Vladan Majerech

is this you? claim profile

Fast DecreaseKey Heaps with worst case variants

In the paper "Fast Fibonacci heaps with worst case extensions" we have d...
10/04/2020 ∙ by Vladan Majerech, et al. ∙ 0 ∙ share

read it
Fast Fibonacci heaps with worst case extensions

We are concentrating on reducing overhead of heaps based on comparisons ...
11/25/2019 ∙ by Vladan Majerech, et al. ∙ 0 ∙ share

read it
Information carefull worstcase DecreaseKey heaps with simple nonMeld variant

We analyze priority queues including DecreaseKey method in its interface...
11/11/2019 ∙ by Vladan Majerech, et al. ∙ 0 ∙ share

read it
Padovan heaps

We analyze priority queues of Fibonacci family. The paper is inspired by...
02/27/2019 ∙ by Vladan Majerech, et al. ∙ 0 ∙ share

read it