| Universal optimality of dijkstra via beyond-worst-case heaps B Haeupler, R Hladík, V Rozhoň, RE Tarjan, J Tetĕk 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS …, 2024 | 7 | 2024 |
| Fast and simple sorting using partial information B Haeupler, R Hladík, J Iacono, V Rozhoň, RE Tarjan, J Tětek Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025 | 5 | 2025 |
| On the complexity of a periodic scheduling problem with precedence relations R Hladík, A Minaeva, Z Hanzálek Combinatorial Optimization and Applications: 14th International Conference …, 2020 | 3 | 2020 |
| Bidirectional Dijkstra’s Algorithm is Instance-Optimal B Haeupler, R Hladík, V Rozhoň, RE Tarjan, J Tětek 2025 Symposium on Simplicity in Algorithms (SOSA), 202-215, 2025 | | 2025 |
| Smooth Sensitivity Revisited: Towards Optimality R Hladík, J Tětek arXiv preprint arXiv:2407.05067, 2024 | | 2024 |
| Near-Universally-Optimal Differentially Private Minimum Spanning Trees R Hladík, J Tětek arXiv preprint arXiv:2404.15035, 2024 | | 2024 |
| Fast and Simple Sorting Using Partial Information R Hladík ETH Zurich, 2024 | | 2024 |
| Combinatorial Algorithms for Flow Problems R Hladík Univerzita Karlova, Matematicko-fyzikální fakulta, 2021 | | 2021 |
Jakub TětekUniversity of Copenhagen確認したメール アドレス: di.ku.dk