-
Fast DecreaseKey Heaps with worst case variants
In the paper "Fast Fibonacci heaps with worst case extensions" we have d...
read it
-
Fast Fibonacci heaps with worst case extensions
We are concentrating on reducing overhead of heaps based on comparisons ...
read it
-
Information carefull worstcase DecreaseKey heaps with simple nonMeld variant
We analyze priority queues including DecreaseKey method in its interface...
read it
-
Padovan heaps
We analyze priority queues of Fibonacci family. The paper is inspired by...
read it

Vladan Majerech
is this you? claim profile