1 citations · 1 across the 5 of their papers we have counts for
5 papers
100 prisoners and a lightbulb -- looking back
Vladan Majerech
100 prisoners and a light bulb is a long standing mathematical puzzle. The problem was studied mostly in 2002 [5], 2003 [1], and 2004 [3]. Solutions in published articles had avera…
Fast DecreaseKey Heaps with worst-case variants
Vladan Majerech
In the paper "Fast Fibonacci heaps with worst case extensions", we have described heaps with both Meld-DecreaseKey and DecreaseKey interfaces, allowing operations with guaranteed w…
Fast Fibonacci heaps with worst case extensions
Vladan Majerech
We are concentrating on reducing overhead of heaps based on comparisons with optimal worstcase behaviour. The paper is inspired by Strict Fibonacci Heaps [1], where G. S. Brodal, G…
Information carefull worstcase DecreaseKey heaps with simple nonMeld variant
Vladan Majerech
We analyze priority queues including DecreaseKey method in its interface. The paper is inspired by Strict Fibonacci Heaps [2], where G. S. Brodal, G. Lagogiannis, and R. E. Tarjan…
Padovan heaps
Vladan Majerech
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 achi…