Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,103,916 papers from all fields of science
Search
Sign In
Create Free Account
Weak heap
A weak heap is a variation of the a binary heap data structure.
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Binary heap
Binary tree
Fibonacci heap
Heap (data structure)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Review
2013
Review
2013
Weak Heaps and Friends: Recent Developments
S. Edelkamp
,
Amr Elmasry
,
J. Katajainen
,
A. Weiss
International Workshop on Combinatorial…
2013
Corpus ID: 215514119
A weak heap is a variant of a binary heap where, for each node, the heap ordering is enforced only for one of its two children…
Expand
2013
2013
Weak heaps engineered
S. Edelkamp
,
Amr Elmasry
,
J. Katajainen
J. Discrete Algorithms
2013
Corpus ID: 297572
Review
2013
Review
2013
Combinatorial Algorithms
T. Lecroq
,
L. Mouchard
Lecture Notes in Computer Science
2013
Corpus ID: 30550003
A weak heap is a variant of a binary heap where, for each node, the heap ordering is enforced only for one of its two children…
Expand
2012
2012
A Catalogue of Algorithms for Building Weak Heaps
S. Edelkamp
,
Amr Elmasry
,
J. Katajainen
International Workshop on Combinatorial…
2012
Corpus ID: 14961429
An array-based weak heap is an efficient data structure for realizing an elementary priority queue. In this paper we focus on the…
Expand
2012
2012
The weak-heap data structure: Variants and applications
S. Edelkamp
,
Amr Elmasry
,
J. Katajainen
J. Discrete Algorithms
2012
Corpus ID: 218595
2012
2012
Υπολογιστική σύγκριση των αλγορίθμων heap sort και weak heap sort.
Βασιλεία Φορμόζη
2012
Corpus ID: 57831319
2011
2011
Two Constant-Factor-Optimal Realizations of Adaptive Heapsort
S. Edelkamp
,
Amr Elmasry
,
J. Katajainen
International Workshop on Combinatorial…
2011
Corpus ID: 10325857
In this paper we introduce two efficient priority queues. For both, insert requires O(1) amortized time and extract-min$O(\lg n…
Expand
2010
2010
Policy-Based Benchmarking of Weak Heaps and Their Relatives,
Asger Bruun
,
S. Edelkamp
,
J. Katajainen
,
Jens Rasmussen
The Sea
2010
Corpus ID: 1334592
In this paper we describe an experimental study where we evaluated the practical efficiency of three worst-case efficient…
Expand
2005
2005
Relaxed Weak Queues: An Alternative to Run-Relaxed Heaps
Amr Elmasry
,
Claus Jensen
,
J. Katajainen
2005
Corpus ID: 374916
A simplification of a run-relaxed heap, called a relaxed weak queue, is presented. This new priority-queue implementation…
Expand
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)
ACCEPT & CONTINUE