Vybrané partie z dátových štruktúr
2-INF-237, LS 2016/17
MediaWiki:Sitenotice: Rozdiel medzi revíziami
Z VPDS
| Riadok 7: | Riadok 7: | ||
| Plán prezentácií: | | Plán prezentácií: | ||
|- | |- | ||
| − | | Utorok 13.5.: Fulla (... shortest path problem with few distinct positive lengths) | + | | Utorok 13.5.: Fulla (... shortest path problem with few distinct positive lengths), Krajči (...improvements on the RMQ-problem...), Jaroščák (Fast set intersection...), Párnický (...short read alignment with Burrows-Wheeler transform) |
|- | |- | ||
| Streda 14.5.: Pitoňák (...empirical study of priority queues), Kovaľ (... fully-dynamic algorithms for ... biconnectivity), Lukča (...Java 7’s dual pivot quicksort) | | Streda 14.5.: Pitoňák (...empirical study of priority queues), Kovaľ (... fully-dynamic algorithms for ... biconnectivity), Lukča (...Java 7’s dual pivot quicksort) | ||
|- | |- | ||
| − | | Utorok 20.5.: Špano (Disjoint | + | | Utorok 20.5.: Špano (Disjoint set union with randomized linking), Moravčík (Algorithms for jumbled pattern...), Csiba (Cache-adaptive algorithms) |
|- | |- | ||
| − | | | + | | |
|} | |} | ||
<br> | <br> | ||
Verzia zo dňa a času 11:19, 7. máj 2014
Vybrané partie z dátových štruktúr
2-INF-237, LS 2013/14
