Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/stoc/stoc2018.bht:"
@inproceedings{DBLP:conf/stoc/0001FL18, author = {Jeff Erickson and Kyle Fox and Luvsandondov Lkhamsuren}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Holiest minimum-cost paths and flows in surface graphs}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1319--1332}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188904}, doi = {10.1145/3188745.3188904}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/0001FL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/0001KZ18, author = {Fabrizio Grandoni and Christos Kalaitzis and Rico Zenklusen}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Improved approximation for tree augmentation: saving by rewiring}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {632--645}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188898}, doi = {10.1145/3188745.3188898}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/0001KZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/0001LLZ18, author = {Heng Guo and Chao Liao and Pinyan Lu and Chihao Zhang}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Counting hypergraph colourings in the local lemma regime}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {926--939}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188934}, doi = {10.1145/3188745.3188934}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/0001LLZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/0001MW018, author = {Fabrizio Grandoni and Tobias M{\"{o}}mke and Andreas Wiese and Hang Zhou}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {A {(5/3} + {\(\epsilon\)})-approximation for unsplittable flow on a path: placing small tasks into boxes}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {607--619}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188894}, doi = {10.1145/3188745.3188894}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/0001MW018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/0002KTWZZ18, author = {Zhiyi Huang and Ning Kang and Zhihao Gavin Tang and Xiaowei Wu and Yuhao Zhang and Xue Zhu}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {How to match when all vertices arrive online}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {17--29}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188858}, doi = {10.1145/3188745.3188858}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/0002KTWZZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/0002S18, author = {L{\'{a}}szl{\'{o}} Kozma and Thatchaphol Saranurak}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Smooth heaps and a dual view of self-adjusting data structures}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {801--814}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188864}, doi = {10.1145/3188745.3188864}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/0002S18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Aaronson18, author = {Scott Aaronson}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Shadow tomography of quantum states}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {325--338}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188802}, doi = {10.1145/3188745.3188802}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Aaronson18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AbboudBDN18, author = {Amir Abboud and Karl Bringmann and Holger Dell and Jesper Nederlof}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {More consequences of falsifying {SETH} and the orthogonal vectors conjecture}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {253--266}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188938}, doi = {10.1145/3188745.3188938}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AbboudBDN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AbrahamFGN18, author = {Ittai Abraham and Arnold Filtser and Anupam Gupta and Ofer Neiman}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Metric embedding via shortest path decompositions}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {952--963}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188808}, doi = {10.1145/3188745.3188808}, timestamp = {Wed, 18 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AbrahamFGN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AbrahamsenABCMR18, author = {Mikkel Abrahamsen and Anna Adamaszek and Karl Bringmann and Vincent Cohen{-}Addad and Mehran Mehr and Eva Rotenberg and Alan Roytman and Mikkel Thorup}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Fast fencing}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {564--573}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188878}, doi = {10.1145/3188745.3188878}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AbrahamsenABCMR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AbrahamsenAM18, author = {Mikkel Abrahamsen and Anna Adamaszek and Tillmann Miltzow}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {The art gallery problem is {\(\exists\)} {\(\mathbb{R}\)}-complete}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {65--73}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188868}, doi = {10.1145/3188745.3188868}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AbrahamsenAM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AgarwalR18, author = {Udit Agarwal and Vijaya Ramachandran}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Fine-grained complexity for sparse graphs}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {239--252}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188888}, doi = {10.1145/3188745.3188888}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AgarwalR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AggarwalS18, author = {Divesh Aggarwal and Noah Stephens{-}Davidowitz}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {(Gap/S)ETH hardness of {SVP}}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {228--238}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188840}, doi = {10.1145/3188745.3188840}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AggarwalS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AgrawalG018, author = {Manindra Agrawal and Sumanta Ghosh and Nitin Saxena}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Bootstrapping variables in algebraic circuits}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1166--1179}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188762}, doi = {10.1145/3188745.3188762}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AgrawalG018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Allen-ZhuGLOW18, author = {Zeyuan Allen{-}Zhu and Ankit Garg and Yuanzhi Li and Rafael Mendes de Oliveira and Avi Wigderson}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Operator scaling via geodesically convex optimization, invariant theory and polynomial identity testing}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {172--181}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188942}, doi = {10.1145/3188745.3188942}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Allen-ZhuGLOW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AlmanWY18, author = {Josh Alman and Joshua R. Wang and Huacheng Yu}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Cell-probe lower bounds from online communication complexity}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1003--1012}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188862}, doi = {10.1145/3188745.3188862}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AlmanWY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AndoniNNRW18, author = {Alexandr Andoni and Assaf Naor and Aleksandar Nikolov and Ilya P. Razenshteyn and Erik Waingarten}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Data-dependent hashing via nonlinear spectral gaps}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {787--800}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188846}, doi = {10.1145/3188745.3188846}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AndoniNNRW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AssadiOSS18, author = {Sepehr Assadi and Krzysztof Onak and Baruch Schieber and Shay Solomon}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Fully dynamic maximal independent set with sublinear update time}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {815--826}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188922}, doi = {10.1145/3188745.3188922}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AssadiOSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AtseriasBRLNR18, author = {Albert Atserias and Ilario Bonacina and Susanna F. de Rezende and Massimo Lauria and Jakob Nordstr{\"{o}}m and Alexander A. Razborov}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Clique is hard on average for regular resolution}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {866--877}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188856}, doi = {10.1145/3188745.3188856}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/AtseriasBRLNR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BackursRSWW18, author = {Arturs Backurs and Liam Roditty and Gilad Segal and Virginia Vassilevska Williams and Nicole Wein}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Towards tight approximation bounds for graph diameter and eccentricities}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {267--280}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188950}, doi = {10.1145/3188745.3188950}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BackursRSWW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BadrinarayananK18, author = {Saikrishna Badrinarayanan and Yael Tauman Kalai and Dakshita Khurana and Amit Sahai and Daniel Wichs}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Succinct delegation for low-space non-deterministic computation}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {709--721}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188924}, doi = {10.1145/3188745.3188924}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BadrinarayananK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BalkanskiS18, author = {Eric Balkanski and Yaron Singer}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {The adaptive complexity of maximizing a submodular function}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1138--1151}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188752}, doi = {10.1145/3188745.3188752}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BalkanskiS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BalliuHKLOS18, author = {Alkida Balliu and Juho Hirvonen and Janne H. Korhonen and Tuomo Lempi{\"{a}}inen and Dennis Olivetti and Jukka Suomela}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {New classes of distributed time complexity}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1307--1318}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188860}, doi = {10.1145/3188745.3188860}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BalliuHKLOS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BansalDGL18, author = {Nikhil Bansal and Daniel Dadush and Shashwat Garg and Shachar Lovett}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {The gram-schmidt walk: a cure for the Banaszczyk blues}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {587--597}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188850}, doi = {10.1145/3188745.3188850}, timestamp = {Tue, 15 Feb 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BansalDGL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BateniHSS18, author = {MohammadHossein Bateni and MohammadTaghi Hajiaghayi and Saeed Seddighin and Cliff Stein}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Fast algorithms for knapsack via convolution and prediction}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1269--1282}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188876}, doi = {10.1145/3188745.3188876}, timestamp = {Thu, 27 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BateniHSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BergBKMZ18, author = {Mark de Berg and Hans L. Bodlaender and S{\'{a}}ndor Kisfaludi{-}Bak and D{\'{a}}niel Marx and Tom C. van der Zanden}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {574--586}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188854}, doi = {10.1145/3188745.3188854}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BergBKMZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BezakovaGGS18, author = {Ivona Bez{\'{a}}kov{\'{a}} and Andreas Galanis and Leslie Ann Goldberg and Daniel Stefankovic}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Inapproximability of the independent set polynomial in the complex plane}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1234--1240}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188788}, doi = {10.1145/3188745.3188788}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BezakovaGGS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BitanskyKP18, author = {Nir Bitansky and Yael Tauman Kalai and Omer Paneth}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Multi-collision resistance: a paradigm for keyless hash functions}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {671--684}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188870}, doi = {10.1145/3188745.3188870}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BitanskyKP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BlaserIJL18, author = {Markus Bl{\"{a}}ser and Christian Ikenmeyer and Gorav Jindal and Vladimir Lysikov}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Generalized matrix completion and algebraic natural proofs}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1193--1206}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188832}, doi = {10.1145/3188745.3188832}, timestamp = {Sun, 06 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BlaserIJL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BlasiokGNRS18, author = {Jaroslaw Blasiok and Venkatesan Guruswami and Preetum Nakkiran and Atri Rudra and Madhu Sudan}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {General strong polarization}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {485--492}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188816}, doi = {10.1145/3188745.3188816}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BlasiokGNRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BrandDH18, author = {Cornelius Brand and Holger Dell and Thore Husfeldt}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Extensor-coding}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {151--164}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188902}, doi = {10.1145/3188745.3188902}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BrandDH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BravermanCG18, author = {Mark Braverman and Gil Cohen and Sumegha Garg}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Hitting sets with near-optimal error for read-once branching programs}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {353--362}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188780}, doi = {10.1145/3188745.3188780}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BravermanCG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BravermanK18, author = {Mark Braverman and Gillat Kol}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Interactive compression to external information}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {964--977}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188956}, doi = {10.1145/3188745.3188956}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BravermanK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BubeckCLL18, author = {S{\'{e}}bastien Bubeck and Michael B. Cohen and Yin Tat Lee and Yuanzhi Li}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {An homotopy method for l\({}_{\mbox{p}}\) regression provably beyond self-concordance and in input-sparsity time}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1130--1137}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188776}, doi = {10.1145/3188745.3188776}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BubeckCLL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BubeckCLLM18, author = {S{\'{e}}bastien Bubeck and Michael B. Cohen and Yin Tat Lee and James R. Lee and Aleksander Madry}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {k-server via multiscale entropic regularization}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {3--16}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188798}, doi = {10.1145/3188745.3188798}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BubeckCLLM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BunDRS18, author = {Mark Bun and Cynthia Dwork and Guy N. Rothblum and Thomas Steinke}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Composable and versatile privacy via truncated {CDP}}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {74--86}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188946}, doi = {10.1145/3188745.3188946}, timestamp = {Sun, 14 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BunDRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BunKT18, author = {Mark Bun and Robin Kothari and Justin Thaler}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {The polynomial method strikes back: tight quantum query bounds via dual polynomials}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {297--310}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188784}, doi = {10.1145/3188745.3188784}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/BunKT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ByrkaSS18, author = {Jaroslaw Byrka and Krzysztof Sornat and Joachim Spoerhase}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Constant-factor approximation for ordered k-median}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {620--631}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188930}, doi = {10.1145/3188745.3188930}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ByrkaSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CanonneDKS18, author = {Cl{\'{e}}ment L. Canonne and Ilias Diakonikolas and Daniel M. Kane and Alistair Stewart}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Testing conditional independence of discrete distributions}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {735--748}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188756}, doi = {10.1145/3188745.3188756}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CanonneDKS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChakrabortyKL18, author = {Diptarka Chakraborty and Lior Kamma and Kasper Green Larsen}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Tight cell probe bounds for succinct Boolean matrix-vector multiplication}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1297--1306}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188830}, doi = {10.1145/3188745.3188830}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChakrabortyKL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChangLP18, author = {Yi{-}Jun Chang and Wenzheng Li and Seth Pettie}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {An optimal distributed ({\(\Delta\)}+1)-coloring algorithm?}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {445--456}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188964}, doi = {10.1145/3188745.3188964}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ChangLP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChattopadhyayHR18, author = {Eshan Chattopadhyay and Pooya Hatami and Omer Reingold and Avishay Tal}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Improved pseudorandomness for unordered branching programs through local monotonicity}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {363--375}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188800}, doi = {10.1145/3188745.3188800}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayHR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChattopadhyayKL18, author = {Arkadev Chattopadhyay and Michal Kouck{\'{y}} and Bruno Loff and Sagnik Mukhopadhyay}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Simulation beats richness: new data-structure lower bounds}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1013--1020}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188874}, doi = {10.1145/3188745.3188874}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayKL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Cheraghchi18, author = {Mahdi Cheraghchi}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Capacity upper bounds for deletion-type channels}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {493--506}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188768}, doi = {10.1145/3188745.3188768}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Cheraghchi18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChristandlVZ18, author = {Matthias Christandl and P{\'{e}}ter Vrana and Jeroen Zuiddam}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Universal points in the asymptotic spectrum of tensors}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {289--296}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188766}, doi = {10.1145/3188745.3188766}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChristandlVZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ChuzhoyKN18, author = {Julia Chuzhoy and David H. K. Kim and Rachit Nimavat}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Almost polynomial hardness of node-disjoint paths in grids}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1220--1233}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188772}, doi = {10.1145/3188745.3188772}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyKN18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CohenHS18, author = {Gil Cohen and Bernhard Haeupler and Leonard J. Schulman}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Explicit binary tree codes with polylogarithmic size alphabet}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {535--544}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188928}, doi = {10.1145/3188745.3188928}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CohenHS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/CzumajLMMOS18, author = {Artur Czumaj and Jakub Lacki and Aleksander Madry and Slobodan Mitrovic and Krzysztof Onak and Piotr Sankowski}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Round compression for parallel matching algorithms}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {471--484}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188764}, doi = {10.1145/3188745.3188764}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/CzumajLMMOS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DadushH18, author = {Daniel Dadush and Sophie Huiberts}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {A friendly smoothed analysis of the simplex method}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {390--403}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188826}, doi = {10.1145/3188745.3188826}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DadushH18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DaskalakisTZ18, author = {Constantinos Daskalakis and Christos Tzamos and Manolis Zampetakis}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {A converse to Banach's fixed point theorem and its CLS-completeness}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {44--50}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188968}, doi = {10.1145/3188745.3188968}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DaskalakisTZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DellL18, author = {Holger Dell and John Lapinskas}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Fine-grained reductions from approximate counting to decision}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {281--288}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188920}, doi = {10.1145/3188745.3188920}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DellL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DiakonikolasKS18, author = {Ilias Diakonikolas and Daniel M. Kane and Alistair Stewart}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {List-decodable robust mean estimation and learning mixtures of spherical gaussians}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1047--1060}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188758}, doi = {10.1145/3188745.3188758}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DiakonikolasKS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DiakonikolasKS18a, author = {Ilias Diakonikolas and Daniel M. Kane and Alistair Stewart}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Learning geometric concepts with nasty noise}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1061--1073}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188754}, doi = {10.1145/3188745.3188754}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/DiakonikolasKS18a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurKKMS18, author = {Irit Dinur and Subhash Khot and Guy Kindler and Dor Minzer and Muli Safra}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Towards a proof of the 2-to-1 games conjecture?}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {376--389}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188804}, doi = {10.1145/3188745.3188804}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DinurKKMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DinurKKMS18a, author = {Irit Dinur and Subhash Khot and Guy Kindler and Dor Minzer and Muli Safra}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {On non-optimally expanding sets in Grassmann graphs}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {940--951}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188806}, doi = {10.1145/3188745.3188806}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DinurKKMS18a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/DudekK18, author = {Bartlomiej Dudek and Adrian Kosowski}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Universal protocols for information dissemination using emergent signals}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {87--99}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188818}, doi = {10.1145/3188745.3188818}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/DudekK18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Dutta0S18, author = {Pranjal Dutta and Nitin Saxena and Amit Sinhababu}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Discovering the roots: uniform closure results for algebraic classes under factoring}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1152--1165}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188760}, doi = {10.1145/3188745.3188760}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Dutta0S18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/EdenRS18, author = {Talya Eden and Dana Ron and C. Seshadhri}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {On approximating the number of k-cliques in sublinear time}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {722--734}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188810}, doi = {10.1145/3188745.3188810}, timestamp = {Thu, 07 Jul 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/EdenRS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/EfremenkoKS18, author = {Klim Efremenko and Gillat Kol and Raghuvansh Saxena}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Interactive coding over the noisy broadcast channel}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {507--520}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188884}, doi = {10.1145/3188745.3188884}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/EfremenkoKS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/EmekKLS18, author = {Yuval Emek and Shay Kutten and Ron Lavi and Yangguang Shi}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Approximating generalized network design under (dis)economies of scale with applications to energy efficiency}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {598--606}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188812}, doi = {10.1145/3188745.3188812}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/EmekKLS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FawziGL18, author = {Omar Fawzi and Antoine Grospellier and Anthony Leverrier}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Efficient decoding of random errors for quantum expander codes}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {521--534}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188886}, doi = {10.1145/3188745.3188886}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/FawziGL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Filos-RatsikasG18, author = {Aris Filos{-}Ratsikas and Paul W. Goldberg}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Consensus halving is PPA-complete}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {51--64}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188880}, doi = {10.1145/3188745.3188880}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Filos-RatsikasG18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Fineman18, author = {Jeremy T. Fineman}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Nearly work-efficient parallel algorithm for digraph reachability}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {457--470}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188926}, doi = {10.1145/3188745.3188926}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Fineman18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ForbesS18, author = {Michael A. Forbes and Amir Shpilka}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {A {PSPACE} construction of a hitting set for the closure of small algebraic circuits}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1180--1192}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188792}, doi = {10.1145/3188745.3188792}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/ForbesS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Franks18, author = {Cole Franks}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Operator scaling with specified marginals}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {190--203}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188932}, doi = {10.1145/3188745.3188932}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Franks18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GargGKS18, author = {Ankit Garg and Mika G{\"{o}}{\"{o}}s and Pritish Kamath and Dmitry Sokolov}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Monotone circuit lower bounds from resolution}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {902--911}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188838}, doi = {10.1145/3188745.3188838}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GargGKS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GargLSS18, author = {Ankit Garg and Yin Tat Lee and Zhao Song and Nikhil Srivastava}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {A matrix expander Chernoff bound}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1102--1114}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188890}, doi = {10.1145/3188745.3188890}, timestamp = {Wed, 02 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GargLSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GargRT18, author = {Sumegha Garg and Ran Raz and Avishay Tal}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Extractor-based time-space lower bounds for learning}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {990--1002}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188962}, doi = {10.1145/3188745.3188962}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GargRT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GhaffariKMU18, author = {Mohsen Ghaffari and Fabian Kuhn and Yannic Maus and Jara Uitto}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Deterministic distributed edge-coloring with fewer colors}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {418--430}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188906}, doi = {10.1145/3188745.3188906}, timestamp = {Mon, 23 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GhaffariKMU18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GhaffariL18, author = {Mohsen Ghaffari and Jason Li}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Improved distributed algorithms for exact shortest paths}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {431--444}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188948}, doi = {10.1145/3188745.3188948}, timestamp = {Mon, 23 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/GhaffariL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GishbolinerS18, author = {Lior Gishboliner and Asaf Shapira}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {A generalized Tur{\'{a}}n problem and its applications}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {760--772}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188778}, doi = {10.1145/3188745.3188778}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GishbolinerS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Gonczarowski18, author = {Yannai A. Gonczarowski}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Bounding the menu-size of approximately optimal auctions via optimal-transport duality}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {123--131}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188786}, doi = {10.1145/3188745.3188786}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Gonczarowski18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Goyal018, author = {Vipul Goyal and Ashutosh Kumar}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Non-malleable secret sharing}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {685--698}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188872}, doi = {10.1145/3188745.3188872}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Goyal018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GoyalKW18, author = {Rishab Goyal and Venkata Koppula and Brent Waters}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Collusion resistant traitor tracing from learning with errors}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {660--670}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188844}, doi = {10.1145/3188745.3188844}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GoyalKW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HaeuplerS18, author = {Bernhard Haeupler and Amirbehshad Shahrasbi}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Synchronization strings: explicit constructions, local decoding, and applications}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {841--854}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188940}, doi = {10.1145/3188745.3188940}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/HaeuplerS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Hopkins018, author = {Samuel B. Hopkins and Jerry Li}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Mixture models, robustness, and sum of squares proofs}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1021--1034}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188748}, doi = {10.1145/3188745.3188748}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Hopkins018.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/HoyTW18, author = {Darrell Hoy and Samuel Taggart and Zihe Wang}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {A tighter welfare guarantee for first-price auctions}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {132--137}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188944}, doi = {10.1145/3188745.3188944}, timestamp = {Tue, 02 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/HoyTW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/IkenmeyerKLLMS18, author = {Christian Ikenmeyer and Balagopal Komarath and Christoph Lenzen and Vladimir Lysikov and Andrey Mokhov and Karteek Sreenivasaiah}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {On the complexity of hazard-free circuits}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {878--889}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188912}, doi = {10.1145/3188745.3188912}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/IkenmeyerKLLMS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/ImKPS18, author = {Sungjin Im and Nathaniel Kell and Debmalya Panigrahi and Maryam Shadloo}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Online load balancing on related machines}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {30--43}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188966}, doi = {10.1145/3188745.3188966}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/ImKPS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KaneLM18, author = {Daniel M. Kane and Shachar Lovett and Shay Moran}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Near-optimal linear decision trees for k-SUM and related problems}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {554--563}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188770}, doi = {10.1145/3188745.3188770}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KaneLM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KarlinGW18, author = {Anna R. Karlin and Shayan Oveis Gharan and Robbie Weber}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {A simply exponential upper bound on the maximum number of stable matchings}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {920--925}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188848}, doi = {10.1145/3188745.3188848}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KarlinGW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KaufmanO18, author = {Tali Kaufman and Izhar Oppenheim}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Construction of new local spectral high dimensional expanders}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {773--786}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188782}, doi = {10.1145/3188745.3188782}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KaufmanO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KempaP18, author = {Dominik Kempa and Nicola Prezza}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {At the roots of dictionary compression: string attractors}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {827--840}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188814}, doi = {10.1145/3188745.3188814}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KempaP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KothariM18, author = {Pravesh K. Kothari and Ruta Mehta}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Sum-of-squares meets nash: lower bounds for finding any equilibrium}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1241--1248}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188892}, doi = {10.1145/3188745.3188892}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KothariM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KothariSS18, author = {Pravesh K. Kothari and Jacob Steinhardt and David Steurer}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Robust moment estimation and improved clustering via sum of squares}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1035--1046}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188970}, doi = {10.1145/3188745.3188970}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KothariSS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KrishnaswamyLS18, author = {Ravishankar Krishnaswamy and Shi Li and Sai Sandeep}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Constant approximation for k-median and k-means with outliers via iterative rounding}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {646--659}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188882}, doi = {10.1145/3188745.3188882}, timestamp = {Thu, 29 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KrishnaswamyLS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KwokLLR18, author = {Tsz Chiu Kwok and Lap Chi Lau and Yin Tat Lee and Akshay Ramachandran}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {The Paulsen problem, continuous operator scaling, and smoothed analysis}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {182--189}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188794}, doi = {10.1145/3188745.3188794}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/KwokLLR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KyngPSZ18, author = {Rasmus Kyng and Richard Peng and Robert Schwieterman and Peng Zhang}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Incomplete nested dissection}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {404--417}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188960}, doi = {10.1145/3188745.3188960}, timestamp = {Wed, 17 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KyngPSZ18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LarsenWY18, author = {Kasper Green Larsen and Omri Weinstein and Huacheng Yu}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {978--989}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188790}, doi = {10.1145/3188745.3188790}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LarsenWY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LeeV18, author = {Yin Tat Lee and Santosh S. Vempala}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Convergence rate of riemannian Hamiltonian Monte Carlo and faster polytope volume computation}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1115--1121}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188774}, doi = {10.1145/3188745.3188774}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LeeV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LeeV18a, author = {Yin Tat Lee and Santosh S. Vempala}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Stochastic localization + Stieltjes barrier = tight bound for log-Sobolev}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1122--1129}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188866}, doi = {10.1145/3188745.3188866}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LeeV18a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LeungNSTYY18, author = {Debbie W. Leung and Ashwin Nayak and Ala Shayeghi and Dave Touchette and Penghui Yao and Nengkun Yu}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Capacity approaching coding for low noise interactive quantum communication}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {339--352}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188908}, doi = {10.1145/3188745.3188908}, timestamp = {Mon, 18 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/LeungNSTYY18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LiuCSSX18, author = {Zhengyang Liu and Xi Chen and Rocco A. Servedio and Ying Sheng and Jinyu Xie}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Distribution-free junta testing}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {749--759}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188842}, doi = {10.1145/3188745.3188842}, timestamp = {Fri, 17 Dec 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/LiuCSSX18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LiuV18, author = {Tianren Liu and Vinod Vaikuntanathan}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Breaking the circuit-size barrier in secret sharing}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {699--708}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188936}, doi = {10.1145/3188745.3188936}, timestamp = {Sat, 02 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/LiuV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Lo18, author = {Irene Lo}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Dynamic matching in school choice: efficient seat reassignment after late cancellations (invited talk)}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3232193}, doi = {10.1145/3188745.3232193}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Lo18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LoeraHR18, author = {Jes{\'{u}}s A. De Loera and Jamie Haddock and Luis Rademacher}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {The minimum euclidean-norm point in a convex polytope: Wolfe's combinatorial algorithm is exponential}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {545--553}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188820}, doi = {10.1145/3188745.3188820}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/LoeraHR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/LykourisML18, author = {Thodoris Lykouris and Vahab S. Mirrokni and Renato Paes Leme}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Stochastic bandits robust to adversarial corruptions}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {114--122}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188918}, doi = {10.1145/3188745.3188918}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/LykourisML18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Ma18, author = {Tengyu Ma}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Generalization and equilibrium in generative adversarial nets (GANs) (invited talk)}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {2}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3232194}, doi = {10.1145/3188745.3232194}, timestamp = {Sun, 08 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/Ma18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MahabadiMMR18, author = {Sepideh Mahabadi and Konstantin Makarychev and Yury Makarychev and Ilya P. Razenshteyn}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Nonlinear dimension reduction via outer Bi-Lipschitz extensions}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1088--1101}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188828}, doi = {10.1145/3188745.3188828}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/MahabadiMMR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MurrayW18, author = {Cody Murray and R. Ryan Williams}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for {NP} and {NQP}}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {890--901}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188910}, doi = {10.1145/3188745.3188910}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/MurrayW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/MutzeNW18, author = {Torsten M{\"{u}}tze and Jerri Nummenpalo and Bartosz Walczak}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Sparse Kneser graphs are Hamiltonian}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {912--919}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188834}, doi = {10.1145/3188745.3188834}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/MutzeNW18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/NeuenS18, author = {Daniel Neuen and Pascal Schweitzer}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {An exponential lower bound for individualization-refinement algorithms for graph isomorphism}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {138--150}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188900}, doi = {10.1145/3188745.3188900}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/NeuenS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/OmidvarF18, author = {Hamed Omidvar and Massimo Franceschetti}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Shape of diffusion and size of monochromatic region of a two-dimensional spin system}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {100--113}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188836}, doi = {10.1145/3188745.3188836}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/OmidvarF18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/OnakS18, author = {Krzysztof Onak and Xiaorui Sun}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {The query complexity of graph isomorphism: bypassing distribution testing lower bounds}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {165--171}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188952}, doi = {10.1145/3188745.3188952}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/OnakS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/PitassiR18, author = {Toniann Pitassi and Robert Robere}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Lifting nullstellensatz to monotone span programs over any field}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1207--1219}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188914}, doi = {10.1145/3188745.3188914}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/PitassiR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Rubinstein18, author = {Aviad Rubinstein}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Hardness of approximate nearest neighbor search}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1260--1268}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188916}, doi = {10.1145/3188745.3188916}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Rubinstein18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/SLM18, author = {{Karthik {C. S.}} and Bundit Laekhanukit and Pasin Manurangsi}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {On the parameterized complexity of approximating dominating set}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1283--1296}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188896}, doi = {10.1145/3188745.3188896}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/SLM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Schild18, author = {Aaron Schild}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {An almost-linear time algorithm for uniform random spanning tree generation}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {214--227}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188852}, doi = {10.1145/3188745.3188852}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Schild18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/SharanKLV18, author = {Vatsal Sharan and Sham M. Kakade and Percy Liang and Gregory Valiant}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Prediction with a short memory}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1074--1087}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188954}, doi = {10.1145/3188745.3188954}, timestamp = {Tue, 23 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/SharanKLV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Sherstov18, author = {Alexander A. Sherstov}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Algorithmic polynomials}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {311--324}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188958}, doi = {10.1145/3188745.3188958}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Sherstov18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/SimchowitzAR18, author = {Max Simchowitz and Ahmed El Alaoui and Benjamin Recht}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Tight query complexity lower bounds for {PCA} via finite sample deformed wigner law}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {1249--1259}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188796}, doi = {10.1145/3188745.3188796}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/SimchowitzAR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/SvenssonTV18, author = {Ola Svensson and Jakub Tarnawski and L{\'{a}}szl{\'{o}} A. V{\'{e}}gh}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {A constant-factor approximation algorithm for the asymmetric traveling salesman problem}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {204--213}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188824}, doi = {10.1145/3188745.3188824}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/SvenssonTV18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Tell18, author = {Roei Tell}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Quantified derandomization of linear threshold circuits}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {855--865}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188822}, doi = {10.1145/3188745.3188822}, timestamp = {Wed, 21 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Tell18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/stoc/2018, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, publisher = {{ACM}}, year = {2018}, url = {http://dl.acm.org/citation.cfm?id=3188745}, timestamp = {Thu, 21 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/2018.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.