62 search results - page 1 / 13 » Are Fibonacci Heaps Optimal? |
ISAAC
1994
Springer
13 years 10 months ago
1994
Springer
TALG
2008
13 years 6 months ago
2008
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
ESA
2009
Springer
14 years 25 days ago
2009
Springer
Abstract. We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pair...
FOCS
2005
IEEE
13 years 12 months ago
2005
IEEE
Fredman, Sedgewick, Sleator, and Tarjan proposed the pairing heap as a self-adjusting, streamlined version of the Fibonacci heap. It provably supports all priority queue operation...
ASPLOS
2006
ACM
13 years 10 months ago
2006
ACM
The goal of this paper is to propose a scheme that provides comprehensive security protection for the heap. Heap vulnerabilities are increasingly being exploited for attacks on co...