An algorithm for online Steiner forest achieves constant competitiveness with amortized O(log n) recourse.
A Borsuk-Ulam lower bound for sign-rank and its applications
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Randomized communication complexity of Point-Line Incidence is Theta(log n), the first constant support-rank example with super-constant complexity.
citing papers explorer
-
Online Steiner Forest with Recourse
An algorithm for online Steiner forest achieves constant competitiveness with amortized O(log n) recourse.
-
No Constant-Cost Protocol for Point--Line Incidence
Randomized communication complexity of Point-Line Incidence is Theta(log n), the first constant support-rank example with super-constant complexity.