Vladan Majerech

Padovan heaps

2019 · arXiv (Cornell University)

We analyze priority queues of Fibonacci family. The paper is inspired by Violation heap [1], where A. Elmasry saves one pointer in representation of Fibonacci heap nodes while achieving the same amortized bounds as Fibonacci …