Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,238,795 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
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.
Highly Cited
2012
Highly Cited
2012
AddressSanitizer: A Fast Address Sanity Checker
Kostya Serebryany
,
Derek Bruening
,
A. Potapenko
,
Dmitriy Vyukov
USENIX Annual Technical Conference
2012
Corpus ID: 11024896
Memory access bugs, including buffer overflows and uses of freed heap memory, remain a serious problem for programming languages…
Expand
Highly Cited
2008
Highly Cited
2008
Fermentation of cocoa beans: influence of microbial activities and polyphenol concentrations on the flavour of chocolate
N. Camu
,
T. Winter
,
Solomon K. Addo
,
J. Takrama
,
H. Bernaert
,
L. Vuyst
2008
Corpus ID: 44053975
BACKGROUND: Spontaneous cocoa bean fermentation is characterised by a succession of microbial activities. Cocoa flavour…
Expand
Highly Cited
2006
Highly Cited
2006
DieHard: probabilistic memory safety for unsafe languages
E. Berger
,
B. Zorn
PLDI '06
2006
Corpus ID: 8984358
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling…
Expand
Highly Cited
2006
Highly Cited
2006
Refinement-based context-sensitive points-to analysis for Java
Manu Sridharan
,
R. Bodík
PLDI '06
2006
Corpus ID: 6139497
We present a scalable and precise context-sensitive points-to analysis with three key properties: (1) filtering out of…
Expand
Highly Cited
2002
Highly Cited
2002
Applying SAT Methods in Unbounded Symbolic Model Checking
K. McMillan
CAV
2002
Corpus ID: 223130
A method of symbolic model checking is introduced that uses conjunctive normal form (CNF) rather than binary decision diagrams…
Expand
Review
1999
Review
1999
Principles of Program Analysis
F. Nielson
,
H. R. Nielson
,
C. Hankin
Springer Berlin Heidelberg
1999
Corpus ID: 45062380
Program analysis utilizes static techniques for computing reliable information about the dynamic behavior of programs…
Expand
Highly Cited
1998
Highly Cited
1998
BIOLOGICAL LEACHING OF SHALES: BLACK SHALE AND OIL SHALE
A. Tasa
1998
Corpus ID: 128598698
The purpose o f this study was to evaluate the oxidauve dissolution o f a black (dictyonema) shale and processed concenrrates…
Expand
Highly Cited
1993
Highly Cited
1993
An Optimal Algorithm for Selection in a Min-Heap
G. Frederickson
Inf. Comput.
1993
Corpus ID: 206565915
Abstract An O(k)-time algorithm is presented for selecting the kth smallest element in a binary min-heap of size n⪢k. The…
Expand
Highly Cited
1993
Highly Cited
1993
A natural semantics for lazy evaluation
J. Launchbury
POPL '93
1993
Corpus ID: 14945994
We define an operational semantics for lazy evaluation which provides an accurate model for sharing. The only computational…
Expand
Highly Cited
1987
Highly Cited
1987
Fibonacci heaps and their uses in improved network optimization algorithms
M. Fredman
,
R. Tarjan
JACM
1987
Corpus ID: 193986
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, <italic>Fibonacci heaps…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE