20 listopada 2023 22:11
Marcin Bie艅kowski o "The Randomized 饾憳-Server Conjecture" dla Quanta Magazine
Marcin Bie艅kowski opowiada Quanta Magazine o obaleniu The Randomized 饾憳-Server Conjecture czyli o najlepszej pracy z tegorocznego Symposium on Theory of Computing (STOC): Sebastien Bubeck (Microsoft Research); Christian Coester (University of Oxford); Yuval Rabani (Hebrew University) The Randomized k-Server Conjecture is False!
Quanta Magazine: Researchers Refute a Widespread Belief About Online Algorithms
