Binary heap

Known as: Heap tree, Binary min heap, Binary min-heap 
A binary heap is a heap data structure that takes the form of a binary tree. Binary heaps are a common way of implementing priority queues. A binary… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Let n denote the number of elements currently in a data structure. An in-place heap is stored in the first n locations of an… (More)
  • table 1
  • figure 1
  • figure 2
Is this relevant?
2011
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm… (More)
  • table 1
  • table 2
  • figure 1
  • table 6
  • table 7
Is this relevant?
2010
2010
For event based routing using global timestamps a sorting and buffering component is required. This work describes the… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Much research has been done in the area of software transactional memory (STM) as a new programming paradigm to help ease the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
The static determination of approximated values of string expressions has many potential applications. For instance, approximated… (More)
  • figure 2
  • figure 3
  • figure 5
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present a new algorithm, A*Prune, to list (in order of increasing length) the first K Multiple-Constrained-Shortest-Path… (More)
  • table I
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present an analysis of the memory usage for six of the Java programs in the SPECjvm98 benchmark suite. Most of the programs… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
1998
1998
Comparator networks for constructing binary heaps of size n are presented which have size O(n log log n) and depth O(log n). A… (More)
Is this relevant?
1992
1992
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A simple implementation of double-ended priority queues is presented. The proposed structure, called a min-max heap, can be built… (More)
  • figure 1
  • table I
  • table II
Is this relevant?