Worst-Case Optimal Priority Queues via Extended Regular Counters
From MaRDI portal
Publication:2907494
DOI10.1007/978-3-642-30642-6_13zbMath1360.68380arXiv1112.0993OpenAlexW1599550474MaRDI QIDQ2907494
Publication date: 10 September 2012
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.0993
Related Items
Regular numeral systems for data structures ⋮ Worst-Case Optimal Priority Queues via Extended Regular Counters ⋮ A priority queue with the time-finger property ⋮ Bipartite binomial heaps ⋮ A Survey on Priority Queues
Cites Work
- Unnamed Item
- Two-tier relaxed heaps
- Fat Heaps without Regular Counters
- Worst-Case Optimal Priority Queues via Extended Regular Counters
- Strictly-Regular Number System and Data Structures
- Meldable heaps and boolean union-find
- A data structure for manipulating priority queues
- Multipartite priority queues
- Fast meldable priority queues
- Fibonacci heaps and their uses in improved network optimization algorithms