Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

D-ary heap

Known as: Ternary heap, D-heap, D heap 
The d-ary heap or d-heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We present a construction for the holomorph of an inverse semigroup, derived from the cartesian closed structure of the category… Expand
Is this relevant?
2008
2008
The measurement of force distributions in sandpiles provides a useful way to test concepts and models of the way forces propagate… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
In this paper, a realization structure for our previously proposed systematic recursive formula for bitwise decomposition of M… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
2002
The paper presents an efficient algorithm for post compression optimal rate allocation and packetization within JPEG2000 encoding… Expand
  • figure 1
  • figure 2
  • table 3
  • table 2
Is this relevant?
2001
2001
The measurement of force distributions in sandpiles provides a useful way to test concepts and models of the way forces propagate… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition method is proposed to solve them… Expand
Is this relevant?
1993
1993
This paper presents the k-d heap, an efficient data structure that implements a multi-dimensional priority queue. The basic form… Expand
Is this relevant?
1991
1991
Abstract A probabilistic analysis is presented of certain pointer-based implementations of dictionaries, linear lists, and… Expand
Is this relevant?
1990
1990
  • A. Paulik
  • Inf. Process. Lett.
  • 1990
  • Corpus ID: 34323597
Abstract With the concept of d -heap, a generalized heapsort algorithm is presented. The worst-case analysis of d -heapsort shows… Expand
Is this relevant?
1984
1984
It is possible to improve the worst-case behavior of operations on heaps, when counting number of comparisons between elements in… Expand
Is this relevant?