Tournament heaps with any number of fingers have competitive ratio Ω(√log n) for modify-key sequences, refuting dynamic optimality for this model.
Cohen, Rasmus Kyng, Gary L
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Dynamic Optimality Refuted -- For Tournament Heaps
Tournament heaps with any number of fingers have competitive ratio Ω(√log n) for modify-key sequences, refuting dynamic optimality for this model.