Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

32 relations
2–3 heapA* search algorithmAmortized analysisBentley–Ottmann algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An Efficient Cascaded Filtering Retrieval Method for Big Audio Data
Fast audio retrieval is crucial for many important applications and yet demanding due to the high dimension nature and… 
2013
2013
The Transformation from the Galois NLFSR to the Fibonacci Configuration
  • Zhiqiang Lin
  • Fourth International Conference on Emerging…
  • 2013
  • Corpus ID: 14671896
Two configurations of nonlinear feedback shift registers (NLFSRs) are considered. Conventional NLFSRs use the Fibonacci… 
2012
2012
Data Hiding Techniques in Steganography Using Fibonacci and Catalan Numbers
During the last decades, Steganography has found many applications. Many steganographic systems have been developed and used in… 
2010
2010
Benchmarking the Compression of XML Node Streams
In recent years, many approaches to XML twig pattern query processing have been developed. Holistic approaches are particularly… 
2010
2010
Kac-Moody Fibonacci sequences, hyperbolic golden ratios, and real quadratic fields
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… 
2006
2006
CoINS: Context Sensitive Indoor Navigation System
The context sensitive indoor navigation system (CoINS) implements an architecture to develop context-aware indoor user guidance… 
2004
2004
Further developements in finite fibonomial calculus
Primary definitions, notation and general observations of finite fibonomial operator calculus (ffoc) are presented. Kwasniewski's… 
Highly Cited
1999
Highly Cited
1999
Physical nature of critical modes in Fibonacci quasicrystals
We report on the possibility of modulating the transport properties of critical normal modes in Fibonacci quasicrystals by using… 
Highly Cited
1998
Highly Cited
1998
Ergodic properties of the Erdös measure, the entropy of the goldenshift, and related problems
AbstractWe define a two-sided analog of the Erdös measure on the space of two-sided expansions with respect to the powers of the… 
1994
1994
Are Fibonacci Heaps Optimal?
In this paper we investigate the inherent complexity of the priority queue abstract data type. We show that, under reasonable… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)