activity
20232026
most citedUniversal Optimality of Dijkstra via Beyond-Worst-Case Heaps

2 citations · 2 across the 5 of their papers we have counts for

collaborators
Showing 2026Show all

2 papers · 1 filter

cs.DS2026

Heaps and Their Working Sets

Bernhard Haeupler, Richard Hladík, Václav Rozhoň +1

We construct a heap with strong beyond-worst-case performance guarantees and explore the analysis of such heaps. First, we unify existing notions of the working-set bound for heaps…

cs.DS2026

Splay trees are almost dynamically optimal

Petr Chmel, Bernhard Haeupler, Richard Hladík +5

Sleator and Tarjan [JACM, 1985] conjectured that splay trees are dynamically optimal -- that on every access sequence, they perform within a constant factor of the optimal offline…