Optimal purely functional priority queues
From MaRDI portal
Publication:4339017
DOI10.1017/S095679680000201XzbMATH Open0870.68035OpenAlexW2136598300MaRDI QIDQ4339017FDOQ4339017
Authors: 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
Recommendations
Cites Work
- Self-adjusting binary search trees
- Self-Adjusting Heaps
- The derivation of a tighter bound for top-down skew heaps
- Making data structures persistent
- A data structure for manipulating priority queues
- The pairing heap: A new form of self-adjusting heap
- Implementation and Analysis of Binomial Queue Algorithms
- An applicative random-access stack
- Confluently Persistent Deques via Data-Structural Bootstrapping
- Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
Cited In (9)
- Space-efficient functional offline-partially-persistent trees with applications to planar point location
- Title not available (Why is that?)
- Two skew-binary numeral systems and one application
- Two-tier relaxed heaps
- An explicit solution for the value function of a priority queue
- Purely functional, real-time deques with catenation
- Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority Function
- A simple implementation technique for priority search queues
- A survey on priority queues
Uses Software
This page was built for publication: Optimal purely functional priority queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339017)
