Richard Hladík

According to our database, Richard Hladík authored at least 6 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Bidirectional Dijkstra's Algorithm is Instance-Optimal.

Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek

CoRR, 2024

Smooth Sensitivity Revisited: Towards Optimality.

Richard Hladík, Jakub Tetek

CoRR, 2024

Near-Universally-Optimal Differentially Private Minimum Spanning Trees.

Richard Hladík, Jakub Tetek

CoRR, 2024

Fast and Simple Sorting Using Partial Information.

Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek

CoRR, 2024

Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps.

Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2020

On the Complexity of a Periodic Scheduling Problem with Precedence Relations.

Richard Hladík, Anna Minaeva, Zdenek Hanzálek

Proceedings of the Combinatorial Optimization and Applications, 2020