Results 1 
7 of
7
RankPairing Heaps
"... Abstract. We introduce the rankpairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps. Unlike all other heap implementations that match the bounds of Fibonacci heaps, our structure needs only one c ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We introduce the rankpairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps. Unlike all other heap implementations that match the bounds of Fibonacci heaps, our structure needs only one cut and no other structural changes per key decrease; the trees representing the heap can evolve to have arbitrary structure. Our initial experiments indicate that rankpairing heaps perform almost as well as pairing heaps on typical input sequences and better on worstcase sequences. 1
Strict Fibonacci Heaps
 STOC
, 2012
"... We present the first pointerbased heap implementation with time bounds matching those of Fibonacci heaps in the worst case. We support makeheap, insert, findmin, meld and decreasekey in worstcase O(1) time, and delete and deletemin in worstcase O(lgn) time, where n is the size of the heap. The ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
We present the first pointerbased heap implementation with time bounds matching those of Fibonacci heaps in the worst case. We support makeheap, insert, findmin, meld and decreasekey in worstcase O(1) time, and delete and deletemin in worstcase O(lgn) time, where n is the size of the heap. The data structure uses linear space. A previous, very complicated, solution achieving the same time bounds in the RAM model made essential use of arrays and extensive use of redundant counter schemes to maintain balance. Our solution uses neither. Our key simplification is to discard the structure of the smaller heap when doing a meld. We use the pigeonhole principle in place of the redundant counter mechanism.
Pairing Heaps with Costless Meld
, 2009
"... Improving the structure and analysis in [1], we give a variation of the pairing heaps that has amortized zero cost per meld (compared to an O(log log n) in [1]) and the same amortized bounds for all other operations. More precisely, the new pairing heap requires: no cost per meld, O(1) per findmin ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Improving the structure and analysis in [1], we give a variation of the pairing heaps that has amortized zero cost per meld (compared to an O(log log n) in [1]) and the same amortized bounds for all other operations. More precisely, the new pairing heap requires: no cost per meld, O(1) per findmin and insert, O(log n) per deletemin, and O(log log n) per decreasekey. These bounds are the best known for any selfadjusting heap, and match the lower bound proven by Fredman for a family of such heaps. Moreover, our structure is even simpler than that in [1].
Violation heaps: A better substitute for Fibonacci heaps
, 2008
"... We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, findmin requires O(1) worstcase time, insert, meld and decreasekey require O(1) amortized time, and deletemin requires O(log n) amortized time. Our structure is simple and promises a more efficient pract ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, findmin requires O(1) worstcase time, insert, meld and decreasekey require O(1) amortized time, and deletemin requires O(log n) amortized time. Our structure is simple and promises a more efficient practical behavior compared to any other known Fibonaccilike heap.
Verification of Costless Merge Pairing Heaps
, 2010
"... I/We certify have followed the accepted standards of scientific, creative, and academic honesty and ethics. I understand that my article submission will be blindreviewed by faculty reviewers who will recommend acceptance for publication; acceptance with revisions; or reject for publication. I under ..."
Abstract
 Add to MetaCart
I/We certify have followed the accepted standards of scientific, creative, and academic honesty and ethics. I understand that my article submission will be blindreviewed by faculty reviewers who will recommend acceptance for publication; acceptance with revisions; or reject for publication. I understand that as author, I retain the right to present any part of the research in any form in other publications. The JUR has the right to reproduce and reprint published submissions for instructional or promotional purposes. Mentor Agreement: I have reviewed the submission, and I support its inclusion in the JUR (The Journal of Undergraduate Research at Minnesota State University, Mankato). I understand that I will be acknowledged as the faculty mentor for the student author(s). To the best of my knowledge, the student has followed the accepted standards of scientific, creative, and academic honesty and ethics.