Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/stoc/stoc2017.bht:"
@inproceedings{DBLP:conf/stoc/0001S17, author = {Oded Regev and Noah Stephens{-}Davidowitz}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {A reverse Minkowski theorem}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {941--953}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055434}, doi = {10.1145/3055399.3055434}, timestamp = {Sun, 02 Jun 2019 21:10:31 +0200}, biburl = {https://dblp.org/rec/conf/stoc/0001S17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AaronsonBKM17, author = {Scott Aaronson and Adam Bouland and Greg Kuperberg and Saeed Mehraban}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {The computational complexity of ball permutations}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {317--327}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055453}, doi = {10.1145/3055399.3055453}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AaronsonBKM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AbolhassaniEEHK17, author = {Melika Abolhassani and Soheil Ehsani and Hossein Esfandiari and MohammadTaghi Hajiaghayi and Robert D. Kleinberg and Brendan Lucier}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Beating 1-1/e for ordered prophets}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {61--71}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055479}, doi = {10.1145/3055399.3055479}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AbolhassaniEEHK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AgarwalZBHM17, author = {Naman Agarwal and Zeyuan Allen Zhu and Brian Bullins and Elad Hazan and Tengyu Ma}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Finding approximate local minima faster than gradient descent}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1195--1199}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055464}, doi = {10.1145/3055399.3055464}, timestamp = {Sun, 08 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AgarwalZBHM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AlmanW17, author = {Josh Alman and R. Ryan Williams}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Probabilistic rank and matrix rigidity}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {641--652}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055484}, doi = {10.1145/3055399.3055484}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AlmanW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AmbainisK17, author = {Andris Ambainis and Martins Kokainis}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {989--1002}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055444}, doi = {10.1145/3055399.3055444}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AmbainisK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AnariG17, author = {Nima Anari and Shayan Oveis Gharan}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {A generalization of permanent inequalities and applications in counting and optimization}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {384--396}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055469}, doi = {10.1145/3055399.3055469}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AnariG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AndoniNNRW17, author = {Alexandr Andoni and Huy L. Nguyen and Aleksandar Nikolov and Ilya P. Razenshteyn and Erik Waingarten}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Approximate near neighbors for general symmetric norms}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {902--913}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055418}, doi = {10.1145/3055399.3055418}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AndoniNNRW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AngelBPW17, author = {Omer Angel and S{\'{e}}bastien Bubeck and Yuval Peres and Fan Wei}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Local max-cut in smoothed polynomial time}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {429--437}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055402}, doi = {10.1145/3055399.3055402}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AngelBPW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AngelidakisMM17, author = {Haris Angelidakis and Konstantin Makarychev and Yury Makarychev}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Algorithms for stable and perturbation-resilient problems}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {438--451}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055487}, doi = {10.1145/3055399.3055487}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AngelidakisMM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AnshuTYY17, author = {Anurag Anshu and Dave Touchette and Penghui Yao and Nengkun Yu}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Exponential separation of quantum communication and classical information}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {277--288}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055401}, doi = {10.1145/3055399.3055401}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AnshuTYY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Arora0MR17, author = {Sanjeev Arora and Rong Ge and Tengyu Ma and Andrej Risteski}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Provable learning of noisy-OR networks}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1057--1066}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055482}, doi = {10.1145/3055399.3055482}, timestamp = {Sun, 08 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Arora0MR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ArtmannWZ17, author = {Stephan Artmann and Robert Weismantel and Rico Zenklusen}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {A strongly polynomial algorithm for bimodular integer linear programming}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1206--1219}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055473}, doi = {10.1145/3055399.3055473}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ArtmannWZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ArvindJMR17, author = {Vikraman Arvind and Pushkar S. Joglekar and Partha Mukhopadhyay and S. Raja}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Randomized polynomial time identity testing for noncommutative circuits}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {831--841}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055442}, doi = {10.1145/3055399.3055442}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ArvindJMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AzarGGP17, author = {Yossi Azar and Arun Ganesh and Rong Ge and Debmalya Panigrahi}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Online service with delay}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {551--563}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055475}, doi = {10.1145/3055399.3055475}, timestamp = {Fri, 26 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AzarGGP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BabaioffGN17, author = {Moshe Babaioff and Yannai A. Gonczarowski and Noam Nisan}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {The menu-size complexity of revenue approximation}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {869--877}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055426}, doi = {10.1145/3055399.3055426}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BabaioffGN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BabichenkoR17, author = {Yakov Babichenko and Aviad Rubinstein}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Communication complexity of approximate Nash equilibria}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {878--889}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055407}, doi = {10.1145/3055399.3055407}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BabichenkoR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BalkanskiRS17, author = {Eric Balkanski and Aviad Rubinstein and Yaron Singer}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {The limitations of optimization from samples}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1016--1027}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055406}, doi = {10.1145/3055399.3055406}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BalkanskiRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BallRSV17, author = {Marshall Ball and Alon Rosen and Manuel Sabin and Prashant Nalini Vasudevan}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Average-case fine-grained hardness}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {483--496}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055466}, doi = {10.1145/3055399.3055466}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BallRSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BansalG17, author = {Nikhil Bansal and Shashwat Garg}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Algorithmic discrepancy beyond partial coloring}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {914--926}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055490}, doi = {10.1145/3055399.3055490}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BansalG17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BansalGNV17, author = {Nikhil Bansal and Shashwat Garg and Jesper Nederlof and Nikhil Vyas}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Faster space-efficient algorithms for subset sum and k-sum}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {198--209}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055467}, doi = {10.1145/3055399.3055467}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BansalGNV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BarakKS17, author = {Boaz Barak and Pravesh K. Kothari and David Steurer}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Quantum entanglement, sum of squares, and the log rank conjecture}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {975--988}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055488}, doi = {10.1145/3055399.3055488}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BarakKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BavarianVY17, author = {Mohammad Bavarian and Thomas Vidick and Henry Yuen}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Hardness amplification for entangled games via anchoring}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {303--316}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055433}, doi = {10.1145/3055399.3055433}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BavarianVY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ben-AroyaDT17, author = {Avraham Ben{-}Aroya and Dean Doron and Amnon Ta{-}Shma}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {An efficient reduction from two-source to non-malleable extractors: achieving near-logarithmic min-entropy}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1185--1194}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055423}, doi = {10.1145/3055399.3055423}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ben-AroyaDT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BlasiokBCKY17, author = {Jaroslaw Blasiok and Vladimir Braverman and Stephen R. Chestnut and Robert Krauthgamer and Lin F. Yang}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Streaming symmetric norms via measure concentration}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {716--729}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055424}, doi = {10.1145/3055399.3055424}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BlasiokBCKY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BrakerskiHK17, author = {Zvika Brakerski and Justin Holmgren and Yael Tauman Kalai}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Non-interactive delegation and batch {NP} verification from standard computational assumptions}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {474--482}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055497}, doi = {10.1145/3055399.3055497}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BrakerskiHK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BubeckLE17, author = {S{\'{e}}bastien Bubeck and Yin Tat Lee and Ronen Eldan}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Kernel-based methods for bandit convex optimization}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {72--85}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055403}, doi = {10.1145/3055399.3055403}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BubeckLE17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CaiF17, author = {Jin{-}Yi Cai and Zhiguo Fu}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Holographic algorithm with matchgates is universal for planar {\#}CSP over boolean domain}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {842--855}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055405}, doi = {10.1145/3055399.3055405}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CaiF17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CaiZ17, author = {Yang Cai and Mingfei Zhao}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Simple mechanisms for subadditive buyers via duality}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {170--183}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055465}, doi = {10.1145/3055399.3055465}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/CaiZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CaludeJKL017, author = {Cristian S. Calude and Sanjay Jain and Bakhadyr Khoussainov and Wei Li and Frank Stephan}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Deciding parity games in quasipolynomial time}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {252--263}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055409}, doi = {10.1145/3055399.3055409}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/CaludeJKL017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CanettiPV17, author = {Ran Canetti and Oxana Poburinnaya and Muthuramakrishnan Venkitasubramaniam}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Equivocating Yao: constant-round adaptively secure multiparty computation in the plain model}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {497--509}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055495}, doi = {10.1145/3055399.3055495}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CanettiPV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CevherKSZ17, author = {Volkan Cevher and Michael Kapralov and Jonathan Scarlett and Amir Zandieh}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {An adaptive sublinear-time block sparse fourier transform}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {702--715}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055462}, doi = {10.1145/3055399.3055462}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/CevherKSZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChakrabartyLSW17, author = {Deeparnab Chakrabarty and Yin Tat Lee and Aaron Sidford and Sam Chiu{-}wai Wong}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Subquadratic submodular function minimization}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1220--1231}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055419}, doi = {10.1145/3055399.3055419}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChakrabartyLSW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChangKPWZ17, author = {Yi{-}Jun Chang and Tsvi Kopelowitz and Seth Pettie and Ruosong Wang and Wei Zhan}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Exponential separations in the energy complexity of leader election}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {771--783}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055481}, doi = {10.1145/3055399.3055481}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ChangKPWZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CharikarSV17, author = {Moses Charikar and Jacob Steinhardt and Gregory Valiant}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Learning from untrusted data}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {47--60}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055491}, doi = {10.1145/3055399.3055491}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/CharikarSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Chattopadhyay017, author = {Eshan Chattopadhyay and Xin Li}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Non-malleable codes and extractors for small-depth circuits, and affine functions}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1171--1184}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055483}, doi = {10.1145/3055399.3055483}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Chattopadhyay017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChawlaDHKMS17, author = {Shuchi Chawla and Nikhil R. Devanur and Alexander E. Holroyd and Anna R. Karlin and James B. Martin and Balasubramanian Sivan}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Stability of service under time-of-use pricing}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {184--197}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055455}, doi = {10.1145/3055399.3055455}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChawlaDHKMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChenOS17, author = {Xi Chen and Igor C. Oliveira and Rocco A. Servedio}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Addition is exponentially harder than counting for shallow monotone circuits}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1232--1245}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055425}, doi = {10.1145/3055399.3055425}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ChenOS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChenWX17, author = {Xi Chen and Erik Waingarten and Jinyu Xie}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Beyond Talagrand functions: new lower bounds for testing monotonicity and unateness}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {523--536}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055461}, doi = {10.1145/3055399.3055461}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChenWX17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChristianiP17, author = {Tobias Christiani and Rasmus Pagh}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Set similarity search beyond MinHash}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1094--1107}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055443}, doi = {10.1145/3055399.3055443}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChristianiP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChuzhoyKN17, author = {Julia Chuzhoy and David H. K. Kim and Rachit Nimavat}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {New hardness results for routing on disjoint paths}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {86--99}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055411}, doi = {10.1145/3055399.3055411}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyKN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Cohen17, author = {Gil Cohen}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Towards optimal two-source extractors and Ramsey graphs}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1157--1170}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055429}, doi = {10.1145/3055399.3055429}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Cohen17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CohenKPPRSV17, author = {Michael B. Cohen and Jonathan A. Kelner and John Peebles and Richard Peng and Anup B. Rao and Aaron Sidford and Adrian Vladu}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {410--419}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055463}, doi = {10.1145/3055399.3055463}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CohenKPPRSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Coja-OghlanKPZ17, author = {Amin Coja{-}Oghlan and Florent Krzakala and Will Perkins and Lenka Zdeborov{\'{a}}}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Information-theoretic thresholds from the cavity method}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {146--157}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055420}, doi = {10.1145/3055399.3055420}, timestamp = {Fri, 08 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Coja-OghlanKPZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CurticapeanDM17, author = {Radu Curticapean and Holger Dell and D{\'{a}}niel Marx}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Homomorphisms are a good basis for counting small subgraphs}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {210--223}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055502}, doi = {10.1145/3055399.3055502}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/CurticapeanDM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DaganFGM17, author = {Yuval Dagan and Yuval Filmus and Ariel Gabizon and Shay Moran}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Twenty (simple) questions}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {9--21}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055422}, doi = {10.1145/3055399.3055422}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DaganFGM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DahlgaardKS17, author = {S{\o}ren Dahlgaard and Mathias B{\ae}k Tejs Knudsen and Morten St{\"{o}}ckel}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Finding even cycles faster via capped k-walks}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {112--120}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055459}, doi = {10.1145/3055399.3055459}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DahlgaardKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DeOS17, author = {Anindya De and Ryan O'Donnell and Rocco A. Servedio}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Optimal mean-based algorithms for trace reconstruction}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1047--1056}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055450}, doi = {10.1145/3055399.3055450}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DeOS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DughmiHKN17, author = {Shaddin Dughmi and Jason D. Hartline and Robert Kleinberg and Rad Niazadeh}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Bernoulli factories and black-box reductions in mechanism design}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {158--169}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055492}, doi = {10.1145/3055399.3055492}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DughmiHKN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DurfeeKPRS17, author = {David Durfee and Rasmus Kyng and John Peebles and Anup B. Rao and Sushant Sachdeva}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Sampling random spanning trees faster than matrix multiplication}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {730--742}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055499}, doi = {10.1145/3055399.3055499}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DurfeeKPRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/EenbergLY17, author = {Kasper Eenberg and Kasper Green Larsen and Huacheng Yu}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {DecreaseKeys are expensive for external memory priority queues}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1081--1093}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055437}, doi = {10.1145/3055399.3055437}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/EenbergLY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Elkin17, author = {Michael Elkin}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Distributed exact shortest paths in sublinear time}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {757--770}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055452}, doi = {10.1145/3055399.3055452}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Elkin17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FanM17, author = {Zhou Fan and Andrea Montanari}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {How well do local algorithms solve semidefinite programs?}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {604--614}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055451}, doi = {10.1145/3055399.3055451}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/FanM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FeigeFT17, author = {Uriel Feige and Michal Feldman and Inbal Talgam{-}Cohen}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Approximate modularity revisited}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1028--1041}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055476}, doi = {10.1145/3055399.3055476}, timestamp = {Fri, 02 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/FeigeFT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ForbesSV17, author = {Michael A. Forbes and Amir Shpilka and Ben Lee Volk}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Succinct hitting sets and barriers to proving algebraic circuits lower bounds}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {653--664}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055496}, doi = {10.1145/3055399.3055496}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ForbesSV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Foster17, author = {Nate Foster}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {The next 700 network programming languages (invited talk)}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {7}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3081042}, doi = {10.1145/3055399.3081042}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Foster17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GargGOW17, author = {Ankit Garg and Leonid Gurvits and Rafael Mendes de Oliveira and Avi Wigderson}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {397--409}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055458}, doi = {10.1145/3055399.3055458}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GargGOW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GargMVY17, author = {Jugal Garg and Ruta Mehta and Vijay V. Vazirani and Sadra Yazdanbod}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Settling the complexity of Leontief and {PLC} exchange markets under exact and approximate equilibria}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {890--901}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055474}, doi = {10.1145/3055399.3055474}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GargMVY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GhaffariKM17, author = {Mohsen Ghaffari and Fabian Kuhn and Yannic Maus}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {On the complexity of local distributed graph problems}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {784--797}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055471}, doi = {10.1145/3055399.3055471}, timestamp = {Mon, 23 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GhaffariKM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GishbolinerS17, author = {Lior Gishboliner and Asaf Shapira}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Removal lemmas with polynomial bounds}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {510--522}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055404}, doi = {10.1145/3055399.3055404}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GishbolinerS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GonczarowskiN17, author = {Yannai A. Gonczarowski and Noam Nisan}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Efficient empirical revenue maximization in single-parameter auction environments}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {856--868}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055427}, doi = {10.1145/3055399.3055427}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GonczarowskiN17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GrandoniL17, author = {Fabrizio Grandoni and Bundit Laekhanukit}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed Steiner tree}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {420--428}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055445}, doi = {10.1145/3055399.3055445}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GrandoniL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GuoJ017, author = {Heng Guo and Mark Jerrum and Jingcheng Liu}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Uniform sampling through the Lovasz local lemma}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {342--355}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055410}, doi = {10.1145/3055399.3055410}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GuoJ017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GuptaK0P17, author = {Anupam Gupta and Ravishankar Krishnaswamy and Amit Kumar and Debmalya Panigrahi}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Online and dynamic algorithms for set cover}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {537--550}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055493}, doi = {10.1145/3055399.3055493}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GuptaK0P17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GurjarT17, author = {Rohit Gurjar and Thomas Thierauf}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Linear matroid intersection is in quasi-NC}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {821--830}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055440}, doi = {10.1145/3055399.3055440}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GurjarT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HaeuplerS17, author = {Bernhard Haeupler and Amirbehshad Shahrasbi}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Synchronization strings: codes for insertions and deletions approaching the Singleton bound}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {33--46}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055498}, doi = {10.1145/3055399.3055498}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/HaeuplerS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HozaU17, author = {William M. Hoza and Chris Umans}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Targeted pseudorandom generators, simulation advice generators, and derandomizing logspace}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {629--640}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055414}, doi = {10.1145/3055399.3055414}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HozaU17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ImMS17, author = {Sungjin Im and Benjamin Moseley and Xiaorui Sun}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Efficient massively parallel methods for dynamic programming}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {798--811}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055460}, doi = {10.1145/3055399.3055460}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ImMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ItalianoKLS17, author = {Giuseppe F. Italiano and Adam Karczmarz and Jakub Lacki and Piotr Sankowski}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Decremental single-source reachability in planar digraphs}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1108--1121}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055480}, doi = {10.1145/3055399.3055480}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ItalianoKLS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Iwata017, author = {Satoru Iwata and Yusuke Kobayashi}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {A weighted linear matroid parity algorithm}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {264--276}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055436}, doi = {10.1145/3055399.3055436}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Iwata017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ji17, author = {Zhengfeng Ji}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Compression of quantum multi-prover interactive proofs}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {289--302}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055441}, doi = {10.1145/3055399.3055441}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ji17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KabanetsKL17, author = {Valentine Kabanets and Daniel M. Kane and Zhenjian Lu}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {A polynomial restriction lemma with applications}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {615--628}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055470}, doi = {10.1145/3055399.3055470}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KabanetsKL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KhotMS17, author = {Subhash Khot and Dor Minzer and Muli Safra}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {On independent sets, 2-to-2 games, and Grassmann graphs}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {576--589}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055432}, doi = {10.1145/3055399.3055432}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KhotMS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KolRT17, author = {Gillat Kol and Ran Raz and Avishay Tal}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Time-space hardness of learning sparse parities}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1067--1080}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055430}, doi = {10.1145/3055399.3055430}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KolRT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KothariMOW17, author = {Pravesh K. Kothari and Ryuhei Mori and Ryan O'Donnell and David Witmer}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Sum of squares lower bounds for refuting any {CSP}}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {132--145}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055485}, doi = {10.1145/3055399.3055485}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KothariMOW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KothariMR17, author = {Pravesh K. Kothari and Raghu Meka and Prasad Raghavendra}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Approximating rectangles by juntas and weakly-exponential lower bounds for {LP} relaxations of CSPs}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {590--603}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055438}, doi = {10.1145/3055399.3055438}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KothariMR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Kupferman17, author = {Orna Kupferman}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Examining classical graph-theory problems from the viewpoint of formal-verification methods (invited talk)}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {6}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3079075}, doi = {10.1145/3055399.3079075}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Kupferman17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Lee017, author = {Yin Tat Lee and He Sun}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {An SDP-based algorithm for linear-sized spectral sparsification}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {678--687}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055477}, doi = {10.1145/3055399.3055477}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Lee017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LeeV17, author = {Yin Tat Lee and Santosh S. Vempala}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Geodesic walks in polytopes}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {927--940}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055416}, doi = {10.1145/3055399.3055416}, timestamp = {Thu, 24 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/LeeV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Li17, author = {Xin Li}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Improved non-malleable extractors, non-malleable codes and independent source extractors}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1144--1156}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055486}, doi = {10.1145/3055399.3055486}, timestamp = {Wed, 19 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Li17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LokshtanovPRS17, author = {Daniel Lokshtanov and Fahad Panolan and M. S. Ramanujan and Saket Saurabh}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Lossy kernelization}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {224--237}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055456}, doi = {10.1145/3055399.3055456}, timestamp = {Tue, 03 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LokshtanovPRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Manurangsi17, author = {Pasin Manurangsi}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {954--961}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055412}, doi = {10.1145/3055399.3055412}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Manurangsi17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Martens17, author = {Wim Martens}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Optimizing tree pattern queries: why cutting is not enough (invited talk)}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {3}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3079076}, doi = {10.1145/3055399.3079076}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Martens17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MeunierW17, author = {Pierre{-}{\'{E}}tienne Meunier and Damien Woods}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {328--341}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055446}, doi = {10.1145/3055399.3055446}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/MeunierW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Moitra17, author = {Ankur Moitra}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Approximate counting, the Lovasz local lemma, and inference in graphical models}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {356--369}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055428}, doi = {10.1145/3055399.3055428}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Moitra17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NanongkaiS17, author = {Danupon Nanongkai and Thatchaphol Saranurak}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n\({}^{\mbox{1/2 - {\(\epsilon\)}}}\))-time}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1122--1129}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055447}, doi = {10.1145/3055399.3055447}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/NanongkaiS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NaorY17, author = {Assaf Naor and Robert Young}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {The integrality gap of the Goemans-Linial {SDP} relaxation for sparsest cut is at least a constant multiple of {\(\surd\)}log n}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {564--575}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055413}, doi = {10.1145/3055399.3055413}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/NaorY17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NatarajanV17, author = {Anand Natarajan and Thomas Vidick}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {A quantum linearity test for robustly verifying entanglement}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1003--1015}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055468}, doi = {10.1145/3055399.3055468}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/NatarajanV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NazarovP17, author = {Fedor Nazarov and Yuval Peres}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Trace reconstruction with exp(O(n\({}^{\mbox{1/3}}\))) samples}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1042--1046}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055494}, doi = {10.1145/3055399.3055494}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/NazarovP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NguyenP17, author = {Danny Nguyen and Igor Pak}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Complexity of short Presburger arithmetic}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {812--820}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055435}, doi = {10.1145/3055399.3055435}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/NguyenP17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Nikolaenko17, author = {Valeria Nikolaenko}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Practical post-quantum key agreement from generic lattices (invited talk)}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {8}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3079078}, doi = {10.1145/3055399.3079078}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Nikolaenko17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ODonnellW17, author = {Ryan O'Donnell and John Wright}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Efficient quantum tomography {II}}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {962--974}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055454}, doi = {10.1145/3055399.3055454}, timestamp = {Thu, 11 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ODonnellW17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/OliveiraS17, author = {Igor C. Oliveira and Rahul Santhanam}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Pseudodeterministic constructions in subexponential time}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {665--677}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055500}, doi = {10.1145/3055399.3055500}, timestamp = {Tue, 30 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/OliveiraS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/OlverV17, author = {Neil Olver and L{\'{a}}szl{\'{o}} A. V{\'{e}}gh}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {A simpler and faster strongly polynomial algorithm for generalized flow maximization}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {100--111}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055439}, doi = {10.1145/3055399.3055439}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/OlverV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Pandurangan0S17, author = {Gopal Pandurangan and Peter Robinson and Michele Scquizzato}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {A time- and message-optimal distributed algorithm for minimum spanning trees}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {743--756}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055449}, doi = {10.1145/3055399.3055449}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Pandurangan0S17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Peikert0S17, author = {Chris Peikert and Oded Regev and Noah Stephens{-}Davidowitz}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Pseudorandomness of ring-LWE for any ring and modulus}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {461--473}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055489}, doi = {10.1145/3055399.3055489}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Peikert0S17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/PitassiR17, author = {Toniann Pitassi and Robert Robere}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Strongly exponential lower bounds for monotone computation}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1246--1255}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055478}, doi = {10.1145/3055399.3055478}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/PitassiR17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/RaghavendraRS17, author = {Prasad Raghavendra and Satish Rao and Tselil Schramm}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Strongly refuting random CSPs below the spectral threshold}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {121--131}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055417}, doi = {10.1145/3055399.3055417}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/RaghavendraRS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/RoughgardenT17, author = {Tim Roughgarden and Inbal Talgam{-}Cohen}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Why prices need algorithms (invited talk)}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {2}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3079077}, doi = {10.1145/3055399.3079077}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/RoughgardenT17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Rudra17, author = {Atri Rudra}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Answering FAQs in CSPs, probabilistic graphical models, databases, logic and matrix operations (invited talk)}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {4}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3079073}, doi = {10.1145/3055399.3079073}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Rudra17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Sherman17, author = {Jonah Sherman}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Area-convexity, l\({}_{\mbox{{\(\infty\)}}}\) regularization, and undirected multicommodity flow}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {452--460}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055501}, doi = {10.1145/3055399.3055501}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Sherman17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/SongWZ17, author = {Zhao Song and David P. Woodruff and Peilin Zhong}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Low rank approximation with entrywise l\({}_{\mbox{1}}\)-norm error}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {688--701}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055431}, doi = {10.1145/3055399.3055431}, timestamp = {Wed, 02 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/SongWZ17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/StraszakV17, author = {Damian Straszak and Nisheeth K. Vishnoi}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Real stable polynomials and matroids: optimization and counting}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {370--383}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055457}, doi = {10.1145/3055399.3055457}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/StraszakV17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Syrgkanis17, author = {Vasilis Syrgkanis}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Fast convergence of learning in games (invited talk)}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {5}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3084098}, doi = {10.1145/3055399.3084098}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Syrgkanis17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ta-Shma17, author = {Amnon Ta{-}Shma}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Explicit, almost optimal, epsilon-balanced codes}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {238--251}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055408}, doi = {10.1145/3055399.3055408}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ta-Shma17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Tal17, author = {Avishay Tal}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Formula lower bounds via the quantum method}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1256--1268}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055472}, doi = {10.1145/3055399.3055472}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Tal17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Wulff-Nilsen17, author = {Christian Wulff{-}Nilsen}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Fully-dynamic minimum spanning forest with improved worst-case update time}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1130--1143}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055415}, doi = {10.1145/3055399.3055415}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Wulff-Nilsen17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Zhu17, author = {Zeyuan Allen Zhu}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Katyusha: the first direct acceleration of stochastic gradient methods}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1200--1205}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055448}, doi = {10.1145/3055399.3055448}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Zhu17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Zimand17, author = {Marius Zimand}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Kolmogorov complexity version of Slepian-Wolf coding}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {22--32}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3055421}, doi = {10.1145/3055399.3055421}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Zimand17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Zohar17, author = {Aviv Zohar}, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Recent trends in decentralized cryptocurrencies (invited talk)}, booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, pages = {1}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399.3079074}, doi = {10.1145/3055399.3079074}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Zohar17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/stoc/2017, editor = {Hamed Hatami and Pierre McKenzie and Valerie King}, title = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017}, publisher = {{ACM}}, year = {2017}, url = {https://doi.org/10.1145/3055399}, doi = {10.1145/3055399}, isbn = {978-1-4503-4528-6}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/2017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.