Richard Hladík

12 papers A* 2C 1Journal 6Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	—	`conf`	Bidirectional Dijkstra's Algorithm is Instance-Optimal. SOSA Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
2025	A*	`conf`	Fast and Simple Sorting Using Partial Information. SODA Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
2025	—	`conf`	Near-Universally-Optimal Differentially Private Minimum Spanning Trees. FORC Richard Hladík, Jakub Tetek
2025	—	`conf`	Smooth Sensitivity Revisited: Towards Optimality. FORC Richard Hladík, Jakub Tetek
2025	J	`jnl`	Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation. CoRR Bernhard Haeupler, Richard Hladík, Shengzhe Wang, Zhijun Zhang
2024	J	`jnl`	Bidirectional Dijkstra's Algorithm is Instance-Optimal. CoRR Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
2024	J	`jnl`	Fast and Simple Sorting Using Partial Information. CoRR Bernhard Haeupler, Richard Hladík, John Iacono, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
2024	J	`jnl`	Near-Universally-Optimal Differentially Private Minimum Spanning Trees. CoRR Richard Hladík, Jakub Tetek
2024	J	`jnl`	Smooth Sensitivity Revisited: Towards Optimality. CoRR Richard Hladík, Jakub Tetek
2024	A*	`conf`	Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps. FOCS Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
2023	J	`jnl`	Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps. CoRR Bernhard Haeupler, Richard Hladík, Václav Rozhon, Robert E. Tarjan, Jakub Tetek
2020	C	`conf`	On the Complexity of a Periodic Scheduling Problem with Precedence Relations. COCOA Richard Hladík, Anna Minaeva, Zdenek Hanzálek