Fast meldable priority queues
From MaRDI portal
Publication:5057442
DOI10.1007/3-540-60220-8_70zbMATH Open1502.68086OpenAlexW1757811393MaRDI QIDQ5057442FDOQ5057442
Authors: Gerth Stølting Brodal 
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
Recommendations
Cites Work
- Fibonacci heaps and their uses in improved network optimization algorithms
- Title not available (Why is that?)
- A data structure for manipulating priority queues
- The pairing heap: A new form of self-adjusting heap
- Amortized Computational Complexity
- Min-max heaps and generalized priority queues
- The relaxed min-max heap: A mergeable double-ended priority queue
- Fishspear: a priority queue algorithm
- Title not available (Why is that?)
Cited In (19)
- Range-restricted mergeable priority queues
- Title not available (Why is that?)
- The randomized complexity of maintaining the minimum
- Parallel priority queues based on binomial heaps
- Reflected min-Max heaps
- Multidimensional heaps and complementary range searching
- Rank-Sensitive Priority Queues
- Priority queues on parallel machines
- Strictly-regular number system and data structures
- Algorithm Theory - SWAT 2004
- Regular numeral systems for data structures
- Queue-mergesort
- Bipartite binomial heaps
- Worst-case optimal priority queues via extended regular counters
- Title not available (Why is that?)
- Probabilistic data structures for priority queues
- Melding priority queues
- A generalization of binomial queues
- Fishspear: a priority queue algorithm
Uses Software
This page was built for publication: Fast meldable priority queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5057442)
