BibTeX
@MISC{Pettie05towardsa,
author = {Seth Pettie},
title = {Towards a Final Analysis of Pairing Heaps},
year = {2005}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 593 | LEDA: A Platform for Combinatorial and Geometric Computing. MaxPlanck-Institut fuer Informatik, Saarbruecken - Mehlhorn, Naeher - 1995 |
| 493 | Fibonacci heaps and their uses in improved network optimization algorithms - Fredman, Tarjan - 1987 |
| 334 | Self-adjusting binary search trees - SLEATOR, E - 1985 |
| 47 | The pairing heap: A new form of self-adjusting heap - Fredman, Sedgewick, et al. - 1986 |
| 43 | Self-adjusting heaps - Sleater, Tarjan - 1986 |
| 38 | An empirical assessment of algorithms for constructing a minimum spanning tree - MORET, H - 1994 |
| 30 | Pairing heaps: experiments and analysis - Stasko, Vitter - 1987 |
| 14 | On the efficiency of pairing heaps and related data structures - Fredman - 1999 |
| 14 | Improved upper bounds for pairing heaps - Iacono |
| 5 | Dynamic optimality — almost - Demaine, Harmon, et al. - 2004 |
| 5 | Parametrized self-adjusting heaps - Elmasry |
| 3 | Adaptive properties of pairing heaps - Elmasry - 2001 |
