Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,529,886 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
2013
2013
Medical garbage and the making of neoliberalism in India
S. Hodges
2013
Corpus ID: 53003816
In the 1980s, as plastic pervaded daily life in the Indian household, so too did it saturate everyday healthcare. Following these…
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
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
nhc-Nearly a Haskell Compiler
Niklas Röjemo
1994
Corpus ID: 7677883
This paper describes nhc a compiler for a subset of Haskell. Nhc is the result of the author’s wish to have a Haskell compiler…
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
Review
1992
Review
1992
They get heaps: A study of attitudes in Roebourne Western Australia [Book Review]
D. Rose
1992
Corpus ID: 146542801
Review(s) of: They get heaps: A study of attitudes in Roebourne Western Australia, by M. Edmunds, The Institute Report Series…
Expand
1989
1989
A note on constructing min-max heaps
T. Strothotte
,
Patrik Eriksson
,
Sören Vallner
BIT
1989
Corpus ID: 39887476
In this paper we show that to construct an implicit, double-ended priority queue organized as a min-max heap, 17/9n = 1.88 ...n…
Expand