Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,595,079 papers from all fields of science
Search
Sign In
Create Free Account
Heap (data structure)
Known as:
Max-heap property
, Min-heap
, Min heap order
Expand
In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: If A is a parent node of B then the key (the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
16-bit
2–3 heap
Abstract data type
Array data structure
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
OOPSLA 2002: Reconsidering custom memory allocation
E. Berger
,
B. Zorn
,
K. McKinley
SIGP
2013
Corpus ID: 52828486
Programmers hoping to achieve performance improvements often use custom memory allocators. This in-depth study examines eight…
Expand
2011
2011
Projection onto A Nonnegative Max-Heap
Jun Liu
,
Liang Sun
,
Jieping Ye
Neural Information Processing Systems
2011
Corpus ID: 6934300
We consider the problem of computing the Euclidean projection of a vector of length p onto a non-negative max-heap—an ordered…
Expand
2010
2010
Content of zinc in plants fertilized with municipal solid waste and urban green waste composts.
W. Sądej
,
A. Namiotko
2010
Corpus ID: 98102402
In a vegetation experiment, the effect of composts made from unsorted municipal solid waste and urban green waste on the content…
Expand
2004
2004
Finding bugs in software with a constraint solver
Mandana Vaziri-Farahani
2004
Corpus ID: 17541550
We present a static technique for finding bugs in object-oriented procedures. It is capable of checking complex user-defined…
Expand
1998
1998
Distributed Virtual Address Space Management in the MoDiS-OS
M. Pizka
1998
Corpus ID: 17499631
This report motivates and explains concepts developed in the project MoDiS to organize large virtual address spaces comprising…
Expand
1994
1994
Characterization of object behaviour in Standard ML of New Jersey
D. Stefanovic
,
J. Moss
LFP '94
1994
Corpus ID: 3029249
We describe a method of measuring lifetime characteristics of heap objects, and discuss ways in which such quantitative object…
Expand
1993
1993
POPULATION DYNAMICS OF ORATOSQUILLA NEPA IN THE TRAWLING GROUNDS OFF MADRAS
D. James
,
P. Thirumilu
1993
Corpus ID: 127810183
OratosqidUa nepa (Latreilla)is one of the important species of stomatopods landed by the trawlen at Madras as by-catch. The…
Expand
1992
1992
The complexity of heaps
S. Carlsson
,
Jingsen Chen
ACM-SIAM Symposium on Discrete Algorithms
1992
Corpus ID: 17925648
In this paper, we investigate the complexity of heaps. In particular, we study the construction problem and the search problem…
Expand
1982
1982
Deleting the root of a heap
E. Doberkat
Acta Informatica
1982
Corpus ID: 2669401
SummaryThe average behavior of the familiar algorithm for root deletion is considered, when every heap has the same probability…
Expand
1973
1973
Beiträge zur Biologie und Bekämpfung vonXyleborus (Anisandrus) dispar F. andX. saxeseni Ratz. (Col., Scolytidae)
A. Egger
Anzeiger für Schädlingskunde Pflanzen- und…
1973
Corpus ID: 24412058
SummaryContributions to bionomy and control of Xyleborus dispar F. and X. saxeseni Rtz. (Col., Scolytidae) In the beginning of…
Expand