Skip to search formSkip to main contentSkip to account menu

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

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… 
2011
2011
This paper offers an exercise for revisiting the main sorting algorithms after they have been taught to students. This is done in… 
2002
2002
  • W. FrittsJ. T. Sun
  • Proceedings. International Conference on Image…
  • 2002
  • Corpus ID: 9717432
The paper presents an efficient algorithm for post compression optimal rate allocation and packetization within JPEG2000 encoding… 
2001
2001
The measurement of force distributions in sandpiles provides a useful way to test concepts and models of the way forces propagate… 
Highly Cited
1997
Highly Cited
1997
The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition method is proposed to solve them… 
1993
1993
  • Y. DingM. Weiss
  • Workshop on Algorithms and Data Structures
  • 1993
  • Corpus ID: 6931715
This paper presents the k-d heap, an efficient data structure that implements a multi-dimensional priority queue. The basic form… 
1991
1991
1990
1990
  • A. Paulik
  • Information Processing Letters
  • 1990
  • Corpus ID: 34323597
1984
1984
It is possible to improve the worst-case behavior of operations on heaps, when counting number of comparisons between elements in…