Heaps is a specialized tree-based data structure that satisfies the heap property, where the key of each parent node is ordered with respect to the keys of its children, enabling efficient implementation of priority queues.
413
Publications
22K
Citations
943
Authors
438
Institutions
Publications per year
2017–2026
55
Variants
Heap Data Structure
Parents
Publications
413
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
Carlo Curino, Evan P. C. Jones, Yang Zhang et al. · Proceedings of the VLDB Endowment · 2010 · 532 citations
Susanne Albers · Communications of the ACM · 2010 · 450 citations
Emery D. Berger, Kathryn S. McKinley, Robert D. Blumofe et al. · ACM SIGPLAN Notices · 2000 · 449 citations · Full text
1–5 of 413
Authors
943
- RE
14
h-index
- EP
7
h-index
- ML
7
h-index
- SC
6
h-index
- AE
5
h-index
1–5 of 943
Institutions
438
Centre National de la Recherche Scientifique
Paris, France
10 h-index
15 publications
535 citations
Princeton University
Princeton, United States
9 h-index
11 publications
1.5K citations
Tel Aviv University
Tel Aviv, Israel
8 h-index
11 publications
358 citations
Technion – Israel Institute of Technology
Haifa, Israel
8 h-index
21 publications
1.1K citations
Chinese Academy of Sciences
Beijing, China
7 h-index
17 publications
722 citations
Polish Academy of Sciences
Warsaw, Poland
7 h-index
18 publications
729 citations
Northwest A&F University
Yangling, China
6 h-index
15 publications
707 citations
Microsoft (United States)
Redmond, United States
6 h-index
9 publications
318 citations
1–8 of 438
Venues
- Information Processing Letters
10 publications · 290 citations
10
h-index
- Communications of the ACM
10 publications · 1.3K citations
10
h-index
- ACM SIGPLAN Notices
8 publications · 769 citations
8
h-index
- Journal of the ACM
JACM · 6 publications · 3.4K citations
6
h-index
- SIAM Journal on Computing
5 publications · 366 citations
5
h-index
1–5