Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:streams/conf/stoc:"
more than 1000 matches, exporting first 1000 hits only!
download as .bib file
@inproceedings{DBLP:conf/stoc/0001G23,
author = {Mohsen Ghaffari and
Christoph Grunau},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Faster Deterministic Distributed {MIS} and Approximate Matching},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1777--1790},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585243},
doi = {10.1145/3564246.3585243},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001G23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001GHKS23,
author = {Debarati Das and
Jacob Gilbert and
MohammadTaghi Hajiaghayi and
Tomasz Kociumaka and
Barna Saha},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Weighted Edit Distance Computation: Strings, Trees, and Dyck},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {377--390},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585178},
doi = {10.1145/3564246.3585178},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001GHKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001I0MZ23,
author = {Tobias Friedrich and
Davis Issac and
Nikhil Kumar and
Nadym Mallek and
Ziena Zeif},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1325--1334},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585150},
doi = {10.1145/3564246.3585150},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001I0MZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001JM23,
author = {Nikhil Bansal and
Haotian Jiang and
Raghu Meka},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Resolving Matrix Spencer Conjecture Up to Poly-logarithmic Rank},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1814--1819},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585103},
doi = {10.1145/3564246.3585103},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001JM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001KK23,
author = {George Christodoulou and
Elias Koutsoupias and
Annam{\'{a}}ria Kov{\'{a}}cs},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Proof of the Nisan-Ronen Conjecture},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {672--685},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585176},
doi = {10.1145/3564246.3585176},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001KK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001T23,
author = {Lijie Chen and
Roei Tell},
editor = {Barna Saha and
Rocco A. Servedio},
title = {When Arthur Has Neither Random Coins Nor Time to Spare: Superfast
Derandomization of Proof Systems},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {60--69},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585215},
doi = {10.1145/3564246.3585215},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001T23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001T23a,
author = {Srikanth Srinivasan and
Utkarsh Tripathi},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Optimal Explicit Small-Depth Formulas for the Coin Problem},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {881--894},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585238},
doi = {10.1145/3564246.3585238},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0001T23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0002LR23,
author = {Marco Bressan and
Matthias Lanzinger and
Marc Roth},
editor = {Barna Saha and
Rocco A. Servedio},
title = {The Complexity of Pattern Counting in Directed Graphs, Parameterised
by the Outdegree},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {542--552},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585204},
doi = {10.1145/3564246.3585204},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0002LR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0005MSY23,
author = {Siqi Liu and
Sidhanth Mohanty and
Tselil Schramm and
Elizabeth Yang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Local and Global Expansion in Random Geometric Graphs},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {817--825},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585106},
doi = {10.1145/3564246.3585106},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0005MSY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AaronsonH23,
author = {Scott Aaronson and
Shih{-}Han Hung},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Certified Randomness from Quantum Supremacy},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {933--944},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585145},
doi = {10.1145/3564246.3585145},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AaronsonH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudBF23,
author = {Amir Abboud and
Karl Bringmann and
Nick Fischer},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive
Combinatorics},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {391--404},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585240},
doi = {10.1145/3564246.3585240},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbboudBF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AggarwalBBG0LPS23,
author = {Divesh Aggarwal and
Huck Bennett and
Zvika Brakerski and
Alexander Golovnev and
Rajendra Kumar and
Zeyong Li and
Spencer Peters and
Noah Stephens{-}Davidowitz and
Vinod Vaikuntanathan},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Lattice Problems beyond Polynomial Time},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1516--1526},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585227},
doi = {10.1145/3564246.3585227},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AggarwalBBG0LPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AharonovGLLV23,
author = {Dorit Aharonov and
Xun Gao and
Zeph Landau and
Yunchao Liu and
Umesh V. Vazirani},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {945--957},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585234},
doi = {10.1145/3564246.3585234},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AharonovGLLV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlabiKTVZ23,
author = {Daniel Alabi and
Pravesh K. Kothari and
Pranay Tankala and
Prayaag Venkat and
Fred Zhang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Privately Estimating a Gaussian: Efficient, Robust, and Optimal},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {483--496},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585194},
doi = {10.1145/3564246.3585194},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlabiKTVZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlmanR23,
author = {Josh Alman and
Kevin Rao},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Faster Walsh-Hadamard and Discrete Fourier Transforms from Matrix
Non-rigidity},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {455--462},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585188},
doi = {10.1145/3564246.3585188},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlmanR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlrabiahGKM23,
author = {Omar Alrabiah and
Venkatesan Guruswami and
Pravesh K. Kothari and
Peter Manohar},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from
Semirandom {CSP} Refutation},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1438--1448},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585143},
doi = {10.1145/3564246.3585143},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlrabiahGKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AmitR23,
author = {Noga Amit and
Guy N. Rothblum},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Constant-Round Arguments from One-Way Functions},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1537--1544},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585244},
doi = {10.1145/3564246.3585244},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AmitR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnariHLVXY23,
author = {Nima Anari and
Yizhi Huang and
Tianyu Liu and
Thuy{-}Duong Vuong and
Brian Xu and
Katherine Yu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Parallel Discrete Sampling via Continuous Walks},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {103--116},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585207},
doi = {10.1145/3564246.3585207},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AnariHLVXY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnshuBN23,
author = {Anurag Anshu and
Nikolas P. Breuckmann and
Chinmay Nirkhe},
editor = {Barna Saha and
Rocco A. Servedio},
title = {{NLTS} Hamiltonians from Good Quantum Codes},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1090--1096},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585114},
doi = {10.1145/3564246.3585114},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AnshuBN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ApplebaumBIKLV23,
author = {Benny Applebaum and
Amos Beimel and
Yuval Ishai and
Eyal Kushilevitz and
Tianren Liu and
Vinod Vaikuntanathan},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Succinct Computational Secret Sharing},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1553--1566},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585127},
doi = {10.1145/3564246.3585127},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ApplebaumBIKLV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ApplebaumKP23,
author = {Benny Applebaum and
Eliran Kachlon and
Arpita Patra},
editor = {Barna Saha and
Rocco A. Servedio},
title = {The Round Complexity of Statistical {MPC} with Optimal Resiliency},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1527--1536},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585228},
doi = {10.1145/3564246.3585228},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ApplebaumKP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArmbrusterRW23,
author = {Alexander Armbruster and
Lars Rohwedder and
Andreas Wiese},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A {PTAS} for Minimizing Weighted Flow Time on a Single Machine},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1335--1344},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585146},
doi = {10.1145/3564246.3585146},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ArmbrusterRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AroraCCGSW23,
author = {Atul Singh Arora and
Andrea Coladangelo and
Matthew Coudron and
Alexandru Gheorghiu and
Uttam Singh and
Hendrik Waldner},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Quantum Depth in the Random Oracle Model},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1111--1124},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585153},
doi = {10.1145/3564246.3585153},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AroraCCGSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiBKL23,
author = {Sepehr Assadi and
Soheil Behnezhad and
Sanjeev Khanna and
Huan Li},
editor = {Barna Saha and
Rocco A. Servedio},
title = {On Regularity Lemma and Barriers in Streaming and Dynamic Matching},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {131--144},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585110},
doi = {10.1145/3564246.3585110},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AssadiBKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiS23,
author = {Sepehr Assadi and
Janani Sundaresan},
editor = {Barna Saha and
Rocco A. Servedio},
title = {(Noisy) Gap Cycle Counting Strikes Back: Random Order Streaming Lower
Bounds for Connected Components and Beyond},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {183--195},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585192},
doi = {10.1145/3564246.3585192},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AssadiS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AtseriasBM23,
author = {Albert Atserias and
Sam Buss and
Moritz M{\"{u}}ller},
editor = {Barna Saha and
Rocco A. Servedio},
title = {On the Consistency of Circuit Lower Bounds for Non-deterministic Time},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1257--1270},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585253},
doi = {10.1145/3564246.3585253},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AtseriasBM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BakshiLMY23,
author = {Ainesh Bakshi and
Allen Liu and
Ankur Moitra and
Morris Yau},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A New Approach to Learning Linear Dynamical Systems},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {335--348},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585247},
doi = {10.1145/3564246.3585247},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BakshiLMY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BaloghDLMZ23,
author = {J{\'{o}}zsef Balogh and
Dingding Dong and
Bernard Lidick{\'{y}} and
Nitya Mani and
Yufei Zhao},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Nearly All k-SAT Functions Are Unate},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {958--962},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585123},
doi = {10.1145/3564246.3585123},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BaloghDLMZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BamasR23,
author = {{\'{E}}tienne Bamas and
Lars Rohwedder},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Better Trees for Santa Claus},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1862--1875},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585174},
doi = {10.1145/3564246.3585174},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BamasR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BartusekKNY23,
author = {James Bartusek and
Fuyuki Kitagawa and
Ryo Nishimaki and
Takashi Yamakawa},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Obfuscation of Pseudo-Deterministic Quantum Circuits},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1567--1578},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585179},
doi = {10.1145/3564246.3585179},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BartusekKNY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BehnezhadRR23,
author = {Soheil Behnezhad and
Mohammad Roghani and
Aviad Rubinstein},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Sublinear Time Algorithms and Complexity of Approximate Maximum Matching},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {267--280},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585231},
doi = {10.1145/3564246.3585231},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BehnezhadRR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BennettCG023,
author = {Huck Bennett and
Mahdi Cheraghchi and
Venkatesan Guruswami and
Jo{\~{a}}o Ribeiro},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Parameterized Inapproximability of the Minimum Distance Problem over
All Fields and the Shortest Vector Problem in All {\(\mathscr{l}\)}\emph{\({}_{\mbox{p}}\)}
Norms},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {553--566},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585214},
doi = {10.1145/3564246.3585214},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BennettCG023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeyhaghiC23,
author = {Hedyeh Beyhaghi and
Linda Cai},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Pandora's Problem with Nonobligatory Inspection: Optimal Structure
and a {PTAS}},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {803--816},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585217},
doi = {10.1145/3564246.3585217},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeyhaghiC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhangaleKM23,
author = {Amey Bhangale and
Subhash Khot and
Dor Minzer},
editor = {Barna Saha and
Rocco A. Servedio},
title = {On Approximability of Satisfiable k-CSPs: {II}},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {632--642},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585120},
doi = {10.1145/3564246.3585120},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BhangaleKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhangaleKM23a,
author = {Amey Bhangale and
Subhash Khot and
Dor Minzer},
editor = {Barna Saha and
Rocco A. Servedio},
title = {On Approximability of Satisfiable k-CSPs: {III}},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {643--655},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585121},
doi = {10.1145/3564246.3585121},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BhangaleKM23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhargavaSV23,
author = {Vishwas Bhargava and
Shubhangi Saraf and
Ilya Volkovich},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Linear Independence, Alternants, and Applications},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {441--454},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585149},
doi = {10.1145/3564246.3585149},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BhargavaSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bhattacharya023,
author = {Sudatta Bhattacharya and
Michal Kouck{\'{y}}},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Locally Consistent Decomposition of Strings with Applications to Edit
Distance Sketching},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {219--232},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585239},
doi = {10.1145/3564246.3585239},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Bhattacharya023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhattacharyaKS23,
author = {Sayan Bhattacharya and
Peter Kiss and
Thatchaphol Saranurak},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Sublinear Algorithms for (1.5+{\(\epsilon\)})-Approximate Matching},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {254--266},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585252},
doi = {10.1145/3564246.3585252},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BhattacharyaKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BiloCCC0KS23,
author = {Davide Bil{\`{o}} and
Shiri Chechik and
Keerti Choudhary and
Sarel Cohen and
Tobias Friedrich and
Simon Krogmann and
Martin Schirneck},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Approximate Distance Sensitivity Oracles in Subquadratic Space},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1396--1409},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585251},
doi = {10.1145/3564246.3585251},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BiloCCC0KS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlackC023,
author = {Hadley Black and
Deeparnab Chakrabarty and
C. Seshadhri},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid
and an {\~{O}}(n{\(\surd\)}d) Monotonicity Tester},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {233--241},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585167},
doi = {10.1145/3564246.3585167},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BlackC023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Blanc23,
author = {Guy Blanc},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Subsampling Suffices for Adaptive Data Analysis},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {999--1012},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585226},
doi = {10.1145/3564246.3585226},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Blanc23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlancLMT23,
author = {Guy Blanc and
Jane Lange and
Ali Malik and
Li{-}Yang Tan},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Lifting Uniform Learners via Distributional Decomposition},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1755--1767},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585212},
doi = {10.1145/3564246.3585212},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BlancLMT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlasiokGHN23,
author = {Jaroslaw Blasiok and
Parikshit Gopalan and
Lunjia Hu and
Preetum Nakkiran},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Unifying Theory of Distance from Calibration},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1727--1740},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585182},
doi = {10.1145/3564246.3585182},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BlasiokGHN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlauthN23,
author = {Jannis Blauth and
Martin N{\"{a}}gele},
editor = {Barna Saha and
Rocco A. Servedio},
title = {An Improved Approximation Guarantee for Prize-Collecting {TSP}},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1848--1861},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585159},
doi = {10.1145/3564246.3585159},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BlauthN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlikstadMNT23,
author = {Joakim Blikstad and
Sagnik Mukhopadhyay and
Danupon Nanongkai and
Ta{-}Wei Tu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Fast Algorithms via Dynamic-Oracle Matroids},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1229--1242},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585219},
doi = {10.1145/3564246.3585219},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BlikstadMNT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrakensiekGM23,
author = {Joshua Brakensiek and
Sivakanth Gopi and
Visu Makam},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Generic Reed-Solomon Codes Achieve List-Decoding Capacity},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1488--1501},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585128},
doi = {10.1145/3564246.3585128},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrakensiekGM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrakensiekGS23,
author = {Joshua Brakensiek and
Venkatesan Guruswami and
Sai Sandeep},
editor = {Barna Saha and
Rocco A. Servedio},
title = {SDPs and Robust Satisfiability of Promise {CSP}},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {609--622},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585180},
doi = {10.1145/3564246.3585180},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrakensiekGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrandLS23,
author = {Jan van den Brand and
Yang P. Liu and
Aaron Sidford},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Dynamic Maxflow via Dynamic Interior Point Methods},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1215--1228},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585135},
doi = {10.1145/3564246.3585135},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrandLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrodalRS23,
author = {Gerth St{\o}lting Brodal and
Casper Moldrup Rysgaard and
Rolf Svenning},
editor = {Barna Saha and
Rocco A. Servedio},
title = {External Memory Fully Persistent Search Trees},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1410--1423},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585140},
doi = {10.1145/3564246.3585140},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrodalRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BubeckCR23,
author = {S{\'{e}}bastien Bubeck and
Christian Coester and
Yuval Rabani},
editor = {Barna Saha and
Rocco A. Servedio},
title = {The Randomized k-Server Conjecture Is False!},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {581--594},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585132},
doi = {10.1145/3564246.3585132},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BubeckCR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bucic023,
author = {Matija Bucic and
Richard Montgomery},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Towards the Erd{\H{o}}s-Gallai Cycle Decomposition Conjecture},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {839--852},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585218},
doi = {10.1145/3564246.3585218},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Bucic023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BuhaiKS23,
author = {Rares{-}Darius Buhai and
Pravesh K. Kothari and
David Steurer},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Algorithms Approaching the Threshold for Semi-random Planted Clique},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1918--1926},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585184},
doi = {10.1145/3564246.3585184},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BuhaiKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BunGHILPSS23,
author = {Mark Bun and
Marco Gaboardi and
Max Hopkins and
Russell Impagliazzo and
Rex Lei and
Toniann Pitassi and
Satchit Sivakumar and
Jessica Sorrell},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Stability Is Stable: Connections between Replicability, Privacy, and
Adaptive Generalization},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {520--527},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585246},
doi = {10.1145/3564246.3585246},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BunGHILPSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CaiM23,
author = {Jin{-}Yi Cai and
Ashwin Maran},
editor = {Barna Saha and
Rocco A. Servedio},
title = {The Complexity of Counting Planar Graph Homomorphisms of Domain Size
3},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1285--1297},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585173},
doi = {10.1145/3564246.3585173},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CaiM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CaiW23,
author = {Yang Cai and
Jinzhao Wu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {On the Optimal Fixed-Price Mechanism in Bilateral Trade},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {737--750},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585171},
doi = {10.1145/3564246.3585171},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CaiW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CaragiannisJ23,
author = {Ioannis Caragiannis and
Zhile Jiang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Computing Better Approximate Pure Nash Equilibria in Cut Games via
Semidefinite Programming},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {710--722},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585236},
doi = {10.1145/3564246.3585236},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CaragiannisJ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChanWX23,
author = {Timothy M. Chan and
Virginia Vassilevska Williams and
Yinzhan Xu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Fredman's Trick Meets Dominance Product: Fine-Grained Complexity of
Unweighted APSP, 3SUM Counting, and More},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {419--432},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585237},
doi = {10.1145/3564246.3585237},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChanWX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CharikarP23,
author = {Moses Charikar and
Chirag Pabbaraju},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Characterization of List Learnability},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1713--1726},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585190},
doi = {10.1145/3564246.3585190},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CharikarP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChattopadhyayDM23,
author = {Arkadev Chattopadhyay and
Yogesh Dahiya and
Nikhil S. Mande and
Jaikumar Radhakrishnan and
Swagato Sanyal},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Randomized versus Deterministic Decision Tree Size},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {867--880},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585199},
doi = {10.1145/3564246.3585199},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayDM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Chen0LZ23,
author = {Sitan Chen and
Jerry Li and
Yuanzhi Li and
Anru R. Zhang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Learning Polynomial Transformations via Generalized Tensor Decompositions},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1671--1684},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585209},
doi = {10.1145/3564246.3585209},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Chen0LZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenCJLW23,
author = {Xi Chen and
Vincent Cohen{-}Addad and
Rajesh Jayaram and
Amit Levi and
Erik Waingarten},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Streaming Euclidean {MST} to a Constant Factor},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {156--169},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585168},
doi = {10.1145/3564246.3585168},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenCJLW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenHLR23,
author = {Yeyuan Chen and
Yizhi Huang and
Jiatu Li and
Hanlin Ren},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs
Algorithms},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1058--1066},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585147},
doi = {10.1145/3564246.3585147},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenHLR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenJK23,
author = {Xiaoyu Chen and
Shaofeng H.{-}C. Jiang and
Robert Krauthgamer},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Streaming Euclidean Max-Cut: Dimension vs Data Reduction},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {170--182},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585170},
doi = {10.1145/3564246.3585170},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenJK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenP23,
author = {Xi Chen and
Binghui Peng},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Complexity of Equilibria in First-Price Auctions under General Tie-Breaking
Rules},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {698--709},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585195},
doi = {10.1145/3564246.3585195},
timestamp = {Fri, 25 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CherapanamjeriD23,
author = {Yeshwanth Cherapanamjeri and
Constantinos Daskalakis and
Andrew Ilyas and
Manolis Zampetakis},
editor = {Barna Saha and
Rocco A. Servedio},
title = {What Makes a Good Fisherman? Linear Regression under Self-Selection
Bias},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1699--1712},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585177},
doi = {10.1145/3564246.3585177},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CherapanamjeriD23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChristY23,
author = {Miranda Christ and
Mihalis Yannakakis},
editor = {Barna Saha and
Rocco A. Servedio},
title = {The Smoothed Complexity of Policy Iteration for Markov Decision Processes},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1890--1903},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585220},
doi = {10.1145/3564246.3585220},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChristY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Christiansen0R23,
author = {Aleksander Bj{\o}rn Grodt Christiansen and
Krzysztof Nowicki and
Eva Rotenberg},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Improved Dynamic Colouring of Sparse Graphs},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1201--1214},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585111},
doi = {10.1145/3564246.3585111},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Christiansen0R23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Christiansen23,
author = {Aleksander Bj{\o}rn Grodt Christiansen},
editor = {Barna Saha and
Rocco A. Servedio},
title = {The Power of Multi-step Vizing Chains},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1013--1026},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585105},
doi = {10.1145/3564246.3585105},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Christiansen23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyZ23,
author = {Julia Chuzhoy and
Ruimin Zhang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A New Deterministic Algorithm for Fully Dynamic All-Pairs Shortest
Paths},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1159--1172},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585196},
doi = {10.1145/3564246.3585196},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CiardoZ23,
author = {Lorenzo Ciardo and
Stanislav Zivn{\'{y}}},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Approximate Graph Colouring and the Hollow Shadow},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {623--631},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585112},
doi = {10.1145/3564246.3585112},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CiardoZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cohen0NSS23,
author = {Edith Cohen and
Xin Lyu and
Jelani Nelson and
Tam{\'{a}}s Sarl{\'{o}}s and
Uri Stemmer},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Optimal Differentially Private Learning of Thresholds and Quasi-Concave
Optimization},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {472--482},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585148},
doi = {10.1145/3564246.3585148},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Cohen0NSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenDST23,
author = {Gil Cohen and
Dean Doron and
Ori Sberlo and
Amnon Ta{-}Shma},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Approximating Iterated Multiplication of Stochastic Matrices in Small
Space},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {35--45},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585181},
doi = {10.1145/3564246.3585181},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CohenDST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenM23,
author = {Gil Cohen and
Gal Maor},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Random Walks on Rotating Expanders},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {971--984},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585133},
doi = {10.1145/3564246.3585133},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CohenM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CorreaC23,
author = {Jos{\'{e}} Correa and
Andr{\'{e}}s Cristi},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Constant Factor Prophet Inequality for Online Combinatorial Auctions},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {686--697},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585151},
doi = {10.1145/3564246.3585151},
timestamp = {Wed, 03 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CorreaC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DalzellPCB23,
author = {Alexander M. Dalzell and
Nicola Pancotti and
Earl T. Campbell and
Fernando G. S. L. Brand{\~{a}}o},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Mind the Gap: Achieving a Super-Grover Quantum Speedup by Jumping
to the End},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1131--1144},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585203},
doi = {10.1145/3564246.3585203},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DalzellPCB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DerakhshanDH23,
author = {Mahsa Derakhshan and
Naveen Durvasula and
Nika Haghtalab},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Stochastic Minimum Vertex Cover in General Graphs: {A} 3/2-Approximation},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {242--253},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585230},
doi = {10.1145/3564246.3585230},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DerakhshanDH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DiakonikolasTK23,
author = {Ilias Diakonikolas and
Christos Tzamos and
Daniel M. Kane},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Strongly Polynomial Algorithm for Approximate Forster Transforms
and Its Application to Halfspace Learning},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1741--1754},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585191},
doi = {10.1145/3564246.3585191},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DiakonikolasTK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Dikstein23,
author = {Yotam Dikstein},
editor = {Barna Saha and
Rocco A. Servedio},
title = {New High Dimensional Expanders from Covers},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {826--838},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585183},
doi = {10.1145/3564246.3585183},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Dikstein23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DinurHLV23,
author = {Irit Dinur and
Min{-}Hsiu Hsieh and
Ting{-}Chun Lin and
Thomas Vidick},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Good Quantum {LDPC} Codes with Linear Time Decoders},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {905--918},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585101},
doi = {10.1145/3564246.3585101},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DinurHLV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DoronMOZ23,
author = {Dean Doron and
Dana Moshkovitz and
Justin Oh and
David Zuckerman},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Almost Chor-Goldreich Sources and Adversarial Random Walks},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1--9},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585134},
doi = {10.1145/3564246.3585134},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DoronMOZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DreierMS23,
author = {Jan Dreier and
Nikolas M{\"{a}}hlmann and
Sebastian Siebertz},
editor = {Barna Saha and
Rocco A. Servedio},
title = {First-Order Model Checking on Structurally Sparse Graph Classes},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {567--580},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585186},
doi = {10.1145/3564246.3585186},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DreierMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DuttingEFK23,
author = {Paul D{\"{u}}tting and
Tomer Ezra and
Michal Feldman and
Thomas Kesselheim},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Multi-agent Contracts},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1311--1324},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585193},
doi = {10.1145/3564246.3585193},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DuttingEFK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EfremenkoKPS23,
author = {Klim Efremenko and
Gillat Kol and
Dmitry Paramonov and
Raghuvansh R. Saxena},
editor = {Barna Saha and
Rocco A. Servedio},
title = {The Rate of Interactive Codes Is Bounded Away from 1},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1424--1437},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585249},
doi = {10.1145/3564246.3585249},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/EfremenkoKPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EldanMR23,
author = {Ronen Eldan and
Dan Mikulincer and
Prasad Raghavendra},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Noise Stability on the Boolean Hypercube via a Renormalized Brownian
Motion},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {661--671},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585118},
doi = {10.1145/3564246.3585118},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/EldanMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EldanWW23,
author = {Ronen Eldan and
Avi Wigderson and
Pei Wu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {An Optimal "It Ain't Over Till It's Over" Theorem},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {853--866},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585205},
doi = {10.1145/3564246.3585205},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/EldanWW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EllisKL23,
author = {David Ellis and
Guy Kindler and
Noam Lifshitz},
editor = {Barna Saha and
Rocco A. Servedio},
title = {An Analogue of Bonami's Lemma for Functions on Spaces of Linear Maps,
and 2-2 Games},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {656--660},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585116},
doi = {10.1145/3564246.3585116},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/EllisKL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FerreiraP23,
author = {Matheus Venturyne Xavier Ferreira and
David C. Parkes},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Credible Decentralized Exchange Design via Verifiable Sequencing Rules},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {723--736},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585233},
doi = {10.1145/3564246.3585233},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FerreiraP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ForsterNG23,
author = {Sebastian Forster and
Yasamin Nazari and
Maximilian Probst Gutenberg},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Deterministic Incremental {APSP} with Polylogarithmic Update Time
and Stretch},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1173--1186},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585213},
doi = {10.1145/3564246.3585213},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ForsterNG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FuLL23,
author = {Hu Fu and
Jiawei Li and
Daogao Liu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Pandora Box Problem with Nonobligatory Inspection: Hardness and Approximation
Scheme},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {789--802},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585229},
doi = {10.1145/3564246.3585229},
timestamp = {Mon, 30 Oct 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FuLL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GargHLVV23,
author = {Jugal Garg and
Edin Husic and
Wenzheng Li and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh and
Jan Vondr{\'{a}}k},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Approximating Nash Social Welfare by Matching and Local Search},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1298--1310},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585255},
doi = {10.1145/3564246.3585255},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GargHLVV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GhosalIKKLS23,
author = {Riddhi Ghosal and
Yuval Ishai and
Alexis Korb and
Eyal Kushilevitz and
Paul Lou and
Amit Sahai},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Hard Languages in {NP} {\(\cap\)} coNP and {NIZK} Proofs from Unstructured
Hardness},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1243--1256},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585119},
doi = {10.1145/3564246.3585119},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GhosalIKKLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GollakotaKK23,
author = {Aravind Gollakota and
Adam R. Klivans and
Pravesh K. Kothari},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Moment-Matching Approach to Testable Learning and a New Characterization
of Rademacher Complexity},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1657--1670},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585206},
doi = {10.1145/3564246.3585206},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GollakotaKK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Golowich23,
author = {Louis Golowich},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A New Berry-Esseen Theorem for Expander Walks},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {10--22},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585141},
doi = {10.1145/3564246.3585141},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Golowich23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GolowichMR23,
author = {Noah Golowich and
Ankur Moitra and
Dhruv Rohatgi},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Planning and Learning in Partially Observable Systems via Filter Stability},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {349--362},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585099},
doi = {10.1145/3564246.3585099},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GolowichMR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuPT23,
author = {Shouzhen Gu and
Christopher A. Pattison and
Eugene Tang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {An Efficient Decoder for a Linear Distance Quantum {LDPC} Code},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {919--932},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585169},
doi = {10.1145/3564246.3585169},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuPT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuX23,
author = {Yuzhou Gu and
Yinzhan Xu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Optimal Bounds for Noisy Sorting},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1502--1515},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585131},
doi = {10.1145/3564246.3585131},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GunnJMZ23,
author = {Sam Gunn and
Nathan Ju and
Fermi Ma and
Mark Zhandry},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Commitments to Quantum States},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1579--1588},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585198},
doi = {10.1145/3564246.3585198},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GunnJMZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuoVJZ23,
author = {Zeyu Guo and
Ben Lee Volk and
Akhil Jalan and
David Zuckerman},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Extractors for Images of Varieties},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {46--59},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585109},
doi = {10.1145/3564246.3585109},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuoVJZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuptaGZ23,
author = {Meghal Gupta and
Venkatesan Guruswami and
Rachel Yun Zhang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Binary Error-Correcting Codes with Minimal Noiseless Feedback},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1475--1487},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585126},
doi = {10.1145/3564246.3585126},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuptaGZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuptaZ23,
author = {Meghal Gupta and
Rachel Yun Zhang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Efficient Interactive Coding Achieving Optimal Error Resilience over
the Binary Channel},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1449--1462},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585162},
doi = {10.1145/3564246.3585162},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuptaZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HaeuplerHS23,
author = {Bernhard Haeupler and
D. Ellis Hershkowitz and
Thatchaphol Saranurak},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Maximum Length-Constrained Flows and Disjoint Paths: Distributed,
Deterministic, and Fast},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1371--1383},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585202},
doi = {10.1145/3564246.3585202},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HaeuplerHS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HatamiHM23,
author = {Hamed Hatami and
Kaave Hosseini and
Xiang Meng},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Borsuk-Ulam Lower Bound for Sign-Rank and Its Applications},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {463--471},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585210},
doi = {10.1145/3564246.3585210},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HatamiHM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HatamiHTT23,
author = {Pooya Hatami and
William M. Hoza and
Avishay Tal and
Roei Tell},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Depth-d Threshold Circuits vs. Depth-(d+1) {AND-OR} Trees},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {895--904},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585216},
doi = {10.1145/3564246.3585216},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HatamiHTT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HeL23,
author = {Xiaoyu He and
Ray Li},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Approximating Binary Longest Common Subsequence in Almost-Linear Time},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1145--1158},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585104},
doi = {10.1145/3564246.3585104},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HeL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Hirahara23,
author = {Shuichi Hirahara},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Capturing One-Way Functions via NP-Hardness of Meta-Complexity},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1027--1038},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585130},
doi = {10.1145/3564246.3585130},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Hirahara23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HiraharaILNO23,
author = {Shuichi Hirahara and
Rahul Ilango and
Zhenjian Lu and
Mikito Nanashima and
Igor C. Oliveira},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Duality between One-Way Functions and Average-Case Symmetry of Information},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1039--1050},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585138},
doi = {10.1145/3564246.3585138},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HiraharaILNO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HiraharaS23,
author = {Shuichi Hirahara and
Nobutaka Shimizu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Hardness Self-Amplification: Simplified, Optimized, and Unified},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {70--83},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585189},
doi = {10.1145/3564246.3585189},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HiraharaS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Hopkins0MN23,
author = {Samuel B. Hopkins and
Gautam Kamath and
Mahbod Majid and
Shyam Narayanan},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Robustness Implies Privacy in Statistical Estimation},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {497--506},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585115},
doi = {10.1145/3564246.3585115},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Hopkins0MN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HuangIR23,
author = {Yizhi Huang and
Rahul Ilango and
Hanlin Ren},
editor = {Barna Saha and
Rocco A. Servedio},
title = {NP-Hardness of Approximating Meta-Complexity: {A} Cryptographic Approach},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1067--1075},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585154},
doi = {10.1145/3564246.3585154},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HuangIR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HuangLSW23,
author = {Zhiyi Huang and
Yaowei Long and
Thatchaphol Saranurak and
Benyu Wang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Tight Conditional Lower Bounds for Vertex Connectivity Problems},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1384--1395},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585223},
doi = {10.1145/3564246.3585223},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HuangLSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HuibertsL023,
author = {Sophie Huiberts and
Yin Tat Lee and
Xinzhi Zhang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1904--1917},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585124},
doi = {10.1145/3564246.3585124},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HuibertsL023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HurleyP23,
author = {Eoin Hurley and
Fran{\c{c}}ois Pirot},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Uniformly Random Colourings of Sparse Graphs},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1357--1370},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585242},
doi = {10.1145/3564246.3585242},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HurleyP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/IlangoLW23,
author = {Rahul Ilango and
Jiatu Li and
R. Ryan Williams},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Indistinguishability Obfuscation, Range Avoidance, and Bounded Arithmetic},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1076--1089},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585187},
doi = {10.1145/3564246.3585187},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/IlangoLW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JambulapatiLS23,
author = {Arun Jambulapati and
Yang P. Liu and
Aaron Sidford},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Chaining, Group Leverage Score Overestimates, and Fast Spectral Hypergraph
Sparsification},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {196--206},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585136},
doi = {10.1145/3564246.3585136},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JambulapatiLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JefferyZ23,
author = {Stacey Jeffery and
Sebastian Zur},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Multidimensional Quantum Walks},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1125--1130},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585158},
doi = {10.1145/3564246.3585158},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JefferyZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JeronimoW23,
author = {Fernando Granha Jeronimo and
Pei Wu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {The Power of Unentangled Quantum Proofs with Non-negative Amplitudes},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1629--1642},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585248},
doi = {10.1145/3564246.3585248},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JeronimoW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JiangM23,
author = {Yonggang Jiang and
Sagnik Mukhopadhyay},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Finding a Small Vertex Cut on Distributed Networks},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1791--1801},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585201},
doi = {10.1145/3564246.3585201},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JiangM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JinX23,
author = {Ce Jin and
Yinzhan Xu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Removing Additive Structure in 3SUM-Based Reductions},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {405--418},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585157},
doi = {10.1145/3564246.3585157},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JinX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JonesPRX23,
author = {Chris Jones and
Aaron Potechin and
Goutham Rajendran and
Jeff Xu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Sum-of-Squares Lower Bounds for Densest k-Subgraph},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {84--95},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585221},
doi = {10.1145/3564246.3585221},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JonesPRX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KalaiLV023,
author = {Yael Kalai and
Alex Lombardi and
Vinod Vaikuntanathan and
Lisa Yang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Quantum Advantage from Any Non-local Game},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1617--1628},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585164},
doi = {10.1145/3564246.3585164},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KalaiLV023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KalaiLVW23,
author = {Yael Kalai and
Alex Lombardi and
Vinod Vaikuntanathan and
Daniel Wichs},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Boosting Batch Arguments and {RAM} Delegation},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1545--1552},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585200},
doi = {10.1145/3564246.3585200},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KalaiLVW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KorhonenL23,
author = {Tuukka Korhonen and
Daniel Lokshtanov},
editor = {Barna Saha and
Rocco A. Servedio},
title = {An Improved Parameterized Algorithm for Treewidth},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {528--541},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585245},
doi = {10.1145/3564246.3585245},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KorhonenL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KretschmerQST23,
author = {William Kretschmer and
Luowen Qian and
Makrand Sinha and
Avishay Tal},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Quantum Cryptography in Algorithmica},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1589--1602},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585225},
doi = {10.1145/3564246.3585225},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KretschmerQST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Krishnaswamy0S23,
author = {Ravishankar Krishnaswamy and
Shi Li and
Varun Suriyanarayana},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Online Unrelated-Machine Load Balancing and Generalized Flow with
Recourse},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {775--788},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585222},
doi = {10.1145/3564246.3585222},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Krishnaswamy0S23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LauTW23,
author = {Lap Chi Lau and
Kam Chuen Tung and
Robert Wang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted
Eigenvalues},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1834--1847},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585139},
doi = {10.1145/3564246.3585139},
timestamp = {Tue, 20 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LauTW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeS23,
author = {Hung Le and
Shay Solomon},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Unified Framework for Light Spanners},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {295--308},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585185},
doi = {10.1145/3564246.3585185},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LeS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Lee23,
author = {James R. Lee},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Spectral Hypergraph Sparsification via Chaining},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {207--218},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585165},
doi = {10.1145/3564246.3585165},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Lee23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiO23,
author = {Jiatu Li and
Igor C. Oliveira},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1051--1057},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585144},
doi = {10.1145/3564246.3585144},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LieutierW23,
author = {Andr{\'{e}} Lieutier and
Mathijs Wintraecken},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1768--1776},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585113},
doi = {10.1145/3564246.3585113},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LieutierW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LinMW23,
author = {Wei{-}Kai Lin and
Ethan Mook and
Daniel Wichs},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Doubly Efficient Private Information Retrieval and Fully Homomorphic
{RAM} Computation from Ring {LWE}},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {595--608},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585175},
doi = {10.1145/3564246.3585175},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LinMW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiuNS023,
author = {Qinghua Liu and
Praneeth Netrapalli and
Csaba Szepesv{\'{a}}ri and
Chi Jin},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Optimistic {MLE:} {A} Generic Model-Based Algorithm for Partially
Observable Sequential Decision Making},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {363--376},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585161},
doi = {10.1145/3564246.3585161},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiuNS023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiuR023,
author = {Zhengyang Liu and
Zeyu Ren and
Zihe Wang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Improved Approximation Ratios of Fixed-Price Mechanisms in Bilateral
Trades},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {751--760},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585160},
doi = {10.1145/3564246.3585160},
timestamp = {Sun, 20 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiuR023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiuRZ23,
author = {Qipeng Liu and
Ran Raz and
Wei Zhan},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid
Memory},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1097--1110},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585129},
doi = {10.1145/3564246.3585129},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiuRZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Mao0XY23,
author = {Cheng Mao and
Yihong Wu and
Jiaming Xu and
Sophie H. Yu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Random Graph Matching at Otter's Threshold via Counting Chandeliers},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1345--1356},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585156},
doi = {10.1145/3564246.3585156},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Mao0XY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MerinoMN23,
author = {Arturo I. Merino and
Torsten M{\"{u}}tze and
Namrata},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Kneser Graphs Are Hamiltonian},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {963--970},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585137},
doi = {10.1145/3564246.3585137},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MerinoMN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MosselSS23,
author = {Elchanan Mossel and
Allan Sly and
Youngtak Sohn},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Exact Phase Transitions for Stochastic Block Models and Reconstruction
on Trees},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {96--102},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585155},
doi = {10.1145/3564246.3585155},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MosselSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NarayananR023,
author = {Hariharan Narayanan and
Amit Rajaraman and
Piyush Srivastava},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Sampling from Convex Sets with a Cold Start using Multiscale Decompositions},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {117--130},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585172},
doi = {10.1145/3564246.3585172},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NarayananR023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NatarajanZ23,
author = {Anand Natarajan and
Tina Zhang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Quantum Free Games},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1603--1616},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585208},
doi = {10.1145/3564246.3585208},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NatarajanZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NewtonRW23,
author = {Parker Newton and
Silas Richelson and
Chase Wilson},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A High Dimensional Goldreich-Levin Theorem},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1463--1474},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585224},
doi = {10.1145/3564246.3585224},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NewtonRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PatakT23,
author = {Pavel Pat{\'{a}}k and
Martin Tancer},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Shellability Is Hard Even for Balls},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1271--1284},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585152},
doi = {10.1145/3564246.3585152},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PatakT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PuttermanP23,
author = {Aaron (Louie) Putterman and
Edward Pyne},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Near-Optimal Derandomization of Medium-Width Branching Programs},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {23--34},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585108},
doi = {10.1145/3564246.3585108},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PuttermanP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Roditty23,
author = {Liam Roditty},
editor = {Barna Saha and
Rocco A. Servedio},
title = {New Algorithms for All Pairs Approximate Shortest Paths},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {309--320},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585197},
doi = {10.1145/3564246.3585197},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Roditty23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RozhonHMGZ23,
author = {V{\'{a}}clav Rozhon and
Bernhard Haeupler and
Anders Martinsson and
Christoph Grunau and
Goran Zuzic},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Parallel Breadth-First Search and Exact Shortest Paths and Stronger
Notions for Approximate Distances},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {321--334},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585235},
doi = {10.1145/3564246.3585235},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RozhonHMGZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RubinfeldV23,
author = {Ronitt Rubinfeld and
Arsen Vasilyan},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Testing Distributional Assumptions of Learning Algorithms},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1643--1656},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585117},
doi = {10.1145/3564246.3585117},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RubinfeldV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SolomonU23,
author = {Shay Solomon and
Amitai Uzrad},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Dynamic ((1+{\(\epsilon\)}) ln n)-Approximation Algorithms for Minimum
Set Cover and Dominating Set},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1187--1200},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585211},
doi = {10.1145/3564246.3585211},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SolomonU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Sun23,
author = {Xiaorui Sun},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Faster Isomorphism for {\unicode{119901}}-Groups of Class 2 and Exponent
{\unicode{119901}}},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {433--440},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585250},
doi = {10.1145/3564246.3585250},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Sun23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SwartworthW23,
author = {William Swartworth and
David P. Woodruff},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Optimal Eigenvalue Approximation via Sketching},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {145--155},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585102},
doi = {10.1145/3564246.3585102},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SwartworthW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TanZ23,
author = {Zihan Tan and
Tianyi Zhang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Almost-Optimal Sublinear Additive Spanners},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {281--294},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585125},
doi = {10.1145/3564246.3585125},
timestamp = {Fri, 25 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/TanZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Touitou23,
author = {Noam Touitou},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Improved and Deterministic Online Service with Deadlines or Delay},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {761--774},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585107},
doi = {10.1145/3564246.3585107},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Touitou23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TraubZ23,
author = {Vera Traub and
Rico Zenklusen},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A (1.5+{\(\epsilon\)})-Approximation Algorithm for Weighted Connectivity
Augmentation},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1820--1833},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585122},
doi = {10.1145/3564246.3585122},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/TraubZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Vadhan023,
author = {Salil P. Vadhan and
Wanrong Zhang},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Concurrent Composition Theorems for Differential Privacy},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {507--519},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585241},
doi = {10.1145/3564246.3585241},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Vadhan023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Vladu23,
author = {Adrian Vladu},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Interior Point Methods with a Gradient Oracle},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1876--1889},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585142},
doi = {10.1145/3564246.3585142},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Vladu23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Wein23,
author = {Alexander S. Wein},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1685--1698},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585232},
doi = {10.1145/3564246.3585232},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Wein23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Woodruff023,
author = {David P. Woodruff and
Taisuke Yasuda},
editor = {Barna Saha and
Rocco A. Servedio},
title = {New Subset Selection Algorithms for Low Rank Approximation: Offline
and Online},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1802--1813},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585100},
doi = {10.1145/3564246.3585100},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Woodruff023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Zamir23,
author = {Or Zamir},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Algorithmic Applications of Hypergraph and Partition Containers},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {985--998},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585163},
doi = {10.1145/3564246.3585163},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Zamir23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2023,
editor = {Barna Saha and
Rocco A. Servedio},
title = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246},
doi = {10.1145/3564246},
isbn = {978-1-4503-9913-5},
timestamp = {Mon, 22 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001AT22,
author = {Fabrizio Grandoni and
Afrouz Jabal Ameli and
Vera Traub},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Breaching the 2-approximation barrier for the forest augmentation
problem},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1598--1611},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520035},
doi = {10.1145/3519935.3520035},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001AT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001F22,
author = {Nikhil Bansal and
Ohad N. Feldheim},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {The power of two choices in graphical allocation},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {52--63},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519995},
doi = {10.1145/3519935.3519995},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001F22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001MW22,
author = {Fabrizio Grandoni and
Tobias M{\"{o}}mke and
Andreas Wiese},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {A {PTAS} for unsplittable flow on a path},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {289--302},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519959},
doi = {10.1145/3519935.3519959},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001MW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001OZ22,
author = {Yang Cai and
Argyris Oikonomou and
Mingfei Zhao},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Computing simple mechanisms: Lift-and-round over marginal reduced
forms},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {704--717},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520029},
doi = {10.1145/3519935.3520029},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001OZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001RS22,
author = {Nikhil Bansal and
Lars Rohwedder and
Ola Svensson},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Flow time scheduling and prefix Beck-Fiala},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {331--342},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520077},
doi = {10.1145/3519935.3520077},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0001RS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001RTT22,
author = {Shuchi Chawla and
Rojin Rezvan and
Yifeng Teng and
Christos Tzamos},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Pricing ordered items},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {722--735},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520065},
doi = {10.1145/3519935.3520065},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001RTT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0002KPW22,
author = {Eun Jung Kim and
Stefan Kratsch and
Marcin Pilipczuk and
Magnus Wahlstr{\"{o}}m},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Directed flow-augmentation},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {938--947},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520018},
doi = {10.1145/3519935.3520018},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0002KPW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0002PWV22,
author = {Peter Dixon and
Aduri Pavan and
Jason Vander Woude and
N. V. Vinodchandran},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Pseudodeterminism: promises and lowerbounds},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1552--1565},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520043},
doi = {10.1145/3519935.3520043},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0002PWV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0002SY22,
author = {Zhiyi Huang and
Xinkai Shu and
Shuyi Yan},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {The power of multiple choices in online stochastic matching},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {91--103},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520046},
doi = {10.1145/3519935.3520046},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0002SY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0003F22,
author = {Robert Andrews and
Michael A. Forbes},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Ideals, determinants, and straightening: proving and using lower bounds
for polynomial ideals},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {389--402},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520025},
doi = {10.1145/3519935.3520025},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0003F22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbbeLS22,
author = {Emmanuel Abbe and
Shuangping Li and
Allan Sly},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Binary perceptron: efficient algorithms can find solutions in a rare
well-connected cluster},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {860--873},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519975},
doi = {10.1145/3519935.3519975},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbbeLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudBKZ22,
author = {Amir Abboud and
Karl Bringmann and
Seri Khoury and
Or Zamir},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Hardness of approximation in p via short cycle removal: cycle detection,
distance oracles, and beyond},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1487--1500},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520066},
doi = {10.1145/3519935.3520066},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbboudBKZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AgarwalCRX22,
author = {Pankaj K. Agarwal and
Hsien{-}Chih Chang and
Sharath Raghvendra and
Allen Xiao},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Deterministic, near-linear \emph{{\(\epsilon\)}}-approximation algorithm
for geometric bipartite matching},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1052--1065},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519977},
doi = {10.1145/3519935.3519977},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AgarwalCRX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AggarwalKOOS22,
author = {Divesh Aggarwal and
Bhavana Kanukurthi and
Sai Lakshmi Bhavana Obbattu and
Maciej Obremski and
Sruthi Sekar},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Rate one-third non-malleable codes},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1364--1377},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519972},
doi = {10.1145/3519935.3519972},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AggarwalKOOS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AharonovI22,
author = {Dorit Aharonov and
Sandy Irani},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Hamiltonian complexity in the thermodynamic limit},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {750--763},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520067},
doi = {10.1145/3519935.3520067},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AharonovI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AllamigeonGV22,
author = {Xavier Allamigeon and
St{\'{e}}phane Gaubert and
Nicolas Vandame},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {No self-concordant barrier interior point method is strongly polynomial},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {515--528},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519997},
doi = {10.1145/3519935.3519997},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AllamigeonGV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AmirWSWK022,
author = {Daniel Amir and
Tegan Wilson and
Vishal Shrivastav and
Hakim Weatherspoon and
Robert Kleinberg and
Rachit Agarwal},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Optimal oblivious reconfigurable networks},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1339--1352},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520020},
doi = {10.1145/3519935.3520020},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AmirWSWK022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnagnostidesDFF22,
author = {Ioannis Anagnostides and
Constantinos Daskalakis and
Gabriele Farina and
Maxwell Fishelson and
Noah Golowich and
Tuomas Sandholm},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Near-optimal no-regret learning for correlated equilibria in multi-player
general-sum games},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {736--749},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520031},
doi = {10.1145/3519935.3520031},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AnagnostidesDFF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnariJKPV22,
author = {Nima Anari and
Vishesh Jain and
Frederic Koehler and
Huy Tuan Pham and
Thuy{-}Duong Vuong},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Entropic independence: optimal mixing of down-up random walks},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1418--1430},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520048},
doi = {10.1145/3519935.3520048},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AnariJKPV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnshuAG22,
author = {Anurag Anshu and
Itai Arad and
David Gosset},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {An area law for 2d frustration-free spin systems},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {12--18},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519962},
doi = {10.1145/3519935.3519962},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AnshuAG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnshuLL22,
author = {Anurag Anshu and
Zeph Landau and
Yunchao Liu},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Distributed Quantum inner product estimation},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {44--51},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519974},
doi = {10.1145/3519935.3519974},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AnshuLL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArunachalamY22,
author = {Srinivasan Arunachalam and
Penghui Yao},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Positive spectrahedra: invariance principles and pseudorandom generators},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {208--221},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519965},
doi = {10.1145/3519935.3519965},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ArunachalamY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AsadiGGS22,
author = {Vahid R. Asadi and
Alexander Golovnev and
Tom Gur and
Igor Shinkar},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Worst-case to average-case reductions via additive combinatorics},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1566--1574},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520041},
doi = {10.1145/3519935.3520041},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AsadiGGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiCS22,
author = {Sepehr Assadi and
Andrew Chen and
Glenn Sun},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Deterministic graph coloring in the streaming model},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {261--274},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520016},
doi = {10.1145/3519935.3520016},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AssadiCS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiKM22,
author = {Sepehr Assadi and
Pankaj Kumar and
Parth Mittal},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Brooks' theorem in graph streams: a single-pass semi-streaming algorithm
for {\unicode{8710}}-coloring},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {234--247},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520005},
doi = {10.1145/3519935.3520005},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AssadiKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BafnaHKL22,
author = {Mitali Bafna and
Max Hopkins and
Tali Kaufman and
Shachar Lovett},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Hypercontractivity on high dimensional expanders},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {185--194},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520040},
doi = {10.1145/3519935.3520040},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BafnaHKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BakshiCW22,
author = {Ainesh Bakshi and
Kenneth L. Clarkson and
David P. Woodruff},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Low-rank approximation with \emph{1/{\(\epsilon\)}\({}^{\mbox{1/3}}\)}
matrix-vector products},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1130--1143},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519988},
doi = {10.1145/3519935.3519988},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BakshiCW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BakshiDJKKV22,
author = {Ainesh Bakshi and
Ilias Diakonikolas and
He Jia and
Daniel M. Kane and
Pravesh K. Kothari and
Santosh S. Vempala},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Robustly learning mixtures of \emph{k} arbitrary Gaussians},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1234--1247},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519953},
doi = {10.1145/3519935.3519953},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BakshiDJKKV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Balliu0KO22,
author = {Alkida Balliu and
Sebastian Brandt and
Fabian Kuhn and
Dennis Olivetti},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Distributed {\unicode{8710}}-coloring plays hide-and-seek},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {464--477},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520027},
doi = {10.1145/3519935.3520027},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Balliu0KO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeimelKMNSS22,
author = {Amos Beimel and
Haim Kaplan and
Yishay Mansour and
Kobbi Nissim and
Thatchaphol Saranurak and
Uri Stemmer},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Dynamic algorithms against an adaptive adversary: generic constructions
and lower bounds},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1671--1684},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520064},
doi = {10.1145/3519935.3520064},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BeimelKMNSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BenderFKKL22,
author = {Michael A. Bender and
Martin Farach{-}Colton and
John Kuszmaul and
William Kuszmaul and
Mingmou Liu},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {On the optimal time/space tradeoff for hash tables},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1284--1297},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519969},
doi = {10.1145/3519935.3519969},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BenderFKKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BerceaE22,
author = {Ioana Oriana Bercea and
Guy Even},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {An extendable data structure for incremental stable perfect hashing},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1298--1310},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520070},
doi = {10.1145/3519935.3520070},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BerceaE22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhangaleKM22,
author = {Amey Bhangale and
Subhash Khot and
Dor Minzer},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {On approximability of satisfiable \emph{k}-CSPs: {I}},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {976--988},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520028},
doi = {10.1145/3519935.3520028},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BhangaleKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhargavaG0M22,
author = {Vishwas Bhargava and
Sumanta Ghosh and
Mrinal Kumar and
Chandra Kanta Mohapatra},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Fast, algebraic multivariate multipoint evaluation in small characteristic
and applications},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {403--415},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519968},
doi = {10.1145/3519935.3519968},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BhargavaG0M22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BjorklundHK22,
author = {Andreas Bj{\"{o}}rklund and
Thore Husfeldt and
Petteri Kaski},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {The shortest even cycle problem is tractable},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {117--130},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520030},
doi = {10.1145/3519935.3520030},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BjorklundHK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlancKLT22,
author = {Guy Blanc and
Caleb Koch and
Jane Lange and
Li{-}Yang Tan},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {The query complexity of certification},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {623--636},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519993},
doi = {10.1145/3519935.3519993},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BlancKLT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BonnetGMSTT22,
author = {{\'{E}}douard Bonnet and
Ugo Giocanti and
Patrice Ossona de Mendez and
Pierre Simon and
St{\'{e}}phan Thomass{\'{e}} and
Szymon Torunczyk},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Twin-width {IV:} ordered graphs and matrices},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {924--937},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520037},
doi = {10.1145/3519935.3520037},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BonnetGMSTT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrakerskiY22,
author = {Zvika Brakerski and
Henry Yuen},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Quantum garbled circuits},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {804--817},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520073},
doi = {10.1145/3519935.3520073},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrakerskiY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrandGJLLPS22,
author = {Jan van den Brand and
Yu Gao and
Arun Jambulapati and
Yin Tat Lee and
Yang P. Liu and
Richard Peng and
Aaron Sidford},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Faster maxflow via improved dynamic spectral vertex sparsifiers},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {543--556},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520068},
doi = {10.1145/3519935.3520068},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrandGJLLPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Braverman0M22,
author = {Vladimir Braverman and
Aditya Krishnan and
Christopher Musco},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Sublinear time spectral density estimation},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1144--1157},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520009},
doi = {10.1145/3519935.3520009},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Braverman0M22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannCFN22,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer and
Vasileios Nakos},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Almost-optimal sublinear-time edit distance in the low distance regime},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1102--1115},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519990},
doi = {10.1145/3519935.3519990},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BringmannCFN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BulatovK22,
author = {Andrei A. Bulatov and
Amirhossein Kazeminia},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Complexity classification of counting graph homomorphisms modulo a
prime number},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1024--1037},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520075},
doi = {10.1145/3519935.3520075},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BulatovK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BulatovR22,
author = {Andrei A. Bulatov and
Akbar Rafiey},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {On the complexity of CSP-based ideal membership problems},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {436--449},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520063},
doi = {10.1145/3519935.3520063},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BulatovR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CarlsonDKP22,
author = {Charlie Carlson and
Ewan Davies and
Alexandra Kolla and
Will Perkins},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Computational thresholds for the fixed-magnetization Ising model},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1459--1472},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520003},
doi = {10.1145/3519935.3520003},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CarlsonDKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CenLP22,
author = {Ruoxu Cen and
Jason Li and
Debmalya Panigrahi},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Edge connectivity augmentation in near-linear time},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {137--150},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520038},
doi = {10.1145/3519935.3520038},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CenLP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChanWX22,
author = {Timothy M. Chan and
Virginia Vassilevska Williams and
Yinzhan Xu},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Hardness for triangle problems under even more believable hypotheses:
reductions from real APSP, real 3SUM, and {OV}},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1501--1514},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520032},
doi = {10.1145/3519935.3520032},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChanWX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChangKT22,
author = {Hsien{-}Chih Chang and
Robert Krauthgamer and
Zihan Tan},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Almost-linear \emph{{\(\epsilon\)}}-emulators for planar graphs},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1311--1324},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519998},
doi = {10.1145/3519935.3519998},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChangKT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChaseFMMS22,
author = {Gilad Chase and
Yuval Filmus and
Dor Minzer and
Elchanan Mossel and
Nitin Saurabh},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Approximate polymorphisms},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {195--202},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519966},
doi = {10.1145/3519935.3519966},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChaseFMMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChattopadhyayL22,
author = {Eshan Chattopadhyay and
Jyun{-}Jie Liao},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Extractors for sum of two sources},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1584--1597},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519963},
doi = {10.1145/3519935.3519963},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenJLW22,
author = {Xi Chen and
Rajesh Jayaram and
Amit Levi and
Erik Waingarten},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {New streaming algorithms for high dimensional {EMD} and {MST}},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {222--233},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519979},
doi = {10.1145/3519935.3519979},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenJLW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenKMY22,
author = {Sitan Chen and
Frederic Koehler and
Ankur Moitra and
Morris Yau},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Kalman filtering with adversarial corruptions},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {832--845},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520050},
doi = {10.1145/3519935.3520050},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenKMY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenP22,
author = {Xi Chen and
Binghui Peng},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {On the complexity of dynamic submodular maximization},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1685--1698},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519951},
doi = {10.1145/3519935.3519951},
timestamp = {Thu, 13 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CherapanamjeriN22,
author = {Yeshwanth Cherapanamjeri and
Jelani Nelson},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Uniform approximations for Randomized Hadamard Transforms with applications},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {659--671},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519961},
doi = {10.1145/3519935.3519961},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CherapanamjeriN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChiDX022,
author = {Shucheng Chi and
Ran Duan and
Tianle Xie and
Tianyi Zhang},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Faster min-plus product for monotone instances},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1529--1542},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520057},
doi = {10.1145/3519935.3520057},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChiDX022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChouGSVV22,
author = {Chi{-}Ning Chou and
Alexander Golovnev and
Madhu Sudan and
Ameya Velingker and
Santhoshini Velusamy},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Linear space streaming lower bounds for approximating CSPs},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {275--288},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519983},
doi = {10.1145/3519935.3519983},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChouGSVV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyT22,
author = {Julia Chuzhoy and
Zihan Tan},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {A subpolynomial approximation algorithm for graph crossing number
in low-degree graphs},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {303--316},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519984},
doi = {10.1145/3519935.3519984},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cohen-Addad22,
author = {Vincent Cohen{-}Addad},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Bypassing the surface embedding: approximation schemes for network
design in minor-free graphs},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {343--356},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520049},
doi = {10.1145/3519935.3520049},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Cohen-Addad22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cohen-AddadEMN22,
author = {Vincent Cohen{-}Addad and
Hossein Esfandiari and
Vahab S. Mirrokni and
Shyam Narayanan},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Improved approximations for Euclidean \emph{k}-means and \emph{k}-median,
via nested quasi-independent sets},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1621--1628},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520011},
doi = {10.1145/3519935.3520011},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Cohen-AddadEMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cohen-AddadLSS22,
author = {Vincent Cohen{-}Addad and
Kasper Green Larsen and
David Saulpic and
Chris Schwiegelshohn},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Towards optimal lower bounds for k-median and k-means coresets},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1038--1051},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519946},
doi = {10.1145/3519935.3519946},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Cohen-AddadLSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ColadangeloGV22,
author = {Andrea Coladangelo and
Shafi Goldwasser and
Umesh V. Vazirani},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Deniable encryption in a Quantum world},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1378--1391},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520019},
doi = {10.1145/3519935.3520019},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ColadangeloGV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CornelissenHJ22,
author = {Arjan Cornelissen and
Yassine Hamoudi and
Sofi{\`{e}}ne Jerbi},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Near-optimal Quantum algorithms for multivariate mean estimation},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {33--43},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520045},
doi = {10.1145/3519935.3520045},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CornelissenHJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CoyC22,
author = {Sam Coy and
Artur Czumaj},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Deterministic massively parallel connectivity},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {162--175},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520055},
doi = {10.1145/3519935.3520055},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CoyC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DadushJR22,
author = {Daniel Dadush and
Haotian Jiang and
Victor Reis},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {A new framework for matrix discrepancy: partial coloring bounds via
mirror descent},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {649--658},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519967},
doi = {10.1145/3519935.3519967},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DadushJR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DaskalakisG22,
author = {Constantinos Daskalakis and
Noah Golowich},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Fast rates for nonparametric online learning: from realizability to
learning in games},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {846--859},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519950},
doi = {10.1145/3519935.3519950},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DaskalakisG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DeligkasFHM22,
author = {Argyrios Deligkas and
John Fearnley and
Alexandros Hollender and
Themistoklis Melissourgos},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Constant inapproximability for {PPA}},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1010--1023},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520079},
doi = {10.1145/3519935.3520079},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DeligkasFHM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DengMSW22,
author = {Yuan Deng and
Jieming Mao and
Balasubramanian Sivan and
Kangning Wang},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Approximately efficient bilateral trade},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {718--721},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520054},
doi = {10.1145/3519935.3520054},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DengMSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DiakonikolasKK022,
author = {Ilias Diakonikolas and
Daniel M. Kane and
Daniel Kongsgaard and
Jerry Li and
Kevin Tian},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Clustering mixture models in almost-linear time via list-decodable
mean estimation},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1262--1275},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520014},
doi = {10.1145/3519935.3520014},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DiakonikolasKK022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DiakonikolasKKT22,
author = {Ilias Diakonikolas and
Daniel M. Kane and
Vasilis Kontonis and
Christos Tzamos and
Nikos Zarifis},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Learning general halfspaces with general Massart noise under the Gaussian
distribution},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {874--885},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519970},
doi = {10.1145/3519935.3519970},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DiakonikolasKKT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DinurELLM22,
author = {Irit Dinur and
Shai Evra and
Ron Livne and
Alexander Lubotzky and
Shahar Mozes},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Locally testable codes with constant rate, distance, and locality},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {357--374},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520024},
doi = {10.1145/3519935.3520024},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DinurELLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DobzinskiRV22,
author = {Shahar Dobzinski and
Shiri Ron and
Jan Vondr{\'{a}}k},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {On the hardness of dominant strategy mechanism design},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {690--703},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520013},
doi = {10.1145/3519935.3520013},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DobzinskiRV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DuanR22,
author = {Ran Duan and
Hanlin Ren},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Maintaining exact distances under multiple edge failures},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1093--1101},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520002},
doi = {10.1145/3519935.3520002},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DuanR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EfremenkoHKKKRS22,
author = {Klim Efremenko and
Bernhard Haeupler and
Yael Tauman Kalai and
Pritish Kamath and
Gillat Kol and
Nicolas Resch and
Raghuvansh R. Saxena},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Circuits resilient to short-circuit errors},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {582--594},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520007},
doi = {10.1145/3519935.3520007},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EfremenkoHKKKRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EnglertMV22,
author = {Matthias Englert and
Nicolaos Matsakis and
Pavel Vesel{\'{y}}},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Improved approximation guarantees for shortest superstrings using
cycle classification by overlap to length ratios},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {317--330},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520001},
doi = {10.1145/3519935.3520001},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EnglertMV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EskenazisI22,
author = {Alexandros Eskenazis and
Paata Ivanisvili},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Learning low-degree functions from a logarithmic number of random
queries},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {203--207},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519981},
doi = {10.1145/3519935.3519981},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EskenazisI22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FanL022,
author = {Zhiyuan Fan and
Jiatu Li and
Tianqi Yang},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {The exact complexity of pseudorandom functions and the black-box natural
proof barrier for bootstrapping results in computational complexity},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {962--975},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520010},
doi = {10.1145/3519935.3520010},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FanL022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FiltserL22,
author = {Arnold Filtser and
Hung Le},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Locality-sensitive orderings and applications to reliable spanners},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1066--1079},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520042},
doi = {10.1145/3519935.3520042},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FiltserL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FischerMU22,
author = {Manuela Fischer and
Slobodan Mitrovic and
Jara Uitto},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Deterministic (1+\emph{{\(\epsilon\)}})-approximate maximum matching
with poly(1/\emph{{\(\epsilon\)}}) passes in the semi-streaming model
and beyond},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {248--260},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520039},
doi = {10.1145/3519935.3520039},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FischerMU22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FockeR22,
author = {Jacob Focke and
Marc Roth},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Counting small induced subgraphs with hereditary properties},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1543--1551},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520008},
doi = {10.1145/3519935.3520008},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FockeR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FominK22,
author = {Fedor V. Fomin and
Tuukka Korhonen},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Fast FPT-approximation of branchwidth},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {886--899},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519996},
doi = {10.1145/3519935.3519996},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FominK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GharibianG22,
author = {Sevag Gharibian and
Fran{\c{c}}ois Le Gall},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Dequantizing the Quantum singular value transformation: hardness and
applications to Quantum chemistry and the Quantum {PCP} conjecture},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {19--32},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519991},
doi = {10.1145/3519935.3519991},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GharibianG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GheissariS22,
author = {Reza Gheissari and
Alistair Sinclair},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Low-temperature Ising dynamics with random initializations},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1445--1458},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519964},
doi = {10.1145/3519935.3519964},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GheissariS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Giakkoupis22,
author = {George Giakkoupis},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Expanders via local edge flips in quasilinear time},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {64--76},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520022},
doi = {10.1145/3519935.3520022},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Giakkoupis22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GirishHMRZ22,
author = {Uma Girish and
Justin Holmgren and
Kunal Mittal and
Ran Raz and
Wei Zhan},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Parallel repetition for all 3-player games over binary alphabet},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {998--1009},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520071},
doi = {10.1145/3519935.3520071},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GirishHMRZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuptaKZ22,
author = {Meghal Gupta and
Yael Tauman Kalai and
Rachel Yun Zhang},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Interactive error correcting codes over binary erasure channels resilient
to {\textgreater} {\textonehalf} adversarial corruption},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {609--622},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519980},
doi = {10.1145/3519935.3519980},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuptaKZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuptaZ22,
author = {Meghal Gupta and
Rachel Yun Zhang},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {The optimal error resilience of interactive communication over binary
channels},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {948--961},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519985},
doi = {10.1145/3519935.3519985},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuptaZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GurLL22,
author = {Tom Gur and
Noam Lifshitz and
Siqi Liu},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Hypercontractivity on high dimensional expanders},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {176--184},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520004},
doi = {10.1145/3519935.3520004},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GurLL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiKM22,
author = {Venkatesan Guruswami and
Pravesh K. Kothari and
Peter Manohar},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Algorithms and certificates for Boolean {CSP} refutation: smoothed
is no harder than random},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {678--689},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519955},
doi = {10.1145/3519935.3519955},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiKM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HaeuplerR022,
author = {Bernhard Haeupler and
Harald R{\"{a}}cke and
Mohsen Ghaffari},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Hop-constrained expander decompositions, oblivious routing, and distributed
universal optimality},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1325--1338},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520026},
doi = {10.1145/3519935.3520026},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HaeuplerR022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HaitnerMST22,
author = {Iftach Haitner and
Noam Mazor and
Jad Silbak and
Eliad Tsfadia},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {On the complexity of two-party differential privacy},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1392--1405},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519982},
doi = {10.1145/3519935.3519982},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HaitnerMST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HajiaghayiKO22,
author = {Mohammad Taghi Hajiaghayi and
Dariusz R. Kowalski and
Jan Olkowski},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Improved communication complexity of fault-tolerant consensus},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {488--501},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520078},
doi = {10.1145/3519935.3520078},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HajiaghayiKO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HalldorssonKNT22,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Fabian Kuhn and
Alexandre Nolin and
Tigran Tonoyan},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Near-optimal distributed degree+1 coloring},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {450--463},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520023},
doi = {10.1145/3519935.3520023},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HalldorssonKNT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HarmsWZ22,
author = {Nathaniel Harms and
Sebastian Wild and
Viktor Zamaraev},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Randomized communication and implicit graph representations},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1220--1233},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519978},
doi = {10.1145/3519935.3519978},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HarmsWZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HastingsO22,
author = {Matthew B. Hastings and
Ryan O'Donnell},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Optimizing strongly interacting fermionic Hamiltonians},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {776--789},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519960},
doi = {10.1145/3519935.3519960},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HastingsO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/He022,
author = {Zhiyang He and
Jason Li},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Breaking the \emph{n\({}^{\mbox{k}}\)} barrier for minimum \emph{k}-cut
on simple graphs},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {131--136},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519948},
doi = {10.1145/3519935.3519948},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/He022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HermanR22,
author = {Tal Herman and
Guy N. Rothblum},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Verifying the unseen: interactive proofs for label-invariant distribution
properties},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1208--1219},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519987},
doi = {10.1145/3519935.3519987},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HermanR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Hieronymi022,
author = {Philipp Hieronymi and
Christian Schulz},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {A strong version of Cobham's theorem},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1172--1179},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519958},
doi = {10.1145/3519935.3519958},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Hieronymi022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Hopkins0M22,
author = {Samuel B. Hopkins and
Gautam Kamath and
Mahbod Majid},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Efficient mean estimation with pure differential privacy via a sum-of-squares
exponential mechanism},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1406--1417},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519947},
doi = {10.1145/3519935.3519947},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Hopkins0M22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HopkinsRS22,
author = {Samuel B. Hopkins and
Prasad Raghavendra and
Abhishek Shetty},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Matrix discrepancy from Quantum communication},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {637--648},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519954},
doi = {10.1145/3519935.3519954},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HopkinsRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HuangPZ22,
author = {Shang{-}En Huang and
Seth Pettie and
Leqi Zhu},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Byzantine agreement in polynomial time with near-optimal resilience},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {502--514},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520015},
doi = {10.1145/3519935.3520015},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HuangPZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/IlangoRS22,
author = {Rahul Ilango and
Hanlin Ren and
Rahul Santhanam},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Robustness of average-case meta-complexity via pseudorandomness},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1575--1583},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520051},
doi = {10.1145/3519935.3520051},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/IlangoRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ImpagliazzoLPS22,
author = {Russell Impagliazzo and
Rex Lei and
Toniann Pitassi and
Jessica Sorrell},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Reproducibility in learning},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {818--831},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519973},
doi = {10.1145/3519935.3519973},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ImpagliazzoLPS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/IvkovK22,
author = {Misha Ivkov and
Pravesh K. Kothari},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {List-decodable covariance estimation},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1276--1283},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520006},
doi = {10.1145/3519935.3520006},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/IvkovK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JainPSS22,
author = {Vishesh Jain and
Will Perkins and
Ashwin Sah and
Mehtaab Sawhney},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Approximate counting and sampling via local central limit theorems},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1473--1486},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519957},
doi = {10.1145/3519935.3519957},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JainPSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JambulapatiLS22,
author = {Arun Jambulapati and
Yang P. Liu and
Aaron Sidford},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Improved iteration complexities for overconstrained \emph{p}-norm
regression},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {529--542},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519971},
doi = {10.1145/3519935.3519971},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JambulapatiLS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Jansen022,
author = {Bart M. P. Jansen and
Michal Wlodarczyk},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Lossy planarization: a constant-factor approximate kernelization for
planar vertex deletion},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {900--913},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520021},
doi = {10.1145/3519935.3520021},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Jansen022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JinX22,
author = {Ce Jin and
Yinzhan Xu},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Tight dynamic problem lower bounds from generalized {BMM} and OMv},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1515--1528},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520036},
doi = {10.1145/3519935.3520036},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JinX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KamberK22,
author = {Amitay Kamber and
Tali Kaufman},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Combinatorics via closed orbits: number theoretic Ramanujan graphs
are not unique neighbor expanders},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {426--435},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519992},
doi = {10.1145/3519935.3519992},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KamberK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Karczmarz0S22,
author = {Adam Karczmarz and
Anish Mukherjee and
Piotr Sankowski},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Subquadratic dynamic path reporting in directed graphs against an
adaptive adversary},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1643--1656},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520058},
doi = {10.1145/3519935.3520058},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Karczmarz0S22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KarlinKG022,
author = {Anna R. Karlin and
Nathan Klein and
Shayan Oveis Gharan and
Xinzhi Zhang},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {An improved approximation algorithm for the minimum \emph{k}-edge
connected multi-subgraph problem},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1612--1620},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520062},
doi = {10.1145/3519935.3520062},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KarlinKG022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KempaK22,
author = {Dominik Kempa and
Tomasz Kociumaka},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Dynamic suffix array with polylogarithmic queries and updates},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1657--1670},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520061},
doi = {10.1145/3519935.3520061},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KempaK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KulkarniLSST22,
author = {Janardhan Kulkarni and
Yang P. Liu and
Ashwin Sah and
Mehtaab Sawhney and
Jakub Tarnawski},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Online edge coloring via tree recurrences and correlation decay},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {104--116},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519986},
doi = {10.1145/3519935.3519986},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KulkarniLSST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeG22,
author = {Euiwoong Lee and
Suprovat Ghoshal},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {A characterization of approximability for biased CSPs},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {989--997},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520072},
doi = {10.1145/3519935.3520072},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LeeG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Li022,
author = {Jiatu Li and
Tianqi Yang},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {3.1\emph{n} - \emph{o}(\emph{n}) circuit lower bounds for explicit
functions},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1180--1193},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519976},
doi = {10.1145/3519935.3519976},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Li022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Liu022,
author = {Allen Liu and
Jerry Li},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Clustering mixtures with almost optimal separation in polynomial time},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1248--1261},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520012},
doi = {10.1145/3519935.3520012},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Liu022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiuMSY22,
author = {Siqi Liu and
Sidhanth Mohanty and
Tselil Schramm and
Elizabeth Yang},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Testing thresholds for high-dimensional sparse random geometric graphs},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {672--677},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519989},
doi = {10.1145/3519935.3519989},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiuMSY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiuY22,
author = {Hongyang Liu and
Yitong Yin},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Simple parallel algorithms for single-site dynamics},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1431--1444},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519999},
doi = {10.1145/3519935.3519999},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiuY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LokshtanovPP022,
author = {Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Fixed-parameter tractability of graph isomorphism in graphs with an
excluded minor},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {914--923},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520076},
doi = {10.1145/3519935.3520076},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LokshtanovPP022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MakarychevS22,
author = {Konstantin Makarychev and
Liren Shan},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Explainable \emph{k}-means: don't be greedy, plant bigger trees!},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1629--1642},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520056},
doi = {10.1145/3519935.3520056},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MakarychevS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MousaviNY22,
author = {Hamoon Mousavi and
Seyed Sajjad Nezhadi and
Henry Yuen},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Nonlocal games, compression theorems, and the arithmetical hierarchy},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1--11},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519949},
doi = {10.1145/3519935.3519949},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MousaviNY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Nie22,
author = {Zipei Nie},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Matrix anti-concentration inequalities with applications},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {568--581},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520060},
doi = {10.1145/3519935.3520060},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Nie22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PanteleevK22,
author = {Pavel Panteleev and
Gleb Kalachev},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Asymptotically good Quantum and locally testable classical {LDPC}
codes},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {375--388},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520017},
doi = {10.1145/3519935.3520017},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PanteleevK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Parter22,
author = {Merav Parter},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Nearly optimal vertex fault-tolerant spanners in optimal time: sequential,
distributed, and parallel},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1080--1092},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520047},
doi = {10.1145/3519935.3520047},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Parter22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PengS22,
author = {Richard Peng and
Zhuoqing Song},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Sparsified block elimination for directed laplacians},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {557--567},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520053},
doi = {10.1145/3519935.3520053},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PengS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PettieSY22,
author = {Seth Pettie and
Thatchaphol Saranurak and
Longhui Yin},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Optimal vertex connectivity oracles},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {151--161},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519945},
doi = {10.1145/3519935.3519945},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PettieSY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ron-ZewiR22,
author = {Noga Ron{-}Zewi and
Ron D. Rothblum},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Proving as fast as computing: succinct arguments with constant prover
overhead},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1353--1363},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519956},
doi = {10.1145/3519935.3519956},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ron-ZewiR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RozhonGHZL22,
author = {V{\'{a}}clav Rozhon and
Christoph Grunau and
Bernhard Haeupler and
Goran Zuzic and
Jason Li},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Undirected (1+\emph{{\(\epsilon\)}})-shortest paths via minor-aggregates:
near-optimal deterministic parallel and distributed algorithms},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {478--487},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520074},
doi = {10.1145/3519935.3520074},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RozhonGHZL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Sherstov22,
author = {Alexander A. Sherstov},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {The approximate degree of {DNF} and {CNF} formulas},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1194--1207},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520000},
doi = {10.1145/3519935.3520000},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Sherstov22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Shmueli22,
author = {Omri Shmueli},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Public-key Quantum money with a classical bank},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {790--803},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519952},
doi = {10.1145/3519935.3519952},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Shmueli22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SrinivasWXZ22,
author = {Vaidehi Srinivas and
David P. Woodruff and
Ziyu Xu and
Samson Zhou},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Memory bounds for the experts problem},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1158--1171},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520069},
doi = {10.1145/3519935.3520069},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SrinivasWXZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TangWW22,
author = {Zhihao Gavin Tang and
Jinzhao Wu and
Hongxun Wu},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {(Fractional) online stochastic matching via fine-grained offline statistics},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {77--90},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3519994},
doi = {10.1145/3519935.3519994},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/TangWW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TavenasL022,
author = {S{\'{e}}bastien Tavenas and
Nutan Limaye and
Srikanth Srinivasan},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Set-multilinear and non-commutative formula lower bounds for iterated
matrix multiplication},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {416--425},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520044},
doi = {10.1145/3519935.3520044},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/TavenasL022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TetekT22,
author = {Jakub Tetek and
Mikkel Thorup},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Edge sampling and graph parameter estimation via vertex neighborhood
accesses},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1116--1129},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520059},
doi = {10.1145/3519935.3520059},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/TetekT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/WatsonC22,
author = {James D. Watson and
Toby S. Cubitt},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Computational complexity of the ground state energy density problem},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {764--775},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520052},
doi = {10.1145/3519935.3520052},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/WatsonC22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/YaacovCY22,
author = {Inbar Ben Yaacov and
Gil Cohen and
Tal Yankovitz},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Explicit binary tree codes with sub-logarithmic size alphabet},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {595--608},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520033},
doi = {10.1145/3519935.3520033},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/YaacovCY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2022,
editor = {Stefano Leonardi and
Anupam Gupta},
title = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935},
doi = {10.1145/3519935},
isbn = {978-1-4503-9264-8},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/000121,
author = {Zachary Chase},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Separating words and trace reconstruction},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {21--31},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451118},
doi = {10.1145/3406325.3451118},
timestamp = {Tue, 22 Jun 2021 19:47:11 +0200},
biburl = {https://dblp.org/rec/conf/stoc/000121.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001GPV21,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Eric Price and
N. V. Vinodchandran},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Near-optimal learning of tree-structured distributions by Chow-Liu},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {147--160},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451066},
doi = {10.1145/3406325.3451066},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001GPV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001KPS0Y21,
author = {Lijie Chen and
Gillat Kol and
Dmitry Paramonov and
Raghuvansh R. Saxena and
Zhao Song and
Huacheng Yu},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Almost optimal super-constant-pass streaming lower bounds for reachability},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {570--583},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451038},
doi = {10.1145/3406325.3451038},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001KPS0Y21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001L21,
author = {Lijie Chen and
Xin Lyu},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Inverse-exponential correlation bounds and extremely rigid matrices
from a new derandomized {XOR} lemma},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {761--771},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451132},
doi = {10.1145/3406325.3451132},
timestamp = {Mon, 05 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001L21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001LN0SS21,
author = {Christopher Jung and
Katrina Ligett and
Seth Neel and
Aaron Roth and
Saeed Sharifi{-}Malvajerdi and
Moshe Shenfeld},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A new analysis of differential privacy's generalization guarantees
(invited paper)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {9},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465358},
doi = {10.1145/3406325.3465358},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001LN0SS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001T21,
author = {Lijie Chen and
Roei Tell},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Simple and fast derandomization from very hard functions: eliminating
randomness at almost no cost},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {283--291},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451059},
doi = {10.1145/3406325.3451059},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001T21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/000221,
author = {Marco Bressan},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Efficient and near-optimal algorithms for sampling connected subgraphs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1132--1143},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451042},
doi = {10.1145/3406325.3451042},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/000221.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/000221a,
author = {Krzysztof Nowicki},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A deterministic algorithm for the {MST} problem in constant rounds
of congested clique},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1154--1165},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451136},
doi = {10.1145/3406325.3451136},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/000221a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0002T21,
author = {Roy Schwartz and
Nitzan Tur},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {The metric relaxation for \emph{0}-extension admits an \emph{{\(\Omega\)}(log\({}^{\mbox{2/3}}\)k)}
gap},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1601--1614},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451071},
doi = {10.1145/3406325.3451071},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0002T21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AamandKT21,
author = {Anders Aamand and
Jakob B{\ae}k Tejs Knudsen and
Mikkel Thorup},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Load balancing with dynamic set of balls and bins},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1262--1275},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451107},
doi = {10.1145/3406325.3451107},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AamandKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AamariK21,
author = {Eddie Aamari and
Alexander Knop},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Statistical query complexity of manifold estimation},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {116--122},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451135},
doi = {10.1145/3406325.3451135},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AamariK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AaronsonBKRT21,
author = {Scott Aaronson and
Shalev Ben{-}David and
Robin Kothari and
Shravas Rao and
Avishay Tal},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Degree vs. approximate degree and Quantum implications of Huang's
sensitivity theorem},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1330--1342},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451047},
doi = {10.1145/3406325.3451047},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AaronsonBKRT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudKT21,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Subcubic algorithms for Gomory-Hu tree in unweighted graphs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1725--1737},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451073},
doi = {10.1145/3406325.3451073},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbboudKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Aho21,
author = {Alfred V. Aho},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Computational thinking in programming language and compiler design
(keynote)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465350},
doi = {10.1145/3406325.3465350},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Aho21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlimohammadiASV21,
author = {Yeganeh Alimohammadi and
Nima Anari and
Kirankumar Shiragur and
Thuy{-}Duong Vuong},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Fractionally log-concave and sector-stable polynomials: counting planar
matchings and more},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {433--446},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451123},
doi = {10.1145/3406325.3451123},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlimohammadiASV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Alman21,
author = {Josh Alman},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Kronecker products, low-depth circuits, and matrix rigidity},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {772--785},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451008},
doi = {10.1145/3406325.3451008},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Alman21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonBDMNY21,
author = {Noga Alon and
Omri Ben{-}Eliezer and
Yuval Dagan and
Shay Moran and
Moni Naor and
Eylon Yogev},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Adversarial laws of large numbers and optimal regret in online classification},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {447--455},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451041},
doi = {10.1145/3406325.3451041},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlonBDMNY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonGHM21,
author = {Noga Alon and
Alon Gonen and
Elad Hazan and
Shay Moran},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Boosting simple learners},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {481--489},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451030},
doi = {10.1145/3406325.3451030},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlonGHM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlweissLS21,
author = {Ryan Alweiss and
Yang P. Liu and
Mehtaab Sawhney},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Discrepancy minimization via a self-balancing walk},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {14--20},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3450994},
doi = {10.1145/3406325.3450994},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlweissLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnariLGVV21,
author = {Nima Anari and
Kuikui Liu and
Shayan Oveis Gharan and
Cynthia Vinzant and
Thuy{-}Duong Vuong},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Log-concave polynomials {IV:} approximate exchange, tight mixing times,
and near-optimal sampling of forests},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {408--420},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451091},
doi = {10.1145/3406325.3451091},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AnariLGVV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnariV21,
author = {Nima Anari and
Cynthia Vinzant},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Log-concave polynomials in theory and applications (tutorial)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {12},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465351},
doi = {10.1145/3406325.3465351},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AnariV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArenasCJR21,
author = {Marcelo Arenas and
Luis Alberto Croquevielle and
Rajesh Jayaram and
Cristian Riveros},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A polynomial-time approximation algorithm for counting words accepted
by an {NFA} (invited paper)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {4},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465353},
doi = {10.1145/3406325.3465353},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ArenasCJR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArenasCJR21a,
author = {Marcelo Arenas and
Luis Alberto Croquevielle and
Rajesh Jayaram and
Cristian Riveros},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {When is approximate counting for conjunctive queries tractable?},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1015--1027},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451014},
doi = {10.1145/3406325.3451014},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ArenasCJR21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ArgueGGT21,
author = {C. J. Argue and
Anupam Gupta and
Guru Guruganesh and
Ziye Tang},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Chasing convex bodies with linear competitive ratio (invited paper)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {5},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465354},
doi = {10.1145/3406325.3465354},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ArgueGGT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiN21,
author = {Sepehr Assadi and
Vishvajeet N},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Graph streaming lower bounds for parameter estimation and property
testing via a streaming {XOR} lemma},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {612--625},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451110},
doi = {10.1145/3406325.3451110},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AssadiN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AzarLT21,
author = {Yossi Azar and
Stefano Leonardi and
Noam Touitou},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Flow time scheduling with uncertain processing time},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1070--1080},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451023},
doi = {10.1145/3406325.3451023},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AzarLT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BabichenkoR21,
author = {Yakov Babichenko and
Aviad Rubinstein},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Settling the complexity of Nash equilibrium in congestion games},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1426--1437},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451039},
doi = {10.1145/3406325.3451039},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BabichenkoR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BadescuO21,
author = {Costin Badescu and
Ryan O'Donnell},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Improved Quantum data analysis},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1398--1411},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451109},
doi = {10.1145/3406325.3451109},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BadescuO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BafnaBKSS21,
author = {Mitali Bafna and
Boaz Barak and
Pravesh K. Kothari and
Tselil Schramm and
David Steurer},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Playing unique games on certified small-set expanders},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1629--1642},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451099},
doi = {10.1145/3406325.3451099},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BafnaBKSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BakshiP21,
author = {Ainesh Bakshi and
Adarsh Prasad},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Robust linear regression: optimal rates in polynomial time},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {102--115},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451001},
doi = {10.1145/3406325.3451001},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BakshiP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BalcanDDKSV21,
author = {Maria{-}Florina Balcan and
Dan F. DeBlasio and
Travis Dick and
Carl Kingsford and
Tuomas Sandholm and
Ellen Vitercik},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {How much data is sufficient to learn high-performing algorithms? generalization
guarantees for data-driven algorithm design},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {919--932},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451036},
doi = {10.1145/3406325.3451036},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BalcanDDKSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BansalS21,
author = {Nikhil Bansal and
Makrand Sinha},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {k-forrelation optimally separates Quantum and classical query complexity},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1303--1316},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451040},
doi = {10.1145/3406325.3451040},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BansalS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BartalG21,
author = {Yair Bartal and
Lee{-}Ad Gottlieb},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Near-linear time approximation schemes for Steiner tree and forest
in low-dimensional spaces},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1028--1041},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451063},
doi = {10.1145/3406325.3451063},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BartalG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ben-DavidHMSY21,
author = {Shai Ben{-}David and
Pavel Hrubes and
Shay Moran and
Amir Shpilka and
Amir Yehudayoff},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Learnability can be independent of set theory (invited paper)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {11},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465360},
doi = {10.1145/3406325.3465360},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Ben-DavidHMSY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeniaminiN21,
author = {Gal Beniamini and
Noam Nisan},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Bipartite perfect matching as a real polynomial},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1118--1131},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451002},
doi = {10.1145/3406325.3451002},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeniaminiN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BernsteinDL21,
author = {Aaron Bernstein and
Aditi Dudeja and
Zachary Langley},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A framework for dynamic matching in weighted graphs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {668--681},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451113},
doi = {10.1145/3406325.3451113},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BernsteinDL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhandariH0S21,
author = {Siddharth Bhandari and
Prahladh Harsha and
Mrinal Kumar and
Madhu Sudan},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Decoding multivariate multiplicity codes on product sets},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1489--1501},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451027},
doi = {10.1145/3406325.3451027},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BhandariH0S21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhangaleK21,
author = {Amey Bhangale and
Subhash Khot},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Optimal inapproximability of satisfiable k-LIN over non-abelian groups},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1615--1628},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451003},
doi = {10.1145/3406325.3451003},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BhangaleK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhargavaSV21,
author = {Vishwas Bhargava and
Shubhangi Saraf and
Ilya Volkovich},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Reconstruction algorithms for low-rank tensors and depth-3 multilinear
circuits},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {809--822},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451096},
doi = {10.1145/3406325.3451096},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BhargavaSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhattiproluLN21,
author = {Vijay Bhattiprolu and
Euiwoong Lee and
Assaf Naor},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A framework for quadratic form maximization over convex sets through
nonconvex relaxations},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {870--881},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451128},
doi = {10.1145/3406325.3451128},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BhattiproluLN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlaisPH21,
author = {Eric Blais and
Renato Ferreira Pinto Jr. and
Nathaniel Harms},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {{VC} dimension and distribution-free sample-based testing},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {504--517},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451104},
doi = {10.1145/3406325.3451104},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BlaisPH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlancaCPSV21,
author = {Antonio Blanca and
Pietro Caputo and
Daniel Parisi and
Alistair Sinclair and
Eric Vigoda},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Entropy decay in the Swendsen-Wang dynamics on {\(\mathbb{Z}\)}\({}^{\mbox{\emph{d}}}\)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1551--1564},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451095},
doi = {10.1145/3406325.3451095},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BlancaCPSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlikstadBMN21,
author = {Joakim Blikstad and
Jan van den Brand and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Breaking the quadratic barrier for matroid intersection},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {421--432},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451092},
doi = {10.1145/3406325.3451092},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BlikstadBMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BonamyEGS21,
author = {Marthe Bonamy and
Louis Esperet and
Carla Groenland and
Alex D. Scott},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Optimal labelling schemes for adjacency, comparability, and reachability},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1109--1117},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451102},
doi = {10.1145/3406325.3451102},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BonamyEGS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BousquetHMHY21,
author = {Olivier Bousquet and
Steve Hanneke and
Shay Moran and
Ramon van Handel and
Amir Yehudayoff},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A theory of universal learning},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {532--541},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451087},
doi = {10.1145/3406325.3451087},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BousquetHMHY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrandLLSS0W21,
author = {Jan van den Brand and
Yin Tat Lee and
Yang P. Liu and
Thatchaphol Saranurak and
Aaron Sidford and
Zhao Song and
Di Wang},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Minimum cost flows, MDPs, and {\(\mathscr{l}\)}\({}_{\mbox{1}}\)-regression
in nearly linear time for dense instances},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {859--869},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451108},
doi = {10.1145/3406325.3451108},
timestamp = {Fri, 19 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrandLLSS0W21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BravermanM21,
author = {Mark Braverman and
Dor Minzer},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {New separations results for external information},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {248--258},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451044},
doi = {10.1145/3406325.3451044},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BravermanM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannFN21,
author = {Karl Bringmann and
Nick Fischer and
Vasileios Nakos},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Sparse nonnegative convolution is equivalent to dense nonnegative
convolution},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1711--1724},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451090},
doi = {10.1145/3406325.3451090},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BringmannFN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrownBFST21,
author = {Gavin Brown and
Mark Bun and
Vitaly Feldman and
Adam D. Smith and
Kunal Talwar},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {When is memorization of irrelevant training data necessary for high-accuracy
learning?},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {123--132},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451131},
doi = {10.1145/3406325.3451131},
timestamp = {Tue, 25 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrownBFST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bruna0ST21,
author = {Joan Bruna and
Oded Regev and
Min Jae Song and
Yi Tang},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Continuous {LWE}},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {694--707},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451000},
doi = {10.1145/3406325.3451000},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bruna0ST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CecchettoTZ21,
author = {Federica Cecchetto and
Vera Traub and
Rico Zenklusen},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Bridging the gap between tree and connectivity augmentation: unified
and stronger approaches},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {370--383},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451086},
doi = {10.1145/3406325.3451086},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CecchettoTZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChattopadhyayDM21,
author = {Arkadev Chattopadhyay and
Rajit Datta and
Partha Mukhopadhyay},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Lower bounds for monotone arithmetic circuits via communication complexity},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {786--799},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451069},
doi = {10.1145/3406325.3451069},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayDM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenLV21,
author = {Zongchen Chen and
Kuikui Liu and
Eric Vigoda},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Optimal mixing of Glauber dynamics: entropy factorization via high-dimensional
expansion},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1537--1550},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451035},
doi = {10.1145/3406325.3451035},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenLV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenM21,
author = {Sitan Chen and
Ankur Moitra},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Algorithmic foundations for the diffraction limit},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {490--503},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451078},
doi = {10.1145/3406325.3451078},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CheuU21,
author = {Albert Cheu and
Jonathan R. Ullman},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {The limits of pan privacy and shuffle privacy for learning and estimation},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1081--1094},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3450995},
doi = {10.1145/3406325.3450995},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CheuU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Chuzhoy21,
author = {Julia Chuzhoy},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Decremental all-pairs shortest paths in deterministic near-linear
time},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {626--639},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451025},
doi = {10.1145/3406325.3451025},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Chuzhoy21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cohen-AddadGK021,
author = {Vincent Cohen{-}Addad and
Anupam Gupta and
Philip N. Klein and
Jason Li},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A quasipolynomial {(2} + \emph{{\(\epsilon\)}})-approximation for
planar sparsest cut},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1056--1069},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451103},
doi = {10.1145/3406325.3451103},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Cohen-AddadGK021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cohen-AddadSS21,
author = {Vincent Cohen{-}Addad and
David Saulpic and
Chris Schwiegelshohn},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A new coreset framework for clustering},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {169--182},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451022},
doi = {10.1145/3406325.3451022},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Cohen-AddadSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenM21,
author = {Alex Cohen and
Guy Moshkovitz},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Structure vs. randomness for bilinear maps},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {800--808},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451007},
doi = {10.1145/3406325.3451007},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CohenM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenPT21,
author = {Gil Cohen and
Noam Peri and
Amnon Ta{-}Shma},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Expander random walks: a Fourier-analytic approach},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1643--1655},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451049},
doi = {10.1145/3406325.3451049},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CohenPT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Curticapean21,
author = {Radu Curticapean},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A full complexity dichotomy for immanant families},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1770--1783},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451124},
doi = {10.1145/3406325.3451124},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Curticapean21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DaganDDK21,
author = {Yuval Dagan and
Constantinos Daskalakis and
Nishanth Dikkala and
Anthimos Vardis Kandiros},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Learning Ising models from one or multiple samples},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {161--168},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451074},
doi = {10.1145/3406325.3451074},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DaganDDK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DalirrooyfardW21,
author = {Mina Dalirrooyfard and
Nicole Wein},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Tight conditional lower bounds for approximating diameter in directed
graphs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1697--1710},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451130},
doi = {10.1145/3406325.3451130},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DalirrooyfardW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DaskalakisP21,
author = {Constantinos Daskalakis and
Qinxuan Pan},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Sample-optimal and efficient learning of tree Ising models},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {133--146},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451006},
doi = {10.1145/3406325.3451006},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DaskalakisP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DaskalakisSZ21,
author = {Constantinos Daskalakis and
Stratis Skoulakis and
Manolis Zampetakis},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {The complexity of constrained min-max optimization},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1466--1478},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451125},
doi = {10.1145/3406325.3451125},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DaskalakisSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DeMN21,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Robust testing of low dimensional functions},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {584--597},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451115},
doi = {10.1145/3406325.3451115},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DeMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DershowitzOR21,
author = {Nachum Dershowitz and
Rotem Oshman and
Tal Roth},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {The communication complexity of multiparty set disjointness under
product distributions},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1194--1207},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451106},
doi = {10.1145/3406325.3451106},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DershowitzOR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DiakonikolasGKP21,
author = {Ilias Diakonikolas and
Themis Gouleakis and
Daniel M. Kane and
John Peebles and
Eric Price},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Optimal testing of discrete distributions with high probability},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {542--555},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3450997},
doi = {10.1145/3406325.3450997},
timestamp = {Fri, 22 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DiakonikolasGKP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DiakonikolasKKT21,
author = {Ilias Diakonikolas and
Daniel M. Kane and
Vasilis Kontonis and
Christos Tzamos and
Nikos Zarifis},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Efficiently learning halfspaces with Tsybakov noise},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {88--101},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3450998},
doi = {10.1145/3406325.3450998},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DiakonikolasKKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DobzinskiR21,
author = {Shahar Dobzinski and
Shiri Ron},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {The communication complexity of payment computation},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {933--946},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451083},
doi = {10.1145/3406325.3451083},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DobzinskiR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DongLY21,
author = {Sally Dong and
Yin Tat Lee and
Guanghao Ye},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A nearly-linear time algorithm for linear programs with small treewidth:
a multiscale representation of robust central path},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1784--1797},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451056},
doi = {10.1145/3406325.3451056},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DongLY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DoryEMN21,
author = {Michal Dory and
Yuval Efron and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Distributed weighted min-cut in nearly-optimal time},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1144--1153},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451020},
doi = {10.1145/3406325.3451020},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DoryEMN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DuttingFLLR21,
author = {Paul D{\"{u}}tting and
Federico Fusco and
Philip Lazos and
Stefano Leonardi and
Rebecca Reiffenh{\"{a}}user},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Efficient two-sided markets with limited information},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1452--1465},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451076},
doi = {10.1145/3406325.3451076},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DuttingFLLR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DworkKRRY21,
author = {Cynthia Dwork and
Michael P. Kim and
Omer Reingold and
Guy N. Rothblum and
Gal Yona},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Outcome indistinguishability},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1095--1108},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451064},
doi = {10.1145/3406325.3451064},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DworkKRRY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EfremenkoKS21,
author = {Klim Efremenko and
Gillat Kol and
Raghuvansh R. Saxena},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Optimal error resilience of adaptive message exchange},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1235--1247},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451077},
doi = {10.1145/3406325.3451077},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/EfremenkoKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FearnleyGHS21,
author = {John Fearnley and
Paul W. Goldberg and
Alexandros Hollender and
Rahul Savani},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {The complexity of gradient descent: {CLS} = {PPAD} {\(\cap\)} {PLS}},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {46--59},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451052},
doi = {10.1145/3406325.3451052},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FearnleyGHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeffermanR21,
author = {Bill Fefferman and
Zachary Remscrim},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Eliminating intermediate measurements in space-bounded Quantum computation},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1343--1356},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451051},
doi = {10.1145/3406325.3451051},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FeffermanR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feng0Y21,
author = {Weiming Feng and
Kun He and
Yitong Yin},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Sampling constraint satisfaction solutions in the local lemma regime},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1565--1578},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451101},
doi = {10.1145/3406325.3451101},
timestamp = {Wed, 24 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Feng0Y21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FengHL21,
author = {Yiding Feng and
Jason D. Hartline and
Yingkai Li},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Revelation gap for pricing from samples},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1438--1451},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451057},
doi = {10.1145/3406325.3451057},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FengHL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FiltserL21,
author = {Arnold Filtser and
Hung Le},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Clan embeddings into trees, and low treewidth graphs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {342--355},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451043},
doi = {10.1145/3406325.3451043},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FiltserL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GargHV21,
author = {Jugal Garg and
Edin Husic and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Approximating Nash social welfare under rado valuations},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1412--1425},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451031},
doi = {10.1145/3406325.3451031},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GargHV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GartlandLPPR21,
author = {Peter Gartland and
Daniel Lokshtanov and
Marcin Pilipczuk and
Michal Pilipczuk and
Pawel Rzazewski},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Finding large induced sparse subgraphs in \emph{c\({}_{\mbox{{\textgreater}t}}\)}
-free graphs in quasipolynomial time},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {330--341},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451034},
doi = {10.1145/3406325.3451034},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GartlandLPPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GawrychowskiJ21,
author = {Pawel Gawrychowski and
Wojciech Janczewski},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Fully dynamic approximation of {LIS} in polylogarithmic time},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {654--667},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451137},
doi = {10.1145/3406325.3451137},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GawrychowskiJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GayP21,
author = {Romain Gay and
Rafael Pass},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Indistinguishability obfuscation from circular security},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {736--749},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451070},
doi = {10.1145/3406325.3451070},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GayP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GhaffariHZ21,
author = {Mohsen Ghaffari and
Bernhard Haeupler and
Goran Zuzic},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Hop-constrained oblivious routing},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1208--1220},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451098},
doi = {10.1145/3406325.3451098},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GhaffariHZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GhaziG0M21,
author = {Badih Ghazi and
Noah Golowich and
Ravi Kumar and
Pasin Manurangsi},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Sample-efficient proper {PAC} learning with approximate differential
privacy},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {183--196},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451028},
doi = {10.1145/3406325.3451028},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GhaziG0M21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GhoshalS21,
author = {Suprovat Ghoshal and
Rishi Saket},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Hardness of learning DNFs using halfspaces},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {467--480},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451067},
doi = {10.1145/3406325.3451067},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GhoshalS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GiakkoupisGW21,
author = {George Giakkoupis and
Mehrdad Jafari Giv and
Philipp Woelfel},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Efficient randomized {DCAS}},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1221--1234},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451133},
doi = {10.1145/3406325.3451133},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GiakkoupisGW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GilyenHV21,
author = {Andr{\'{a}}s Gily{\'{e}}n and
Matthew B. Hastings and
Umesh V. Vazirani},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {(Sub)Exponential advantage of adiabatic Quantum computation with no
sign problem},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1357--1369},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451060},
doi = {10.1145/3406325.3451060},
timestamp = {Sun, 29 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GilyenHV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GrosofSH21,
author = {Isaac Grosof and
Ziv Scully and
Mor Harchol{-}Balter},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Load balancing guardrails: keeping your heavy traffic on the road
to low response times (invited paper)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {10},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465359},
doi = {10.1145/3406325.3465359},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GrosofSH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuoR21,
author = {Zeyu Guo and
Noga Ron{-}Zewi},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Efficient list-decoding with constant alphabet and list sizes},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1502--1515},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451046},
doi = {10.1145/3406325.3451046},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuoR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GurvitsL21,
author = {Leonid Gurvits and
Jonathan Leake},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Capacity lower bounds via productization},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {847--858},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451105},
doi = {10.1145/3406325.3451105},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GurvitsL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HaeuplerHZ21,
author = {Bernhard Haeupler and
D. Ellis Hershkowitz and
Goran Zuzic},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Tree embeddings for hop-constrained network design},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {356--369},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451053},
doi = {10.1145/3406325.3451053},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HaeuplerHZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HaeuplerWZ21,
author = {Bernhard Haeupler and
David Wajc and
Goran Zuzic},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Universally-optimal distributed algorithms for known topologies},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1166--1179},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451081},
doi = {10.1145/3406325.3451081},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HaeuplerWZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HalldorssonKMT21,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Fabian Kuhn and
Yannic Maus and
Tigran Tonoyan},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Efficient randomized distributed coloring in {CONGEST}},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1180--1193},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451089},
doi = {10.1145/3406325.3451089},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HalldorssonKMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HastingsHO21,
author = {Matthew B. Hastings and
Jeongwan Haah and
Ryan O'Donnell},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Fiber bundle codes: breaking the \emph{n}\({}^{\mbox{1/2}}\) polylog(\emph{n})
barrier for Quantum {LDPC} codes},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1276--1288},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451005},
doi = {10.1145/3406325.3451005},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HastingsHO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HazlaSS21,
author = {Jan Hazla and
Alex Samorodnitsky and
Ori Sberlo},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {On codes decoding a constant fraction of errors on the {BSC}},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1479--1488},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451015},
doi = {10.1145/3406325.3451015},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HazlaSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Hirahara21,
author = {Shuichi Hirahara},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Average-case hardness of {NP} from exponential worst-case hardness
assumptions},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {292--302},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451065},
doi = {10.1145/3406325.3451065},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Hirahara21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HolmgrenLR21,
author = {Justin Holmgren and
Alex Lombardi and
Ron D. Rothblum},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Fiat-Shamir via list-recoverable codes (or: parallel repetition of
{GMW} is not zero-knowledge)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {750--760},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451116},
doi = {10.1145/3406325.3451116},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HolmgrenLR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HuangS21,
author = {Zhiyi Huang and
Xinkai Shu},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Online stochastic matching, poisson arrivals, and the natural linear
program},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {682--693},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451079},
doi = {10.1145/3406325.3451079},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HuangS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JacotGH21,
author = {Arthur Jacot and
Franck Gabriel and
Cl{\'{e}}ment Hongler},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Neural tangent kernel: convergence and generalization in neural networks
(invited paper)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {6},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465355},
doi = {10.1145/3406325.3465355},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JacotGH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JainLS21,
author = {Aayush Jain and
Huijia Lin and
Amit Sahai},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Indistinguishability obfuscation from well-founded assumptions},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {60--73},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451093},
doi = {10.1145/3406325.3451093},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JainLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JainSS21,
author = {Vishesh Jain and
Ashwin Sah and
Mehtaab Sawhney},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Perfectly sampling \emph{k} {\(\geq\)} {(8/3} + \emph{o}(1)){\(\Delta\)}-colorings
in graphs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1589--1600},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451012},
doi = {10.1145/3406325.3451012},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JainSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JansenK021,
author = {Bart M. P. Jansen and
Jari J. H. de Kroon and
Michal Wlodarczyk},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Vertex deletion parameterized by elimination distance and even less},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1757--1769},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451068},
doi = {10.1145/3406325.3451068},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JansenK021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JawaleKKZ21,
author = {Ruta Jawale and
Yael Tauman Kalai and
Dakshita Khurana and
Rachel Yun Zhang},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {SNARGs for bounded depth computations and {PPAD} hardness from sub-exponential
{LWE}},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {708--721},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451055},
doi = {10.1145/3406325.3451055},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JawaleKKZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JeronimoST21,
author = {Fernando Granha Jeronimo and
Shashank Srivastava and
Madhur Tulsiani},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Near-linear time decoding of Ta-Shma's codes via splittable regularity},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1527--1536},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451126},
doi = {10.1145/3406325.3451126},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JeronimoST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JiaLLV21,
author = {He Jia and
Aditi Laddha and
Yin Tat Lee and
Santosh S. Vempala},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Reducing isotropy and volume to {KLS:} an \emph{o}*(\emph{n}\({}^{\mbox{3}}\)\emph{{\(\psi\)}}\({}^{\mbox{2}}\))
volume algorithm},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {961--974},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451018},
doi = {10.1145/3406325.3451018},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JiaLLV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Jiang0WZ21,
author = {Shunhua Jiang and
Zhao Song and
Omri Weinstein and
Hengjie Zhang},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A faster algorithm for solving general LPs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {823--832},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451058},
doi = {10.1145/3406325.3451058},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Jiang0WZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KapralovKTY21,
author = {Michael Kapralov and
Robert Krauthgamer and
Jakab Tardos and
Yuichi Yoshida},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Towards tight bounds for spectral sparsification of hypergraphs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {598--611},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451061},
doi = {10.1145/3406325.3451061},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KapralovKTY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KarlinKG21,
author = {Anna R. Karlin and
Nathan Klein and
Shayan Oveis Gharan},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A (slightly) improved approximation algorithm for metric {TSP}},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {32--45},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451009},
doi = {10.1145/3406325.3451009},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KarlinKG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KaufmanT21,
author = {Tali Kaufman and
Ran J. Tessler},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {New cosystolic expanders from tensors imply explicit Quantum {LDPC}
codes with {\(\Omega\)}({\(\surd\)}\emph{n} log\({}^{\mbox{\emph{k}}}\)
\emph{n}) distance},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1317--1329},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451029},
doi = {10.1145/3406325.3451029},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KaufmanT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KellerK21,
author = {Nathan Keller and
Ohad Klein},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Local concentration inequalities and Tomaszewski's conjecture},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1656--1669},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451011},
doi = {10.1145/3406325.3451011},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KellerK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kelley21,
author = {Zander Kelley},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {An improved derandomization of the switching lemma},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {272--282},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451054},
doi = {10.1145/3406325.3451054},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Kelley21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KimTP21,
author = {Isaac H. Kim and
Eugene Tang and
John Preskill},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {The ghost in the radiation: robust encodings of the black hole interior
(invited paper)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {8},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465357},
doi = {10.1145/3406325.3465357},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KimTP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KleinbergM21,
author = {Jon M. Kleinberg and
Sendhil Mullainathan},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Simplicity creates inequity: implications for fairness, stereotypes,
and interpretability (invited paper)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {7},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465356},
doi = {10.1145/3406325.3465356},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KleinbergM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KnopLM021,
author = {Alexander Knop and
Shachar Lovett and
Sam McGuire and
Weiqiang Yuan},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Log-rank and lifting for AND-functions},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {197--208},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3450999},
doi = {10.1145/3406325.3450999},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KnopLM021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KociumakaS21,
author = {Tomasz Kociumaka and
Saeed Seddighin},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Improved dynamic algorithms for longest increasing subsequence},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {640--653},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451026},
doi = {10.1145/3406325.3451026},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KociumakaS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KrishnamurthyLP21,
author = {Akshay Krishnamurthy and
Thodoris Lykouris and
Chara Podimata and
Robert E. Schapire},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Contextual search in the presence of irrational agents},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {910--918},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451120},
doi = {10.1145/3406325.3451120},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KrishnamurthyLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kuszmaul21,
author = {William Kuszmaul},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {How asymmetry helps buffer management: achieving optimal tail size
in cup games},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1248--1261},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451033},
doi = {10.1145/3406325.3451033},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Kuszmaul21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeakeMV21,
author = {Jonathan Leake and
Colin S. McSwiggen and
Nisheeth K. Vishnoi},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Sampling matrices from Harish-Chandra-Itzykson-Zuber densities with
applications to Quantum inference and differential privacy},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1384--1397},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451094},
doi = {10.1145/3406325.3451094},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LeakeMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Levin21,
author = {Leonid A. Levin},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Climbing algorithms (invited talk)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {2--3},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3457137},
doi = {10.1145/3406325.3457137},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Levin21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Li21,
author = {Jason Li},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Deterministic mincut in almost-linear time},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {384--395},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451114},
doi = {10.1145/3406325.3451114},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Li21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Li21a,
author = {Ray Li},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Settling {SETH} vs. approximate sparse directed unweighted diameter
(up to {(NU)NSETH)}},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1684--1696},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451045},
doi = {10.1145/3406325.3451045},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Li21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiNPSY21,
author = {Jason Li and
Danupon Nanongkai and
Debmalya Panigrahi and
Thatchaphol Saranurak and
Sorrachai Yingchareonthawornchai},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Vertex connectivity in poly-logarithmic max-flows},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {317--329},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451088},
doi = {10.1145/3406325.3451088},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LiNPSY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiP21,
author = {Jason Li and
Debmalya Panigrahi},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Approximate Gomory-Hu tree is faster than \emph{n} - 1 max-flows},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1738--1748},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451112},
doi = {10.1145/3406325.3451112},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LiP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Lin21,
author = {Bingkai Lin},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Constant approximating k-clique is w[1]-hard},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1749--1756},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451016},
doi = {10.1145/3406325.3451016},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Lin21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiuM21,
author = {Allen Liu and
Ankur Moitra},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Settling the robust learnability of mixtures of Gaussians},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {518--531},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451084},
doi = {10.1145/3406325.3451084},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiuM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiuP21,
author = {Yanyi Liu and
Rafael Pass},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Cryptography from sublinear-time average-case hardness of time-bounded
Kolmogorov complexity},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {722--735},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451121},
doi = {10.1145/3406325.3451121},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiuP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LuOS21,
author = {Zhenjian Lu and
Igor C. Oliveira and
Rahul Santhanam},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Pseudodeterministic algorithms and the structure of probabilistic
time},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {303--316},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451085},
doi = {10.1145/3406325.3451085},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LuOS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MangoubiV21,
author = {Oren Mangoubi and
Nisheeth K. Vishnoi},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave
min-max optimization},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {896--909},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451097},
doi = {10.1145/3406325.3451097},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MangoubiV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/McKenzieRS21,
author = {Theo McKenzie and
Peter Michael Reichstein Rasmussen and
Nikhil Srivastava},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Support of closed walks and second eigenvalue multiplicity of graphs},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {396--407},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451129},
doi = {10.1145/3406325.3451129},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/McKenzieRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NederlofW21,
author = {Jesper Nederlof and
Karol Wegrzycki},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal
vectors},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1670--1683},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451024},
doi = {10.1145/3406325.3451024},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NederlofW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Nekrich21,
author = {Yakov Nekrich},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Dynamic planar point location in optimal time},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1003--1014},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451100},
doi = {10.1145/3406325.3451100},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Nekrich21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NiazadehLS21,
author = {Rad Niazadeh and
Renato Paes Leme and
Jon Schneider},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Combinatorial Bernoulli factories: matchings, flows, and other polytopes},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {833--846},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451072},
doi = {10.1145/3406325.3451072},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NiazadehLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PelegS21,
author = {Shir Peleg and
Amir Shpilka},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Polynomial time deterministic identity testing algorithm for {\(\Sigma\)}\({}^{\mbox{[3]}}\){\(\Pi\)}{\(\Sigma\)}{\(\Pi\)}\({}^{\mbox{[2]}}\)
circuits via Edelstein-Kelly type theorem for quadratic polynomials},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {259--271},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451013},
doi = {10.1145/3406325.3451013},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PelegS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PerkinsX21,
author = {Will Perkins and
Changji Xu},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Frozen 1-RSB structure of the symmetric Ising perceptron},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1579--1588},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451119},
doi = {10.1145/3406325.3451119},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PerkinsX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PettieW21,
author = {Seth Pettie and
Dingyu Wang},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Information theoretic limits of cardinality estimation: Fisher meets
Shannon},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {556--569},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451032},
doi = {10.1145/3406325.3451032},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PettieW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PichS21,
author = {J{\'{a}}n Pich and
Rahul Santhanam},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Strong co-nondeterministic lower bounds for {NP} cannot be proved
feasibly},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {223--233},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451117},
doi = {10.1145/3406325.3451117},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PichS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/QiaoV21,
author = {Mingda Qiao and
Gregory Valiant},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Stronger calibration lower bounds via sidestepping},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {456--466},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451050},
doi = {10.1145/3406325.3451050},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/QiaoV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RezendeGNPR021,
author = {Susanna F. de Rezende and
Mika G{\"{o}}{\"{o}}s and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere and
Dmitry Sokolov},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Automating algebraic proof systems is NP-hard},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {209--222},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451080},
doi = {10.1145/3406325.3451080},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RezendeGNPR021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RohwedderW21,
author = {Lars Rohwedder and
Andreas Wiese},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A {(2} + \emph{{\(\epsilon\)}})-approximation algorithm for preemptive
weighted flow time on a single machine},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1042--1055},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451075},
doi = {10.1145/3406325.3451075},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RohwedderW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RuanY021,
author = {Yufei Ruan and
Jiaqi Yang and
Yuan Zhou},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Linear bandits with limited adaptivity and learning distributional
optimal design},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {74--87},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451004},
doi = {10.1145/3406325.3451004},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RuanY021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Rubin21,
author = {Natan Rubin},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Stronger bounds for weak epsilon-nets in higher dimensions},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {989--1002},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451062},
doi = {10.1145/3406325.3451062},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Rubin21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RubinsteinSTWZ21,
author = {Aviad Rubinstein and
Raghuvansh R. Saxena and
Clayton Thomas and
S. Matthew Weinberg and
Junyao Zhao},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Exponential communication separations between notions of selfishness},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {947--960},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451127},
doi = {10.1145/3406325.3451127},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RubinsteinSTWZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RubinsteinZ21,
author = {Aviad Rubinstein and
Junyao Zhao},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {The randomized communication complexity of randomized auctions},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {882--895},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451111},
doi = {10.1145/3406325.3451111},
timestamp = {Fri, 05 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RubinsteinZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SanthanamT21,
author = {Rahul Santhanam and
Iddo Tzameret},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Iterated lower bound formulas: a diagonalization-based approach to
proof complexity},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {234--247},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451010},
doi = {10.1145/3406325.3451010},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SanthanamT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ShaltielS21,
author = {Ronen Shaltiel and
Jad Silbak},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Explicit uniquely decodable codes for space bounded channels that
achieve list-decoding capacity},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1516--1526},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451048},
doi = {10.1145/3406325.3451048},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ShaltielS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SherstovSW21,
author = {Alexander A. Sherstov and
Andrey A. Storozhenko and
Pei Wu},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {An optimal separation of randomized and Quantum query complexity},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1289--1302},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451019},
doi = {10.1145/3406325.3451019},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SherstovSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Sun21,
author = {Nike Sun},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Statistical physics of random CSPs (tutorial)},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {13},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3465352},
doi = {10.1145/3406325.3465352},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Sun21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Wang21,
author = {Haitao Wang},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {A new algorithm for Euclidean shortest paths in the plane},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {975--988},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451037},
doi = {10.1145/3406325.3451037},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Wang21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Zhang21,
author = {Jiayu Zhang},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Succinct blind Quantum computation using a random oracle},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {1370--1383},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451082},
doi = {10.1145/3406325.3451082},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Zhang21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2021,
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325},
doi = {10.1145/3406325},
isbn = {978-1-4503-8053-9},
timestamp = {Tue, 22 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/000120,
author = {Srikanth Srinivasan},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {A robust version of Hegedus's lemma, with applications},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1349--1362},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384328},
doi = {10.1145/3357713.3384328},
timestamp = {Mon, 18 Dec 2023 07:33:37 +0100},
biburl = {https://dblp.org/rec/conf/stoc/000120.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001DS20,
author = {Xue Chen and
Anindya De and
Rocco A. Servedio},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Testing noisy linear functions for sparsity},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {610--623},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384239},
doi = {10.1145/3357713.3384239},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001DS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001GS20,
author = {Bartlomiej Dudek and
Pawel Gawrychowski and
Tatiana Starikovskaya},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {All non-trivial variants of 3-LDT are equivalent},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {974--981},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384275},
doi = {10.1145/3357713.3384275},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001GS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001KK20,
author = {George Christodoulou and
Elias Koutsoupias and
Annam{\'{a}}ria Kov{\'{a}}cs},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {On the Nisan-Ronen conjecture for submodular valuations},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1086--1096},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384299},
doi = {10.1145/3357713.3384299},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001KK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001LL20,
author = {Rong Ge and
Holden Lee and
Jianfeng Lu},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Estimating normalizing constants for log-concave distributions: algorithms
and lower bounds},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {579--586},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384289},
doi = {10.1145/3357713.3384289},
timestamp = {Fri, 01 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0001LL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0002Z20,
author = {Zhiyi Huang and
Qiankun Zhang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Online primal dual meets online matching with stochastic rewards:
configuration {LP} to the rescue},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1153--1164},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384294},
doi = {10.1145/3357713.3384294},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0002Z20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/000520,
author = {Dmitry Sokolov},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {(Semi)Algebraic proofs over {\(\pm\)}1 variables},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {78--90},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384288},
doi = {10.1145/3357713.3384288},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/000520.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AamandKKRT20,
author = {Anders Aamand and
Jakob B{\ae}k Tejs Knudsen and
Mathias B{\ae}k Tejs Knudsen and
Peter Michael Reichstein Rasmussen and
Mikkel Thorup},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Fast hashing with strong concentration bounds},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1265--1278},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384259},
doi = {10.1145/3357713.3384259},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AamandKKRT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudCK20,
author = {Amir Abboud and
Vincent Cohen{-}Addad and
Philip N. Klein},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {New hardness results for planar graph problems in p and an algorithm
for sparsest cut},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {996--1009},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384310},
doi = {10.1145/3357713.3384310},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbboudCK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlekseevGHT20,
author = {Yaroslav Alekseev and
Dima Grigoriev and
Edward A. Hirsch and
Iddo Tzameret},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Semi-algebraic proofs, {IPS} lower bounds, and the {\(\tau\)}-conjecture:
can a natural number be negative?},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {54--67},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384245},
doi = {10.1145/3357713.3384245},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlekseevGHT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlevL20,
author = {Vedat Levi Alev and
Lap Chi Lau},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Improved analysis of higher order random walks and applications},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1198--1211},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384317},
doi = {10.1145/3357713.3384317},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlevL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlweissL0Z20,
author = {Ryan Alweiss and
Shachar Lovett and
Kewen Wu and
Jiapeng Zhang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Improved bounds for the sunflower lemma},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {624--630},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384234},
doi = {10.1145/3357713.3384234},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlweissL0Z20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AmbainisGJK20,
author = {Andris Ambainis and
Andr{\'{a}}s Gily{\'{e}}n and
Stacey Jeffery and
Martins Kokainis},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Quadratic speedup for finding marked vertices by quantum walks},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {412--424},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384252},
doi = {10.1145/3357713.3384252},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AmbainisGJK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Amos0KZ20,
author = {Ryan Amos and
Marios Georgiou and
Aggelos Kiayias and
Mark Zhandry},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {One-shot signatures and applications to hybrid quantum/classical authentication},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {255--268},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384304},
doi = {10.1145/3357713.3384304},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Amos0KZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AndoniSZ20,
author = {Alexandr Andoni and
Clifford Stein and
Peilin Zhong},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Parallel approximate undirected shortest paths via low hop emulators},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {322--335},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384321},
doi = {10.1145/3357713.3384321},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AndoniSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnshuAG20,
author = {Anurag Anshu and
Itai Arad and
David Gosset},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Entanglement subvolume law for 2d frustration-free spin systems},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {868--874},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384292},
doi = {10.1145/3357713.3384292},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AnshuAG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ApplebaumBNP20,
author = {Benny Applebaum and
Amos Beimel and
Oded Nir and
Naty Peter},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Better secret sharing via robust conditional disclosure of secrets},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {280--293},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384293},
doi = {10.1145/3357713.3384293},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ApplebaumBNP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiKSW20,
author = {Sepehr Assadi and
Hrishikesh Khandeparkar and
Raghuvansh R. Saxena and
S. Matthew Weinberg},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Separating the communication complexity of truthful and non-truthful
combinatorial auctions},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1073--1085},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384267},
doi = {10.1145/3357713.3384267},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AssadiKSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiW20,
author = {Sepehr Assadi and
Chen Wang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Exploration with limited memory: streaming algorithms for coin tossing,
noisy comparisons, and multi-armed bandits},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1237--1250},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384341},
doi = {10.1145/3357713.3384341},
timestamp = {Tue, 08 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AssadiW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BalkanskiS20,
author = {Eric Balkanski and
Yaron Singer},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {A lower bound for parallel submodular minimization},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {130--139},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384287},
doi = {10.1145/3357713.3384287},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BalkanskiS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BansalJ0S20,
author = {Nikhil Bansal and
Haotian Jiang and
Sahil Singla and
Makrand Sinha},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Online vector balancing and geometric discrepancy},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1139--1152},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384280},
doi = {10.1145/3357713.3384280},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BansalJ0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BehnezhadDH20,
author = {Soheil Behnezhad and
Mahsa Derakhshan and
MohammadTaghi Hajiaghayi},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Stochastic matching with few queries: (1-{\(\epsilon\)}) approximation},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1111--1124},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384340},
doi = {10.1145/3357713.3384340},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BehnezhadDH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BenderKKP20,
author = {Michael A. Bender and
Tsvi Kopelowitz and
William Kuszmaul and
Seth Pettie},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Contention resolution without collision detection},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {105--118},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384305},
doi = {10.1145/3357713.3384305},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BenderKKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BerenbrinkGK20,
author = {Petra Berenbrink and
George Giakkoupis and
Peter Kling},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Optimal time and space leader election in population protocols},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {119--129},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384312},
doi = {10.1145/3357713.3384312},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BerenbrinkGK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bhandari020,
author = {Siddharth Bhandari and
Sayantan Chakraborty},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Improved bounds for perfect sampling of k-colorings in graphs},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {631--642},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384244},
doi = {10.1145/3357713.3384244},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Bhandari020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BienkowskiBCJ20,
author = {Marcin Bienkowski and
Jaroslaw Byrka and
Christian Coester and
Lukasz Jez},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Unbounded lower bound for k-server against weak adversaries},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1165--1169},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384306},
doi = {10.1145/3357713.3384306},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BienkowskiBCJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BitanskyS20,
author = {Nir Bitansky and
Omri Shmueli},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Post-quantum zero knowledge in constant rounds},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {269--279},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384324},
doi = {10.1145/3357713.3384324},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BitanskyS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BorgsCHPT20,
author = {Christian Borgs and
Jennifer T. Chayes and
Tyler Helmuth and
Will Perkins and
Prasad Tetali},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Efficient sampling and counting algorithms for the Potts model on
{\(\mathbb{Z}\)}{\unicode{7496}} at all temperatures},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {738--751},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384271},
doi = {10.1145/3357713.3384271},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BorgsCHPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrakensiekR20,
author = {Joshua Brakensiek and
Aviad Rubinstein},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Constant-factor approximation of near-linear edit distance in near-linear
time},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {685--698},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384282},
doi = {10.1145/3357713.3384282},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrakensiekR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrandLSS20,
author = {Jan van den Brand and
Yin Tat Lee and
Aaron Sidford and
Zhao Song},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Solving tall dense linear programs in nearly linear time},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {775--788},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384309},
doi = {10.1145/3357713.3384309},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrandLSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannN20,
author = {Karl Bringmann and
Vasileios Nakos},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Top-k-convolution and the quest for near-linear output-sensitive subset
sum},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {982--995},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384308},
doi = {10.1145/3357713.3384308},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BringmannN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Byrka0A20,
author = {Jaroslaw Byrka and
Fabrizio Grandoni and
Afrouz Jabal Ameli},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Breaching the 2-approximation barrier for connectivity augmentation:
a reduction to Steiner tree},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {815--825},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384301},
doi = {10.1145/3357713.3384301},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Byrka0A20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CaoFR20,
author = {Nairen Cao and
Jeremy T. Fineman and
Katina Russell},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Efficient construction of directed hopsets and parallel approximate
shortest paths},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {336--349},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384270},
doi = {10.1145/3357713.3384270},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CaoFR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChanGKKP20,
author = {Timothy M. Chan and
Shay Golan and
Tomasz Kociumaka and
Tsvi Kopelowitz and
Ely Porat},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Approximating text-to-pattern Hamming distances},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {643--656},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384266},
doi = {10.1145/3357713.3384266},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChanGKKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChattopadhyayGG20,
author = {Eshan Chattopadhyay and
Jesse Goodman and
Vipul Goyal and
Xin Li},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Extractors for adversarial sources via extremal hypergraphs},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1184--1197},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384339},
doi = {10.1145/3357713.3384339},
timestamp = {Thu, 26 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayGG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChattopadhyayHH20,
author = {Eshan Chattopadhyay and
Pooya Hatami and
Kaave Hosseini and
Shachar Lovett and
David Zuckerman},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {{XOR} lemmas for resilient functions against polynomials},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {234--246},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384242},
doi = {10.1145/3357713.3384242},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayHH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChechikC20,
author = {Shiri Chechik and
Sarel Cohen},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Distance sensitivity oracles with subcubic preprocessing time and
fast query time},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1375--1388},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384253},
doi = {10.1145/3357713.3384253},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChechikC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChechikLRS20,
author = {Shiri Chechik and
Yang P. Liu and
Omer Rotem and
Aaron Sidford},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Constant girth approximation for directed graphs in subquadratic time},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1010--1023},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384330},
doi = {10.1145/3357713.3384330},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChechikLRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Chen0M20,
author = {Sitan Chen and
Jerry Li and
Ankur Moitra},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Efficiently learning structured distributions from untrusted batches},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {960--973},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384337},
doi = {10.1145/3357713.3384337},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Chen0M20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Chen0S20,
author = {Sitan Chen and
Jerry Li and
Zhao Song},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Learning mixtures of linear regressions in subexponential time via
Fourier moments},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {587--600},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384333},
doi = {10.1145/3357713.3384333},
timestamp = {Sat, 05 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Chen0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenGVYZ20,
author = {Xi Chen and
Chenghao Guo and
Emmanouil V. Vlatakis{-}Gkaragkounis and
Mihalis Yannakakis and
Xinzhi Zhang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Smoothed complexity of local max-cut and binary max-CSP},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1052--1065},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384325},
doi = {10.1145/3357713.3384325},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenGVYZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenJW20,
author = {Lijie Chen and
Ce Jin and
R. Ryan Williams},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Sharp threshold results for computational complexity},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1335--1348},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384283},
doi = {10.1145/3357713.3384283},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenJW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenR20,
author = {Lijie Chen and
Hanlin Ren},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Strong average-case lower bounds from non-trivial derandomization},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1327--1334},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384279},
doi = {10.1145/3357713.3384279},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CherapanamjeriH20,
author = {Yeshwanth Cherapanamjeri and
Samuel B. Hopkins and
Tarun Kathuria and
Prasad Raghavendra and
Nilesh Tripuraneni},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Algorithms for heavy-tailed statistics: regression, covariance estimation,
and beyond},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {601--609},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384329},
doi = {10.1145/3357713.3384329},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CherapanamjeriH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChiaCL20,
author = {Nai{-}Hui Chia and
Kai{-}Min Chung and
Ching{-}Yi Lai},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {On the need for large quantum depth},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {902--915},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384291},
doi = {10.1145/3357713.3384291},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChiaCL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChiaGLLTW20,
author = {Nai{-}Hui Chia and
Andr{\'{a}}s Gily{\'{e}}n and
Tongyang Li and
Han{-}Hsuan Lin and
Ewin Tang and
Chunhao Wang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Sampling-based sublinear low-rank matrix arithmetic framework for
dequantizing quantum machine learning},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {387--400},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384314},
doi = {10.1145/3357713.3384314},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChiaGLLTW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CookM20,
author = {James Cook and
Ian Mertz},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Catalytic approaches to the tree evaluation problem},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {752--760},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384316},
doi = {10.1145/3357713.3384316},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CookM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CoudronM20,
author = {Matthew Coudron and
Sanketh Menda},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Computations with greater quantum depth are strictly more powerful
(relative to an oracle)},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {889--901},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384269},
doi = {10.1145/3357713.3384269},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CoudronM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DadushHNV20,
author = {Daniel Dadush and
Sophie Huiberts and
Bento Natura and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {A scaling-invariant algorithm for linear programming whose running
time depends only on the constraint matrix},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {761--774},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384326},
doi = {10.1145/3357713.3384326},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DadushHNV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DaganF20,
author = {Yuval Dagan and
Vitaly Feldman},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Interaction is necessary for distributed learning with privacy or
communication constraints},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {450--462},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384315},
doi = {10.1145/3357713.3384315},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DaganF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EdmondsNU20,
author = {Alexander Edmonds and
Aleksandar Nikolov and
Jonathan R. Ullman},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {The power of factorization mechanisms in local and central differential
privacy},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {425--438},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384297},
doi = {10.1145/3357713.3384297},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EdmondsNU20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EfremenkoKS20,
author = {Klim Efremenko and
Gillat Kol and
Raghuvansh R. Saxena},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Interactive error resilience beyond 2/7},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {565--578},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384320},
doi = {10.1145/3357713.3384320},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/EfremenkoKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EldanG20,
author = {Ronen Eldan and
Renan Gross},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Concentration on the Boolean hypercube via pathwise stochastic analysis},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {208--221},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384230},
doi = {10.1145/3357713.3384230},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/EldanG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feldman20,
author = {Vitaly Feldman},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Does learning require memorization? a short tale about a long tail},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {954--959},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384290},
doi = {10.1145/3357713.3384290},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Feldman20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeldmanKT20,
author = {Vitaly Feldman and
Tomer Koren and
Kunal Talwar},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Private stochastic convex optimization: optimal rates in linear time},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {439--449},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384335},
doi = {10.1145/3357713.3384335},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FeldmanKT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeldmanNSZ20,
author = {Moran Feldman and
Ashkan Norouzi{-}Fard and
Ola Svensson and
Rico Zenklusen},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {The one-way communication complexity of submodular maximization with
applications to streaming and robustness},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1363--1374},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384286},
doi = {10.1145/3357713.3384286},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FeldmanNSZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Feng0Y020,
author = {Weiming Feng and
Heng Guo and
Yitong Yin and
Chihao Zhang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Fast sampling and counting k-SAT solutions in the local lemma regime},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {854--867},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384255},
doi = {10.1145/3357713.3384255},
timestamp = {Wed, 24 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Feng0Y020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FilmusLMM20,
author = {Yuval Filmus and
Noam Lifshitz and
Dor Minzer and
Elchanan Mossel},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {{AND} testing and robust judgement aggregation},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {222--233},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384254},
doi = {10.1145/3357713.3384254},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FilmusLMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FominLP0Z20,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Fahad Panolan and
Saket Saurabh and
Meirav Zehavi},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Hitting topological minors is {FPT}},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1317--1326},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384318},
doi = {10.1145/3357713.3384318},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FominLP0Z20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Gavinsky20,
author = {Dmitry Gavinsky},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Bare quantum simultaneity versus classical interactivity in communication
complexity},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {401--411},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384243},
doi = {10.1145/3357713.3384243},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Gavinsky20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoldenbergRS20,
author = {Elazar Goldenberg and
Aviad Rubinstein and
Barna Saha},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Does preprocessing help in fast sequence comparisons?},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {657--670},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384300},
doi = {10.1145/3357713.3384300},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GoldenbergRS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GolovnevGHPV20,
author = {Alexander Golovnev and
Siyao Guo and
Thibaut Horel and
Sunoo Park and
Vinod Vaikuntanathan},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Data structures meet cryptography: 3SUM with preprocessing},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {294--307},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384342},
doi = {10.1145/3357713.3384342},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GolovnevGHPV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoosKMP20,
author = {Mika G{\"{o}}{\"{o}}s and
Sajin Koroth and
Ian Mertz and
Toniann Pitassi},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Automating cutting planes is NP-hard},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {68--77},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384248},
doi = {10.1145/3357713.3384248},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GoosKMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GrierS20,
author = {Daniel Grier and
Luke Schaeffer},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Interactive shallow Clifford circuits: quantum advantage against NC{\({^1}\)}
and beyond},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {875--888},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384332},
doi = {10.1145/3357713.3384332},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GrierS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Gupta0P20,
author = {Anupam Gupta and
Amit Kumar and
Debmalya Panigrahi},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Caching with time windows},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1125--1138},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384277},
doi = {10.1145/3357713.3384277},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Gupta0P20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuptaLL20,
author = {Anupam Gupta and
Euiwoong Lee and
Jason Li},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {The Karger-Stein algorithm is optimal for k-cut},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {473--484},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384285},
doi = {10.1145/3357713.3384285},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuptaLL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiHS20,
author = {Venkatesan Guruswami and
Bernhard Haeupler and
Amirbehshad Shahrasbi},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Optimally resilient codes for list-decoding from insertions and deletions},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {524--537},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384262},
doi = {10.1145/3357713.3384262},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiHS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiRY20,
author = {Venkatesan Guruswami and
Andrii Riazanov and
Min Ye},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Arikan meets Shannon: polar codes with near-optimal convergence to
channel capacity},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {552--564},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384323},
doi = {10.1145/3357713.3384323},
timestamp = {Tue, 26 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiRY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GutenbergWW20,
author = {Maximilian Probst Gutenberg and
Virginia Vassilevska Williams and
Nicole Wein},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {New algorithms and hardness for incremental single-source shortest
paths in directed graphs},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {153--166},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384236},
doi = {10.1145/3357713.3384236},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GutenbergWW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HarrowMS20,
author = {Aram W. Harrow and
Saeed Mehraban and
Mehdi Soleimanifar},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Classical algorithms, correlation decay, and complex zeros of partition
functions of quantum many-body systems},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {378--386},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384322},
doi = {10.1145/3357713.3384322},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HarrowMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Hirahara20,
author = {Shuichi Hirahara},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Unexpected hardness results for Kolmogorov complexity under uniform
reductions},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1038--1051},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384251},
doi = {10.1145/3357713.3384251},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Hirahara20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HoldenK20,
author = {Dhiraj Holden and
Yael Tauman Kalai},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Non-signaling proofs with o({\(\surd\)} log n) provers are in {PSPACE}},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1024--1037},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384246},
doi = {10.1145/3357713.3384246},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HoldenK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HolmR20,
author = {Jacob Holm and
Eva Rotenberg},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Fully-dynamic planarity testing in polylogarithmic time},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {167--180},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384249},
doi = {10.1145/3357713.3384249},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HolmR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HuangV20,
author = {Lingxiao Huang and
Nisheeth K. Vishnoi},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Coresets for clustering in Euclidean spaces: importance sampling is
nearly optimal},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1416--1429},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384296},
doi = {10.1145/3357713.3384296},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HuangV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/IkenmeyerK20,
author = {Christian Ikenmeyer and
Umangathan Kandasamy},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Implementing geometric complexity theory: on the separation of orbit
closures via symmetries},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {713--726},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384257},
doi = {10.1145/3357713.3384257},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/IkenmeyerK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JambulapatiL0PT20,
author = {Arun Jambulapati and
Yin Tat Lee and
Jerry Li and
Swati Padmanabhan and
Kevin Tian},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Positive semidefinite programming: mixed, parallel, and width-independent},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {789--802},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384338},
doi = {10.1145/3357713.3384338},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JambulapatiL0PT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JiangLSW20,
author = {Haotian Jiang and
Yin Tat Lee and
Zhao Song and
Sam Chiu{-}wai Wong},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {An improved cutting plane method for convex optimization, convex-concave
games, and its applications},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {944--953},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384284},
doi = {10.1145/3357713.3384284},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/JiangLSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JiangMW20,
author = {Zhihao Jiang and
Kamesh Munagala and
Kangning Wang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Approximately stable committee selection},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {463--472},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384238},
doi = {10.1145/3357713.3384238},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JiangMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KallaugherP20,
author = {John Kallaugher and
Eric Price},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Separations and equivalences between turnstile streaming and linear
sketching},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1223--1236},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384278},
doi = {10.1145/3357713.3384278},
timestamp = {Fri, 22 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KallaugherP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Karger20,
author = {David R. Karger},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {A phase transition and a quadratic time unbiased estimator for network
reliability},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {485--495},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384336},
doi = {10.1145/3357713.3384336},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Karger20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KarlinKG20,
author = {Anna R. Karlin and
Nathan Klein and
Shayan Oveis Gharan},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {An improved approximation algorithm for {TSP} in the half integral
case},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {28--39},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384273},
doi = {10.1145/3357713.3384273},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KarlinKG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KouckyS20,
author = {Michal Kouck{\'{y}} and
Michael E. Saks},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Constant factor approximations to edit distance on far input pairs
in nearly linear time},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {699--712},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384307},
doi = {10.1145/3357713.3384307},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KouckyS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LackiMOS20,
author = {Jakub Lacki and
Slobodan Mitrovic and
Krzysztof Onak and
Piotr Sankowski},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Walking randomly, massively, and efficiently},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {364--377},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384303},
doi = {10.1145/3357713.3384303},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LackiMOS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LaddhaLV20,
author = {Aditi Laddha and
Yin Tat Lee and
Santosh S. Vempala},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Strong self-concordance and sampling},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1212--1222},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384272},
doi = {10.1145/3357713.3384272},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LaddhaLV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LaiLT20,
author = {Kai{-}Yuan Lai and
Hsueh{-}I Lu and
Mikkel Thorup},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Three-in-a-tree in near linear time},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1279--1292},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384235},
doi = {10.1145/3357713.3384235},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LaiLT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LauZ20,
author = {Lap Chi Lau and
Hong Zhou},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {A spectral approach to network design},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {826--839},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384313},
doi = {10.1145/3357713.3384313},
timestamp = {Mon, 18 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LauZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeakeV20,
author = {Jonathan Leake and
Nisheeth K. Vishnoi},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {On the computability of continuous maximum entropy distributions with
applications},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {930--943},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384302},
doi = {10.1145/3357713.3384302},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LeakeV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Li20,
author = {Jason Li},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Faster parallel algorithm for approximate shortest path},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {308--321},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384268},
doi = {10.1145/3357713.3384268},
timestamp = {Fri, 13 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Li20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiLV20,
author = {Wenzheng Li and
Paul Liu and
Jan Vondr{\'{a}}k},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {A polynomial lower bound on adaptive complexity of submodular maximization},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {140--152},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384311},
doi = {10.1145/3357713.3384311},
timestamp = {Tue, 19 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LiLV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiuS20,
author = {Yang P. Liu and
Aaron Sidford},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Faster energy maximization for faster maximum flow},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {803--814},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384247},
doi = {10.1145/3357713.3384247},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiuS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiuY20,
author = {Mingmou Liu and
Huacheng Yu},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Lower bound for succinct range minimum query},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1402--1415},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384260},
doi = {10.1145/3357713.3384260},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LiuY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LokshtanovMP0Z20,
author = {Daniel Lokshtanov and
Pranabendu Misra and
Michal Pilipczuk and
Saket Saurabh and
Meirav Zehavi},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {An exponential time parameterized algorithm for planar disjoint paths},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1307--1316},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384250},
doi = {10.1145/3357713.3384250},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LokshtanovMP0Z20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Lovett0Z20,
author = {Shachar Lovett and
Kewen Wu and
Jiapeng Zhang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Decision list compression by mild random restrictions},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {247--254},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384241},
doi = {10.1145/3357713.3384241},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Lovett0Z20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MahabadiRWZ20,
author = {Sepideh Mahabadi and
Ilya P. Razenshteyn and
David P. Woodruff and
Samson Zhou},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Non-adaptive adaptive sampling on turnstile streams},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1251--1264},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384331},
doi = {10.1145/3357713.3384331},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MahabadiRWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MeunierRW20,
author = {Pierre{-}{\'{E}}tienne Meunier and
Damien Regnault and
Damien Woods},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {The program-size complexity of self-assembled paths},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {727--737},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384263},
doi = {10.1145/3357713.3384263},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MeunierRW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Miller20,
author = {Carl A. Miller},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {The impossibility of efficient quantum weak coin flipping},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {916--929},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384276},
doi = {10.1145/3357713.3384276},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Miller20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MitzenmacherS20,
author = {Michael Mitzenmacher and
Saeed Seddighin},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Dynamic algorithms for {LIS} and distance to monotonicity},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {671--684},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384240},
doi = {10.1145/3357713.3384240},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MitzenmacherS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MohantyO020,
author = {Sidhanth Mohanty and
Ryan O'Donnell and
Pedro Paredes},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Explicit near-Ramanujan graphs of every degree},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {510--523},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384231},
doi = {10.1145/3357713.3384231},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MohantyO020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MohantyRX20,
author = {Sidhanth Mohanty and
Prasad Raghavendra and
Jeff Xu},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Lifting sum-of-squares lower bounds: degree-2 to degree-4},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {840--853},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384319},
doi = {10.1145/3357713.3384319},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MohantyRX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MukhopadhyayN20,
author = {Sagnik Mukhopadhyay and
Danupon Nanongkai},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Weighted min-cut: sequential, cut-query, and streaming algorithms},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {496--509},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384334},
doi = {10.1145/3357713.3384334},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MukhopadhyayN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Nederlof20,
author = {Jesper Nederlof},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Bipartite {TSP} in o(1.9999{\unicode{8319}}) time, assuming quadratic
time matrix multiplication},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {40--53},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384264},
doi = {10.1145/3357713.3384264},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Nederlof20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Nederlof20a,
author = {Jesper Nederlof},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Detecting and counting small patterns in planar graphs in subexponential
parameterized time},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1293--1306},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384261},
doi = {10.1145/3357713.3384261},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Nederlof20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ODonnellST20,
author = {Ryan O'Donnell and
Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Fooling Gaussian PTFs via local hyperconcentration},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1170--1183},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384281},
doi = {10.1145/3357713.3384281},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ODonnellST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RojasY20,
author = {Cristobal Rojas and
Michael Yampolsky},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {How to lose at Monte Carlo: a simple dynamical system whose typical
statistical behavior is non-computable},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1066--1072},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384237},
doi = {10.1145/3357713.3384237},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RojasY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RozhonG20,
author = {V{\'{a}}clav Rozhon and
Mohsen Ghaffari},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Polylogarithmic-time deterministic network decomposition and distributed
derandomization},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {350--363},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384298},
doi = {10.1145/3357713.3384298},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RozhonG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SawlaniW20,
author = {Saurabh Sawlani and
Junxing Wang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Near-optimal fully dynamic densest subgraph},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {181--193},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384327},
doi = {10.1145/3357713.3384327},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SawlaniW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ShangguanT20,
author = {Chong Shangguan and
Itzhak Tamo},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson
radius},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {538--551},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384295},
doi = {10.1145/3357713.3384295},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ShangguanT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TangW020,
author = {Zhihao Gavin Tang and
Xiaowei Wu and
Yuhao Zhang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Towards a better understanding of randomized greedy matching},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1097--1110},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384265},
doi = {10.1145/3357713.3384265},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/TangW020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TraubV20,
author = {Vera Traub and
Jens Vygen},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {An improved approximation algorithm for {ATSP}},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1--13},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384233},
doi = {10.1145/3357713.3384233},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/TraubV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/TraubVZ20,
author = {Vera Traub and
Jens Vygen and
Rico Zenklusen},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Reducing path {TSP} to {TSP}},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {14--27},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384256},
doi = {10.1145/3357713.3384256},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/TraubVZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Wajc20,
author = {David Wajc},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Rounding dynamic matchings against an adaptive adversary},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {194--207},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384258},
doi = {10.1145/3357713.3384258},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Wajc20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yu20,
author = {Huacheng Yu},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Nearly optimal static Las Vegas succinct dictionary},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1389--1401},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384274},
doi = {10.1145/3357713.3384274},
timestamp = {Tue, 09 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Yu20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ZhukM20,
author = {Dmitriy Zhuk and
Barnaby Martin},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {{QCSP} monsters and the demise of the chen conjecture},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {91--104},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384232},
doi = {10.1145/3357713.3384232},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ZhukM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2020,
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713},
doi = {10.1145/3357713},
isbn = {978-1-4503-6979-4},
timestamp = {Mon, 18 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001HLS19,
author = {Alireza Farhadi and
MohammadTaghi Hajiaghayi and
Kasper Green Larsen and
Elaine Shi},
editor = {Moses Charikar and
Edith Cohen},
title = {Lower bounds for external memory integer sorting via network coding},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {997--1008},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316337},
doi = {10.1145/3313276.3316337},
timestamp = {Sat, 22 Jun 2019 17:42:26 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001HLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001LL19,
author = {Fabrizio Grandoni and
Bundit Laekhanukit and
Shi Li},
editor = {Moses Charikar and
Edith Cohen},
title = {\emph{O}(log\({}^{\mbox{2}}\) \emph{k} / log log \emph{k})-approximation
algorithm for directed Steiner tree: a tight quasi-polynomial-time
algorithm},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {253--264},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316349},
doi = {10.1145/3313276.3316349},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0001LL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001T19,
author = {Jingcheng Liu and
Kunal Talwar},
editor = {Moses Charikar and
Edith Cohen},
title = {Private selection from private candidates},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {298--309},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316377},
doi = {10.1145/3313276.3316377},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001T19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0003FK19,
author = {Lin Chen and
Moran Feldman and
Amin Karbasi},
editor = {Moses Charikar and
Edith Cohen},
title = {Unconstrained submodular maximization with constant adaptive complexity},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {102--113},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316327},
doi = {10.1145/3313276.3316327},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0003FK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0003SS19,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
editor = {Moses Charikar and
Edith Cohen},
title = {Random walks and forbidden minors {II:} a poly(\emph{d {\(\epsilon\)}}\({}^{\mbox{-1}}\))-query
tester for minor-closed properties of bounded degree graphs},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {559--567},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316330},
doi = {10.1145/3313276.3316330},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0003SS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0011LSZ19,
author = {Kun He and
Qian Li and
Xiaoming Sun and
Jiapeng Zhang},
editor = {Moses Charikar and
Edith Cohen},
title = {Quantum Lov{\'{a}}sz local lemma: Shearer's bound is tight},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {461--472},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316392},
doi = {10.1145/3313276.3316392},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0011LSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AaronsonR19,
author = {Scott Aaronson and
Guy N. Rothblum},
editor = {Moses Charikar and
Edith Cohen},
title = {Gentle measurement of quantum states and differential privacy},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {322--333},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316378},
doi = {10.1145/3313276.3316378},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AaronsonR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudA0PS19,
author = {Amir Abboud and
Raghavendra Addanki and
Fabrizio Grandoni and
Debmalya Panigrahi and
Barna Saha},
editor = {Moses Charikar and
Edith Cohen},
title = {Dynamic set cover: improved algorithms and lower bounds},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {114--125},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316376},
doi = {10.1145/3313276.3316376},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AbboudA0PS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlistarhAEGZ19,
author = {Dan Alistarh and
James Aspnes and
Faith Ellen and
Rati Gelashvili and
Leqi Zhu},
editor = {Moses Charikar and
Edith Cohen},
title = {Why extension-based proofs fail},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {986--996},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316407},
doi = {10.1145/3313276.3316407},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlistarhAEGZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonLMM19,
author = {Noga Alon and
Roi Livni and
Maryanthe Malliaris and
Shay Moran},
editor = {Moses Charikar and
Edith Cohen},
title = {Private {PAC} learning implies finite Littlestone dimension},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {852--860},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316312},
doi = {10.1145/3313276.3316312},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlonLMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlrabiahG19,
author = {Omar Alrabiah and
Venkatesan Guruswami},
editor = {Moses Charikar and
Edith Cohen},
title = {An exponential lower bound on the sub-packetization of {MSR} codes},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {979--985},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316387},
doi = {10.1145/3313276.3316387},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AlrabiahG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AnariLGV19,
author = {Nima Anari and
Kuikui Liu and
Shayan Oveis Gharan and
Cynthia Vinzant},
editor = {Moses Charikar and
Edith Cohen},
title = {Log-concave polynomials {II:} high-dimensional walks and an {FPRAS}
for counting bases of a matroid},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1--12},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316385},
doi = {10.1145/3313276.3316385},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AnariLGV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AroraRW19,
author = {Atul Singh Arora and
J{\'{e}}r{\'{e}}mie Roland and
Stephan Weis},
editor = {Moses Charikar and
Edith Cohen},
title = {Quantum weak coin flipping},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {205--216},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316306},
doi = {10.1145/3313276.3316306},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AroraRW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiCK19,
author = {Sepehr Assadi and
Yu Chen and
Sanjeev Khanna},
editor = {Moses Charikar and
Edith Cohen},
title = {Polynomial pass lower bounds for graph streaming algorithms},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {265--276},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316361},
doi = {10.1145/3313276.3316361},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AssadiCK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AvronKMMVZ19,
author = {Haim Avron and
Michael Kapralov and
Cameron Musco and
Christopher Musco and
Ameya Velingker and
Amir Zandieh},
editor = {Moses Charikar and
Edith Cohen},
title = {A universal sampling method for reconstructing signals with simple
Fourier transforms},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1051--1063},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316363},
doi = {10.1145/3313276.3316363},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AvronKMMVZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Babai19,
author = {L{\'{a}}szl{\'{o}} Babai},
editor = {Moses Charikar and
Edith Cohen},
title = {Canonical form for graphs in quasipolynomial time: preliminary report},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1237--1246},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316356},
doi = {10.1145/3313276.3316356},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Babai19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BabichenkoDN19,
author = {Yakov Babichenko and
Shahar Dobzinski and
Noam Nisan},
editor = {Moses Charikar and
Edith Cohen},
title = {The communication complexity of local search},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {650--661},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316354},
doi = {10.1145/3313276.3316354},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BabichenkoDN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BadescuO019,
author = {Costin Badescu and
Ryan O'Donnell and
John Wright},
editor = {Moses Charikar and
Edith Cohen},
title = {Quantum state certification},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {503--514},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316344},
doi = {10.1145/3313276.3316344},
timestamp = {Thu, 11 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BadescuO019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BalkanskiRS19,
author = {Eric Balkanski and
Aviad Rubinstein and
Yaron Singer},
editor = {Moses Charikar and
Edith Cohen},
title = {An optimal approximation for submodular maximization under a matroid
constraint in the adaptive complexity model},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {66--77},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316304},
doi = {10.1145/3313276.3316304},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BalkanskiRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bansal19,
author = {Nikhil Bansal},
editor = {Moses Charikar and
Edith Cohen},
title = {On a generalization of iterated and randomized rounding},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1125--1135},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316313},
doi = {10.1145/3313276.3316313},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Bansal19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BecchettiBC0S19,
author = {Luca Becchetti and
Marc Bury and
Vincent Cohen{-}Addad and
Fabrizio Grandoni and
Chris Schwiegelshohn},
editor = {Moses Charikar and
Edith Cohen},
title = {Oblivious dimension reduction for \emph{k}-means: beyond subspaces
and the Johnson-Lindenstrauss lemma},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1039--1050},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316318},
doi = {10.1145/3313276.3316318},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BecchettiBC0S19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BekosFGMMRU19,
author = {Michael A. Bekos and
Henry F{\"{o}}rster and
Martin Gronemann and
Tamara Mchedlidze and
Fabrizio Montecchiani and
Chrysanthi N. Raftopoulou and
Torsten Ueckerdt},
editor = {Moses Charikar and
Edith Cohen},
title = {Planar graphs of bounded degree have bounded queue number},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {176--184},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316324},
doi = {10.1145/3313276.3316324},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BekosFGMMRU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BenderFK19,
author = {Michael A. Bender and
Martin Farach{-}Colton and
William Kuszmaul},
editor = {Moses Charikar and
Edith Cohen},
title = {Achieving optimal backlog in multi-processor cup games},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1148--1157},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316342},
doi = {10.1145/3313276.3316342},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BenderFK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BernsteinN19,
author = {Aaron Bernstein and
Danupon Nanongkai},
editor = {Moses Charikar and
Edith Cohen},
title = {Distributed exact weighted all-pairs shortest paths in near-linear
time},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {334--342},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316326},
doi = {10.1145/3313276.3316326},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BernsteinN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BernsteinPW19,
author = {Aaron Bernstein and
Maximilian Probst and
Christian Wulff{-}Nilsen},
editor = {Moses Charikar and
Edith Cohen},
title = {Decremental strongly-connected components and single-source reachability
in near-linear time},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {365--376},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316335},
doi = {10.1145/3313276.3316335},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BernsteinPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeyhaghiW19,
author = {Hedyeh Beyhaghi and
S. Matthew Weinberg},
editor = {Moses Charikar and
Edith Cohen},
title = {Optimal (and benchmark-optimal) competition complexity for additive
buyers over independent items},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {686--696},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316405},
doi = {10.1145/3313276.3316405},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BeyhaghiW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BitanskyKP19,
author = {Nir Bitansky and
Dakshita Khurana and
Omer Paneth},
editor = {Moses Charikar and
Edith Cohen},
title = {Weak zero-knowledge beyond the black-box barrier},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1091--1102},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316382},
doi = {10.1145/3313276.3316382},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BitanskyKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BohdanowiczCNY19,
author = {Thomas C. Bohdanowicz and
Elizabeth Crosson and
Chinmay Nirkhe and
Henry Yuen},
editor = {Moses Charikar and
Edith Cohen},
title = {Good approximate quantum {LDPC} codes from spacetime circuit Hamiltonians},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {481--490},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316384},
doi = {10.1145/3313276.3316384},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BohdanowiczCNY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BoroujeniGHS19,
author = {Mahdi Boroujeni and
Mohammad Ghodsi and
MohammadTaghi Hajiaghayi and
Saeed Seddighin},
editor = {Moses Charikar and
Edith Cohen},
title = {1+\emph{{\(\epsilon\)}} approximation of tree edit distance in quadratic
time},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {709--720},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316388},
doi = {10.1145/3313276.3316388},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BoroujeniGHS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrakensiekG19,
author = {Joshua Brakensiek and
Venkatesan Guruswami},
editor = {Moses Charikar and
Edith Cohen},
title = {Bridging between 0/1 and linear programming via random walks},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {568--577},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316347},
doi = {10.1145/3313276.3316347},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrakensiekG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrakensiekGG19,
author = {Joshua Brakensiek and
Sivakanth Gopi and
Venkatesan Guruswami},
editor = {Moses Charikar and
Edith Cohen},
title = {CSPs with global modular constraints: algorithms and hardness via
polynomial representations},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {590--601},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316401},
doi = {10.1145/3313276.3316401},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BrakensiekGG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BreslerKM19,
author = {Guy Bresler and
Frederic Koehler and
Ankur Moitra},
editor = {Moses Charikar and
Edith Cohen},
title = {Learning restricted Boltzmann machines via influence maximization},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {828--839},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316372},
doi = {10.1145/3313276.3316372},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BreslerKM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BringmannKW19,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann and
Karol Wegrzycki},
editor = {Moses Charikar and
Edith Cohen},
title = {Approximating {APSP} without scaling: equivalence of approximate min-plus
and exact min-max},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {943--954},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316373},
doi = {10.1145/3313276.3316373},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BringmannKW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BubeckLLS19,
author = {S{\'{e}}bastien Bubeck and
Yin Tat Lee and
Yuanzhi Li and
Mark Sellke},
editor = {Moses Charikar and
Edith Cohen},
title = {Competitively chasing convex bodies},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {861--868},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316314},
doi = {10.1145/3313276.3316314},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BubeckLLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BulinKO19,
author = {Jakub Bul{\'{\i}}n and
Andrei A. Krokhin and
Jakub Oprsal},
editor = {Moses Charikar and
Edith Cohen},
title = {Algebraic approach to promise constraint satisfaction},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {602--613},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316300},
doi = {10.1145/3313276.3316300},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BulinKO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CanettiCHLRRW19,
author = {Ran Canetti and
Yilei Chen and
Justin Holmgren and
Alex Lombardi and
Guy N. Rothblum and
Ron D. Rothblum and
Daniel Wichs},
editor = {Moses Charikar and
Edith Cohen},
title = {Fiat-Shamir: from practice to theory},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1082--1090},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316380},
doi = {10.1145/3313276.3316380},
timestamp = {Tue, 22 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CanettiCHLRRW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CanonneKMSU19,
author = {Cl{\'{e}}ment L. Canonne and
Gautam Kamath and
Audra McMillan and
Adam D. Smith and
Jonathan R. Ullman},
editor = {Moses Charikar and
Edith Cohen},
title = {The structure of optimal private tests for simple hypotheses},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {310--321},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316336},
doi = {10.1145/3313276.3316336},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CanonneKMSU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Capalbo19,
author = {Michael Capalbo},
editor = {Moses Charikar and
Edith Cohen},
title = {Explicit N-vertex graphs with maximum degree {K} and diameter [1+o(1)]
log\({}_{\mbox{K-1}}\) {N} for each {K-1} a prime power},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1191--1202},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316399},
doi = {10.1145/3313276.3316399},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Capalbo19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChakrabartyS19,
author = {Deeparnab Chakrabarty and
Chaitanya Swamy},
editor = {Moses Charikar and
Edith Cohen},
title = {Approximation algorithms for minimum norm and ordered optimization
problems},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {126--137},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316322},
doi = {10.1145/3313276.3316322},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChakrabartyS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Charalampopoulos19,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Shay Mozes and
Oren Weimann},
editor = {Moses Charikar and
Edith Cohen},
title = {Almost optimal distance oracles for planar graphs},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {138--151},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316316},
doi = {10.1145/3313276.3316316},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Charalampopoulos19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CharikarSS19,
author = {Moses Charikar and
Kirankumar Shiragur and
Aaron Sidford},
editor = {Moses Charikar and
Edith Cohen},
title = {Efficient profile maximum likelihood for universal symmetric property
estimation},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {780--791},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316398},
doi = {10.1145/3313276.3316398},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CharikarSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChattopadhyayMS19,
author = {Arkadev Chattopadhyay and
Nikhil S. Mande and
Suhail Sherif},
editor = {Moses Charikar and
Edith Cohen},
title = {The log-approximate-rank conjecture is false},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {42--53},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316353},
doi = {10.1145/3313276.3316353},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChekuriQ19,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Moses Charikar and
Edith Cohen},
title = {Parallelizing greedy for submodular set function maximization in matroids
and beyond},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {78--89},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316406},
doi = {10.1145/3313276.3316406},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChekuriQ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenM19,
author = {Sitan Chen and
Ankur Moitra},
editor = {Moses Charikar and
Edith Cohen},
title = {Beyond the low-degree algorithm: mixtures of subcubes and their applications},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {869--880},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316375},
doi = {10.1145/3313276.3316375},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenT19,
author = {Lijie Chen and
Roei Tell},
editor = {Moses Charikar and
Edith Cohen},
title = {Bootstrapping results for threshold circuits "just beyond" known lower
bounds},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {34--41},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316333},
doi = {10.1145/3313276.3316333},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChenT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenW19,
author = {Xi Chen and
Erik Waingarten},
editor = {Moses Charikar and
Edith Cohen},
title = {Testing unateness nearly optimally},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {547--558},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316351},
doi = {10.1145/3313276.3316351},
timestamp = {Fri, 31 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChenW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChoudhuriHKPRR19,
author = {Arka Rai Choudhuri and
Pavel Hub{\'{a}}cek and
Chethan Kamath and
Krzysztof Pietrzak and
Alon Rosen and
Guy N. Rothblum},
editor = {Moses Charikar and
Edith Cohen},
title = {Finding a Nash equilibrium is no easier than breaking Fiat-Shamir},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1103--1114},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316400},
doi = {10.1145/3313276.3316400},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChoudhuriHKPRR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyK19,
author = {Julia Chuzhoy and
Sanjeev Khanna},
editor = {Moses Charikar and
Edith Cohen},
title = {A new algorithm for decremental single-source shortest paths with
applications to vertex-capacitated flow and cut problems},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {389--400},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316320},
doi = {10.1145/3313276.3316320},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CoesterK19,
author = {Christian Coester and
Elias Koutsoupias},
editor = {Moses Charikar and
Edith Cohen},
title = {The online $k$-taxi problem.},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1136--1147},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316370},
doi = {10.1145/3313276.3316370},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CoesterK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenLS19,
author = {Michael B. Cohen and
Yin Tat Lee and
Zhao Song},
editor = {Moses Charikar and
Edith Cohen},
title = {Solving linear programs in the current matrix multiplication time},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {938--942},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316303},
doi = {10.1145/3313276.3316303},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CohenLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ConteU19,
author = {Alessio Conte and
Takeaki Uno},
editor = {Moses Charikar and
Edith Cohen},
title = {New polynomial delay bounds for maximal subgraph enumeration by proximity
search},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1179--1190},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316402},
doi = {10.1145/3313276.3316402},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ConteU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CzerwinskiLLLM19,
author = {Wojciech Czerwinski and
Slawomir Lasota and
Ranko Lazic and
J{\'{e}}r{\^{o}}me Leroux and
Filip Mazowiecki},
editor = {Moses Charikar and
Edith Cohen},
title = {The reachability problem for Petri nets is not elementary},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {24--33},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316369},
doi = {10.1145/3313276.3316369},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CzerwinskiLLLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Dadush19,
author = {Daniel Dadush},
editor = {Moses Charikar and
Edith Cohen},
title = {On approximating the covering radius and finding dense lattice subspaces},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1021--1026},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316397},
doi = {10.1145/3313276.3316397},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Dadush19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DagaHNS19,
author = {Mohit Daga and
Monika Henzinger and
Danupon Nanongkai and
Thatchaphol Saranurak},
editor = {Moses Charikar and
Edith Cohen},
title = {Distributed edge connectivity in sublinear time},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {343--354},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316346},
doi = {10.1145/3313276.3316346},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DagaHNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DalirrooyfardVW19,
author = {Mina Dalirrooyfard and
Thuy{-}Duong Vuong and
Virginia Vassilevska Williams},
editor = {Moses Charikar and
Edith Cohen},
title = {Graph pattern detection: hardness for all induced patterns and faster
non-induced cycles},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1167--1178},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316329},
doi = {10.1145/3313276.3316329},
timestamp = {Tue, 16 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DalirrooyfardVW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DaskalakisDP19,
author = {Constantinos Daskalakis and
Nishanth Dikkala and
Ioannis Panageas},
editor = {Moses Charikar and
Edith Cohen},
title = {Regression from dependent observations},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {881--889},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316362},
doi = {10.1145/3313276.3316362},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DaskalakisDP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DiakonikolasK19,
author = {Ilias Diakonikolas and
Daniel M. Kane},
editor = {Moses Charikar and
Edith Cohen},
title = {Degree-{\unicode{54353}} chow parameters robustly determine degree-{\unicode{54353}}
PTFs (and algorithmic applications)},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {804--815},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316301},
doi = {10.1145/3313276.3316301},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DiakonikolasK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DingS19,
author = {Jian Ding and
Nike Sun},
editor = {Moses Charikar and
Edith Cohen},
title = {Capacity lower bound for the Ising perceptron},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {816--827},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316383},
doi = {10.1145/3313276.3316383},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DingS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DudekG19,
author = {Bartlomiej Dudek and
Pawel Gawrychowski},
editor = {Moses Charikar and
Edith Cohen},
title = {Computing quartet distance is equivalent to counting 4-cycles},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {733--743},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316390},
doi = {10.1145/3313276.3316390},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DudekG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DurfeeGGP19,
author = {David Durfee and
Yu Gao and
Gramoz Goranci and
Richard Peng},
editor = {Moses Charikar and
Edith Cohen},
title = {Fully dynamic spectral vertex sparsifiers and applications},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {914--925},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316379},
doi = {10.1145/3313276.3316379},
timestamp = {Fri, 14 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DurfeeGGP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DvirGW19,
author = {Zeev Dvir and
Alexander Golovnev and
Omri Weinstein},
editor = {Moses Charikar and
Edith Cohen},
title = {Static data structure lower bounds imply rigidity},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {967--978},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316348},
doi = {10.1145/3313276.3316348},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DvirGW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EneNV19,
author = {Alina Ene and
Huy L. Nguyen and
Adrian Vladu},
editor = {Moses Charikar and
Edith Cohen},
title = {Submodular maximization with matroid and packing constraints in parallel},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {90--101},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316389},
doi = {10.1145/3313276.3316389},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/EneNV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FengVY19,
author = {Weiming Feng and
Nisheeth K. Vishnoi and
Yitong Yin},
editor = {Moses Charikar and
Edith Cohen},
title = {Dynamic sampling from graphical models},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1070--1081},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316365},
doi = {10.1145/3313276.3316365},
timestamp = {Wed, 24 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FengVY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Filos-RatsikasG19,
author = {Aris Filos{-}Ratsikas and
Paul W. Goldberg},
editor = {Moses Charikar and
Edith Cohen},
title = {The complexity of splitting necklaces and bisecting ham sandwiches},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {638--649},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316334},
doi = {10.1145/3313276.3316334},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Filos-RatsikasG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FitzsimonsJVY19,
author = {Joseph F. Fitzsimons and
Zhengfeng Ji and
Thomas Vidick and
Henry Yuen},
editor = {Moses Charikar and
Edith Cohen},
title = {Quantum proof systems for iterated exponential time, and beyond},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {473--480},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316343},
doi = {10.1145/3313276.3316343},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FitzsimonsJVY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ForsterG19,
author = {Sebastian Forster and
Gramoz Goranci},
editor = {Moses Charikar and
Edith Cohen},
title = {Dynamic low-stretch trees via dynamic low-diameter decompositions},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {377--388},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316381},
doi = {10.1145/3313276.3316381},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ForsterG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GaneshZ19,
author = {Arun Ganesh and
Qiuyi (Richard) Zhang},
editor = {Moses Charikar and
Edith Cohen},
title = {Optimal sequence length requirements for phylogenetic tree reconstruction
with indels},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {721--732},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316345},
doi = {10.1145/3313276.3316345},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GaneshZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GargV19,
author = {Jugal Garg and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
editor = {Moses Charikar and
Edith Cohen},
title = {A strongly polynomial algorithm for linear exchange markets},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {54--65},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316340},
doi = {10.1145/3313276.3316340},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GargV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GilyenSLW19,
author = {Andr{\'{a}}s Gily{\'{e}}n and
Yuan Su and
Guang Hao Low and
Nathan Wiebe},
editor = {Moses Charikar and
Edith Cohen},
title = {Quantum singular value transformation and beyond: exponential improvements
for quantum matrix arithmetics},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {193--204},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316366},
doi = {10.1145/3313276.3316366},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GilyenSLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GishbolinerS19,
author = {Lior Gishboliner and
Asaf Shapira},
editor = {Moses Charikar and
Edith Cohen},
title = {Testing graphs against an unknown distribution},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {535--546},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316308},
doi = {10.1145/3313276.3316308},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GishbolinerS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Goldreich19,
author = {Oded Goldreich},
editor = {Moses Charikar and
Edith Cohen},
title = {Testing graphs in vertex-distribution-free models},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {527--534},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316302},
doi = {10.1145/3313276.3316302},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Goldreich19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoyalS19,
author = {Navin Goyal and
Abhishek Shetty},
editor = {Moses Charikar and
Edith Cohen},
title = {Non-Gaussian component analysis using entropy methods},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {840--851},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316309},
doi = {10.1145/3313276.3316309},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GoyalS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuoHZ19,
author = {Chenghao Guo and
Zhiyi Huang and
Xinzhi Zhang},
editor = {Moses Charikar and
Edith Cohen},
title = {Settling the sample complexity of single-parameter revenue maximization},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {662--673},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316325},
doi = {10.1145/3313276.3316325},
timestamp = {Tue, 08 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuoHZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuptaLL19,
author = {Anupam Gupta and
Euiwoong Lee and
Jason Li},
editor = {Moses Charikar and
Edith Cohen},
title = {The number of minimum \emph{k}-cuts: improving the Karger-Stein bound},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {229--240},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316395},
doi = {10.1145/3313276.3316395},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GuptaLL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HadarLPS19,
author = {Uri Hadar and
Jingbo Liu and
Yury Polyanskiy and
Ofer Shayevitz},
editor = {Moses Charikar and
Edith Cohen},
title = {Communication complexity of estimating correlations},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {792--803},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316332},
doi = {10.1145/3313276.3316332},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HadarLPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HaeuplerRS19,
author = {Bernhard Haeupler and
Aviad Rubinstein and
Amirbehshad Shahrasbi},
editor = {Moses Charikar and
Edith Cohen},
title = {Near-linear time insertion-deletion codes and (1+\emph{{\(\epsilon\)}})-approximating
edit distance via indexing},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {697--708},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316371},
doi = {10.1145/3313276.3316371},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HaeuplerRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HansenKZZ19,
author = {Thomas Dueholm Hansen and
Haim Kaplan and
Or Zamir and
Uri Zwick},
editor = {Moses Charikar and
Edith Cohen},
title = {Faster \emph{k}-SAT algorithms using biased-PPSZ},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {578--589},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316359},
doi = {10.1145/3313276.3316359},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HansenKZZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HelmuthPR19,
author = {Tyler Helmuth and
Will Perkins and
Guus Regts},
editor = {Moses Charikar and
Edith Cohen},
title = {Algorithmic Pirogov-Sinai theory},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1009--1020},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316305},
doi = {10.1145/3313276.3316305},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HelmuthPR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HolmgrenY19,
author = {Justin Holmgren and
Lisa Yang},
editor = {Moses Charikar and
Edith Cohen},
title = {The parallel repetition of non-signaling games: counterexamples and
dichotomy},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {185--192},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316367},
doi = {10.1145/3313276.3316367},
timestamp = {Sun, 08 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HolmgrenY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JainKR19,
author = {Vishesh Jain and
Frederic Koehler and
Andrej Risteski},
editor = {Moses Charikar and
Edith Cohen},
title = {Mean-field approximation, convex hierarchies, and the optimality of
correlation rounding: a unified perspective},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1226--1236},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316299},
doi = {10.1145/3313276.3316299},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JainKR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/JinLQTX19,
author = {Yaonan Jin and
Pinyan Lu and
Qi Qi and
Zhihao Gavin Tang and
Tao Xiao},
editor = {Moses Charikar and
Edith Cohen},
title = {Tight approximation ratio of anonymous pricing},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {674--685},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316331},
doi = {10.1145/3313276.3316331},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/JinLQTX19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KalaiPY19,
author = {Yael Tauman Kalai and
Omer Paneth and
Lisa Yang},
editor = {Moses Charikar and
Edith Cohen},
title = {How to delegate computations publicly},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1115--1124},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316411},
doi = {10.1145/3313276.3316411},
timestamp = {Sun, 08 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KalaiPY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KapralovK19,
author = {Michael Kapralov and
Dmitry Krachun},
editor = {Moses Charikar and
Edith Cohen},
title = {An optimal space lower bound for approximating {MAX-CUT}},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {277--288},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316364},
doi = {10.1145/3313276.3316364},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KapralovK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KawarabayashiS19,
author = {Ken{-}ichi Kawarabayashi and
Anastasios Sidiropoulos},
editor = {Moses Charikar and
Edith Cohen},
title = {Polylogarithmic approximation for Euler genus on bounded degree graphs},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {164--175},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316409},
doi = {10.1145/3313276.3316409},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KawarabayashiS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kayal019,
author = {Neeraj Kayal and
Chandan Saha},
editor = {Moses Charikar and
Edith Cohen},
title = {Reconstruction of non-degenerate homogeneous depth three circuits},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {413--424},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316360},
doi = {10.1145/3313276.3316360},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Kayal019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KempaK19,
author = {Dominik Kempa and
Tomasz Kociumaka},
editor = {Moses Charikar and
Edith Cohen},
title = {String synchronizing sets: sublinear-time {BWT} construction and optimal
{LCE} data structure},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {756--767},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316368},
doi = {10.1145/3313276.3316368},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KempaK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KyngPSW19,
author = {Rasmus Kyng and
Richard Peng and
Sushant Sachdeva and
Di Wang},
editor = {Moses Charikar and
Edith Cohen},
title = {Flows in almost linear time via adaptive preconditioning},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {902--913},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316410},
doi = {10.1145/3313276.3316410},
timestamp = {Fri, 19 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KyngPSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiP19,
author = {Jason Li and
Merav Parter},
editor = {Moses Charikar and
Edith Cohen},
title = {Planar diameter via metric compression},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {152--163},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316358},
doi = {10.1145/3313276.3316358},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LiP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LimayeS0TV19,
author = {Nutan Limaye and
Karteek Sreenivasaiah and
Srikanth Srinivasan and
Utkarsh Tripathi and
S. Venkitesh},
editor = {Moses Charikar and
Edith Cohen},
title = {A fixed-depth size-hierarchy theorem for AC\({}^{\mbox{0}}\)[{\(\oplus\)}]
via the coin problem},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {442--453},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316339},
doi = {10.1145/3313276.3316339},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LimayeS0TV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LinharesS19,
author = {Andr{\'{e}} Linhares and
Chaitanya Swamy},
editor = {Moses Charikar and
Edith Cohen},
title = {Approximation algorithms for distributionally-robust stochastic optimization
with black-box distributions},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {768--779},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316391},
doi = {10.1145/3313276.3316391},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LinharesS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LovettZ19,
author = {Shachar Lovett and
Jiapeng Zhang},
editor = {Moses Charikar and
Edith Cohen},
title = {{DNF} sparsification beyond sunflowers},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {454--460},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316323},
doi = {10.1145/3313276.3316323},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LovettZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Low19,
author = {Guang Hao Low},
editor = {Moses Charikar and
Edith Cohen},
title = {Hamiltonian simulation with nearly optimal dependence on spectral
norm},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {491--502},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316386},
doi = {10.1145/3313276.3316386},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Low19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MakarychevMR19,
author = {Konstantin Makarychev and
Yury Makarychev and
Ilya P. Razenshteyn},
editor = {Moses Charikar and
Edith Cohen},
title = {Performance of Johnson-Lindenstrauss transform for \emph{k}-means
and \emph{k}-medians clustering},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1027--1038},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316350},
doi = {10.1145/3313276.3316350},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MakarychevMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/McKayMW19,
author = {Dylan M. McKay and
Cody D. Murray and
R. Ryan Williams},
editor = {Moses Charikar and
Edith Cohen},
title = {Weak lower bounds on resource-bounded compression imply strong separations
of complexity classes},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1215--1225},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316396},
doi = {10.1145/3313276.3316396},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/McKayMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MekaRT19,
author = {Raghu Meka and
Omer Reingold and
Avishay Tal},
editor = {Moses Charikar and
Edith Cohen},
title = {Pseudorandom generators for width-3 branching programs},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {626--637},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316319},
doi = {10.1145/3313276.3316319},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MekaRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MoitraW19,
author = {Ankur Moitra and
Alexander S. Wein},
editor = {Moses Charikar and
Edith Cohen},
title = {Spectral methods from tensor networks},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {926--937},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316357},
doi = {10.1145/3313276.3316357},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/MoitraW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NakosS19,
author = {Vasileios Nakos and
Zhao Song},
editor = {Moses Charikar and
Edith Cohen},
title = {Stronger l\({}_{\mbox{2}}\)/l\({}_{\mbox{2}}\) compressed sensing;
without iterating},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {289--297},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316355},
doi = {10.1145/3313276.3316355},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/NakosS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NanongkaiSY19,
author = {Danupon Nanongkai and
Thatchaphol Saranurak and
Sorrachai Yingchareonthawornchai},
editor = {Moses Charikar and
Edith Cohen},
title = {Breaking quadratic time for small vertex connectivity and an approximation
scheme},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {241--252},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316394},
doi = {10.1145/3313276.3316394},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NanongkaiSY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NarayananN19,
author = {Shyam Narayanan and
Jelani Nelson},
editor = {Moses Charikar and
Edith Cohen},
title = {Optimal terminal dimensionality reduction in Euclidean space},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1064--1069},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316307},
doi = {10.1145/3313276.3316307},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/NarayananN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ODonnellST19,
author = {Ryan O'Donnell and
Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Moses Charikar and
Edith Cohen},
title = {Fooling polytopes},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {614--625},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316321},
doi = {10.1145/3313276.3316321},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ODonnellST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PachRT19,
author = {J{\'{a}}nos Pach and
Natan Rubin and
G{\'{a}}bor Tardos},
editor = {Moses Charikar and
Edith Cohen},
title = {Planar point sets determine many pairwise crossing segments},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1158--1166},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316328},
doi = {10.1145/3313276.3316328},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/PachRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Potechin19,
author = {Aaron Potechin},
editor = {Moses Charikar and
Edith Cohen},
title = {On the approximation resistance of balanced linear threshold functions},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {430--441},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316374},
doi = {10.1145/3313276.3316374},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Potechin19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RazT19,
author = {Ran Raz and
Avishay Tal},
editor = {Moses Charikar and
Edith Cohen},
title = {Oracle separation of {BQP} and {PH}},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {13--23},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316315},
doi = {10.1145/3313276.3316315},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RazT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SchweitzerW19,
author = {Pascal Schweitzer and
Daniel Wiebking},
editor = {Moses Charikar and
Edith Cohen},
title = {A unifying method for the design of algorithms canonizing combinatorial
objects},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1247--1258},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316338},
doi = {10.1145/3313276.3316338},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SchweitzerW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SharanSV19,
author = {Vatsal Sharan and
Aaron Sidford and
Gregory Valiant},
editor = {Moses Charikar and
Edith Cohen},
title = {Memory-sample tradeoffs for linear regression with small error},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {890--901},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316403},
doi = {10.1145/3313276.3316403},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SharanSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SherstovW19,
author = {Alexander A. Sherstov and
Pei Wu},
editor = {Moses Charikar and
Edith Cohen},
title = {Near-optimal lower bounds on the threshold degree and sign-rank of
AC\({}^{\mbox{0}}\)},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {401--412},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316408},
doi = {10.1145/3313276.3316408},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SherstovW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Shpilka19,
author = {Amir Shpilka},
editor = {Moses Charikar and
Edith Cohen},
title = {Sylvester-Gallai type theorems for quadratic polynomials},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1203--1214},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316341},
doi = {10.1145/3313276.3316341},
timestamp = {Fri, 04 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Shpilka19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SinhaW19,
author = {Sandip Sinha and
Omri Weinstein},
editor = {Moses Charikar and
Edith Cohen},
title = {Local decodability of the Burrows-Wheeler transform},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {744--755},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316317},
doi = {10.1145/3313276.3316317},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SinhaW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SuV19,
author = {Hsin{-}Hao Su and
Hoa T. Vu},
editor = {Moses Charikar and
Edith Cohen},
title = {Towards the locality of Vizing's theorem},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {355--364},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316393},
doi = {10.1145/3313276.3316393},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/SuV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Tang19,
author = {Ewin Tang},
editor = {Moses Charikar and
Edith Cohen},
title = {A quantum-inspired classical algorithm for recommendation systems},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {217--228},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316310},
doi = {10.1145/3313276.3316310},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Tang19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/WattsKST19,
author = {Adam Bene Watts and
Robin Kothari and
Luke Schaeffer and
Avishay Tal},
editor = {Moses Charikar and
Edith Cohen},
title = {Exponential separation between shallow quantum circuits and unbounded
fan-in shallow classical circuits},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {515--526},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316404},
doi = {10.1145/3313276.3316404},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/WattsKST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yehudayoff19,
author = {Amir Yehudayoff},
editor = {Moses Charikar and
Edith Cohen},
title = {Separating monotone {VP} and {VNP}},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {425--429},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316311},
doi = {10.1145/3313276.3316311},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Yehudayoff19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yu19,
author = {Huacheng Yu},
editor = {Moses Charikar and
Edith Cohen},
title = {Optimal succinct rank data structure via approximate nonnegative tensor
decomposition},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {955--966},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316352},
doi = {10.1145/3313276.3316352},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Yu19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2019,
editor = {Moses Charikar and
Edith Cohen},
title = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
publisher = {{ACM}},
year = {2019},
url = {https://dl.acm.org/citation.cfm?id=3313276},
isbn = {978-1-4503-6705-9},
timestamp = {Sat, 22 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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}
}
@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}
}
@inproceedings{DBLP:conf/stoc/AaronsonBK16,
author = {Scott Aaronson and
Shalev Ben{-}David and
Robin Kothari},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Separations in query complexity using cheat sheets},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {863--876},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897644},
doi = {10.1145/2897518.2897644},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AaronsonBK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudB16,
author = {Amir Abboud and
Greg Bodwin},
editor = {Daniel Wichs and
Yishay Mansour},
title = {The 4/3 additive spanner exponent is tight},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {351--361},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897555},
doi = {10.1145/2897518.2897555},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AbboudB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudHWW16,
author = {Amir Abboud and
Thomas Dueholm Hansen and
Virginia Vassilevska Williams and
Ryan Williams},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Simulating branching programs with edit distance and friends: or:
a polylog shaved is a lower bound made},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {375--388},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897653},
doi = {10.1145/2897518.2897653},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AbboudHWW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AmbainisBBLSS16,
author = {Andris Ambainis and
Kaspars Balodis and
Aleksandrs Belovs and
Troy Lee and
Miklos Santha and
Juris Smotrovs},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Separations in query complexity based on pointer functions},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {800--813},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897524},
doi = {10.1145/2897518.2897524},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AmbainisBBLSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ApplebaumL16,
author = {Benny Applebaum and
Shachar Lovett},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Algebraic attacks against random local functions and their countermeasures},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1087--1100},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897554},
doi = {10.1145/2897518.2897554},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ApplebaumL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AronovS16,
author = {Boris Aronov and
Micha Sharir},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Almost tight bounds for eliminating depth cycles in three dimensions},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1--8},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897539},
doi = {10.1145/2897518.2897539},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AronovS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AsharovNSS16,
author = {Gilad Asharov and
Moni Naor and
Gil Segev and
Ido Shahaf},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Searchable symmetric encryption: optimal locality in linear space
via two-dimensional balanced allocations},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1101--1114},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897562},
doi = {10.1145/2897518.2897562},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AsharovNSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AssadiKL16,
author = {Sepehr Assadi and
Sanjeev Khanna and
Yang Li},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Tight bounds for single-pass streaming complexity of the set cover
problem},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {698--711},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897576},
doi = {10.1145/2897518.2897576},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AssadiKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AzizM16,
author = {Haris Aziz and
Simon Mackenzie},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A discrete and bounded envy-free cake cutting protocol for four agents},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {454--464},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897522},
doi = {10.1145/2897518.2897522},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AzizM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Babai16,
author = {L{\'{a}}szl{\'{o}} Babai},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Graph isomorphism in quasipolynomial time [extended abstract]},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {684--697},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897542},
doi = {10.1145/2897518.2897542},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Babai16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BansalSS16,
author = {Nikhil Bansal and
Aravind Srinivasan and
Ola Svensson},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Lift-and-round to improve weighted completion time on unrelated machines},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {156--167},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897572},
doi = {10.1145/2897518.2897572},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BansalSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BassilyNSSSU16,
author = {Raef Bassily and
Kobbi Nissim and
Adam D. Smith and
Thomas Steinke and
Uri Stemmer and
Jonathan R. Ullman},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Algorithmic stability for adaptive data analysis},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1046--1059},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897566},
doi = {10.1145/2897518.2897566},
timestamp = {Sun, 14 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BassilyNSSSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BaswanaCR16,
author = {Surender Baswana and
Keerti Choudhary and
Liam Roditty},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Fault tolerant subgraph for single source reachability: generic and
optimal},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {509--518},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897648},
doi = {10.1145/2897518.2897648},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BaswanaCR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BateniDHM16,
author = {MohammadHossein Bateni and
Erik D. Demaine and
MohammadTaghi Hajiaghayi and
D{\'{a}}niel Marx},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A {PTAS} for planar group Steiner tree via spanner bootstrapping and
prize collecting},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {570--583},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897549},
doi = {10.1145/2897518.2897549},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BateniDHM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BelovsB16,
author = {Aleksandrs Belovs and
Eric Blais},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A polynomial lower bound for testing monotonicity},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1021--1032},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897567},
doi = {10.1145/2897518.2897567},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BelovsB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BenderKPY16,
author = {Michael A. Bender and
Tsvi Kopelowitz and
Seth Pettie and
Maxwell Young},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Contention resolution with log-logstar channel accesses},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {499--508},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897655},
doi = {10.1145/2897518.2897655},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BenderKPY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BernsteinC16,
author = {Aaron Bernstein and
Shiri Chechik},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Deterministic decremental single source shortest paths: beyond the
o(mn) bound},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {389--397},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897521},
doi = {10.1145/2897518.2897521},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BernsteinC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BhattacharyaHN16,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai},
editor = {Daniel Wichs and
Yishay Mansour},
title = {New deterministic approximation algorithms for fully dynamic matching},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {398--411},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897568},
doi = {10.1145/2897518.2897568},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BhattacharyaHN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BoutsidisWZ16,
author = {Christos Boutsidis and
David P. Woodruff and
Peilin Zhong},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Optimal principal component analysis in distributed and streaming
models},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {236--249},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897646},
doi = {10.1145/2897518.2897646},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BoutsidisWZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrandtFHKLRSU16,
author = {Sebastian Brandt and
Orr Fischer and
Juho Hirvonen and
Barbara Keller and
Tuomo Lempi{\"{a}}inen and
Joel Rybicki and
Jukka Suomela and
Jara Uitto},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A lower bound for the distributed Lov{\'{a}}sz local lemma},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {479--488},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897570},
doi = {10.1145/2897518.2897570},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BrandtFHKLRSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BravermanCIW16,
author = {Vladimir Braverman and
Stephen R. Chestnut and
Nikita Ivkin and
David P. Woodruff},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Beating CountSketch for heavy hitters in insertion streams},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {740--753},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897558},
doi = {10.1145/2897518.2897558},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BravermanCIW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BravermanEGH16,
author = {Mark Braverman and
Klim Efremenko and
Ran Gelles and
Bernhard Haeupler},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Constant-rate coding for multiparty interactive communication is impossible},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {999--1010},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897563},
doi = {10.1145/2897518.2897563},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BravermanEGH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BravermanGMNW16,
author = {Mark Braverman and
Ankit Garg and
Tengyu Ma and
Huy L. Nguyen and
David P. Woodruff},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Communication lower bounds for statistical estimation problems via
a distributed data processing inequality},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1011--1020},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897582},
doi = {10.1145/2897518.2897582},
timestamp = {Sun, 08 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BravermanGMNW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BravermanMW16,
author = {Mark Braverman and
Jieming Mao and
S. Matthew Weinberg},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Parallel algorithms for select and partition with noisy comparisons},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {851--862},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897642},
doi = {10.1145/2897518.2897642},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BravermanMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CaiDW16,
author = {Yang Cai and
Nikhil R. Devanur and
S. Matthew Weinberg},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A duality based unified approach to Bayesian mechanism design},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {926--939},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897645},
doi = {10.1145/2897518.2897645},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CaiDW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChakrabortyGK16,
author = {Diptarka Chakraborty and
Elazar Goldenberg and
Michal Kouck{\'{y}}},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Streaming algorithms for embedding and computing edit distance in
the low distance regime},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {712--725},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897577},
doi = {10.1145/2897518.2897577},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChakrabortyGK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChattopadhyayG016,
author = {Eshan Chattopadhyay and
Vipul Goyal and
Xin Li},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Non-malleable extractors and codes, with their many tampered extensions},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {285--298},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897547},
doi = {10.1145/2897518.2897547},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayG016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChattopadhyayL16,
author = {Eshan Chattopadhyay and
Xin Li},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Extractors for sumset sources},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {299--311},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897643},
doi = {10.1145/2897518.2897643},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChattopadhyayZ16,
author = {Eshan Chattopadhyay and
David Zuckerman},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Explicit two-source extractors and resilient functions},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {670--683},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897528},
doi = {10.1145/2897518.2897528},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Chen16,
author = {Sitan Chen},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Basis collapse for holographic algorithms over all domain sizes},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {776--789},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897546},
doi = {10.1145/2897518.2897546},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Chen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenOST16,
author = {Xi Chen and
Igor C. Oliveira and
Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Near-optimal small-depth lower bounds for small distance connectivity},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {612--625},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897534},
doi = {10.1145/2897518.2897534},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenOST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChuzhoyKL16,
author = {Julia Chuzhoy and
David H. K. Kim and
Shi Li},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Improved approximation for node-disjoint paths in planar graphs},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {556--569},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897538},
doi = {10.1145/2897518.2897538},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChuzhoyKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cohen-AddadVKMM16,
author = {Vincent Cohen{-}Addad and
{\'{E}}ric Colin de Verdi{\`{e}}re and
Philip N. Klein and
Claire Mathieu and
David Meierfrankenfeld},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Approximating connectivity domination in weighted bounded-genus graphs},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {584--597},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897635},
doi = {10.1145/2897518.2897635},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Cohen-AddadVKMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Cohen16,
author = {Gil Cohen},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Two-source dispersers for polylogarithmic entropy and improved ramsey
graphs},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {278--284},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897530},
doi = {10.1145/2897518.2897530},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Cohen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenHNVW16,
author = {Aloni Cohen and
Justin Holmgren and
Ryo Nishimaki and
Vinod Vaikuntanathan and
Daniel Wichs},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Watermarking cryptographic capabilities},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1115--1127},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897651},
doi = {10.1145/2897518.2897651},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CohenHNVW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CohenLMPS16,
author = {Michael B. Cohen and
Yin Tat Lee and
Gary L. Miller and
Jakub Pachocki and
Aaron Sidford},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Geometric median in nearly linear time},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {9--21},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897647},
doi = {10.1145/2897518.2897647},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CohenLMPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CzumajPS16,
author = {Artur Czumaj and
Pan Peng and
Christian Sohler},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Relating two property testing models for bounded degree directed graphs},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1033--1045},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897575},
doi = {10.1145/2897518.2897575},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/CzumajPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Daniely16,
author = {Amit Daniely},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Complexity theoretic limitations on learning halfspaces},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {105--117},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897520},
doi = {10.1145/2897518.2897520},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Daniely16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Dasgupta16,
author = {Sanjoy Dasgupta},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A cost function for similarity-based hierarchical clustering},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {118--127},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897527},
doi = {10.1145/2897518.2897527},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Dasgupta16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DaskalakisDKT16,
author = {Constantinos Daskalakis and
Anindya De and
Gautam Kamath and
Christos Tzamos},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A size-free {CLT} for poisson multinomials and its applications},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1074--1086},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897519},
doi = {10.1145/2897518.2897519},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DaskalakisDKT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DavidF16,
author = {Roee David and
Uriel Feige},
editor = {Daniel Wichs and
Yishay Mansour},
title = {On the effect of randomness on planted 3-coloring models},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {77--90},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897561},
doi = {10.1145/2897518.2897561},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DavidF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Devanur0P16,
author = {Nikhil R. Devanur and
Zhiyi Huang and
Christos{-}Alexandros Psomas},
editor = {Daniel Wichs and
Yishay Mansour},
title = {The sample complexity of auctions with side information},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {426--439},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897553},
doi = {10.1145/2897518.2897553},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Devanur0P16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DiakonikolasKS16,
author = {Ilias Diakonikolas and
Daniel M. Kane and
Alistair Stewart},
editor = {Daniel Wichs and
Yishay Mansour},
title = {The fourier transform of poisson multinomial distributions and its
algorithmic applications},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1060--1073},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897552},
doi = {10.1145/2897518.2897552},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DiakonikolasKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Dobzinski16,
author = {Shahar Dobzinski},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Breaking the logarithmic barrier for truthful combinatorial auctions
with submodular bidders},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {940--948},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897569},
doi = {10.1145/2897518.2897569},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Dobzinski16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DughmiX16,
author = {Shaddin Dughmi and
Haifeng Xu},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Algorithmic Bayesian persuasion},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {412--425},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897583},
doi = {10.1145/2897518.2897583},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/DughmiX16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Emamjomeh-Zadeh16,
author = {Ehsan Emamjomeh{-}Zadeh and
David Kempe and
Vikrant Singhal},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Deterministic and probabilistic binary search in graphs},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {519--532},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897656},
doi = {10.1145/2897518.2897656},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Emamjomeh-Zadeh16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EmekKW16,
author = {Yuval Emek and
Shay Kutten and
Roger Wattenhofer},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Online matching: haste makes waste!},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {333--344},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897557},
doi = {10.1145/2897518.2897557},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EmekKW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EneMPS16,
author = {Alina Ene and
Gary L. Miller and
Jakub Pachocki and
Aaron Sidford},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Routing under balance},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {598--611},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897654},
doi = {10.1145/2897518.2897654},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EneMPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EvraK16,
author = {Shai Evra and
Tali Kaufman},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Bounded degree cosystolic expanders of every dimension},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {36--48},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897543},
doi = {10.1145/2897518.2897543},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EvraK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FeldmanILRS16,
author = {Michal Feldman and
Nicole Immorlica and
Brendan Lucier and
Tim Roughgarden and
Vasilis Syrgkanis},
editor = {Daniel Wichs and
Yishay Mansour},
title = {The price of anarchy in large games},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {963--976},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897580},
doi = {10.1145/2897518.2897580},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FeldmanILRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FennerGT16,
author = {Stephen A. Fenner and
Rohit Gurjar and
Thomas Thierauf},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Bipartite perfect matching is in quasi-NC},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {754--763},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897564},
doi = {10.1145/2897518.2897564},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FennerGT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FominGLS16,
author = {Fedor V. Fomin and
Serge Gaspers and
Daniel Lokshtanov and
Saket Saurabh},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Exact algorithms via monotone local search},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {764--775},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897551},
doi = {10.1145/2897518.2897551},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/FominGLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FraigniaudKR16,
author = {Pierre Fraigniaud and
Amos Korman and
Yoav Rodeh},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Parallel exhaustive search without coordination},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {312--323},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897541},
doi = {10.1145/2897518.2897541},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FraigniaudKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FriezeP16,
author = {Alan M. Frieze and
Wesley Pegden},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Separating subadditive euclidean functionals},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {22--35},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897571},
doi = {10.1145/2897518.2897571},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FriezeP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GanorKR16,
author = {Anat Ganor and
Gillat Kol and
Ran Raz},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Exponential separation of communication and external information},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {977--986},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897535},
doi = {10.1145/2897518.2897535},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GanorKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Gavinsky16,
author = {Dmitry Gavinsky},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Entangled simultaneity versus classical interactivity in communication
complexity},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {877--884},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897545},
doi = {10.1145/2897518.2897545},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Gavinsky16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoldreichT16,
author = {Oded Goldreich and
Avishay Tal},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Matrix rigidity of random toeplitz matrices},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {91--104},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897633},
doi = {10.1145/2897518.2897633},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GoldreichT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GoyalPR16,
author = {Vipul Goyal and
Omkant Pandey and
Silas Richelson},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Textbook non-malleable commitments},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {1128--1141},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897657},
doi = {10.1145/2897518.2897657},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GoyalPR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiW16,
author = {Venkatesan Guruswami and
Mary Wootters},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Repairing Reed-solomon codes},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {216--226},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897525},
doi = {10.1145/2897518.2897525},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HaahHJWY16,
author = {Jeongwan Haah and
Aram W. Harrow and
Zheng{-}Feng Ji and
Xiaodi Wu and
Nengkun Yu},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Sample-optimal tomography of quantum states},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {913--925},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897585},
doi = {10.1145/2897518.2897585},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HaahHJWY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HallPS16,
author = {Chris Hall and
Doron Puder and
William F. Sawin},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Ramanujan coverings of graphs},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {533--541},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897574},
doi = {10.1145/2897518.2897574},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HallPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HarrisSS16,
author = {David G. Harris and
Johannes Schneider and
Hsin{-}Hao Su},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Distributed ({\unicode{8710}}+1)-coloring in sublogarithmic rounds},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {465--478},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897533},
doi = {10.1145/2897518.2897533},
timestamp = {Wed, 15 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HarrisSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HazanK16,
author = {Elad Hazan and
Tomer Koren},
editor = {Daniel Wichs and
Yishay Mansour},
title = {The computational power of optimization in online learning},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {128--141},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897536},
doi = {10.1145/2897518.2897536},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HazanK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HenzingerKN16,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A deterministic almost-tight distributed algorithm for approximating
single-source shortest paths},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {489--498},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897638},
doi = {10.1145/2897518.2897638},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HenzingerKN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HopkinsSSS16,
author = {Samuel B. Hopkins and
Tselil Schramm and
Jonathan Shi and
David Steurer},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Fast spectral algorithms from sum-of-squares proofs: tensor decomposition
and planted sparse vectors},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {178--191},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897529},
doi = {10.1145/2897518.2897529},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HopkinsSSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HsuMRRV16,
author = {Justin Hsu and
Jamie Morgenstern and
Ryan M. Rogers and
Aaron Roth and
Rakesh Vohra},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Do prices coordinate markets?},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {440--453},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897559},
doi = {10.1145/2897518.2897559},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/HsuMRRV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Ji16,
author = {Zhengfeng Ji},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Classical verification of quantum proofs},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {885--898},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897634},
doi = {10.1145/2897518.2897634},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Ji16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KaneW16,
author = {Daniel M. Kane and
Ryan Williams},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Super-linear gate and super-quadratic wire lower bounds for depth-two
and depth-three threshold circuits},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {633--643},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897636},
doi = {10.1145/2897518.2897636},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KaneW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kapralov16,
author = {Michael Kapralov},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Sparse fourier transform in any constant dimension with nearly-optimal
sample complexity in sublinear time},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {264--277},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897650},
doi = {10.1145/2897518.2897650},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kapralov16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Karger16,
author = {David R. Karger},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Enumerating parametric global minimum cuts by random interleaving},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {542--555},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897578},
doi = {10.1145/2897518.2897578},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Karger16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KayalST16,
author = {Neeraj Kayal and
Chandan Saha and
S{\'{e}}bastien Tavenas},
editor = {Daniel Wichs and
Yishay Mansour},
title = {On the size of homogeneous and of depth four formulas with low individual
degree},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {626--632},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897550},
doi = {10.1145/2897518.2897550},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KayalST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KhotM16,
author = {Subhash Khot and
Dana Moshkovitz},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Candidate hard unique game},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {63--76},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897531},
doi = {10.1145/2897518.2897531},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KhotM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Kol16,
author = {Gillat Kol},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Interactive compression for product distributions},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {987--998},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897537},
doi = {10.1145/2897518.2897537},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Kol16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KoppartyMRS16,
author = {Swastik Kopparty and
Or Meir and
Noga Ron{-}Zewi and
Shubhangi Saraf},
editor = {Daniel Wichs and
Yishay Mansour},
title = {High-rate locally-correctable and locally-testable codes with sub-polynomial
query complexity},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {202--215},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897523},
doi = {10.1145/2897518.2897523},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KoppartyMRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KudekarKMPSU16,
author = {Shrinivas Kudekar and
Santhosh Kumar and
Marco Mondelli and
Henry D. Pfister and
Eren Sasoglu and
R{\"{u}}diger L. Urbanke},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Reed-Muller codes achieve capacity on erasure channels},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {658--669},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897584},
doi = {10.1145/2897518.2897584},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KudekarKMPSU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KyngLPSS16,
author = {Rasmus Kyng and
Yin Tat Lee and
Richard Peng and
Sushant Sachdeva and
Daniel A. Spielman},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Sparsified Cholesky and multigrid solvers for connection laplacians},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {842--850},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897640},
doi = {10.1145/2897518.2897640},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/KyngLPSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeveyR16,
author = {Elaine Levey and
Thomas Rothvoss},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A (1+epsilon)-approximation for makespan scheduling with precedence
constraints using {LP} hierarchies},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {168--177},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897532},
doi = {10.1145/2897518.2897532},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LeveyR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LiW16,
author = {Yi Li and
David P. Woodruff},
editor = {Daniel Wichs and
Yishay Mansour},
title = {On approximating functions of the singular values in a stream},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {726--739},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897581},
doi = {10.1145/2897518.2897581},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LiW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MoitraPW16,
author = {Ankur Moitra and
William Perry and
Alexander S. Wein},
editor = {Daniel Wichs and
Yishay Mansour},
title = {How robust are reconstruction thresholds for community detection?},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {828--841},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897573},
doi = {10.1145/2897518.2897573},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MoitraPW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MontanariS16,
author = {Andrea Montanari and
Subhabrata Sen},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Semidefinite programs on sparse random graphs and their application
to community detection},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {814--827},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897548},
doi = {10.1145/2897518.2897548},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MontanariS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/NikolovS16,
author = {Aleksandar Nikolov and
Mohit Singh},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Maximizing determinants under partition constraints},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {192--201},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897649},
doi = {10.1145/2897518.2897649},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/NikolovS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ODonnellW16,
author = {Ryan O'Donnell and
John Wright},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Efficient quantum tomography},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {899--912},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897544},
doi = {10.1145/2897518.2897544},
timestamp = {Thu, 11 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ODonnellW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PitassiRST16,
author = {Toniann Pitassi and
Benjamin Rossman and
Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Poly-logarithmic Frege depth lower bounds via an expander switching
lemma},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {644--657},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897637},
doi = {10.1145/2897518.2897637},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PitassiRST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RazenshteynSW16,
author = {Ilya P. Razenshteyn and
Zhao Song and
David P. Woodruff},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Weighted low rank approximations with provable guarantees},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {250--263},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897639},
doi = {10.1145/2897518.2897639},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/RazenshteynSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ReingoldRR16,
author = {Omer Reingold and
Guy N. Rothblum and
Ron D. Rothblum},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Constant-round interactive proofs for delegating computation},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {49--62},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897652},
doi = {10.1145/2897518.2897652},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ReingoldRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/RothUW16,
author = {Aaron Roth and
Jonathan R. Ullman and
Zhiwei Steven Wu},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Watch and learn: optimizing from revealed preferences feedback},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {949--962},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897579},
doi = {10.1145/2897518.2897579},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/RothUW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Rubinstein16,
author = {Aviad Rubinstein},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Beyond matroids: secretary problem and prophet inequality with general
constraints},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {324--332},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897540},
doi = {10.1145/2897518.2897540},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Rubinstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SaptharishiSV16,
author = {Ramprasad Saptharishi and
Amir Shpilka and
Ben Lee Volk},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Efficiently decoding Reed-Muller codes from random errors},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {227--235},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897526},
doi = {10.1145/2897518.2897526},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/SaptharishiSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ValiantV16,
author = {Gregory Valiant and
Paul Valiant},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Instance optimal learning of discrete distributions},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {142--155},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897641},
doi = {10.1145/2897518.2897641},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ValiantV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Xia16,
author = {Mingji Xia},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Base collapse of holographic algorithms},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {790--799},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897560},
doi = {10.1145/2897518.2897560},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Xia16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yu16,
author = {Huacheng Yu},
editor = {Daniel Wichs and
Yishay Mansour},
title = {Cell-probe lower bounds for dynamic problems via a new communication
model},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {362--374},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897556},
doi = {10.1145/2897518.2897556},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Yu16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Zhu16,
author = {Leqi Zhu},
editor = {Daniel Wichs and
Yishay Mansour},
title = {A tight space bound for consensus},
booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
pages = {345--350},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897565},
doi = {10.1145/2897518.2897565},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Zhu16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2016,
editor = {Daniel Wichs and
Yishay Mansour},
title = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
publisher = {{ACM}},
year = {2016},
url = {http://dl.acm.org/citation.cfm?id=2897518},
isbn = {978-1-4503-4132-5},
timestamp = {Fri, 10 Jun 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001G15,
author = {Richard Cole and
Vasilis Gkatzelis},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Approximating the Nash Social Welfare with Indivisible Items},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {371--380},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746589},
doi = {10.1145/2746539.2746589},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0001G15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0001L15,
author = {Abhishek Bhowmick and
Shachar Lovett},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {The List Decoding Radius of Reed-Muller Codes over Small Fields},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {277--285},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746543},
doi = {10.1145/2746539.2746543},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001L15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AaronsonA15,
author = {Scott Aaronson and
Andris Ambainis},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Forrelation: {A} Problem that Optimally Separates Quantum from Classical
Computing},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {307--316},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746547},
doi = {10.1145/2746539.2746547},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AaronsonA15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbbeSW15,
author = {Emmanuel Abbe and
Amir Shpilka and
Avi Wigderson},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Reed-Muller Codes for Random Erasures and Errors},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {297--306},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746575},
doi = {10.1145/2746539.2746575},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbbeSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudWY15,
author = {Amir Abboud and
Virginia Vassilevska Williams and
Huacheng Yu},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Matching Triangles and Basing Hardness on an Extremely Popular Conjecture},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {41--50},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746594},
doi = {10.1145/2746539.2746594},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AbboudWY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbdullahV15,
author = {Amirali Abdullah and
Suresh Venkatasubramanian},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {A Directed Isoperimetric Inequality with application to Bregman Near
Neighbor Lower Bounds},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {509--518},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746595},
doi = {10.1145/2746539.2746595},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AbdullahV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbrahamD15,
author = {Ittai Abraham and
Danny Dolev},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Byzantine Agreement with Optimal Early Stopping, Optimal Resilience
and Polynomial Complexity},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {605--614},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746581},
doi = {10.1145/2746539.2746581},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AbrahamD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AggarwalDKO15,
author = {Divesh Aggarwal and
Yevgeniy Dodis and
Tomasz Kazana and
Maciej Obremski},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Non-malleable Reductions and Applications},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {459--468},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746544},
doi = {10.1145/2746539.2746544},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AggarwalDKO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AggarwalDRS15,
author = {Divesh Aggarwal and
Daniel Dadush and
Oded Regev and
Noah Stephens{-}Davidowitz},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Solving the Shortest Vector Problem in 2\({}^{\mbox{n}}\) Time Using
Discrete Gaussian Sampling: Extended Abstract},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {733--742},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746606},
doi = {10.1145/2746539.2746606},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AggarwalDRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlstrupKTZ15,
author = {Stephen Alstrup and
Haim Kaplan and
Mikkel Thorup and
Uri Zwick},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {Adjacency Labeling Schemes and Induced-Universal Graphs},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {625--634},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746545},
doi = {10.1145/2746539.2746545},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlstrupKTZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlwenS15,
author = {Jo{\"{e}}l Alwen and
Vladimir Serbinenko},
editor = {Rocco A. Servedio and
Ronitt Rubinfeld},
title = {High Parallel Complexity Graphs and Memory-Hard Functions},
booktitle = {Proceedings of the Forty-Seventh Annual {ACM} on Symposium on Theory
of Computing, {STOC} 2015, Portland, OR, USA, June 14-17, 2015},
pages = {595--603},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2746539.2746622},
doi = {10.1145/2746539.2746622},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlwenS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
retrieved on 2024-04-20 01:52 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
