• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Rank-Pairing Heaps

Cached

  • Download as a PDF

Download Links

  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [people.csail.mit.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]
  • [www.cs.princeton.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Bernhard Haeupler , Siddhartha Sen , Robert E. Tarjan
Citations:5 - 3 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Haeupler_rank-pairingheaps,
    author = {Bernhard Haeupler and Siddhartha Sen and Robert E. Tarjan},
    title = {Rank-Pairing Heaps},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We introduce the rank-pairing 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 rank-pairing heaps perform almost as well as pairing heaps on typical input sequences and better on worst-case sequences.

Keyphrases

rank-pairing heap    fibonacci heap    priority queue    typical input sequence    structural change    worst-case sequence    arbitrary structure    key decrease    initial experiment    heap implementation    asymptotic efficiency   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2018 The Pennsylvania State University