Design and implementation of an efficient priority queue-Reference-Cited by-同舟云学术

Design and implementation of an efficient priority queue

Published:1976-12 Issue:1 Volume:10 Page:99-127
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Emde Boas P.,Kaas R.,Zijlstra E.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01683268.pdf

Reference11 articles.

1. Aho, A. V., J. E. Hopcroft andJ. D. Ullman,The design and analysis of computer Algorithms, Addison Wesley, Reading, Mass. (1974).

2. Aho, A. V., J. E. Hopcroft andJ. D. Ullman,On finding lowest common ancestors in tress, Proc. 5-th ACM symp. Theory of Computing (1973), 253–265.

3. Emde Boas, P. Van,An O (n log log n) On-Line Algorithm for the Insert-Extract Min Problem, Rep. TR 74-221 Dept. of Comp. Sci., Cornell Univ., Ithaca 14853, N.Y. Dec. 1974.

4. Even, S. andO. Kariv,Oral Commun., Berkeley, October 1975.

5. Fischer, M. J.,Efficiency of equivalence algorithms, in: R. E. Miller andJ. W. Thatcher (eds.),Complexity of Computer Computations, Plenum Press, New York (1972), 158–168.

Cited by 261 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Lock-free Binary Trie;2024 IEEE 44th International Conference on Distributed Computing Systems (ICDCS);2024-07-23

2. The longest almost increasing subsequence problem with sliding windows;Theoretical Computer Science;2024-07

3. Hierarchical non-dominated sort: analysis and improvement;Genetic Programming and Evolvable Machines;2024-04-16

4. Practical Hardware Transactional vEB Trees;Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming;2024-02-20

5. Predecessor on the Ultra-Wide Word RAM;Algorithmica;2024-01-10