Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
heaps
Description:
A family of tree-based data structures used in computer science to efficiently maintain and retrieve the highest- or lowest-priority element.
Related topics:
Algorithms and Data Compression (19%),
Logic, programming, and type systems (19%),
Teaching and Learning Programming (9%)
Wikidata ID:
wiki/Q274089
OpenAlex ID:
keywords/heaps
Data Structures and Network Algorithms
1983
·
Robert Endre Tarjan
·
Society for Industrial and Applied Mathematics eBooks
·
2,217
Particle Segregation in Dense Granular Flows
2017
·
John Mark Nicholas Timm Gray
·
Annual Review of Fluid Mechanics
·
388
Data Structures and Algorithms with Object-Oriented Design Patterns in Java
1999
·
Bruno R. Preiss
·
228
Proving Pointer Programs in Hoare Logic
2000
·
Richard Bornat
·
Lecture notes in computer science
·
226
Reconsidering custom memory allocation
2002
·
Emery D. Berger
, Benjamin G. Zorn
, et al.
·
Conference on Object-Oriented Programming Systems, Languages, and Applications
·
195
Expressive Pointcuts for Increased Modularity
2005
·
Klaus Ostermann
, Mira Mezini
, et al.
·
Lecture notes in computer science
·
181
Self-Adjusting Heaps
1986
·
Daniel Dominic Sleator
, Robert Endre Tarjan
·
SIAM Journal on Computing
·
175
Parallel graph algorithms
1984
·
Michael J. Quinn
, Narsingh Deo
·
ACM Computing Surveys
·
175
PDF
Context, interest relativity and the sorites
2003
·
J. Stanley
·
Analysis
·
172
Language and Logos: Studies in Ancient Greek Philosophy Presented to G. E. L. Owen
1985
·
Mark Amsler
, Malcolm Schofield
, et al.
·
Language
·
165
Cost analysis of object-oriented bytecode programs
2011
·
Elvira Albert
, Puri Arenas
, et al.
·
Theoretical Computer Science
·
153
PDF
Types, bytes, and separation logic
2007
·
Harvey Tuch
, Gerwin Klein
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
144
Types, bytes, and separation logic
2007
·
Harvey Tuch
, Gerwin Klein
, et al.
·
ACM SIGPLAN Notices
·
143
Self-adjusting binary trees
1983
·
Daniel Dominic Sleator
, Robert Endre Tarjan
·
ACM Symposium on Theory of Computing (STOC)
·
119
PDF
Proving pointer programs in higher-order logic
2005
·
Farhad Mehta
, Tobias Nipkow
·
Information and Computation
·
108
PDF
Liars and heaps : new essays on paradox
2003
·
J. C. Beall
·
108
Heaps on Heaps
1986
·
Gaston H. Gonnet
, J. Ian Munro
·
SIAM Journal on Computing
·
103
Advanced Data Structures
2008
·
Peter Brass
·
Cambridge University Press eBooks
·
102
A Back-to-Basics Empirical Study of Priority Queues
2013
·
Daniel H. Larkin
, Siddhartha Sen
, et al.
·
Society for Industrial and Applied Mathematics eBooks
·
99
PDF
Parallel sparse polynomial multiplication using heaps
2009
·
Michael Monagan
, Roman Pearce
·
International Symposium on Symbolic and Algebraic Computation
·
81
Q-Systems, Heaps, Paths and Cluster Positivity
2009
·
Philippe Di Francesco
, Rinat Kedem
·
Communications in Mathematical Physics
·
72
PDF
Compositional verification of procedural programs using horn clauses over integers and arrays
2015
·
Anvesh Komuravelli
, Nikolaj Bjorner
, et al.
·
Formal Methods in Computer-Aided Design
·
70
PDF
Proving Pointer Programs in Higher-Order Logic
2003
·
Farhad Mehta
, Tobias Nipkow
·
Lecture notes in computer science
·
67
Combinatorics of Minuscule Representations
2013
·
R. M. Green
·
Cambridge University Press eBooks
·
66
A computational study of efficient shortest path algorithms
1988
·
Ming S. Hung
, James J. Divoky
·
Computers & Operations Research
·
64
Show more works
View as search
Works count:
661
Citation count:
8,887
Year
Topic
Type