2000 character limit reached
Improved Upper Bounds for Pairing Heaps
Published 20 Oct 2011 in cs.DS | (1110.4428v3)
Abstract: Pairing heaps are shown to have constant amortized time Insert and Meld, thus showing that pairing heaps have the same amortized runtimes as Fibonacci heaps for all operations but Decrease-key.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.