Symposium on the Theory of Computing
container_jlc5kugafjg4dl7ozagimqfcbm
Homepage URLs
http://acm-stoc.org/ |
Example Publications
A scaling-invariant algorithm for linear programming whose running time depends only on the constraint matrix
Daniel Dadush, Sophie Huiberts, Bento Natura, László A. Végh
2020
|
Symposium on the Theory of Computing
doi:10.1145/3357713.3384326 dblp:conf/stoc/DadushHNV20
Classical algorithms, correlation decay, and complex zeros of partition functions of quantum many-body systems
Aram W. Harrow, Saeed Mehraban, Mehdi Soleimanifar
2020
|
Symposium on the Theory of Computing
doi:10.1145/3357713.3384322 dblp:conf/stoc/HarrowMS20
Caching with time windows
Anupam Gupta, Amit Kumar, Debmalya Panigrahi
2020
|
Symposium on the Theory of Computing
doi:10.1145/3357713.3384277 dblp:conf/stoc/Gupta0P20
Unbounded lower bound for k-server against weak adversaries
Marcin Bienkowski, Jarosław Byrka, Christian Coester, Łukasz Jeż
2020
|
Symposium on the Theory of Computing
doi:10.1145/3357713.3384306 dblp:conf/stoc/BienkowskiBCJ20
QCSP monsters and the demise of the chen conjecture
Dmitriy Zhuk, Barnaby Martin
2020
|
Symposium on the Theory of Computing
doi:10.1145/3357713.3384232 dblp:conf/stoc/ZhukM20