Meldable heaps and boolean union-find
From MaRDI portal
Publication:3579246
Cited in
(8)- Hollow Heaps
- Two-tier relaxed heaps
- Regular numeral systems for data structures
- Bipartite binomial heaps
- Worst-case optimal priority queues via extended regular counters
- A priority queue with the time-finger property
- P-tree structures and event horizon: efficient event-set implementations
- A survey on priority queues
This page was built for publication: Meldable heaps and boolean union-find
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579246)