Fast meldable priority queues
From MaRDI portal
Publication:5057442
DOI10.1007/3-540-60220-8_70zbMath1502.68086MaRDI QIDQ5057442
Publication date: 16 December 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60220-8_70
Related Items
Bipartite binomial heaps, Priority queues on parallel machines, The randomized complexity of maintaining the minimum, Probabilistic data structures for priority queues, A generalization of binomial queues, Multidimensional heaps and complementary range searching, Reflected min-Max heaps, Regular numeral systems for data structures, Worst-Case Optimal Priority Queues via Extended Regular Counters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The pairing heap: A new form of self-adjusting heap
- The relaxed min-max heap: A mergeable double-ended priority queue
- Amortized Computational Complexity
- Min-max heaps and generalized priority queues
- A data structure for manipulating priority queues
- Fishspear: a priority queue algorithm
- Fibonacci heaps and their uses in improved network optimization algorithms