| Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps B Haeupler, R Hladík, V Rozhoň, R Tarjan, J Tětek arXiv preprint arXiv:2311.11793, 2023 | 7 | 2023 |
| Fast and Simple Sorting Using Partial Information B Haeupler, R Hladík, J Iacono, V Rozhon, R Tarjan, J Tětek arXiv preprint arXiv:2404.04552, 2024 | 3 | 2024 |
| 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 Rozhon, RE Tarjan, J Tětek arXiv preprint arXiv:2410.14638, 2024 | | 2024 |
| 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 的电子邮件经过验证
