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 (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
As parallel programming becomes the mainstream due to multicore processors, dynamic memory allocators used in C and C++ can… 
2011
2011
We consider the problem of computing the Euclidean projection of a vector of length p onto a non-negative max-heap—an ordered… 
Highly Cited
2010
Highly Cited
2010
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle… 
2007
2007
Semi-coke is a solid waste material left after oil shale retorting in oil shale chemical industry. During more than 80 years of… 
2006
2006
The production of lead and zinc in the Lead Blast Furnaces of metallurgical factories produces a huge amount of slags. These… 
2005
2005
2004
2004
Depending on the operational organization adopted by a plantation, empty fruit bunches (EFB) fresh from the mill are sometimes… 
2003
2003
In this paper a new data structure named M-heaps is proposed. This data structure is a modification of the well known binary heap… 
1994
1994
We describe a method of measuring lifetime characteristics of heap objects, and discuss ways in which such quantitative object…