Optimal purely functional priority queues
From MaRDI portal
Publication:4339017
DOI10.1017/S095679680000201XzbMath0870.68035OpenAlexW2136598300MaRDI QIDQ4339017
Gerth Stølting Brodal, Chris Okasaki
Publication date: 4 June 1997
Published in: Journal of Functional Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s095679680000201x
Related Items
Space-efficient functional offline-partially-persistent trees with applications to planar point location ⋮ Two-tier relaxed heaps ⋮ Two skew-binary numeral systems and one application ⋮ A Survey on Priority Queues
Uses Software
Cites Work
- The derivation of a tighter bound for top-down skew heaps
- An applicative random-access stack
- The pairing heap: A new form of self-adjusting heap
- Making data structures persistent
- Self-adjusting binary search trees
- A data structure for manipulating priority queues
- Implementation and Analysis of Binomial Queue Algorithms
- Self-Adjusting Heaps
- Confluently Persistent Deques via Data-Structural Bootstrapping
- Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
