Имате ново известие.
Крайно класиране след последния кръг | ||
1. | Boris Mihov | 100 |
2. | Христо Христов | 85 |
3. | Blagojce Pavleski | 70 |
Виж пълно класиране |
Petr Mitrichev (http://en.wikipedia.org/wiki/Petr_Mitrichev), one of the best programming competitors in the world, was a special guest to the final of the programming competition CodeIT. Invited by Musala Soft (www.musala.com) he held a lecture in front of the finalists of the competition, TOP 5 competitors in CodeIT Junior and in front of special guests from informatics academy “A&B”, Shoumen.
Topics in the presentation:
1) Classical randomized algorithms: QSort, Treap, Skip List, Polynomial Identity Testing, Matrix Multiplication Verification
2) Modern randomized algorithms: Smallest Enclosing Circle, Testing Zero Cut, Finding Approximately Largest Source in DAG
3) Randomized solution for constructive problems: Unique Identification, Embedding Caterpillars, Comparator Networks
4) Problems with randomized input: Detect Shuffling Method, Range Estimate, Random Maze, Good Luck, Proper Shuffle
Video of the lecture:
"Randomized algorithms and randomized problems", Petr Mitrichev, May 11 – Sofia, part 1
"Randomized algorithms and randomized problems", Petr Mitrichev, May 11 – Sofia, part 2
"Randomized algorithms and randomized problems", Petr Mitrichev, May 11 – Sofia, part 3
More articles from Petr Mitrichev:
http://petr-mitrichev.blogspot.com/