Publication:5009581
From MaRDI portal
DOI10.4230/LIPIcs.ESA.2018.24MaRDI QIDQ5009581
László Kozma, Uri Zwick, Dani Dorfman, Seth Pettie, Haim Kaplan
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1806.08692
68Wxx: Algorithms in computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The pairing heap: A new form of self-adjusting heap
- Path balance heuristic for self-adjusting binary search trees
- On the efficiency of pairing heaps and related data structures
- Self-Adjusting Binary Search Trees: What Makes Them Tick?
- Self-adjusting binary search trees
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Generalized Template Splay: A Basic Theory and Calculus
- An Explanation of Splaying
- Fibonacci heaps and their uses in improved network optimization algorithms
- A Back-to-Basics Empirical Study of Priority Queues