Design and implementation of an efficient priority queue
Data up to Jan 2025
Total Citations Per Year
Abstract
References (12)
Lecture Notes in Computer Science 1205
1999 • 38,790 citations
The Design and Analysis of Computer Algorithms
1974 • 9,688 citations
Complexity of Computer Computations
1972 • 2,804 citations
Efficiency of a Good But Not Linear Set Union Algorithm
1975 • 1,348 citations
A fast algorithm for computing longest common subsequences
1977 • 694 citations
Applications of Path Compression on Balanced Trees
1979 • 300 citations
Set Merging Algorithms
1973 • 177 citations
On Finding Lowest Common Ancestors in Trees
1976 • 124 citations
The programming language Pascal (Revised Report)
1973 • 69 citations
On finding lowest common ancestors in trees
1973 • 67 citations
Efficiency of Equivalence Algorithms
1972 • 52 citations
Edge-disjoint spanning trees, dominators, and depth-first search.
1974 • 9 citations