A derandomization technique reduces random bits to O(log k) for k-server on HSTs, enabling the first poly-time randomized k-server algorithm on general metrics with polylog competitive ratio.
Theoretical Computer Science , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Randomized $k$-server in polynomial time
A derandomization technique reduces random bits to O(log k) for k-server on HSTs, enabling the first poly-time randomized k-server algorithm on general metrics with polylog competitive ratio.