FAQ

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

Related topics

Related topics

14 relations
Array data structureBinary heapBreadth-first searchData structure
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
D-ary heap
Data structure
Heap
Minimum spanning tree
Dijkstra's algorithm
Priority queue

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
On Complete and Size Balanced k-ary Tree Integer Sequences
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
Sorting algorithms as special cases of a priority queue sort
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
D-Heaps as Hash Tables for Vectors over a Finite Ring
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
Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
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
An efficient packetization algorithm for JPEG2000
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
ar X iv : c on d - m at / 0 10 92 89 v 1 [ co nd - m at . s of t ] 1 7 Se p 20 01 Memory in 2 D heap experiments
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
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
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
Portable Distributed Priority Queues with Mpi Title Portable Distributed Priority Queues with Mpi Primary Author(s)
Part of this work has been presented in [17]. This paper analyzes the performances of portable distributed priority queues by… (More)
Is this relevant?