The k-server conjecture is true
Researchers have formally proven the long-standing k-server conjecture in computer science. The paper, authored by Christian Coester and colleagues, marks a significant milestone in algorithmic theory.
Why it matters
The k-server conjecture is a fundamental problem in online algorithms; its resolution provides theoretical closure to a decades-old challenge in computer science.
Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Marek Zbysiński [ view email ] [v1] Mon, 14 Sep 2026 17:58:11 UTC (22 KB) Full-text links: Access Paper: View a PDF of the paper titled The $k$-server conjecture is true, by Christian Coester and 2 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.DS < prev | next > new | recent | 2026-09 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations?
Get smarter about the news
Sign up free for a feed built around what you actually care about, Dive Deeper research on any story, and the full text of every article.
Create free accountAlready have an account? Sign in