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)

Related topics

Related topics

50 relations
16-bit2–3 heapAbstract data typeArray data structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Garbage Collection for Multiversion Index in Flash-Based Embedded Databases
Recently, flash-based embedded databases have gained their momentum in various control and monitoring systems, such as cyber… 
2011
2011
Projection onto A Nonnegative Max-Heap
We consider the problem of computing the Euclidean projection of a vector of length p onto a non-negative max-heap—an ordered… 
2011
2011
SFMalloc: A Lock-Free and Mostly Synchronization-Free Dynamic Memory Allocator for Manycores
As parallel programming becomes the mainstream due to multicore processors, dynamic memory allocators used in C and C++ can… 
2010
2010
Parallel sparse polynomial division using heaps
We present a parallel algorithm for exact division of sparse distributed polynomials on a multicore processor. This is a problem… 
2007
2007
MINERAL COMPOSITION OF ESTONIAN OIL SHALE SEMI-COKE SEDIMENTS
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
Introspection of a Java™ virtual machine under simulation
Virtual machines are commonly used in commercially-significant systems, for example, Sun Microsystems' Java and Microsoft's .NET… 
2005
2005
A longest prefix first search tree for IP lookup
2003
2003
Liars and heaps : new essays on paradox
2003
2003
M-Heap: A Modified Heap Data Structure
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
Characterization of object behaviour in Standard ML of New Jersey
We describe a method of measuring lifetime characteristics of heap objects, and discuss ways in which such quantitative object… 
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)