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)

Related topics

Related topics

15 relations
Array data structureBinary heapBreadth-first searchData structure

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… 
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… 
2004
2004
Realization of a systematic bit-wise decomposition metric
In this paper, a realization structure for our previously proposed systematic recursive formula for bitwise decomposition of M… 
2003
2003
Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
2002
2002
An efficient packetization algorithm for JPEG2000
The paper presents an efficient algorithm for post compression optimal rate allocation and packetization within JPEG2000 encoding… 
2002
2002
Motion-JPEG2000 and Wavelet-Based Coding in Video and Image Processing - Masters Thesis, December 2002
In this thesis we have studied the potential of Motion JPEG 2000 for video processing and compared its performance with current… 
2001
2001
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… 
1993
1993
The K-D Heap: An Efficient Multi-dimensional Priority Queue
This paper presents the k-d heap, an efficient data structure that implements a multi-dimensional priority queue. The basic form… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)