Skip to search formSkip to main contentSkip to account menu

Heap (data structure)

Known as: Max-heap property, Min-heap, Min heap order 
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… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Memory access bugs, including buffer overflows and uses of freed heap memory, remain a serious problem for programming languages… 
Highly Cited
2008
Highly Cited
2008
BACKGROUND: Spontaneous cocoa bean fermentation is characterised by a succession of microbial activities. Cocoa flavour… 
Highly Cited
2006
Highly Cited
2006
Applications written in unsafe languages like C and C++ are vulnerable to memory errors such as buffer overflows, dangling… 
Highly Cited
2006
Highly Cited
2006
We present a scalable and precise context-sensitive points-to analysis with three key properties: (1) filtering out of… 
Highly Cited
2002
Highly Cited
2002
A method of symbolic model checking is introduced that uses conjunctive normal form (CNF) rather than binary decision diagrams… 
Review
1999
Review
1999
Program analysis utilizes static techniques for computing reliable information about the dynamic behavior of programs… 
Highly Cited
1998
Highly Cited
1998
The purpose o f this study was to evaluate the oxidauve dissolution o f a black (dictyonema) shale and processed concenrrates… 
Highly Cited
1993
Highly Cited
1993
Abstract An O(k)-time algorithm is presented for selecting the kth smallest element in a binary min-heap of size n⪢k. The… 
Highly Cited
1993
Highly Cited
1993
We define an operational semantics for lazy evaluation which provides an accurate model for sharing. The only computational… 
Highly Cited
1987
Highly Cited
1987
In this paper we develop a new data structure for implementing heaps (priority queues). Our structure, <italic>Fibonacci heaps…