# Fibonacci heap

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- ArXiv
- 2014

The Fibonacci heap is a classic data structure that supports deletions in logarithmic amortized time and all other heapâ€¦Â (More)

Is this relevant?

2012

2012

- STOC
- 2012

We present the first pointer-based heap implementation with time bounds matching those of Fibonacci heaps in the worst case. Weâ€¦Â (More)

Is this relevant?

2010

2010

- Discrete Math., Alg. and Appl.
- 2010

We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-caseâ€¦Â (More)

Is this relevant?

2006

2006

- WLP
- 2006

We construct a readable, compact and efficient implementation of Dijkstraâ€™s shortest path algorithm and Fibonacci heaps usingâ€¦Â (More)

Is this relevant?

1994

1994

- ISAAC
- 1994

In this paper we investigate the inherent complexity of the priority queue abstract data type. We show that, under reasonableâ€¦Â (More)

Is this relevant?

1992

1992

- 1992

We consider the requirements for uniform pseudo-random number generators on modern vector and parallel supercomputers, considerâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Commun. ACM
- 1988

The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heapâ€”a sequenceâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- J. ACM
- 1987

In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, <italic>Fibonacci heapsâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Algorithmica
- 1986

Recently, Fredman and Tarjan invented a new, especially efficient form of heap (priority queue) called theFibonacci heapâ€¦Â (More)

Is this relevant?

1984

1984

- FOCS
- 1984

We consider Fibonacci heap style integer priority queues supporting find-min, insert, and decrease key operations in constantâ€¦Â (More)

Is this relevant?