Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 209,895,547 papers from all fields of science
Search
Sign In
Create Free Account
D-ary heap
Known as:
Ternary heap
, D-heap
, D heap
Expand
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
15 relations
Array data structure
Binary heap
Breadth-first search
Data structure
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Ordered groupoids and the holomorph of an inverse semigroup
N. D. Gilbert
,
E. Mcdougall
2014
Corpus ID: 119178496
We present a construction for the holomorph of an inverse semigroup, derived from the cartesian closed structure of the category…
Expand
2011
2011
Sorting algorithms as special cases of a priority queue sort
T. Bell
,
Bengt Aspvall
Technical Symposium on Computer Science Education
2011
Corpus ID: 15086802
This paper offers an exercise for revisiting the main sorting algorithms after they have been taught to students. This is done in…
Expand
2003
2003
Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
Wei-Mei Chen
,
Gen-Huey Chen
Theoretical Computer Science
2003
Corpus ID: 14040084
2002
2002
An efficient packetization algorithm for JPEG2000
W. Fritts
,
J. 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…
Expand
2001
2001
Se p 20 01 Memory in 2 D heap experiments
J. Geng
,
E. Longhi
,
R. Behringer
2001
Corpus ID: 16731531
The measurement of force distributions in sandpiles provides a useful way to test concepts and models of the way forces propagate…
Expand
Highly Cited
1997
Highly Cited
1997
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
J. Goffin
,
J. Gondzio
,
R. Sarkissian
,
J. Vial
Mathematical programming
1997
Corpus ID: 8348050
The paper deals with nonlinear multicommodity flow problems with convex costs. A decomposition method is proposed to solve them…
Expand
1993
1993
The K-D Heap: An Efficient Multi-dimensional Priority Queue
Y. Ding
,
M. 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…
Expand
1991
1991
A path integral approach to data structure evolution
Robert S. Maier
Journal of Complexity
1991
Corpus ID: 40997371
1990
1990
Worst-Case Analysis of a Generalized Heapsort Algorithm
A. Paulik
Information Processing Letters
1990
Corpus ID: 34323597
1984
1984
Improving worst-case behavior of heaps
Svante Carlsson
BIT
1984
Corpus ID: 36402731
It is possible to improve the worst-case behavior of operations on heaps, when counting number of comparisons between elements in…
Expand
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)
ACCEPT & CONTINUE