Keyword

pairing heaps

Description: Pairing heaps are heap-ordered tree data structures used to implement priority queues, with operations analyzed in algorithms and data structures research.
Wikidata ID: wiki/Q17152481
OpenAlex ID: keywords/pairing-heaps
1991 · Mark Allen Weiss · 500
1986 · Michael L. Fredman, Robert Sedgewick, et al. · Algorithmica · 328
2000 · John Iacono · Lecture notes in computer science · 105
1987 · John T. Stasko, Jeffrey Scott Vitter · Communications of the ACM · 92
2005 · S. Pettie · Annual Symposium on Foundations of Computer Science · 86
2005 · Bernard M. E. Moret, Henry D. Shapiro · Springer eBooks · 59
1999 · Michael L. Fredman · Journal of the ACM · 55
1993 · Berry Schoenmakers · Information Processing Letters · 43
2016 · John Iacono, Mark Yagnatinsky · Lecture notes in computer science · 38
2000 · Matthias Müller-Hannemann, Alexander Schwartz · ACM Journal of Experimental Algorithmics · 32
2011 · Bernhard Haeupler, Siddhartha Sen, et al. · SIAM Journal on Computing · 29
2009 · Amr Elmasry · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 23
2009 · Amr Elmasry · Max Planck Institute for Plasma Physics · 19
2005 · John Iacono, Stefan Langerman · Algorithmica · 17
1999 · Michael L. Fredman · Lecture notes in computer science · 16
2021 · Lorenz Leutgeb, Georg Moser, et al. · Lecture notes in computer science · 15
1990 · Joan M. Lucas · SIAM Journal on Computing · 15
2020 · Giannis D. Savva, Michail Stamatakis · The Journal of Physical Chemistry A · 13
2010 · Asger Bruun, Stefan Edelkamp, et al. · Lecture notes in computer science · 13
1992 · Andrew M. Liao · Algorithmica · 13
2021 · Donnacha Oisín Kidney, Nicolas Wu · Proceedings of the ACM on Programming Languages · 10
2010 · Amr Elmasry · Lecture notes in computer science · 10
2009 · Bernhard Haeupler, Siddhartha Sen, et al. · Lecture notes in computer science · 10
2004 · Amr Elmasry · Journal of Algorithms · 10
2004 · Amr Elmasry · Lecture notes in computer science · 9
Works count: 89
Citation count: 1,646
Year
Topic
Type