Priority Queue Implementation
Priority Queue Implementation is a data structure design that organizes elements according to their priorities, enabling efficient insertion and extraction of the highest-priority element, distinguished by its use of probabilistic skip list hierarchies to achieve average-case logarithmic time complexity for key operations.
199
Publications
20.7K
Citations
445
Authors
211
Institutions
Publications per year
2017–2026
19
Parents
199
Faster algorithms for the shortest path problem
Ravindra K. Ahuja, Kurt Mehlhorn, James B. Orlin et al. · Journal of the ACM · 1990 · 551 citations · Full text
1–5 of 199
445
5
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 445
211
Princeton University
Princeton, United States
8 h-index
13 publications
1.4K citations

Tel Aviv University
Tel Aviv, Israel
6 h-index
8 publications
579 citations
University of California San Diego
San Diego, United States
6 h-index
11 publications
921 citations
AT&T (United States)
Bedminster, United States
5 h-index
5 publications
427 citations

KTH Royal Institute of Technology
Stockholm, Sweden
4 h-index
8 publications
382 citations
University of California, Los Angeles
Los Angeles, United States
4 h-index
8 publications
229 citations

Aarhus University
Aarhus, Denmark
4 h-index
6 publications
136 citations
Chalmers University of Technology
Gothenburg, Sweden
4 h-index
6 publications
373 citations
1–8 of 211
7 publications · 1.5K citations
7
h-index
6 publications · 286 citations
6
h-index
6 publications · 382 citations
6
h-index
JACM · 4 publications · 690 citations
4
h-index
4 publications · 422 citations
4
h-index
1–5