D-ary heap

Known as: D heap, D-heap, Ternary 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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1995-2011
0119952011

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Discovering new integer sequences and generalizing the existing ones are important and of great interest. In this article… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2011
2011
This paper offers an exercise for revisiting the main sorting algorithms after they have been taught to students. This is done in… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2009
2009
We present a method to store a set of vectors whose coefficients are elements over a finite ring or a prime field. A D-heap is… (More)
  • figure 2
  • table 1
  • figure 3
Is this relevant?
2003
2003
An elementary approach is given to studying the recurrence relations associated with generalized heaps (or d-heaps), cost of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2002
2002
This paper presents an efficient algorithm for post compression optimal rate allocation and packetization within JPEG2000… (More)
  • figure 1
  • figure 2
  • table 3
  • table 1
  • 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… (More)
  • 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… (More)
Is this relevant?
1995
1995
Part of this work has been presented in [17]. This paper analyzes the performances of portable distributed priority queues by… (More)
Is this relevant?