Fibonacci heap

Known as: Fibbonaci heaps, Fib heap, Fibanocci Heap

In computer science, a Fibonacci heap is a data structure for priority queue operations, consisting of a collection of heap-ordered trees. It has a…

Papers overview

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

2015

Fast audio retrieval is crucial for many important applications and yet demanding due to the high dimension nature and…

2013

— Distributed systems are the backbone of modern day computing services. A mobile ad hoc network (MANET) is a collection of…

2013

Forecasting was one of the most important issues facing companies. Technical analysis was the use of trends and charts to…

2010

Let A be the generalized Cartan matrix of rank 2 Kac-Moody algebra g. We write g = g(a, b) when A has non-diagonal entries −a and…

2004

Primary definitions, notation and general observations of finite fibonomial operator calculus (ffoc) are presented. Kwasniewski's…

2003

2003

On the example of the Fibonacci chain we show how to efˇciently generate inˇnite words deˇned by substitutions. We introduce…

1995

Let be a finitely presented semigroup having a minimal left ideal L and a minimal right ideal R. The main result gives a…

1994

In this paper we investigate the inherent complexity of the priority queue abstract data type. We show that, under reasonable…

1987

Abstract : The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap…