Replacing Mark Bits with Randomness in Fibonacci Heaps

DOI10.1007/978-3-662-47672-7_72zbMath1440.68052arXiv1407.2569OpenAlexW1561695381MaRDI QIDQ3448845

Jerry Li, John Peebles

Publication date: 27 October 2015

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.2569

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (1)

Replacing Mark Bits with Randomness in Fibonacci Heaps

Cites Work

• The pairing heap: A new form of self-adjusting heap
• Theory of 2-3 heaps
• Quake Heaps: A Simple Alternative to Fibonacci Heaps
• THE VIOLATION HEAP: A RELAXED FIBONACCI-LIKE HEAP
• Replacing Mark Bits with Randomness in Fibonacci Heaps
• Thin heaps, thick heaps
• Rank-Pairing Heaps

This page was built for publication: Replacing Mark Bits with Randomness in Fibonacci Heaps