K-server problem (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "K-server problem" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

69^th place

59^th place

2semanticscholar.org

11^th place

8^th place

415^th place

327^th place

451^st place

277^th place

1rjlipton.wordpress.com

low place

low place

1washington.edu

1,067^th place

749^th place

1quantamagazine.org

6,413^th place

4,268^th place

9^th place

13^th place

ams.org

mathscinet.ams.org

Bansal, Nikhil; Buchbinder, Niv; Madry, Aleksander; Naor, Joseph (2015). "A polylogarithmic-competitive algorithm for the $k$ -server problem" (PDF). Journal of the ACM. 62 (5): A40:1–A40:49. arXiv:1110.1580. doi:10.1145/2783434. MR 3424197. S2CID 15668961.

arxiv.org

Bubeck, Sébastien; Coester, Christian; Rabani, Yuval (June 20–23, 2023). The Randomized 𝑘-Server Conjecture Is False!. 55th Annual ACM Symposium on Theory of Computing (STOC '23). Orlando, FL, USA: ACM. p. 14. arXiv:2211.05753. doi:10.1145/3564246.3585132.
Bansal, Nikhil; Buchbinder, Niv; Madry, Aleksander; Naor, Joseph (2015). "A polylogarithmic-competitive algorithm for the $k$ -server problem" (PDF). Journal of the ACM. 62 (5): A40:1–A40:49. arXiv:1110.1580. doi:10.1145/2783434. MR 3424197. S2CID 15668961.
Lee, James R. (2017). "Fusible HSTs and the Randomized k-Server Conjecture". arXiv:1711.01789 [cs.DS].

doi.org

Manasse, Mark; McGeoch, Lyle; Sleator, Daniel (1988-01-01). "Competitive algorithms for on-line problems". Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88. New York, NY, USA: Association for Computing Machinery. pp. 322–333. doi:10.1145/62212.62243. ISBN 978-0-89791-264-8. S2CID 13356897.
Bubeck, Sébastien; Coester, Christian; Rabani, Yuval (June 20–23, 2023). The Randomized 𝑘-Server Conjecture Is False!. 55th Annual ACM Symposium on Theory of Computing (STOC '23). Orlando, FL, USA: ACM. p. 14. arXiv:2211.05753. doi:10.1145/3564246.3585132.
Bansal, Nikhil; Buchbinder, Niv; Madry, Aleksander; Naor, Joseph (2015). "A polylogarithmic-competitive algorithm for the $k$ -server problem" (PDF). Journal of the ACM. 62 (5): A40:1–A40:49. arXiv:1110.1580. doi:10.1145/2783434. MR 3424197. S2CID 15668961.

mit.edu

people.csail.mit.edu

Bansal, Nikhil; Buchbinder, Niv; Madry, Aleksander; Naor, Joseph (2015). "A polylogarithmic-competitive algorithm for the $k$ -server problem" (PDF). Journal of the ACM. 62 (5): A40:1–A40:49. arXiv:1110.1580. doi:10.1145/2783434. MR 3424197. S2CID 15668961.

quantamagazine.org

Goldberg, Madison (2023-11-20). "Researchers Refute a Widespread Belief About Online Algorithms". Quanta Magazine. Retrieved 2023-11-26.

rjlipton.wordpress.com

"Another Annoying Open Problem". 19 November 2011.

semanticscholar.org

api.semanticscholar.org

Manasse, Mark; McGeoch, Lyle; Sleator, Daniel (1988-01-01). "Competitive algorithms for on-line problems". Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88. New York, NY, USA: Association for Computing Machinery. pp. 322–333. doi:10.1145/62212.62243. ISBN 978-0-89791-264-8. S2CID 13356897.
Bansal, Nikhil; Buchbinder, Niv; Madry, Aleksander; Naor, Joseph (2015). "A polylogarithmic-competitive algorithm for the $k$ -server problem" (PDF). Journal of the ACM. 62 (5): A40:1–A40:49. arXiv:1110.1580. doi:10.1145/2783434. MR 3424197. S2CID 15668961.

washington.edu

homes.cs.washington.edu

"Erratum: Fusible HSTS and the randomized k-server conjecture".

youtube.com

The video presentation of the paper "The Randomized k-Server Conjecture is False!" at STOC 2023 is available in YouTube.