Affiliation:
1. Univ. de Paris-Sud, Orsay, France
Abstract
A data structure is described which can be used for representing a collection of priority queues. The primitive operations are insertion, deletion, union, update, and search for an item of earliest priority.
Publisher
Association for Computing Machinery (ACM)
Reference26 articles.
1. Brown M.R. Implementation and analysis of binomial queue algorithms. (to appear in SICOMP). Brown M.R. Implementation and analysis of binomial queue algorithms. (to appear in SICOMP).
Cited by
169 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Verified Extraction from Coq to OCaml;Proceedings of the ACM on Programming Languages;2024-06-20
2. Multi Bucket Queues: Efficient Concurrent Priority Scheduling;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
3. Priority queues with decreasing keys;Theoretical Computer Science;2024-06
4. Tighter bounds on the minimum broadcast time;Discrete Optimization;2024-02
5. Demystifying Complex Algorithms: A Visual Guide Through the DSA Visualizer;Lecture Notes in Networks and Systems;2024