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:conf/focs:"
more than 1000 matches, exporting first 1000 hits only!
download as .bib file
@inproceedings{DBLP:conf/focs/00010W0Y23,
author = {Weiming Feng and
Heng Guo and
Chunyang Wang and
Jiaheng Wang and
Yitong Yin},
title = {Towards derandomising Markov chain Monte Carlo},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1963--1990},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00120},
doi = {10.1109/FOCS57990.2023.00120},
timestamp = {Tue, 02 Jan 2024 14:56:14 +0100},
biburl = {https://dblp.org/rec/conf/focs/00010W0Y23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001CW23,
author = {Yang Cai and
Ziyun Chen and
Jinzhao Wu},
title = {Simultaneous Auctions are Approximately Revenue-Optimal for Subadditive
Bidders},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {134--147},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00017},
doi = {10.1109/FOCS57990.2023.00017},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001CW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001GR23,
author = {Mohsen Ghaffari and
Christoph Grunau and
V{\'{a}}clav Rozhon},
title = {Work-Efficient Parallel Derandomization {I:} Chernoff-like Concentrations
via Pairwise Independence},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1551--1562},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00094},
doi = {10.1109/FOCS57990.2023.00094},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001GR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001H0TW23,
author = {Lijie Chen and
William M. Hoza and
Xin Lyu and
Avishay Tal and
Hongxun Wu},
title = {Weighted Pseudorandom Generators via Inverse Analysis of Random Walks
and Shortcutting},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1224--1239},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00072},
doi = {10.1109/FOCS57990.2023.00072},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001H0TW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001LORS23,
author = {Lijie Chen and
Zhenjian Lu and
Igor C. Oliveira and
Hanlin Ren and
Rahul Santhanam},
title = {Polynomial-Time Pseudodeterministic Construction of Primes},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1261--1270},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00074},
doi = {10.1109/FOCS57990.2023.00074},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/0001LORS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001MY23,
author = {Zachary Chase and
Shay Moran and
Amir Yehudayoff},
title = {Stability and Replicability in Learning},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2430--2439},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00148},
doi = {10.1109/FOCS57990.2023.00148},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001MY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001N023,
author = {Hiroshi Hirai and
Harold Nieuwboer and
Michael Walter},
title = {Interior-point methods on manifolds: theory and applications},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2021--2030},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00123},
doi = {10.1109/FOCS57990.2023.00123},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001N023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001PSY23,
author = {Anupam Gupta and
Madhusudhan Reddy Pittu and
Ola Svensson and
Rachel Yuan},
title = {The Price of Explainability for Clustering},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1131--1148},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00067},
doi = {10.1109/FOCS57990.2023.00067},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001PSY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001T023,
author = {Lijie Chen and
Roei Tell and
Ryan Williams},
title = {Derandomization vs Refutation: {A} Unified Framework for Characterizing
Derandomization},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1008--1047},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00062},
doi = {10.1109/FOCS57990.2023.00062},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/0001T023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001Z23,
author = {Michal Wlodarczyk and
Meirav Zehavi},
title = {Planar Disjoint Paths, Treewidth, and Kernels},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {649--662},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00044},
doi = {10.1109/FOCS57990.2023.00044},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001Z23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/00020W023,
author = {Zhao Song and
Baocheng Sun and
Omri Weinstein and
Ruizhe Zhang},
title = {Quartic Samples Suffice for Fourier Interpolation},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1414--1425},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00087},
doi = {10.1109/FOCS57990.2023.00087},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/00020W023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0002TWY23,
author = {Xin Lyu and
Avishay Tal and
Hongxun Wu and
Junzhao Yang},
title = {Tight Time-Space Lower Bounds for Constant-Pass Learning},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1195--1202},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00070},
doi = {10.1109/FOCS57990.2023.00070},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0002TWY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0003RT23,
author = {Itay Cohen and
Roy Roth and
Amnon Ta{-}Shma},
title = {{HDX} Condensers},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1649--1664},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00100},
doi = {10.1109/FOCS57990.2023.00100},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0003RT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0014PY23,
author = {Xiao Liang and
Omkant Pandey and
Takashi Yamakawa},
title = {A New Approach to Post-Quantum Non-Malleability},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {568--579},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00041},
doi = {10.1109/FOCS57990.2023.00041},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0014PY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbbasiBBCGKMSS23,
author = {Fateme Abbasi and
Sandip Banerjee and
Jaroslaw Byrka and
Parinya Chalermsook and
Ameet Gadekar and
Kamyar Khodamoradi and
D{\'{a}}niel Marx and
Roohani Sharma and
Joachim Spoerhase},
title = {Parameterized Approximation Schemes for Clustering with General Norm
Objectives},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1377--1399},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00085},
doi = {10.1109/FOCS57990.2023.00085},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbbasiBBCGKMSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbbeS23,
author = {Emmanuel Abbe and
Colin Sandon},
title = {A proof that Reed-Muller codes achieve Shannon capacity on symmetric
channels},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {177--193},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00020},
doi = {10.1109/FOCS57990.2023.00020},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbbeS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Abboud0PS23,
author = {Amir Abboud and
Jason Li and
Debmalya Panigrahi and
Thatchaphol Saranurak},
title = {All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu
Trees in Almost-Linear Time},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2204--2212},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00137},
doi = {10.1109/FOCS57990.2023.00137},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Abboud0PS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AcuavivaMNPS0W23,
author = {Arturo Acuaviva and
Visu Makam and
Harold Nieuwboer and
David P{\'{e}}rez{-}Garc{\'{\i}}a and
Friedrich Sittner and
Michael Walter and
Freek Witteveen},
title = {The minimal canonical form of a tensor network},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {328--362},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00027},
doi = {10.1109/FOCS57990.2023.00027},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AcuavivaMNPS0W23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Aden-AliCSZ23,
author = {Ishaq Aden{-}Ali and
Yeshwanth Cherapanamjeri and
Abhishek Shetty and
Nikita Zhivotovskiy},
title = {Optimal {PAC} Bounds without Uniform Convergence},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1203--1223},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00071},
doi = {10.1109/FOCS57990.2023.00071},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Aden-AliCSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Aggarwal023,
author = {Divesh Aggarwal and
Rajendra Kumar},
title = {Why we couldn't prove {SETH} hardness of the Closest Vector Problem
for even norms!},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2213--2230},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00138},
doi = {10.1109/FOCS57990.2023.00138},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Aggarwal023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AhmadinejadPPSV23,
author = {AmirMahdi Ahmadinejad and
John Peebles and
Edward Pyne and
Aaron Sidford and
Salil P. Vadhan},
title = {Singular Value Approximation and Sparsifying Random Walks on Directed
Graphs},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {846--854},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00054},
doi = {10.1109/FOCS57990.2023.00054},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AhmadinejadPPSV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanZ23,
author = {Josh Alman and
Hengjie Zhang},
title = {Generalizations of Matrix Multiplication can solve the Light Bulb
Problem},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1471--1495},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00090},
doi = {10.1109/FOCS57990.2023.00090},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AltschulerC23,
author = {Jason M. Altschuler and
Sinho Chewi},
title = {Faster high-accuracy log-concave sampling via algorithmic warm starts},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2169--2176},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00134},
doi = {10.1109/FOCS57990.2023.00134},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AltschulerC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniZ23,
author = {Alexandr Andoni and
Hengjie Zhang},
title = {Sub-quadratic (1+{\unicode{1013}})-approximate Euclidean Spanners,
with Applications},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {98--112},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00014},
doi = {10.1109/FOCS57990.2023.00014},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndoniZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ApplebaumN23,
author = {Benny Applebaum and
Oded Nir},
title = {Advisor-Verifier-Prover Games and the Hardness of Information Theoretic
Cryptography},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {539--555},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00039},
doi = {10.1109/FOCS57990.2023.00039},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ApplebaumN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ArnonCY23,
author = {Gal Arnon and
Alessandro Chiesa and
Eylon Yogev},
title = {IOPs with Inverse Polynomial Soundness Error},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {752--761},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00050},
doi = {10.1109/FOCS57990.2023.00050},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ArnonCY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AssadiS23,
author = {Sepehr Assadi and
Janani Sundaresan},
title = {Hidden Permutations to the Rescue: Multi-Pass Streaming Lower Bounds
for Approximate Matchings},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {909--932},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00058},
doi = {10.1109/FOCS57990.2023.00058},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AssadiS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BabbushBKSW23,
author = {Ryan Babbush and
Dominic W. Berry and
Robin Kothari and
Rolando D. Somma and
Nathan Wiebe},
title = {Exponential quantum speedup in simulating coupled classical oscillators\({}^{\mbox{*}}\)},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {405--414},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00030},
doi = {10.1109/FOCS57990.2023.00030},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BabbushBKSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BakshiN23,
author = {Ainesh Bakshi and
Shyam Narayanan},
title = {Krylov Methods are (nearly) Optimal for Low-Rank Approximation},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2093--2101},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00128},
doi = {10.1109/FOCS57990.2023.00128},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BakshiN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BallGDM23,
author = {Marshall Ball and
Eli Goldin and
Dana Dachman{-}Soled and
Saachi Mutreja},
title = {Extracting Randomness from Samplable Distributions, Revisited},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1505--1514},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00092},
doi = {10.1109/FOCS57990.2023.00092},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BallGDM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BallLMP23,
author = {Marshall Ball and
Yanyi Liu and
Noam Mazor and
Rafael Pass},
title = {Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity
and Key-Agreement},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {458--483},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00034},
doi = {10.1109/FOCS57990.2023.00034},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BallLMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BehnezhadRR23,
author = {Soheil Behnezhad and
Mohammad Roghani and
Aviad Rubinstein},
title = {Local Computation Algorithms for Maximum Matching: New Lower Bounds},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2322--2335},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00143},
doi = {10.1109/FOCS57990.2023.00143},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BehnezhadRR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Bercea0KHT23,
author = {Ioana O. Bercea and
Lorenzo Beretta and
Jonas Klausen and
Jakob B{\ae}k Tejs Houen and
Mikkel Thorup},
title = {Locally Uniform Hashing},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1440--1470},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00089},
doi = {10.1109/FOCS57990.2023.00089},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Bercea0KHT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhattacharyaBLS23,
author = {Sayan Bhattacharya and
Niv Buchbinder and
Roie Levin and
Thatchaphol Saranurak},
title = {Chasing Positive Bodies},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1694--1714},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00103},
doi = {10.1109/FOCS57990.2023.00103},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhattacharyaBLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhattacharyaKS23,
author = {Sayan Bhattacharya and
Peter Kiss and
Thatchaphol Saranurak},
title = {Dynamic (1+{\unicode{1013}})-Approximate Matching Size in Truly Sublinear
Update Time},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1563--1588},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00095},
doi = {10.1109/FOCS57990.2023.00095},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhattacharyaKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlackC023,
author = {Hadley Black and
Deeparnab Chakrabarty and
C. Seshadhri},
title = {A d\({}^{\mbox{1/2+o(1)}}\) Monotonicity Tester for Boolean Functions
on d-Dimensional Hypergrids},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1796--1821},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00110},
doi = {10.1109/FOCS57990.2023.00110},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlackC023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlaisS23,
author = {Eric Blais and
Cameron Seth},
title = {Testing Graph Properties with the Container Method},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1787--1795},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00109},
doi = {10.1109/FOCS57990.2023.00109},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlaisS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlancKST23,
author = {Guy Blanc and
Caleb Koch and
Carmen Strassle and
Li{-}Yang Tan},
title = {A strong composition theorem for junta complexity and the boosting
of property testers},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1757--1777},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00107},
doi = {10.1109/FOCS57990.2023.00107},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlancKST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlancaG23,
author = {Antonio Blanca and
Reza Gheissari},
title = {Sampling from the Potts model at low temperatures via Swendsen-Wang
dynamics},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2006--2020},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00122},
doi = {10.1109/FOCS57990.2023.00122},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlancaG23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BodwinH23,
author = {Greg Bodwin and
Gary Hoppenworth},
title = {Folklore Sampling is Optimal for Exact Hopsets: Confirming the {\(\surd\)}n
Barrier},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {701--720},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00046},
doi = {10.1109/FOCS57990.2023.00046},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BodwinH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BodwinHT23,
author = {Greg Bodwin and
Gary Hoppenworth and
Ohad Trabelsi},
title = {Bridge Girth: {A} Unifying Notion in Network Design},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {600--648},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00043},
doi = {10.1109/FOCS57990.2023.00043},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BodwinHT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BozzaiRR23,
author = {Rainie Bozzai and
Victor Reis and
Thomas Rothvoss},
title = {The Vector Balancing Constant for Zonotopes},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1292--1300},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00077},
doi = {10.1109/FOCS57990.2023.00077},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BozzaiRR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrakensiekHPZ23,
author = {Joshua Brakensiek and
Neng Huang and
Aaron Potechin and
Uri Zwick},
title = {Separating {MAX} 2-AND, {MAX} {DI-CUT} and {MAX} {CUT}},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {234--252},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00023},
doi = {10.1109/FOCS57990.2023.00023},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrakensiekHPZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Brand0PKLGSS23,
author = {Jan van den Brand and
Li Chen and
Richard Peng and
Rasmus Kyng and
Yang P. Liu and
Maximilian Probst Gutenberg and
Sushant Sachdeva and
Aaron Sidford},
title = {A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {503--514},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00037},
doi = {10.1109/FOCS57990.2023.00037},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Brand0PKLGSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrandK23,
author = {Jan van den Brand and
Adam Karczmarz},
title = {Deterministic Fully Dynamic {SSSP} and More},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2312--2321},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00142},
doi = {10.1109/FOCS57990.2023.00142},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrandK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrandZ23,
author = {Jan van den Brand and
Daniel J. Zhang},
title = {Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {493--502},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00036},
doi = {10.1109/FOCS57990.2023.00036},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrandZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanKM23,
author = {Mark Braverman and
Subhash Khot and
Dor Minzer},
title = {Parallel Repetition for the {GHZ} Game: Exponential Decay},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1337--1341},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00080},
doi = {10.1109/FOCS57990.2023.00080},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BreslerGP23,
author = {Guy Bresler and
Chenghao Guo and
Yury Polyanskiy},
title = {Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs:
The Case of Extra Triangles},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2149--2158},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00132},
doi = {10.1109/FOCS57990.2023.00132},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BreslerGP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BringmannCF23,
author = {Karl Bringmann and
Alejandro Cassis and
Nick Fischer},
title = {Negative-Weight Single-Source Shortest Paths in Near-Linear Time:
Now Faster!},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {515--538},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00038},
doi = {10.1109/FOCS57990.2023.00038},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BringmannCF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrowneKMP23,
author = {Reilly Browne and
Prahlad Narasimhan Kasthurirangan and
Joseph S. B. Mitchell and
Valentin Polishchuk},
title = {Constant-Factor Approximation Algorithms for Convex Cover and Hidden
Set in a Simple Polygon},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1357--1365},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00083},
doi = {10.1109/FOCS57990.2023.00083},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrowneKMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BuschCFHHR23,
author = {Costas Busch and
Da Qi Chen and
Arnold Filtser and
Daniel Hathcock and
D. Ellis Hershkowitz and
Rajmohan Rajaraman},
title = {One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {60--76},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00012},
doi = {10.1109/FOCS57990.2023.00012},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BuschCFHHR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CanonneH0LN23,
author = {Cl{\'{e}}ment L. Canonne and
Samuel B. Hopkins and
Jerry Li and
Allen Liu and
Shyam Narayanan},
title = {The Full Landscape of Robust Mean Testing: Sharp Separations between
Oblivious and Adaptive Contamination},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2159--2168},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00133},
doi = {10.1109/FOCS57990.2023.00133},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CanonneH0LN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CarmesinK23,
author = {Johannes Carmesin and
Jan Kurkofka},
title = {Canonical decompositions of 3-connected graphs},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1887--1920},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00115},
doi = {10.1109/FOCS57990.2023.00115},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CarmesinK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CarmonJJLLST23,
author = {Yair Carmon and
Arun Jambulapati and
Yujia Jin and
Yin Tat Lee and
Daogao Liu and
Aaron Sidford and
Kevin Tian},
title = {ReSQueing Parallel and Private Stochastic Convex Optimization},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2031--2058},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00124},
doi = {10.1109/FOCS57990.2023.00124},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CarmonJJLLST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CassisKW23,
author = {Alejandro Cassis and
Tomasz Kociumaka and
Philip Wellnitz},
title = {Optimal Algorithms for Bounded Weighted Edit Distance},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2177--2187},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00135},
doi = {10.1109/FOCS57990.2023.00135},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CassisKW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chan0WX23,
author = {Timothy M. Chan and
Ce Jin and
Virginia Vassilevska Williams and
Yinzhan Xu},
title = {Faster Algorithms for Text-to-Pattern Hamming Distances},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2188--2203},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00136},
doi = {10.1109/FOCS57990.2023.00136},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Chan0WX23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChangCLMST23,
author = {Hsien{-}Chih Chang and
Jonathan Conroy and
Hung Le and
Lazar Milenkovic and
Shay Solomon and
Cuong Than},
title = {Covering Planar Metrics (and Beyond): {O(1)} Trees Suffice},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2231--2261},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00139},
doi = {10.1109/FOCS57990.2023.00139},
timestamp = {Sun, 05 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChangCLMST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChatziafratisM23,
author = {Vaggos Chatziafratis and
Konstantin Makarychev},
title = {Triplet Reconstruction and all other Phylogenetic CSPs are Approximation
Resistant},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {253--284},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00024},
doi = {10.1109/FOCS57990.2023.00024},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChatziafratisM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chen0Y23,
author = {Xiaoyu Chen and
Jingcheng Liu and
Yitong Yin},
title = {Uniqueness and Rapid Mixing in the Bipartite Hardcore Model (extended
abstract)},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1991--2005},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00121},
doi = {10.1109/FOCS57990.2023.00121},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Chen0Y23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenH0LS23,
author = {Sitan Chen and
Brice Huang and
Jerry Li and
Allen Liu and
Mark Sellke},
title = {When Does Adaptivity Help for Quantum State Learning?},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {391--404},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00029},
doi = {10.1109/FOCS57990.2023.00029},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenH0LS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenLMM23,
author = {Zongchen Chen and
Kuikui Liu and
Nitya Mani and
Ankur Moitra},
title = {Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {810--845},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00053},
doi = {10.1109/FOCS57990.2023.00053},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenLMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenP23,
author = {Xi Chen and
Binghui Peng},
title = {Memory-Query Tradeoffs for Randomized Convex Optimization},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1400--1413},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00086},
doi = {10.1109/FOCS57990.2023.00086},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenP23a,
author = {Xi Chen and
Shyamal Patel},
title = {New Lower Bounds for Adaptive Tolerant Junta Testing},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1778--1786},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00108},
doi = {10.1109/FOCS57990.2023.00108},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenP23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChewiP00N23,
author = {Sinho Chewi and
Jaume de Dios Pont and
Jerry Li and
Chen Lu and
Shyam Narayanan},
title = {Query lower bounds for log-concave sampling},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2139--2148},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00131},
doi = {10.1109/FOCS57990.2023.00131},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChewiP00N23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CiniW23,
author = {Valerio Cini and
Hoeteck Wee},
title = {{ABE} for Circuits with poly ({\(\lambda\)}) -sized Keys from {LWE}},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {435--446},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00032},
doi = {10.1109/FOCS57990.2023.00032},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CiniW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadL0N23,
author = {Vincent Cohen{-}Addad and
Euiwoong Lee and
Shi Li and
Alantha Newman},
title = {Handling Correlated Rounding Error via Preclustering: {A} 1.73-approximation
for Correlation Clustering},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1082--1104},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00065},
doi = {10.1109/FOCS57990.2023.00065},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadL0N23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadLPP23,
author = {Vincent Cohen{-}Addad and
Hung Le and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {Planar and Minor-Free Metrics Embed into Metrics of Polylogarithmic
Treewidth with Expected Multiplicative Distortion Arbitrarily Close
to 1},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2262--2277},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00140},
doi = {10.1109/FOCS57990.2023.00140},
timestamp = {Sun, 05 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadLPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadSS23,
author = {Vincent Cohen{-}Addad and
David Saulpic and
Chris Schwiegelshohn},
title = {Deterministic Clustering in High Dimensional Spaces: Sketches and
Approximation},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1105--1130},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00066},
doi = {10.1109/FOCS57990.2023.00066},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadSS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadWZ23,
author = {Vincent Cohen{-}Addad and
David P. Woodruff and
Samson Zhou},
title = {Streaming Euclidean k-median and k-means with o(log n) Space},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {883--908},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00057},
doi = {10.1109/FOCS57990.2023.00057},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadWZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ConnerydRNPR23,
author = {Jonas Conneryd and
Susanna F. de Rezende and
Jakob Nordstr{\"{o}}m and
Shuo Pang and
Kilian Risse},
title = {Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1--11},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00007},
doi = {10.1109/FOCS57990.2023.00007},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ConnerydRNPR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DuanMSY23,
author = {Ran Duan and
Jiayi Mao and
Xinkai Shu and
Longhui Yin},
title = {A Randomized Algorithm for Single-Source Shortest Path on Undirected
Real-Weighted Graphs},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {484--492},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00035},
doi = {10.1109/FOCS57990.2023.00035},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DuanMSY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DuanWZ23,
author = {Ran Duan and
Hongxun Wu and
Renfei Zhou},
title = {Faster Matrix Multiplication via Asymmetric Hashing},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2129--2138},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00130},
doi = {10.1109/FOCS57990.2023.00130},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DuanWZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DujmovicEMW23,
author = {Vida Dujmovic and
Louis Esperet and
Pat Morin and
David R. Wood},
title = {Proof of the Clustered Hadwiger Conjecture},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1921--1930},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00116},
doi = {10.1109/FOCS57990.2023.00116},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DujmovicEMW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EdenFGMM23,
author = {Alon Eden and
Michal Feldman and
Kira Goldner and
Simon Mauras and
Divyarthi Mohan},
title = {Constant Approximation for Private Interdependent Valuations},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {148--163},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00018},
doi = {10.1109/FOCS57990.2023.00018},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EdenFGMM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ElkinS23,
author = {Michael Elkin and
Idan Shabat},
title = {Path-Reporting Distance Oracles with Logarithmic Stretch and Size
O(n log log n)},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2278--2311},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00141},
doi = {10.1109/FOCS57990.2023.00141},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ElkinS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FoxL23,
author = {Emily Fox and
Jiashuai Lu},
title = {A deterministic near-linear time approximation scheme for geometric
transportation},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1301--1315},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00078},
doi = {10.1109/FOCS57990.2023.00078},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FoxL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ghadiri23,
author = {Mehrdad Ghadiri},
title = {On Symmetric Factorizations of Hankel Matrices},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2081--2092},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00127},
doi = {10.1109/FOCS57990.2023.00127},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ghadiri23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GhadiriPV23,
author = {Mehrdad Ghadiri and
Richard Peng and
Santosh S. Vempala},
title = {The Bit Complexity of Efficient Continuous Optimization},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2059--2070},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00125},
doi = {10.1109/FOCS57990.2023.00125},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GhadiriPV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GhaziIK0M23,
author = {Badih Ghazi and
Rahul Ilango and
Pritish Kamath and
Ravi Kumar and
Pasin Manurangsi},
title = {Towards Separating Computational and Statistical Differential Privacy},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {580--599},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00042},
doi = {10.1109/FOCS57990.2023.00042},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GhaziIK0M23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GhoshHH0S23,
author = {Sumanta Ghosh and
Prahladh Harsha and
Simao Herdade and
Mrinal Kumar and
Ramprasad Saptharishi},
title = {Fast Numerical Multivariate Multipoint Evaluation},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1426--1439},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00088},
doi = {10.1109/FOCS57990.2023.00088},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GhoshHH0S23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GhoshalL23,
author = {Suprovat Ghoshal and
Euiwoong Lee},
title = {On Lifting Integrality Gaps to {SSEH} Hardness for Globally Constrained
CSPs},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {26--36},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00009},
doi = {10.1109/FOCS57990.2023.00009},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GhoshalL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GirishST023,
author = {Uma Girish and
Makrand Sinha and
Avishay Tal and
Kewen Wu},
title = {Fourier Growth of Communication Protocols for {XOR} Functions},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {721--732},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00047},
doi = {10.1109/FOCS57990.2023.00047},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GirishST023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Golowich23,
author = {Louis Golowich},
title = {From Grassmannian to Simplicial High-Dimensional Expanders},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1639--1648},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00099},
doi = {10.1109/FOCS57990.2023.00099},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Golowich23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoosRS023,
author = {Mika G{\"{o}}{\"{o}}s and
Artur Riazanov and
Anastasia Sofronova and
Dmitry Sokolov},
title = {Top-Down Lower Bounds for Depth-Four Circuits},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1048--1055},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00063},
doi = {10.1109/FOCS57990.2023.00063},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoosRS023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GraurJS23,
author = {Andrei Graur and
Haotian Jiang and
Aaron Sidford},
title = {Sparse Submodular Function Minimization},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2071--2080},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00126},
doi = {10.1109/FOCS57990.2023.00126},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GraurJS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GravinST23,
author = {Nick Gravin and
Enze Sun and
Zhihao Gavin Tang},
title = {Online Ordinal Problems: Optimality of Comparison-based Algorithms
and their Cardinal Complexity},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1863--1876},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00113},
doi = {10.1109/FOCS57990.2023.00113},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GravinST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GroheLNS23,
author = {Martin Grohe and
Moritz Lichter and
Daniel Neuen and
Pascal Schweitzer},
title = {Compressing {CFI} Graphs and Lower Bounds for the Weisfeiler-Leman
Refinements},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {798--809},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00052},
doi = {10.1109/FOCS57990.2023.00052},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GroheLNS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GrossmanGS23,
author = {Ofer Grossman and
Meghal Gupta and
Mark Sellke},
title = {Tight Space Lower Bound for Pseudo-Deterministic Approximate Counting},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1496--1504},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00091},
doi = {10.1109/FOCS57990.2023.00091},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GrossmanGS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuoZ23,
author = {Zeyu Guo and
Zihan Zhang},
title = {Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity
over Polynomial-Size Alphabets},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {164--176},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00019},
doi = {10.1109/FOCS57990.2023.00019},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GuoZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiHKM23,
author = {Venkatesan Guruswami and
Jun{-}Ting Hsieh and
Pravesh K. Kothari and
Peter Manohar},
title = {Efficient Algorithms for Semirandom Planted CSPs at the Refutation
Threshold},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {307--327},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00026},
doi = {10.1109/FOCS57990.2023.00026},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiHKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaahKOT23,
author = {Jeongwan Haah and
Robin Kothari and
Ryan O'Donnell and
Ewin Tang},
title = {Query-optimal estimation of unitary channels in diamond distance},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {363--390},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00028},
doi = {10.1109/FOCS57990.2023.00028},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HaahKOT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Hastad23,
author = {Johan H{\aa}stad},
title = {On small-depth Frege proofs for {PHP}},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {37--49},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00010},
doi = {10.1109/FOCS57990.2023.00010},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Hastad23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HermanR23,
author = {Tal Herman and
Guy N. Rothblum},
title = {Doubley-Efficient Interactive Proofs for Distribution Properties},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {743--751},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00049},
doi = {10.1109/FOCS57990.2023.00049},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HermanR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HiraharaN23,
author = {Shuichi Hirahara and
Mikito Nanashima},
title = {Learning in Pessiland via Inductive Inference},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {447--457},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00033},
doi = {10.1109/FOCS57990.2023.00033},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HiraharaN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HollenderR23,
author = {Alexandros Hollender and
Aviad Rubinstein},
title = {Envy-Free Cake-Cutting for Four Agents},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {113--122},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00015},
doi = {10.1109/FOCS57990.2023.00015},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HollenderR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HsiehLL23,
author = {Yao{-}Ching Hsieh and
Huijia Lin and
Ji Luo},
title = {Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {415--434},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00031},
doi = {10.1109/FOCS57990.2023.00031},
timestamp = {Wed, 07 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HsiehLL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ilango23,
author = {Rahul Ilango},
title = {{SAT} Reduces to the Minimum Circuit Size Problem with a Random Oracle},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {733--742},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00048},
doi = {10.1109/FOCS57990.2023.00048},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ilango23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JainMPV23,
author = {Vishesh Jain and
Marcus Michelen and
Huy Tuan Pham and
Thuy{-}Duong Vuong},
title = {Optimal mixing of the down-up walk on independent sets of a given
size},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1665--1681},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00101},
doi = {10.1109/FOCS57990.2023.00101},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JainMPV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JambulapatiLLS23,
author = {Arun Jambulapati and
James R. Lee and
Yang P. Liu and
Aaron Sidford},
title = {Sparsifying Sums of Norms},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1953--1962},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00119},
doi = {10.1109/FOCS57990.2023.00119},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JambulapatiLLS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JeronimoST23,
author = {Fernando Granha Jeronimo and
Shashank Srivastava and
Madhur Tulsiani},
title = {List Decoding of Tanner and Expander Amplified Codes from Distance
Certificates},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1682--1693},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00102},
doi = {10.1109/FOCS57990.2023.00102},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JeronimoST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JiaKV23,
author = {He Jia and
Pravesh K. Kothari and
Santosh S. Vempala},
title = {Beyond Moments: Robustly Learning Affine Transformations with Asymptotically
Optimal Error},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2408--2429},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00147},
doi = {10.1109/FOCS57990.2023.00147},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JiaKV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JiangPW23,
author = {Shunhua Jiang and
Binghui Peng and
Omri Weinstein},
title = {The Complexity of Dynamic Least-Squares Regression},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1605--1627},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00097},
doi = {10.1109/FOCS57990.2023.00097},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JiangPW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JohnstonLV23,
author = {Nathaniel Johnston and
Benjamin Lovitz and
Aravindan Vijayaraghavan},
title = {Computing linear sections of varieties: quantum entanglement, tensor
decompositions and beyond},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1316--1336},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00079},
doi = {10.1109/FOCS57990.2023.00079},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JohnstonLV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JungeblutMU23,
author = {Paul Jungeblut and
Laura Merker and
Torsten Ueckerdt},
title = {Directed Acyclic Outerplanar Graphs Have Constant Stack Number},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1937--1952},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00118},
doi = {10.1109/FOCS57990.2023.00118},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/JungeblutMU23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KachamPTW23,
author = {Praneeth Kacham and
Rasmus Pagh and
Mikkel Thorup and
David P. Woodruff},
title = {Pseudorandom Hashing for Space-bounded Computation with Applications
in Streaming},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1515--1550},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00093},
doi = {10.1109/FOCS57990.2023.00093},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KachamPTW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KarczmarzS23,
author = {Adam Karczmarz and
Piotr Sankowski},
title = {Sensitivity and Dynamic Distance Oracles via Generic Matrices and
Frobenius Form},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1745--1756},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00106},
doi = {10.1109/FOCS57990.2023.00106},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KarczmarzS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KelleyM23,
author = {Zander Kelley and
Raghu Meka},
title = {Strong Bounds for 3-Progressions},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {933--973},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00059},
doi = {10.1109/FOCS57990.2023.00059},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KelleyM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kelner0LST23,
author = {Jonathan A. Kelner and
Jerry Li and
Allen Liu and
Aaron Sidford and
Kevin Tian},
title = {Matrix Completion in Almost-Verification Time},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2102--2128},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00129},
doi = {10.1109/FOCS57990.2023.00129},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kelner0LST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KempaK23,
author = {Dominik Kempa and
Tomasz Kociumaka},
title = {Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays
in Optimal Compressed Space},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1877--1886},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00114},
doi = {10.1109/FOCS57990.2023.00114},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KempaK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Klein23,
author = {Ohad Klein},
title = {Slicing all Edges of an n-cube Requires n\({}^{\mbox{2/3}}\) Hyperplanes},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1931--1936},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00117},
doi = {10.1109/FOCS57990.2023.00117},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Klein23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KleinO23,
author = {Nathan Klein and
Neil Olver},
title = {Thin Trees for Laminar Families},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {50--59},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00011},
doi = {10.1109/FOCS57990.2023.00011},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KleinO23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KochST23,
author = {Caleb Koch and
Carmen Strassle and
Li{-}Yang Tan},
title = {Properly learning decision trees with queries is NP-hard},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2383--2407},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00146},
doi = {10.1109/FOCS57990.2023.00146},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KochST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kociumaka0S23,
author = {Tomasz Kociumaka and
Anish Mukherjee and
Barna Saha},
title = {Approximating Edit Distance in the Fully Dynamic Model},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1628--1638},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00098},
doi = {10.1109/FOCS57990.2023.00098},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kociumaka0S23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KorhonenMNP023,
author = {Tuukka Korhonen and
Konrad Majewski and
Wojciech Nadara and
Michal Pilipczuk and
Marek Sokolowski},
title = {Dynamic treewidth},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1734--1744},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00105},
doi = {10.1109/FOCS57990.2023.00105},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KorhonenMNP023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KulikMS23,
author = {Ariel Kulik and
Matthias Mnich and
Hadas Shachnai},
title = {Improved Approximations for Vector Bin Packing via Iterative Randomized
Rounding},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1366--1376},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00084},
doi = {10.1109/FOCS57990.2023.00084},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KulikMS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KumabeY23,
author = {Soh Kumabe and
Yuichi Yoshida},
title = {Lipschitz Continuous Algorithms for Graph Problems},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {762--797},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00051},
doi = {10.1109/FOCS57990.2023.00051},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KumabeY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kuszmaul23,
author = {William Kuszmaul},
title = {Strongly History-Independent Storage Allocation: New Upper and Lower
Bounds},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1822--1841},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00111},
doi = {10.1109/FOCS57990.2023.00111},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kuszmaul23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LangeV23,
author = {Jane Lange and
Arsen Vasilyan},
title = {Agnostic proper learning of monotone functions: beyond the black-box
correction barrier},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1149--1170},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00068},
doi = {10.1109/FOCS57990.2023.00068},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LangeV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LarsenY23,
author = {Kasper Green Larsen and
Huacheng Yu},
title = {Super-Logarithmic Lower Bounds for Dynamic Graph Problems},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1589--1604},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00096},
doi = {10.1109/FOCS57990.2023.00096},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LarsenY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeST23,
author = {Hung Le and
Shay Solomon and
Cuong Than},
title = {Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics:
Breaking the {\(\Omega\)} (log n) Lightness Barrier},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {77--97},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00013},
doi = {10.1109/FOCS57990.2023.00013},
timestamp = {Sun, 05 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/LeST23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Li23,
author = {Xin Li},
title = {Two Source Extractors for Asymptotically Optimal Entropy, and (Many)
More},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1271--1281},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00075},
doi = {10.1109/FOCS57990.2023.00075},
timestamp = {Sat, 13 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Li23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiLYZ23,
author = {Tianxiao Li and
Jingxun Liang and
Huacheng Yu and
Renfei Zhou},
title = {Dynamic "Succincter"},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1715--1733},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00104},
doi = {10.1109/FOCS57990.2023.00104},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiLYZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiLYZ23a,
author = {Tianxiao Li and
Jingxun Liang and
Huacheng Yu and
Renfei Zhou},
title = {Tight Cell-Probe Lower Bounds for Dynamic Succinct Dictionaries},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1842--1862},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00112},
doi = {10.1109/FOCS57990.2023.00112},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiLYZ23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LinRSW23,
author = {Bingkai Lin and
Xuandi Ren and
Yican Sun and
Xiuhan Wang},
title = {Improved Hardness of Approximating k-Clique under {ETH}},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {285--306},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00025},
doi = {10.1109/FOCS57990.2023.00025},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/LinRSW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LovettZ23,
author = {Shachar Lovett and
Jiapeng Zhang},
title = {Streaming Lower Bounds and Asymmetric Set-Disjointness},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {871--882},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00056},
doi = {10.1109/FOCS57990.2023.00056},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LovettZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Meir23,
author = {Or Meir},
title = {Toward Better Depth Lower Bounds: {A} KRW-like theorem for Strong
Composition},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1056--1081},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00064},
doi = {10.1109/FOCS57990.2023.00064},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Meir23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MerinoM23,
author = {Arturo I. Merino and
Torsten M{\"{u}}tze},
title = {Traversing combinatorial 0/1-polytopes via optimization},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1282--1291},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00076},
doi = {10.1109/FOCS57990.2023.00076},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MerinoM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MetgerY23,
author = {Tony Metger and
Henry Yuen},
title = {stateQIP = statePSPACE},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1349--1356},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00082},
doi = {10.1109/FOCS57990.2023.00082},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MetgerY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MinzerZ23,
author = {Dor Minzer and
Kai Zhe Zheng},
title = {Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {206--233},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00022},
doi = {10.1109/FOCS57990.2023.00022},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MinzerZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NatarajanZ23,
author = {Anand Natarajan and
Tina Zhang},
title = {Bounding the Quantum Value of Compiled Nonlocal Games: From {CHSH}
to {BQP} Verification},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1342--1348},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00081},
doi = {10.1109/FOCS57990.2023.00081},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NatarajanZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ODonnellS023,
author = {Ryan O'Donnell and
Rocco A. Servedio and
Pedro Paredes},
title = {Explicit orthogonal and unitary designs},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1240--1260},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00073},
doi = {10.1109/FOCS57990.2023.00073},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ODonnellS023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/OlverSK23,
author = {Neil Olver and
Leon Sering and
Laura Vargas Koch},
title = {Convergence of Approximate and Packet Routing Equilibria to Nash Flows
Over Time},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {123--133},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00016},
doi = {10.1109/FOCS57990.2023.00016},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/OlverSK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Parter23,
author = {Merav Parter},
title = {Secure Computation Meets Distributed Universal Optimality},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2336--2368},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00144},
doi = {10.1109/FOCS57990.2023.00144},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Parter23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PengR23,
author = {Binghui Peng and
Aviad Rubinstein},
title = {Near Optimal Memory-Regret Tradeoff for Online Learning},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {1171--1194},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00069},
doi = {10.1109/FOCS57990.2023.00069},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PengR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PyneRZ23,
author = {Edward Pyne and
Ran Raz and
Wei Zhan},
title = {Certified Hardness vs. Randomness for Log-Space},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {989--1007},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00061},
doi = {10.1109/FOCS57990.2023.00061},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PyneRZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ReisR23,
author = {Victor Reis and
Thomas Rothvoss},
title = {The Subspace Flatness Conjecture and Faster Integer Programming},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {974--988},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00060},
doi = {10.1109/FOCS57990.2023.00060},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ReisR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RezendePR23,
author = {Susanna F. de Rezende and
Aaron Potechin and
Kilian Risse},
title = {Clique Is Hard on Average for Unary Sherali-Adams},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {12--25},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00008},
doi = {10.1109/FOCS57990.2023.00008},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RezendePR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RichelsonR23,
author = {Silas Richelson and
Sourya Roy},
title = {Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal
Binary Codes},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {194--205},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00021},
doi = {10.1109/FOCS57990.2023.00021},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RichelsonR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RuzomberkaNBP23,
author = {Eric Ruzomberka and
Homa Nikbakht and
Christopher G. Brinton and
H. Vincent Poor},
title = {On Pseudolinear Codes for Correcting Adversarial Errors},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {556--567},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00040},
doi = {10.1109/FOCS57990.2023.00040},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RuzomberkaNBP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SahS23,
author = {Ashwin Sah and
Mehtaab Sawhney},
title = {Distribution of the threshold for the symmetric perceptron},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {2369--2382},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00145},
doi = {10.1109/FOCS57990.2023.00145},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SahS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SaxenaS0V23,
author = {Raghuvansh R. Saxena and
Noah G. Singer and
Madhu Sudan and
Santhoshini Velusamy},
title = {Improved Streaming Algorithms for Maximum Directed Cut via Smoothed
Snapshots},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {855--870},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00055},
doi = {10.1109/FOCS57990.2023.00055},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SaxenaS0V23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Torunczyk23,
author = {Szymon Torunczyk},
title = {Flip-width: Cops and Robber on dense graphs},
booktitle = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
pages = {663--700},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023.00045},
doi = {10.1109/FOCS57990.2023.00045},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Torunczyk23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2023,
title = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2023, Santa Cruz, CA, USA, November 6-9, 2023},
publisher = {{IEEE}},
year = {2023},
url = {https://doi.org/10.1109/FOCS57990.2023},
doi = {10.1109/FOCS57990.2023},
isbn = {979-8-3503-1894-4},
timestamp = {Tue, 02 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/000122,
author = {Mohsen Ghaffari},
title = {Local Computation of Maximal Independent Set},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {438--449},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00049},
doi = {10.1109/FOCS54457.2022.00049},
timestamp = {Sat, 31 Dec 2022 17:14:50 +0100},
biburl = {https://dblp.org/rec/conf/focs/000122.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001GHKSS22,
author = {Debarati Das and
Jacob Gilbert and
MohammadTaghi Hajiaghayi and
Tomasz Kociumaka and
Barna Saha and
Hamed Saleh},
title = {{\~{O}}(n+poly(k))-time Algorithm for Bounded Tree Edit Distance},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {686--697},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00071},
doi = {10.1109/FOCS54457.2022.00071},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/0001GHKSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001K22,
author = {Nikhil Bansal and
William Kuszmaul},
title = {Balanced Allocations: The Heavily Loaded Case with Deletions},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {801--812},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00081},
doi = {10.1109/FOCS54457.2022.00081},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001K22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001RT22,
author = {Lijie Chen and
Ron D. Rothblum and
Roei Tell},
title = {Unstructured Hardness to Average-Case Randomness},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {429--437},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00048},
doi = {10.1109/FOCS54457.2022.00048},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001RT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0002J22,
author = {Abhishek Jain and
Zhengzhong Jin},
title = {Indistinguishability Obfuscation via Mathematical Proofs of Equivalence},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1023--1034},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00100},
doi = {10.1109/FOCS54457.2022.00100},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0002J22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudK0PST22,
author = {Amir Abboud and
Robert Krauthgamer and
Jason Li and
Debmalya Panigrahi and
Thatchaphol Saranurak and
Ohad Trabelsi},
title = {Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree
in Nearly Quadratic Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {884--895},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00088},
doi = {10.1109/FOCS54457.2022.00088},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbboudK0PST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlaouiMS22,
author = {Ahmed El Alaoui and
Andrea Montanari and
Mark Sellke},
title = {Sampling from the Sherrington-Kirkpatrick Gibbs measure via algorithmic
stochastic localization},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {323--334},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00038},
doi = {10.1109/FOCS54457.2022.00038},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AlaouiMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AllamigeonDLNV22,
author = {Xavier Allamigeon and
Daniel Dadush and
Georg Loho and
Bento Natura and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Interior point methods are not worse than Simplex},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {267--277},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00032},
doi = {10.1109/FOCS54457.2022.00032},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AllamigeonDLNV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnariLV22,
author = {Nima Anari and
Yang P. Liu and
Thuy{-}Duong Vuong},
title = {Optimal Sublinear Sampling of Spanning Trees and Determinantal Point
Processes via Average-Case Entropic Independence},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {123--134},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00019},
doi = {10.1109/FOCS54457.2022.00019},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AnariLV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Anastos22,
author = {Michael Anastos},
title = {Solving the Hamilton cycle problem fast on average},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {919--930},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00091},
doi = {10.1109/FOCS54457.2022.00091},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Anastos22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniNS022,
author = {Alexandr Andoni and
Negev Shekel Nosatzki and
Sandip Sinha and
Clifford Stein},
title = {Estimating the Longest Increasing Subsequence in Nearly Optimal Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {708--719},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00073},
doi = {10.1109/FOCS54457.2022.00073},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndoniNS022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Andrews22,
author = {Robert Andrews},
title = {On Matrix Multiplication and Polynomial Identity Testing},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {356--365},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00041},
doi = {10.1109/FOCS54457.2022.00041},
timestamp = {Tue, 10 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Andrews22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ApersEGLMN22,
author = {Simon Apers and
Yuval Efron and
Pawel Gawrychowski and
Troy Lee and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Cut Query Algorithms with Star Contraction},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {507--518},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00055},
doi = {10.1109/FOCS54457.2022.00055},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ApersEGLMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AssadiK022,
author = {Sepehr Assadi and
Gillat Kol and
Zhijun Zhang},
title = {Rounds vs Communication Tradeoffs for Maximal Independent Sets},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1193--1204},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00115},
doi = {10.1109/FOCS54457.2022.00115},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AssadiK022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BafnaHKX22,
author = {Mitali Bafna and
Jun{-}Ting Hsieh and
Pravesh K. Kothari and
Jeff Xu},
title = {Polynomial-Time Power-Sum Decomposition of Polynomials},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {956--967},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00094},
doi = {10.1109/FOCS54457.2022.00094},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BafnaHKX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BassoGMZ22,
author = {Joao Basso and
David Gamarnik and
Song Mei and
Leo Zhou},
title = {Performance and limitations of the {QAOA} at constant levels on large
sparse hypergraphs and spin glass models},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {335--343},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00039},
doi = {10.1109/FOCS54457.2022.00039},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BassoGMZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BasuKMN22,
author = {Saugata Basu and
Hamidreza Amini Khorasgani and
Hemanta K. Maji and
Hai H. Nguyen},
title = {Geometry of Secure Two-party Computation},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1035--1044},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00101},
doi = {10.1109/FOCS54457.2022.00101},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BasuKMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BehnezhadCMT22,
author = {Soheil Behnezhad and
Moses Charikar and
Weiyun Ma and
Li{-}Yang Tan},
title = {Almost 3-Approximate Correlation Clustering in Constant Rounds},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {720--731},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00074},
doi = {10.1109/FOCS54457.2022.00074},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BehnezhadCMT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-DavidBGM22,
author = {Shalev Ben{-}David and
Eric Blais and
Mika G{\"{o}}{\"{o}}s and
Gilbert Maystre},
title = {Randomised Composition and Small-Bias Minimax},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {624--635},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00065},
doi = {10.1109/FOCS54457.2022.00065},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-DavidBGM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BenderCFKKW22,
author = {Michael A. Bender and
Alex Conway and
Martin Farach{-}Colton and
Hanna Koml{\'{o}}s and
William Kuszmaul and
Nicole Wein},
title = {Online List Labeling: Breaking the log\({}^{\mbox{2}}\)n Barrier},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {980--990},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00096},
doi = {10.1109/FOCS54457.2022.00096},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BenderCFKKW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernsteinNW22,
author = {Aaron Bernstein and
Danupon Nanongkai and
Christian Wulff{-}Nilsen},
title = {Negative-Weight Single-Source Shortest Paths in Near-linear Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {600--611},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00063},
doi = {10.1109/FOCS54457.2022.00063},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BernsteinNW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhargavaGG0U22,
author = {Vishwas Bhargava and
Sumanta Ghosh and
Zeyu Guo and
Mrinal Kumar and
Chris Umans},
title = {Fast Multivariate Multipoint Evaluation Over All Finite Fields},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {221--232},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00028},
doi = {10.1109/FOCS54457.2022.00028},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BhargavaGG0U22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlikstadBEMN22,
author = {Joakim Blikstad and
Jan van den Brand and
Yuval Efron and
Sagnik Mukhopadhyay and
Danupon Nanongkai},
title = {Nearly Optimal Communication and Query Complexity of Bipartite Matching},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1174--1185},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00113},
doi = {10.1109/FOCS54457.2022.00113},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BlikstadBEMN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BodwinH22,
author = {Greg Bodwin and
Gary Hoppenworth},
title = {New Additive Spanner Lower Bounds by an Unlayered Obstacle Product},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {778--788},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00079},
doi = {10.1109/FOCS54457.2022.00079},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BodwinH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrandFN22,
author = {Jan van den Brand and
Sebastian Forster and
Yasamin Nazari},
title = {Fast Deterministic Fully Dynamic Distance Approximation},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1011--1022},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00099},
doi = {10.1109/FOCS54457.2022.00099},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BrandFN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanCJKST022,
author = {Vladimir Braverman and
Vincent Cohen{-}Addad and
Shaofeng H.{-}C. Jiang and
Robert Krauthgamer and
Chris Schwiegelshohn and
Mads Bech Toftrup and
Xuan Wu},
title = {The Power of Uniform Sampling for Coresets},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {462--473},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00051},
doi = {10.1109/FOCS54457.2022.00051},
timestamp = {Sun, 17 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanCJKST022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrownLPST22,
author = {Adam Brown and
Aditi Laddha and
Madhusudhan Pittu and
Mohit Singh and
Prasad Tetali},
title = {Determinant Maximization via Matroid Intersection Algorithms},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {255--266},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00031},
doi = {10.1109/FOCS54457.2022.00031},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrownLPST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrukhimCDMY22,
author = {Nataly Brukhim and
Daniel Carmon and
Irit Dinur and
Shay Moran and
Amir Yehudayoff},
title = {A Characterization of Multiclass Learnability},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {943--955},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00093},
doi = {10.1109/FOCS54457.2022.00093},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BrukhimCDMY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BubeckCR22,
author = {S{\'{e}}bastien Bubeck and
Christian Coester and
Yuval Rabani},
title = {Shortest Paths without a Map, but with an Entropic Regularizer},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1102--1113},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00036},
doi = {10.1109/FOCS54457.2022.00036},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BubeckCR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CarlsonDFKPY22,
author = {Charlie Carlson and
Ewan Davies and
Nicolas Fraiman and
Alexandra Kolla and
Aditya Potukuchi and
Corrine Yap},
title = {Algorithms for the ferromagnetic Potts model on expanders},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {344--355},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00040},
doi = {10.1109/FOCS54457.2022.00040},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CarlsonDFKPY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChakrabartyGJS22,
author = {Deeparnab Chakrabarty and
Andrei Graur and
Haotian Jiang and
Aaron Sidford},
title = {Improved Lower Bounds for Submodular Function Minimization},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {245--254},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00030},
doi = {10.1109/FOCS54457.2022.00030},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChakrabartyGJS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Charalampopoulos22,
author = {Panagiotis Charalampopoulos and
Tomasz Kociumaka and
Philip Wellnitz},
title = {Faster Pattern Matching under Edit Distance : {A} Reduction to Dynamic
Puzzle Matching and the Seaweed Monoid of Permutation Matrices},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {698--707},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00072},
doi = {10.1109/FOCS54457.2022.00072},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Charalampopoulos22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChechikZ22,
author = {Shiri Chechik and
Tianyi Zhang},
title = {Constant Approximation of Min-Distances in Near-Linear Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {896--906},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00089},
doi = {10.1109/FOCS54457.2022.00089},
timestamp = {Fri, 25 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChechikZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chen0HL22,
author = {Sitan Chen and
Jerry Li and
Brice Huang and
Allen Liu},
title = {Tight Bounds for Quantum State Certification with Incoherent Measurements},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1205--1213},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00118},
doi = {10.1109/FOCS54457.2022.00118},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Chen0HL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chen0YZ22,
author = {Xiaoyu Chen and
Weiming Feng and
Yitong Yin and
Xinyuan Zhang},
title = {Optimal mixing for two-state anti-ferromagnetic spin systems},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {588--599},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00062},
doi = {10.1109/FOCS54457.2022.00062},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Chen0YZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenE22,
author = {Yuansi Chen and
Ronen Eldan},
title = {Localization Schemes: {A} Framework for Proving Mixing Bounds for
Markov Chains (extended abstract)},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {110--122},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00018},
doi = {10.1109/FOCS54457.2022.00018},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenE22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenKL22,
author = {Yu Chen and
Sanjeev Khanna and
Huan Li},
title = {On Weighted Graph Sparsification by Linear Sketching},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {474--485},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00052},
doi = {10.1109/FOCS54457.2022.00052},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChenKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenKLPGS22,
author = {Li Chen and
Rasmus Kyng and
Yang P. Liu and
Richard Peng and
Maximilian Probst Gutenberg and
Sushant Sachdeva},
title = {Maximum Flow and Minimum-Cost Flow in Almost-Linear Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {612--623},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00064},
doi = {10.1109/FOCS54457.2022.00064},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenKLPGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenLL022,
author = {Qingyun Chen and
Bundit Laekhanukit and
Chao Liao and
Yuhao Zhang},
title = {Survivable Network Design Revisited: Group-Connectivity},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {278--289},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00033},
doi = {10.1109/FOCS54457.2022.00033},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenLL022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenPP22,
author = {Xi Chen and
Christos H. Papadimitriou and
Binghui Peng},
title = {Memory Bounds for Continual Learning},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {519--530},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00056},
doi = {10.1109/FOCS54457.2022.00056},
timestamp = {Thu, 13 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChenPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChiplunkarKK022,
author = {Ashish Chiplunkar and
John Kallaugher and
Michael Kapralov and
Eric Price},
title = {Factorial Lower Bounds for (Almost) Random Order Streams},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {486--497},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00053},
doi = {10.1109/FOCS54457.2022.00053},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChiplunkarKK022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadFLM22,
author = {Vincent Cohen{-}Addad and
Chenglin Fan and
Euiwoong Lee and
Arnaud de Mesmay},
title = {Fitting Metrics and Ultrametrics with Minimum Disagreements},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {301--311},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00035},
doi = {10.1109/FOCS54457.2022.00035},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadFLM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadLN22,
author = {Vincent Cohen{-}Addad and
Euiwoong Lee and
Alantha Newman},
title = {Correlation Clustering with Sherali-Adams},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {651--661},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00068},
doi = {10.1109/FOCS54457.2022.00068},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadLN22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohenY22,
author = {Gil Cohen and
Tal Yankovitz},
title = {Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {24--35},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00010},
doi = {10.1109/FOCS54457.2022.00010},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CohenY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CzumajJK0Y22,
author = {Artur Czumaj and
Shaofeng H.{-}C. Jiang and
Robert Krauthgamer and
Pavel Vesel{\'{y}} and
Mingwei Yang},
title = {Streaming Facility Location in High Dimension via Geometric Hashing},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {450--461},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00050},
doi = {10.1109/FOCS54457.2022.00050},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CzumajJK0Y22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DalirrooyfardJW22,
author = {Mina Dalirrooyfard and
Ce Jin and
Virginia Vassilevska Williams and
Nicole Wein},
title = {Approximation Algorithms and Hardness for n-Pairs Shortest Paths and
All-Nodes Shortest Cycles},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {290--300},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00034},
doi = {10.1109/FOCS54457.2022.00034},
timestamp = {Wed, 19 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DalirrooyfardJW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DalirrooyfardW22,
author = {Mina Dalirrooyfard and
Virginia Vassilevska Williams},
title = {Induced Cycles and Paths Are Harder Than You Think},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {531--542},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00057},
doi = {10.1109/FOCS54457.2022.00057},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DalirrooyfardW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DeligkasFHM22,
author = {Argyrios Deligkas and
John Fearnley and
Alexandros Hollender and
Themistoklis Melissourgos},
title = {Pure-Circuit: Strong Inapproximability for {PPAD}},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {159--170},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00022},
doi = {10.1109/FOCS54457.2022.00022},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DeligkasFHM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DerksenV22,
author = {Harm Derksen and
Emanuele Viola},
title = {Fooling polynomials using invariant theory\({}^{\mbox{*}}\)},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {399--406},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00045},
doi = {10.1109/FOCS54457.2022.00045},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DerksenV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DevadasGKV22,
author = {Lalita Devadas and
Rishab Goyal and
Yael Kalai and
Vinod Vaikuntanathan},
title = {Rate-1 Non-Interactive Arguments for Batch-NP and Applications},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1057--1068},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00103},
doi = {10.1109/FOCS54457.2022.00103},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DevadasGKV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DharD22,
author = {Manik Dhar and
Zeev Dvir},
title = {Linear Hashing with {\(\mathscr{l}\)}{\(\infty\)} guarantees and two-sided
Kakeya bounds},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {419--428},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00047},
doi = {10.1109/FOCS54457.2022.00047},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DharD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DhulipalaLRSSY22,
author = {Laxman Dhulipala and
Quanquan C. Liu and
Sofya Raskhodnikova and
Jessica Shi and
Julian Shun and
Shangdi Yu},
title = {Differential Privacy from Locally Adjustable Graph Algorithms: k-Core
Decomposition, Low Out-Degree Ordering, and Densest Subgraphs},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {754--765},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00077},
doi = {10.1109/FOCS54457.2022.00077},
timestamp = {Mon, 06 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DhulipalaLRSSY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Dutta022,
author = {Pranjal Dutta and
Nitin Saxena},
title = {Separated borders: Exponential-gap fanin-hierarchy theorem for approximative
depth-3 circuits},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {200--211},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00026},
doi = {10.1109/FOCS54457.2022.00026},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Dutta022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EfremenkoKS022,
author = {Klim Efremenko and
Gillat Kol and
Raghuvansh R. Saxena and
Zhijun Zhang},
title = {Binary Codes with Resilience Beyond 1/4 via Interaction},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1--12},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00008},
doi = {10.1109/FOCS54457.2022.00008},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EfremenkoKS022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FiltserL22,
author = {Arnold Filtser and
Hung Le},
title = {Low Treewidth Embeddings of Planar and Minor-Free Metrics},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1081--1092},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00105},
doi = {10.1109/FOCS54457.2022.00105},
timestamp = {Sun, 05 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/FiltserL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GamarnikK0X22,
author = {David Gamarnik and
Eren C. Kizildag and
Will Perkins and
Changji Xu},
title = {Algorithms and Barriers in the Symmetric Binary Perceptron Model},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {576--587},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00061},
doi = {10.1109/FOCS54457.2022.00061},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GamarnikK0X22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoldenbergKKS22,
author = {Elazar Goldenberg and
Tomasz Kociumaka and
Robert Krauthgamer and
Barna Saha},
title = {Gap Edit Distance via Non-Adaptive Queries: Simple and Optimal},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {674--685},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00070},
doi = {10.1109/FOCS54457.2022.00070},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GoldenbergKKS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoldwasserKVZ22,
author = {Shafi Goldwasser and
Michael P. Kim and
Vinod Vaikuntanathan and
Or Zamir},
title = {Planting Undetectable Backdoors in Machine Learning Models : [Extended
Abstract]},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {931--942},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00092},
doi = {10.1109/FOCS54457.2022.00092},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoldwasserKVZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoosH0MPRT22,
author = {Mika G{\"{o}}{\"{o}}s and
Alexandros Hollender and
Siddhartha Jain and
Gilbert Maystre and
William Pires and
Robert Robere and
Ran Tao},
title = {Separations in Proof Complexity and {TFNP}},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1150--1161},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00111},
doi = {10.1109/FOCS54457.2022.00111},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoosH0MPRT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GovindasamyHT22,
author = {Nashlen Govindasamy and
Tuomas Hakoniemi and
Iddo Tzameret},
title = {Simple Hard Instances for Low-Depth Algebraic Proofs},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {188--199},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00025},
doi = {10.1109/FOCS54457.2022.00025},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GovindasamyHT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GupteVV22,
author = {Aparna Gupte and
Neekon Vafa and
Vinod Vaikuntanathan},
title = {Continuous {LWE} is as Hard as {LWE} {\&} Applications to Learning
Gaussian Mixtures},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1162--1173},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00112},
doi = {10.1109/FOCS54457.2022.00112},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GupteVV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiM22,
author = {Venkatesan Guruswami and
Jonathan Mosheiff},
title = {Punctured Low-Bias Codes Behave Like Random Linear Codes},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {36--45},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00011},
doi = {10.1109/FOCS54457.2022.00011},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaahKT22,
author = {Jeongwan Haah and
Robin Kothari and
Ewin Tang},
title = {Optimal learning of quantum Hamiltonians from high-temperature Gibbs
states},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {135--146},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00020},
doi = {10.1109/FOCS54457.2022.00020},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HaahKT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HastadR22,
author = {Johan H{\aa}stad and
Kilian Risse},
title = {On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1138--1149},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00110},
doi = {10.1109/FOCS54457.2022.00110},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HastadR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HatamiH22,
author = {Hamed Hatami and
Pooya Hatami},
title = {The Implicit Graph Conjecture is False},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1134--1137},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00109},
doi = {10.1109/FOCS54457.2022.00109},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HatamiH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HeWY22,
author = {Kun He and
Chunyang Wang and
Yitong Yin},
title = {Sampling Lov{\'{a}}sz local lemma for general constraint satisfaction
solutions in near-linear time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {147--158},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00021},
doi = {10.1109/FOCS54457.2022.00021},
timestamp = {Sun, 08 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HeWY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Hirahara22,
author = {Shuichi Hirahara},
title = {NP-Hardness of Learning Programs and Partial {MCSP}},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {968--979},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00095},
doi = {10.1109/FOCS54457.2022.00095},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Hirahara22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HiraharaS22,
author = {Shuichi Hirahara and
Nobutaka Shimizu},
title = {Hardness Self-Amplification from Feasible Hard-Core Sets},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {543--554},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00058},
doi = {10.1109/FOCS54457.2022.00058},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HiraharaS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HopkinsL22,
author = {Max Hopkins and
Ting{-}Chun Lin},
title = {Explicit Lower Bounds Against {\(\Omega\)}(n)-Rounds of Sum-of-Squares},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {662--673},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00069},
doi = {10.1109/FOCS54457.2022.00069},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HopkinsL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HuangJ0T022,
author = {Baihe Huang and
Shunhua Jiang and
Zhao Song and
Runzhou Tao and
Ruizhe Zhang},
title = {Solving {SDP} Faster: {A} Robust {IPM} Framework and Efficient Implementation},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {233--244},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00029},
doi = {10.1109/FOCS54457.2022.00029},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HuangJ0T022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HuangS22,
author = {Brice Huang and
Mark Sellke},
title = {Tight Lipschitz Hardness for optimizing Mean Field Spin Glasses},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {312--322},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00037},
doi = {10.1109/FOCS54457.2022.00037},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HuangS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/IkenmeyerP22,
author = {Christian Ikenmeyer and
Igor Pak},
title = {What is in {\#}P and what is not?},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {860--871},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00087},
doi = {10.1109/FOCS54457.2022.00087},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/IkenmeyerP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JeronimoMRW22,
author = {Fernando Granha Jeronimo and
Tushant Mittal and
Sourya Roy and
Avi Wigderson},
title = {Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {378--388},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00043},
doi = {10.1109/FOCS54457.2022.00043},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JeronimoMRW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JinL22,
author = {Yaonan Jin and
Pinyan Lu},
title = {First Price Auction is 1 - 1 /e\({}^{\mbox{2}}\) Efficient},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {179--187},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00024},
doi = {10.1109/FOCS54457.2022.00024},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/JinL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KallaugherP22,
author = {John Kallaugher and
Ojas Parekh},
title = {The Quantum and Classical Streaming Complexity of Quantum and Classical
Max-Cut},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {498--506},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00054},
doi = {10.1109/FOCS54457.2022.00054},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KallaugherP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KapralovMSST22,
author = {Michael Kapralov and
Mikhail Makarov and
Sandeep Silwal and
Christian Sohler and
Jakab Tardos},
title = {Motif Cut Sparsifiers},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {389--398},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00044},
doi = {10.1109/FOCS54457.2022.00044},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KapralovMSST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KarlinKG22,
author = {Anna R. Karlin and
Nathan Klein and
Shayan Oveis Gharan},
title = {A (Slightly) Improved Bound on the Integrality Gap of the Subtour
{LP} for {TSP}},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {832--843},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00084},
doi = {10.1109/FOCS54457.2022.00084},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KarlinKG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KaufmanM22,
author = {Tali Kaufman and
Dor Minzer},
title = {Improved Optimal Testing Results from Global Hypercontractivity},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {98--109},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00017},
doi = {10.1109/FOCS54457.2022.00017},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KaufmanM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KoganP22,
author = {Shimon Kogan and
Merav Parter},
title = {Having Hope in Hops: New Spanners, Preservers and Lower Bounds for
Hopsets},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {766--777},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00078},
doi = {10.1109/FOCS54457.2022.00078},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KoganP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kumar22,
author = {Nikhil Kumar},
title = {An Approximate Generalization of the Okamura-Seymour Theorem},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1093--1101},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00106},
doi = {10.1109/FOCS54457.2022.00106},
timestamp = {Sat, 04 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kumar22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kunnemann22,
author = {Marvin K{\"{u}}nnemann},
title = {A tight (non-combinatorial) conditional lower bound for Klee's Measure
Problem in 3D},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {555--566},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00059},
doi = {10.1109/FOCS54457.2022.00059},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kunnemann22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kuszmaul22,
author = {William Kuszmaul},
title = {A Hash Table Without Hash Functions, and How to Get the Most Out of
Your Random Bits},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {991--1001},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00097},
doi = {10.1109/FOCS54457.2022.00097},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kuszmaul22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KwokLT22,
author = {Tsz Chiu Kwok and
Lap Chi Lau and
Kam Chuen Tung},
title = {Cheeger Inequalities for Vertex Expansion and Reweighted Eigenvalues},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {366--377},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00042},
doi = {10.1109/FOCS54457.2022.00042},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KwokLT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KyngMP22,
author = {Rasmus Kyng and
Simon Meierhans and
Maximilian Probst},
title = {Derandomizing Directed Random Walks in Almost-Linear Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {407--418},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00046},
doi = {10.1109/FOCS54457.2022.00046},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KyngMP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LangeRV22,
author = {Jane Lange and
Ronitt Rubinfeld and
Arsen Vasilyan},
title = {Properly learning monotone functions via local correction},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {75--86},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00015},
doi = {10.1109/FOCS54457.2022.00015},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LangeRV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeverrierZ22,
author = {Anthony Leverrier and
Gilles Z{\'{e}}mor},
title = {Quantum Tanner codes},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {872--883},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00117},
doi = {10.1109/FOCS54457.2022.00117},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LeverrierZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiuM22,
author = {Allen Liu and
Ankur Moitra},
title = {Minimax Rates for Robust Community Detection},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {823--831},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00083},
doi = {10.1109/FOCS54457.2022.00083},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiuM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LombardiMS22,
author = {Alex Lombardi and
Fermi Ma and
Nicholas Spooner},
title = {Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding
Undetectably},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {851--859},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00086},
doi = {10.1109/FOCS54457.2022.00086},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LombardiMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LongS22,
author = {Yaowei Long and
Thatchaphol Saranurak},
title = {Near-Optimal Deterministic Vertex-Failure Connectivity Oracles},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1002--1010},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00098},
doi = {10.1109/FOCS54457.2022.00098},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LongS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LunaV22,
author = {Giuseppe Antonio Di Luna and
Giovanni Viglietta},
title = {Computing in Anonymous Dynamic Networks Is Linear},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1122--1133},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00108},
doi = {10.1109/FOCS54457.2022.00108},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LunaV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MatsumotoM22,
author = {Namiko Matsumoto and
Arya Mazumdar},
title = {Binary Iterative Hard Thresholding Converges with Optimal Number of
Measurements for 1-Bit Compressed Sensing},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {813--822},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00082},
doi = {10.1109/FOCS54457.2022.00082},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MatsumotoM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Meiburg22,
author = {Alexander Meiburg},
title = {Inapproximability of Positive Semidefinite Permanents and Quantum
State Tomography},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {58--68},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00013},
doi = {10.1109/FOCS54457.2022.00013},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Meiburg22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MetgerFSR22,
author = {Tony Metger and
Omar Fawzi and
David Sutter and
Renato Renner},
title = {Generalised entropy accumulation},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {844--850},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00085},
doi = {10.1109/FOCS54457.2022.00085},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MetgerFSR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MuscoMW022,
author = {Cameron Musco and
Christopher Musco and
David P. Woodruff and
Taisuke Yasuda},
title = {Active Linear Regression for {\(\mathscr{l}\)}p Norms and Beyond},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {744--753},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00076},
doi = {10.1109/FOCS54457.2022.00076},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/MuscoMW022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NeedellSW22,
author = {Deanna Needell and
William Swartworth and
David P. Woodruff},
title = {Testing Positive Semidefiniteness Using Linear Measurements},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {87--97},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00016},
doi = {10.1109/FOCS54457.2022.00016},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NeedellSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/OliveiraS22,
author = {Rafael Oliveira and
Akash Kumar Sengupta},
title = {Radical Sylvester-Gallai Theorem for Cubics},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {212--220},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00027},
doi = {10.1109/FOCS54457.2022.00027},
timestamp = {Tue, 10 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/OliveiraS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PanethP22,
author = {Omer Paneth and
Rafael Pass},
title = {Incrementally Verifiable Computation via Rate-1 Batch Arguments},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1045--1056},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00102},
doi = {10.1109/FOCS54457.2022.00102},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/PanethP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ParkP22,
author = {Jinyoung Park and
Huy Tuan Pham},
title = {A Proof of the Kahn-Kalai Conjecture},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {636--639},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00066},
doi = {10.1109/FOCS54457.2022.00066},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ParkP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PengT22,
author = {Bo Peng and
Zhihao Gavin Tang},
title = {Order Selection Prophet Inequality: From Threshold Optimization to
Arrival Time Design},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {171--178},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00023},
doi = {10.1109/FOCS54457.2022.00023},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PengT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RenSW22,
author = {Hanlin Ren and
Rahul Santhanam and
Zhikun Wang},
title = {On the Range Avoidance Problem for Circuits},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {640--650},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00067},
doi = {10.1109/FOCS54457.2022.00067},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/RenSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RozhonEGH22,
author = {V{\'{a}}clav Rozhon and
Michael Elkin and
Christoph Grunau and
Bernhard Haeupler},
title = {Deterministic Low-Diameter Decompositions for Weighted Graphs and
Distributed and Parallel Applications},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1114--1121},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00107},
doi = {10.1109/FOCS54457.2022.00107},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/RozhonEGH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SaranurakY22,
author = {Thatchaphol Saranurak and
Sorrachai Yingchareonthawornchai},
title = {Deterministic Small Vertex Connectivity in Almost Linear Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {789--800},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00080},
doi = {10.1109/FOCS54457.2022.00080},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SaranurakY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ShaltielS22,
author = {Ronen Shaltiel and
Jad Silbak},
title = {Error Correcting Codes that Achieve {BSC} Capacity Against Channels
that are Poly-Size Circuits},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {13--23},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00009},
doi = {10.1109/FOCS54457.2022.00009},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ShaltielS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/StephanZ22,
author = {Ludovic Stephan and
Yizhe Zhu},
title = {Sparse random hypergraphs: Non-backtracking spectra and community
detection},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {567--575},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00060},
doi = {10.1109/FOCS54457.2022.00060},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/StephanZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ThilikosW22,
author = {Dimitrios M. Thilikos and
Sebastian Wiederrecht},
title = {Killing a vortex},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1069--1080},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00104},
doi = {10.1109/FOCS54457.2022.00104},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ThilikosW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/WilliamsWX22,
author = {Virginia Vassilevska Williams and
Eyob Woldeghebriel and
Yinzhan Xu},
title = {Algorithms and Lower Bounds for Replacement Paths under Multiple Edge
Failure},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {907--918},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00090},
doi = {10.1109/FOCS54457.2022.00090},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/WilliamsWX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Woodruff022,
author = {David P. Woodruff and
Taisuke Yasuda},
title = {High-Dimensional Geometric Streaming in Polynomial Space},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {732--743},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00075},
doi = {10.1109/FOCS54457.2022.00075},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Woodruff022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/YamakawaZ22,
author = {Takashi Yamakawa and
Mark Zhandry},
title = {Verifiable Quantum Advantage without Structure},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {69--74},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00014},
doi = {10.1109/FOCS54457.2022.00014},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/YamakawaZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Yu22,
author = {Huacheng Yu},
title = {Strong {XOR} Lemma for Communication with Bounded Rounds : (extended
abstract)},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {1186--1192},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00114},
doi = {10.1109/FOCS54457.2022.00114},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Yu22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Zhang22,
author = {Jiayu Zhang},
title = {Classical Verification of Quantum Computations in Linear Time},
booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
pages = {46--57},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022.00012},
doi = {10.1109/FOCS54457.2022.00012},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Zhang22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2021,
title = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS52979.2022},
doi = {10.1109/FOCS52979.2022},
isbn = {978-1-6654-2055-6},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2022,
title = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2022, Denver, CO, USA, October 31 - November 3, 2022},
publisher = {{IEEE}},
year = {2022},
url = {https://doi.org/10.1109/FOCS54457.2022},
doi = {10.1109/FOCS54457.2022},
isbn = {978-1-6654-5519-0},
timestamp = {Sat, 31 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/2022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/00010P21,
author = {Anupam Gupta and
Amit Kumar and
Debmalya Panigrahi},
title = {A Hitting Set Relaxation for {\textdollar}k{\textdollar}-Server and
an Extension to Time-Windows},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {504--515},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00057},
doi = {10.1109/FOCS52979.2021.00057},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/00010P21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001JSW21,
author = {Lijie Chen and
Ce Jin and
Rahul Santhanam and
R. Ryan Williams},
title = {Constructive Separations and Their Consequences},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {646--657},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00069},
doi = {10.1109/FOCS52979.2021.00069},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/0001JSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001K21,
author = {Rahul Jain and
Srijita Kundu},
title = {A direct product theorem for quantum communication complexity with
applications to device-independent {QKD}},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1285--1295},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00125},
doi = {10.1109/FOCS52979.2021.00125},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001K21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001KK21,
author = {George Christodoulou and
Elias Koutsoupias and
Annam{\'{a}}ria Kov{\'{a}}cs},
title = {On the Nisan-Ronen conjecture},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {839--850},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00086},
doi = {10.1109/FOCS52979.2021.00086},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/0001KK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001KL21,
author = {Anupam Gupta and
Gregory Kehne and
Roie Levin},
title = {Random Order Online Set Cover is as Easy as Offline},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1253--1264},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00122},
doi = {10.1109/FOCS52979.2021.00122},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001KL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001S21,
author = {Wenyu Jin and
Xiaorui Sun},
title = {Fully Dynamic s-t Edge Connectivity in Subpolynomial Time (Extended
Abstract)},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {861--872},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00088},
doi = {10.1109/FOCS52979.2021.00088},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001S21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001T21,
author = {Lijie Chen and
Roei Tell},
title = {Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {125--136},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00021},
doi = {10.1109/FOCS52979.2021.00021},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001T21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001W21,
author = {Oded Goldreich and
Avi Wigderson},
title = {Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {269--275},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00035},
doi = {10.1109/FOCS52979.2021.00035},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001W21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0002R21,
author = {Marco Bressan and
Marc Roth},
title = {Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms,
Hardness Results, and Complexity Dichotomies},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {276--285},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00036},
doi = {10.1109/FOCS52979.2021.00036},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0002R21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0003SS21,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
title = {Random walks and forbidden minors {III:} {\textdollar}{\textbackslash}text\{poly\}{\textbackslash}left(d{\textbackslash}varepsilon
\{-1\}{\textbackslash}right){\textdollar}-time partition oracles for
minor-free graph classes},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {257--268},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00034},
doi = {10.1109/FOCS52979.2021.00034},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/0003SS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0006PS21,
author = {Jason Li and
Debmalya Panigrahi and
Thatchaphol Saranurak},
title = {A Nearly Optimal All-Pairs Min-Cuts Algorithm in Simple Graphs},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1124--1134},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00111},
doi = {10.1109/FOCS52979.2021.00111},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0006PS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbbeLS21,
author = {Emmanuel Abbe and
Shuangping Li and
Allan Sly},
title = {Proof of the Contiguity Conjecture and Lognormal Limit for the Symmetric
Perceptron},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {327--338},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00041},
doi = {10.1109/FOCS52979.2021.00041},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbbeLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudKT21,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
title = {{APMF} {\textless} APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic
Time},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1135--1146},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00112},
doi = {10.1109/FOCS52979.2021.00112},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AbboudKT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbdolazimiLG21,
author = {Dorna Abdolazimi and
Kuikui Liu and
Shayan Oveis Gharan},
title = {A Matrix Trickle-Down Theorem on Simplicial Complexes and Applications
to Sampling Colorings},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {161--172},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00024},
doi = {10.1109/FOCS52979.2021.00024},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbdolazimiLG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Abrahamsen21,
author = {Mikkel Abrahamsen},
title = {Covering Polygons is Even Harder},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {375--386},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00045},
doi = {10.1109/FOCS52979.2021.00045},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Abrahamsen21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AkmalW21,
author = {Shyan Akmal and
Ryan Williams},
title = {{MAJORITY-3SAT} (and Related Problems) in Polynomial Time},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1033--1043},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00103},
doi = {10.1109/FOCS52979.2021.00103},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AkmalW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Allen-ZhuL21,
author = {Zeyuan Allen{-}Zhu and
Yuanzhi Li},
title = {Feature Purification: How Adversarial Training Performs Robust Deep
Learning},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {977--988},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00098},
doi = {10.1109/FOCS52979.2021.00098},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Allen-ZhuL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonHHM21,
author = {Noga Alon and
Steve Hanneke and
Ron Holzman and
Shay Moran},
title = {A Theory of {PAC} Learnability of Partial Concept Classes},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {658--671},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00070},
doi = {10.1109/FOCS52979.2021.00070},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlonHHM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ArunachalamGGOS21,
author = {Srinivasan Arunachalam and
Alex B. Grilo and
Tom Gur and
Igor C. Oliveira and
Aarthi Sundaram},
title = {Quantum learning algorithms imply circuit lower bounds},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {562--573},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00062},
doi = {10.1109/FOCS52979.2021.00062},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ArunachalamGGOS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AxiotisMV21,
author = {Kyriakos Axiotis and
Aleksander Madry and
Adrian Vladu},
title = {Faster Sparse Minimum Cost Flow by Electrical Flow Localization},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {528--539},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00059},
doi = {10.1109/FOCS52979.2021.00059},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AxiotisMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BalodisBG0K21,
author = {Kaspars Balodis and
Shalev Ben{-}David and
Mika G{\"{o}}{\"{o}}s and
Siddhartha Jain and
Robin Kothari},
title = {Unambiguous DNFs and Alon-Saks-Seymour},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {116--124},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00020},
doi = {10.1109/FOCS52979.2021.00020},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BalodisBG0K21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BasuC21,
author = {Saugata Basu and
Nathanael Cox},
title = {Harmonic Persistent Homology (extended abstract)},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1112--1123},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00110},
doi = {10.1109/FOCS52979.2021.00110},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BasuC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeckerLM21,
author = {Oren Becker and
Alexander Lubotzky and
Jonathan Mosheiff},
title = {Testability of relations between permutations},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {286--297},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00037},
doi = {10.1109/FOCS52979.2021.00037},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BeckerLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Behnezhad21,
author = {Soheil Behnezhad},
title = {Time-Optimal Sublinear Algorithms for Matching and Vertex Cover},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {873--884},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00089},
doi = {10.1109/FOCS52979.2021.00089},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Behnezhad21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BenderKK21,
author = {Michael A. Bender and
Bradley C. Kuszmaul and
William Kuszmaul},
title = {Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1171--1182},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00115},
doi = {10.1109/FOCS52979.2021.00115},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BenderKK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernsteinGS21,
author = {Aaron Bernstein and
Maximilian Probst Gutenberg and
Thatchaphol Saranurak},
title = {Deterministic Decremental {SSSP} and Approximate Min-Cost Flow in
Almost-Linear Time},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1000--1008},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00100},
doi = {10.1109/FOCS52979.2021.00100},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BernsteinGS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlancC21,
author = {Guy Blanc and
Moses Charikar},
title = {Multiway Online Correlated Selection},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1277--1284},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00124},
doi = {10.1109/FOCS52979.2021.00124},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BlancC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlancLQT21,
author = {Guy Blanc and
Jane Lange and
Mingda Qiao and
Li{-}Yang Tan},
title = {Properly learning decision trees in almost polynomial time},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {920--929},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00093},
doi = {10.1109/FOCS52979.2021.00093},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BlancLQT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlockiCGLZZ21,
author = {Jeremiah Blocki and
Kuan Cheng and
Elena Grigorescu and
Xin Li and
Yu Zheng and
Minshen Zhu},
title = {Exponential Lower Bounds for Locally Decodable and Correctable Codes
for Insertions and Deletions},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {739--750},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00077},
doi = {10.1109/FOCS52979.2021.00077},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlockiCGLZZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BodlaenderGNS21,
author = {Hans L. Bodlaender and
Carla Groenland and
Jesper Nederlof and
C{\'{e}}line M. F. Swennenhuis},
title = {Parameterized Problems Complete for Nondeterministic {FPT} time and
Logarithmic Space},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {193--204},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00027},
doi = {10.1109/FOCS52979.2021.00027},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BodlaenderGNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Boix-AdseraBK21,
author = {Enric Boix{-}Adser{\`{a}} and
Guy Bresler and
Frederic Koehler},
title = {Chow-Liu++: Optimal Prediction-Centric Learning of Tree Ising Models},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {417--426},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00049},
doi = {10.1109/FOCS52979.2021.00049},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Boix-AdseraBK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BoulandFLL21,
author = {Adam Bouland and
Bill Fefferman and
Zeph Landau and
Yunchao Liu},
title = {Noise and the Frontier of Quantum Supremacy},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1308--1317},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00127},
doi = {10.1109/FOCS52979.2021.00127},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BoulandFLL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BousquetBKEM21,
author = {Olivier Bousquet and
Mark Braverman and
Gillat Kol and
Klim Efremenko and
Shay Moran},
title = {Statistically Near-Optimal Hypothesis Selection},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {909--919},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00092},
doi = {10.1109/FOCS52979.2021.00092},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BousquetBKEM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanGZ21,
author = {Mark Braverman and
Sumegha Garg and
Or Zamir},
title = {Tight Space Complexity of the Coin Problem},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1068--1079},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00106},
doi = {10.1109/FOCS52979.2021.00106},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanGZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanKLM21,
author = {Mark Braverman and
Subhash Khot and
Noam Lifshitz and
Dor Minzer},
title = {An Invariance Principle for the Multi-slice, with Applications},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {228--236},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00030},
doi = {10.1109/FOCS52979.2021.00030},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanKLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BreslerH21,
author = {Guy Bresler and
Brice Huang},
title = {The Algorithmic Phase Transition of Random k-SAT for Low Degree Polynomials},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {298--309},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00038},
doi = {10.1109/FOCS52979.2021.00038},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BreslerH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BukhSN21,
author = {Boris Bukh and
{Karthik {C. S.}} and
Bhargav Narayanan},
title = {Applications of Random Algebraic Constructions to Hardness of Approximation},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {237--244},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00032},
doi = {10.1109/FOCS52979.2021.00032},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BukhSN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BurkeFT21,
author = {Kyle W. Burke and
Matthew T. Ferland and
Shang{-}Hua Teng},
title = {Winning the War by (Strategically) Losing Battles: Settling the Complexity
of Grundy-Values in Undirected Geography},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1217--1228},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00119},
doi = {10.1109/FOCS52979.2021.00119},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BurkeFT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CarmosinoKKO21,
author = {Marco Carmosino and
Valentine Kabanets and
Antonina Kolokolova and
Igor C. Oliveira},
title = {LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {770--780},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00080},
doi = {10.1109/FOCS52979.2021.00080},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CarmosinoKKO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CasteigtsRRZ21,
author = {Arnaud Casteigts and
Michael Raskin and
Malte Renken and
Viktor Zamaraev},
title = {Sharp Thresholds in Random Simple Temporal Graphs},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {319--326},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00040},
doi = {10.1109/FOCS52979.2021.00040},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CasteigtsRRZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cen0NPSQ21,
author = {Ruoxu Cen and
Jason Li and
Danupon Nanongkai and
Debmalya Panigrahi and
Thatchaphol Saranurak and
Kent Quanrud},
title = {Minimum Cuts in Directed Graphs via Partial Sparsification},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1147--1158},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00113},
doi = {10.1109/FOCS52979.2021.00113},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cen0NPSQ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChakrabartyCK21,
author = {Deeparnab Chakrabarty and
Yu Chen and
Sanjeev Khanna},
title = {A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular
Function Minimization},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {37--48},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00013},
doi = {10.1109/FOCS52979.2021.00013},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChakrabartyCK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChattopadhyayG21,
author = {Eshan Chattopadhyay and
Jesse Goodman},
title = {Improved Extractors for Small-Space Sources},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {610--621},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00066},
doi = {10.1109/FOCS52979.2021.00066},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChattopadhyayG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChattopadhyayGL21,
author = {Eshan Chattopadhyay and
Jesse Goodman and
Jyun{-}Jie Liao},
title = {Affine Extractors for Almost Logarithmic Entropy},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {622--633},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00067},
doi = {10.1109/FOCS52979.2021.00067},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChattopadhyayGL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenCH021,
author = {Sitan Chen and
Jordan Cotler and
Hsin{-}Yuan Huang and
Jerry Li},
title = {Exponential Separations Between Learning With and Without Quantum
Memory},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {574--585},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00063},
doi = {10.1109/FOCS52979.2021.00063},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenCH021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenFYZ21,
author = {Xiaoyu Chen and
Weiming Feng and
Yitong Yin and
Xinyuan Zhang},
title = {Rapid mixing of Glauber dynamics via spectral independence for all
degrees},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {137--148},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00022},
doi = {10.1109/FOCS52979.2021.00022},
timestamp = {Wed, 24 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChenFYZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenKM21,
author = {Sitan Chen and
Adam R. Klivans and
Raghu Meka},
title = {Learning Deep ReLU Networks Is Fixed-Parameter Tractable},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {696--707},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00073},
doi = {10.1109/FOCS52979.2021.00073},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenKMY21,
author = {Sitan Chen and
Frederic Koehler and
Ankur Moitra and
Morris Yau},
title = {Online and Distribution-Free Robustness: Regression and Contextual
Bandits with Huber Contamination},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {684--695},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00072},
doi = {10.1109/FOCS52979.2021.00072},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenKMY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenLV21,
author = {Zongchen Chen and
Kuikui Liu and
Eric Vigoda},
title = {Spectral Independence via Stability and Applications to Holant-Type
Problems},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {149--160},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00023},
doi = {10.1109/FOCS52979.2021.00023},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenLV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenPW21,
author = {Li Chen and
Richard Peng and
Di Wang},
title = {2-norm Flow Diffusion in Near-Linear Time},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {540--549},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00060},
doi = {10.1109/FOCS52979.2021.00060},
timestamp = {Fri, 19 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChenPW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CherapanamjeriN21,
author = {Yeshwanth Cherapanamjeri and
Jelani Nelson},
title = {Terminal Embeddings in Sublinear Time},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1209--1216},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00118},
doi = {10.1109/FOCS52979.2021.00118},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CherapanamjeriN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChiaCLY21,
author = {Nai{-}Hui Chia and
Kai{-}Min Chung and
Qipeng Liu and
Takashi Yamakawa},
title = {On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant
Round},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {59--67},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00015},
doi = {10.1109/FOCS52979.2021.00015},
timestamp = {Fri, 30 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChiaCLY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChiesaMSZ21,
author = {Alessandro Chiesa and
Fermi Ma and
Nicholas Spooner and
Mark Zhandry},
title = {Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {49--58},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00014},
doi = {10.1109/FOCS52979.2021.00014},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChiesaMSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChouGSV21,
author = {Chi{-}Ning Chou and
Alexander Golovnev and
Madhu Sudan and
Santhoshini Velusamy},
title = {Approximability of all finite CSPs with linear sketches},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1197--1208},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00117},
doi = {10.1109/FOCS52979.2021.00117},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChouGSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChoudhuriJJ21,
author = {Arka Rai Choudhuri and
Abhishek Jain and
Zhengzhong Jin},
title = {SNARGs for {\textdollar}{\textbackslash}mathcal\{P\}{\textdollar}
from {LWE}},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {68--79},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00016},
doi = {10.1109/FOCS52979.2021.00016},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChoudhuriJJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CobleC21,
author = {Nolan J. Coble and
Matthew Coudron},
title = {Quasi-polynomial Time Approximation of Output Probabilities of Geometrically-local,
Shallow Quantum Circuits},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {598--609},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00065},
doi = {10.1109/FOCS52979.2021.00065},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CobleC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-Addad0KPT21,
author = {Vincent Cohen{-}Addad and
Debarati Das and
Evangelos Kipouridis and
Nikos Parotsidis and
Mikkel Thorup},
title = {Fitting Distances by Tree Metrics Minimizing the Total Error within
a Constant Factor},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {468--479},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00054},
doi = {10.1109/FOCS52979.2021.00054},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Cohen-Addad0KPT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CzerwinskiO21,
author = {Wojciech Czerwinski and
Lukasz Orlikowski},
title = {Reachability in Vector Addition Systems is Ackermann-complete},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1229--1240},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00120},
doi = {10.1109/FOCS52979.2021.00120},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CzerwinskiO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DalirrooyfardLW21,
author = {Mina Dalirrooyfard and
Ray Li and
Virginia Vassilevska Williams},
title = {Hardness of Approximate Diameter: Now for Undirected Graphs},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1021--1032},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00102},
doi = {10.1109/FOCS52979.2021.00102},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DalirrooyfardLW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DietrichW21,
author = {Heiko Dietrich and
James B. Wilson},
title = {Group isomorphism is nearly-linear time for most orders},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {457--467},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00053},
doi = {10.1109/FOCS52979.2021.00053},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DietrichW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DingdNS21,
author = {Jingqiu Ding and
Tommaso d'Orsi and
Rajai Nasser and
David Steurer},
title = {Robust recovery for stochastic block models},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {387--394},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00046},
doi = {10.1109/FOCS52979.2021.00046},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DingdNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DinurKK21,
author = {Itai Dinur and
Nathan Keller and
Ohad Klein},
title = {Fine-Grained Cryptanalysis: Tight Conditional Bounds for Dense k-SUM
and k-XOR},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {80--91},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00017},
doi = {10.1109/FOCS52979.2021.00017},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DinurKK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DotyEGSUS21,
author = {David Doty and
Mahsa Eftekhari and
Leszek Gasieniec and
Eric E. Severson and
Przemyslaw Uznanski and
Grzegorz Stachowiak},
title = {A time and space optimal stable population protocol solving exact
majority},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1044--1055},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00104},
doi = {10.1109/FOCS52979.2021.00104},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DotyEGSUS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DuttaD021,
author = {Pranjal Dutta and
Prateek Dwivedi and
Nitin Saxena},
title = {Demystifying the border of depth-3 algebraic circuits},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {92--103},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00018},
doi = {10.1109/FOCS52979.2021.00018},
timestamp = {Thu, 07 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DuttaD021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DuttingEFK21,
author = {Paul D{\"{u}}tting and
Tomer Ezra and
Michal Feldman and
Thomas Kesselheim},
title = {Combinatorial Contracts},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {815--826},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00084},
doi = {10.1109/FOCS52979.2021.00084},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DuttingEFK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EfremenkoKPS21,
author = {Klim Efremenko and
Gillat Kol and
Dmitry Paramonov and
Raghuvansh R. Saxena},
title = {Tight Bounds for General Computation in Noisy Broadcast Networks},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {634--645},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00068},
doi = {10.1109/FOCS52979.2021.00068},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/EfremenkoKPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmanMT21,
author = {Vitaly Feldman and
Audra McMillan and
Kunal Talwar},
title = {Hiding Among the Clones: {A} Simple and Nearly Optimal Analysis of
Privacy Amplification by Shuffling},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {954--964},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00096},
doi = {10.1109/FOCS52979.2021.00096},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeldmanMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FerberKS21,
author = {Asaf Ferber and
Matthew Kwan and
Lisa Sauermann},
title = {List-decodability with large radius for Reed-Solomon codes},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {720--726},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00075},
doi = {10.1109/FOCS52979.2021.00075},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FerberKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Filos-RatsikasH21,
author = {Aris Filos{-}Ratsikas and
Kristoffer Arnsfelt Hansen and
Kasper H{\o}gh and
Alexandros Hollender},
title = {FIXP-membership via Convex Optimization: Games, Cakes, and Markets},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {827--838},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00085},
doi = {10.1109/FOCS52979.2021.00085},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Filos-RatsikasH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Filtser21,
author = {Arnold Filtser},
title = {Hop-Constrained Metric Embeddings and their Applications},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {492--503},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00056},
doi = {10.1109/FOCS52979.2021.00056},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Filtser21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FioriniJWY21,
author = {Samuel Fiorini and
Gwena{\"{e}}l Joret and
Stefan Weltge and
Yelena Yuditsky},
title = {Integer programs with bounded subdeterminants and two nonzeros per
row},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {13--24},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00011},
doi = {10.1109/FOCS52979.2021.00011},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/FioriniJWY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ForsterGLPSY21,
author = {Sebastian Forster and
Gramoz Goranci and
Yang P. Liu and
Richard Peng and
Xiaorui Sun and
Mingquan Ye},
title = {Minor Sparsifiers and the Distributed Laplacian Paradigm},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {989--999},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00099},
doi = {10.1109/FOCS52979.2021.00099},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ForsterGLPSY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GaoHHNYZ21,
author = {Ruiquan Gao and
Zhongtian He and
Zhiyi Huang and
Zipei Nie and
Bijun Yuan and
Yan Zhong},
title = {Improved Online Correlated Selection},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1265--1276},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00123},
doi = {10.1109/FOCS52979.2021.00123},
timestamp = {Thu, 23 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GaoHHNYZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GaoLP21,
author = {Yu Gao and
Yang P. Liu and
Richard Peng},
title = {Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {516--527},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00058},
doi = {10.1109/FOCS52979.2021.00058},
timestamp = {Fri, 14 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GaoLP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GhaffariK21,
author = {Mohsen Ghaffari and
Fabian Kuhn},
title = {Deterministic Distributed Vertex Coloring: Simpler, Faster, and without
Network Decomposition},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1009--1020},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00101},
doi = {10.1109/FOCS52979.2021.00101},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GhaffariK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuoLSTW21,
author = {Zeyu Guo and
Ray Li and
Chong Shangguan and
Itzhak Tamo and
Mary Wootters},
title = {Improved List-Decodability and List-Recoverability of Reed-Solomon
Codes via Tree Packings: [Extended Abstract]},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {708--719},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00074},
doi = {10.1109/FOCS52979.2021.00074},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GuoLSTW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiHL21,
author = {Venkatesan Guruswami and
Xiaoyu He and
Ray Li},
title = {The zero-rate threshold for adversarial bit-deletions is less than
1/2},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {727--738},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00076},
doi = {10.1109/FOCS52979.2021.00076},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiHL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaghtalabRS21,
author = {Nika Haghtalab and
Tim Roughgarden and
Abhishek Shetty},
title = {Smoothed Analysis with Adaptive Adversaries},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {942--953},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00095},
doi = {10.1109/FOCS52979.2021.00095},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HaghtalabRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HatamiHTT21,
author = {Pooya Hatami and
William M. Hoza and
Avishay Tal and
Roei Tell},
title = {Fooling Constant-Depth Threshold Circuits (Extended Abstract)},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {104--115},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00019},
doi = {10.1109/FOCS52979.2021.00019},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HatamiHTT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HiraharaN21,
author = {Shuichi Hirahara and
Mikito Nanashima},
title = {On Worst-Case Learning in Relativized Heuristica},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {751--758},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00078},
doi = {10.1109/FOCS52979.2021.00078},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HiraharaN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ilango21,
author = {Rahul Ilango},
title = {The Minimum Formula Size Problem is {(ETH)} Hard},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {427--432},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00050},
doi = {10.1109/FOCS52979.2021.00050},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ilango21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JainPV21,
author = {Vishesh Jain and
Huy Tuan Pham and
Thuy{-}Duong Vuong},
title = {Towards the sampling Lov{\'{a}}sz Local Lemma},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {173--183},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00025},
doi = {10.1109/FOCS52979.2021.00025},
timestamp = {Tue, 16 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/JainPV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JiNV0Y21,
author = {Zhengfeng Ji and
Anand Natarajan and
Thomas Vidick and
John Wright and
Henry Yuen},
title = {Quantum soundness of testing tensor codes},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {586--597},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00064},
doi = {10.1109/FOCS52979.2021.00064},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JiNV0Y21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JonesPRTX21,
author = {Chris Jones and
Aaron Potechin and
Goutham Rajendran and
Madhur Tulsiani and
Jeff Xu},
title = {Sum-of-Squares Lower Bounds for Sparse Independent Set},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {406--416},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00048},
doi = {10.1109/FOCS52979.2021.00048},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JonesPRTX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kallaugher21,
author = {John Kallaugher},
title = {A Quantum Advantage for a Natural Streaming Problem},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {897--908},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00091},
doi = {10.1109/FOCS52979.2021.00091},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kallaugher21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KangKKMO21,
author = {Dong Yeap Kang and
Tom Kelly and
Daniela K{\"{u}}hn and
Abhishek Methuku and
Deryk Osthus},
title = {A proof of the Erd{\"{o}}s-Faber-Lov{\'{a}}sz conjecture:
Algorithmic aspects},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1080--1089},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00107},
doi = {10.1109/FOCS52979.2021.00107},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KangKKMO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KapralovKTY21,
author = {Michael Kapralov and
Robert Krauthgamer and
Jakab Tardos and
Yuichi Yoshida},
title = {Spectral Hypergraph Sparsifiers of Nearly Linear Size},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1159--1170},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00114},
doi = {10.1109/FOCS52979.2021.00114},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KapralovKTY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KawarabayashiS21,
author = {Ken{-}ichi Kawarabayashi and
Anastasios Sidiropoulos},
title = {Embeddings of Planar Quasimetrics into Directed {\(\mathscr{l}\)}1
and Polylogarithmic Approximation for Directed Sparsest-Cut},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {480--491},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00055},
doi = {10.1109/FOCS52979.2021.00055},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KawarabayashiS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KelnerKMR21,
author = {Jonathan A. Kelner and
Frederic Koehler and
Raghu Meka and
Dhruv Rohatgi},
title = {On the Power of Preconditioning in Sparse Linear Regression},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {550--561},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00061},
doi = {10.1109/FOCS52979.2021.00061},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KelnerKMR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kisfaludi-BakNW21,
author = {S{\'{a}}ndor Kisfaludi{-}Bak and
Jesper Nederlof and
Karol Wegrzycki},
title = {A Gap-ETH-Tight Approximation Scheme for Euclidean {TSP}},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {351--362},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00043},
doi = {10.1109/FOCS52979.2021.00043},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Kisfaludi-BakNW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KociumakaPS21,
author = {Tomasz Kociumaka and
Ely Porat and
Tatiana Starikovskaya},
title = {Small-space and streaming pattern matching with {\textdollar}k{\textdollar}
edits},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {885--896},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00090},
doi = {10.1109/FOCS52979.2021.00090},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KociumakaPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KondoMM21,
author = {Yasuhiro Kondo and
Ryuhei Mori and
Ramis Movassagh},
title = {Quantum supremacy and hardness of estimating output probabilities
of quantum circuits},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1296--1307},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00126},
doi = {10.1109/FOCS52979.2021.00126},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KondoMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Korhonen21,
author = {Tuukka Korhonen},
title = {A Single-Exponential Time 2-Approximation Algorithm for Treewidth},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {184--192},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00026},
doi = {10.1109/FOCS52979.2021.00026},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Korhonen21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Korten21,
author = {Oliver Korten},
title = {The Hardest Explicit Construction},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {433--444},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00051},
doi = {10.1109/FOCS52979.2021.00051},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Korten21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KuszmaulN21,
author = {William Kuszmaul and
Shyam Narayanan},
title = {Stochastic and Worst-Case Generalized Sorting Revisited},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1056--1067},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00105},
doi = {10.1109/FOCS52979.2021.00105},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KuszmaulN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeW21,
author = {Hung Le and
Christian Wulff{-}Nilsen},
title = {Optimal Approximate Distance Oracle for Planar Graphs},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {363--374},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00044},
doi = {10.1109/FOCS52979.2021.00044},
timestamp = {Sun, 05 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/LeW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LecomteT21,
author = {Victor Lecomte and
Li{-}Yang Tan},
title = {Sharper bounds on the Fourier concentration of DNFs},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {930--941},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00094},
doi = {10.1109/FOCS52979.2021.00094},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LecomteT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeV21,
author = {Jasper C. H. Lee and
Paul Valiant},
title = {Optimal Sub-Gaussian Mean Estimation in {\textdollar}{\textbackslash}mathbb\{R\}{\textdollar}},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {672--683},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00071},
doi = {10.1109/FOCS52979.2021.00071},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LeeV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Leroux21,
author = {J{\'{e}}r{\^{o}}me Leroux},
title = {The Reachability Problem for Petri Nets is Not Primitive Recursive},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1241--1252},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00121},
doi = {10.1109/FOCS52979.2021.00121},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Leroux21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiV21,
author = {Wenzheng Li and
Jan Vondr{\'{a}}k},
title = {A constant-factor approximation algorithm for Nash Social Welfare
with submodular valuations},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {25--36},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00012},
doi = {10.1109/FOCS52979.2021.00012},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiWY21,
author = {Yuanzhi Li and
Ruosong Wang and
Lin F. Yang},
title = {Settling the Horizon-Dependence of Sample Complexity in Reinforcement
Learning},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {965--976},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00097},
doi = {10.1109/FOCS52979.2021.00097},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/LiWY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Limaye0T21,
author = {Nutan Limaye and
Srikanth Srinivasan and
S{\'{e}}bastien Tavenas},
title = {Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {804--814},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00083},
doi = {10.1109/FOCS52979.2021.00083},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Limaye0T21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiuMR21,
author = {Siqi Liu and
Sidhanth Mohanty and
Prasad Raghavendra},
title = {On statistical inference when fixed points of belief propagation are
unstable},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {395--405},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00047},
doi = {10.1109/FOCS52979.2021.00047},
timestamp = {Fri, 12 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/LiuMR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Mao21,
author = {Xiao Mao},
title = {Breaking the Cubic Barrier for (Unweighted) Tree Edit Distance},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {792--803},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00082},
doi = {10.1109/FOCS52979.2021.00082},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Mao21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MiltzowS21,
author = {Tillmann Miltzow and
Reinier F. Schmiermann},
title = {On Classifying Continuous Constraint Satisfaction problems},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {781--791},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00081},
doi = {10.1109/FOCS52979.2021.00081},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MiltzowS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Mitchell21,
author = {Joseph S. B. Mitchell},
title = {Approximating Maximum Independent Set for Rectangles in the Plane},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {339--350},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00042},
doi = {10.1109/FOCS52979.2021.00042},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Mitchell21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Moroz21,
author = {Guillaume Moroz},
title = {New data structure for univariate polynomial approximation and applications
to root isolation, numerical multipoint evaluation, and other problems},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1090--1099},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00108},
doi = {10.1109/FOCS52979.2021.00108},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Moroz21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NamSS21,
author = {Danny Nam and
Allan Sly and
Youngtak Sohn},
title = {One-step replica symmetry breaking of random regular {NAE-SAT}},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {310--318},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00039},
doi = {10.1109/FOCS52979.2021.00039},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NamSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/OlverSK21,
author = {Neil Olver and
Leon Sering and
Laura Vargas Koch},
title = {Continuity, Uniqueness and Long-Term Behavior of Nash Flows Over Time},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {851--860},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00087},
doi = {10.1109/FOCS52979.2021.00087},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/OlverSK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PalmerP21,
author = {Cory Palmer and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
title = {At most 3.55\({}^{\mbox{n}}\) stable matchings},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {217--227},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00029},
doi = {10.1109/FOCS52979.2021.00029},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PalmerP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PitassiRT21,
author = {Toniann Pitassi and
Prasanna Ramakrishnan and
Li{-}Yang Tan},
title = {Tradeoffs for small-depth Frege proofs},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {445--456},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00052},
doi = {10.1109/FOCS52979.2021.00052},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PitassiRT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RobereZ21,
author = {Robert Robere and
Jeroen Zuiddam},
title = {Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic
Algorithms},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {759--769},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00079},
doi = {10.1109/FOCS52979.2021.00079},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RobereZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Sandeep21,
author = {Sai Sandeep},
title = {Almost Optimal Inapproximability of Multidimensional Packing Problems},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {245--256},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00033},
doi = {10.1109/FOCS52979.2021.00033},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Sandeep21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Scheder21,
author = {Dominik Scheder},
title = {{PPSZ} is better than you think},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {205--216},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00028},
doi = {10.1109/FOCS52979.2021.00028},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Scheder21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/TraubZ21,
author = {Vera Traub and
Rico Zenklusen},
title = {A Better-Than-2 Approximation for Weighted Tree Augmentation},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1--12},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00010},
doi = {10.1109/FOCS52979.2021.00010},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/TraubZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Vishnoi21,
author = {Nisheeth K. Vishnoi},
title = {{FOCS} 2021 Preface},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {xvii},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00005},
doi = {10.1109/FOCS52979.2021.00005},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Vishnoi21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Wesolowski21,
author = {Benjamin Wesolowski},
title = {The supersingular isogeny path and endomorphism ring problems are
equivalent},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1100--1111},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00109},
doi = {10.1109/FOCS52979.2021.00109},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Wesolowski21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/WoodruffZ21,
author = {David P. Woodruff and
Samson Zhou},
title = {Tight Bounds for Adversarially Robust Streams and Sliding Windows
via Difference Estimators},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {1183--1196},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00116},
doi = {10.1109/FOCS52979.2021.00116},
timestamp = {Wed, 09 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/WoodruffZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001C20,
author = {Shuai Shao and
Jin{-}Yi Cai},
editor = {Sandy Irani},
title = {A Dichotomy for Real Boolean Holant Problems},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1091--1102},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00105},
doi = {10.1109/FOCS46700.2020.00105},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001C20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001GTTZ20,
author = {Shuchi Chawla and
Evangelia Gergatsouli and
Yifeng Teng and
Christos Tzamos and
Ruimin Zhang},
editor = {Sandy Irani},
title = {Pandora's Box with Correlations: Learning and Approximation},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1214--1225},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00116},
doi = {10.1109/FOCS46700.2020.00116},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001GTTZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001HM20,
author = {Jeff Erickson and
Ivor {van der Hoog} and
Tillmann Miltzow},
editor = {Sandy Irani},
title = {Smoothing the gap between {NP} and {ER}},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1022--1033},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00099},
doi = {10.1109/FOCS46700.2020.00099},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/0001HM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0002T0020,
author = {Zhiyi Huang and
Zhihao Gavin Tang and
Xiaowei Wu and
Yuhao Zhang},
editor = {Sandy Irani},
title = {Fully Online Matching {II:} Beating Ranking and Water-filling},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1380--1391},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00130},
doi = {10.1109/FOCS46700.2020.00130},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0002T0020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0002Z020,
author = {Zhiyi Huang and
Qiankun Zhang and
Yuhao Zhang},
editor = {Sandy Irani},
title = {AdWords in a Panorama},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1416--1426},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00133},
doi = {10.1109/FOCS46700.2020.00133},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/0002Z020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudKT20,
author = {Amir Abboud and
Robert Krauthgamer and
Ohad Trabelsi},
editor = {Sandy Irani},
title = {Cut-Equivalent Trees are Optimal for Min-Cut Queries},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {105--118},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00019},
doi = {10.1109/FOCS46700.2020.00019},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AbboudKT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbrahamsenMS20,
author = {Mikkel Abrahamsen and
Tillmann Miltzow and
Nadja Seiferth},
editor = {Sandy Irani},
title = {Framework for ER-Completeness of Two-Dimensional Packing Problems},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1014--1021},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00098},
doi = {10.1109/FOCS46700.2020.00098},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbrahamsenMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AfshaniC20,
author = {Peyman Afshani and
Pingan Cheng},
editor = {Sandy Irani},
title = {2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {716--727},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00072},
doi = {10.1109/FOCS46700.2020.00072},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AfshaniC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AggarwalO20,
author = {Divesh Aggarwal and
Maciej Obremski},
editor = {Sandy Irani},
title = {A constant rate non-malleable code in the split-state model},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1285--1294},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00122},
doi = {10.1109/FOCS46700.2020.00122},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AggarwalO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AhleK20,
author = {Thomas D. Ahle and
Jakob B{\ae}k Tejs Knudsen},
editor = {Sandy Irani},
title = {Subsets and Supermajorities: Optimal Hashing-based Set Similarity
Search},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {728--739},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00073},
doi = {10.1109/FOCS46700.2020.00073},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AhleK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AhmadinejadKMPS20,
author = {AmirMahdi Ahmadinejad and
Jonathan A. Kelner and
Jack Murtagh and
John Peebles and
Aaron Sidford and
Salil P. Vadhan},
editor = {Sandy Irani},
title = {High-precision Estimation of Random Walks in Small Space},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1295--1306},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00123},
doi = {10.1109/FOCS46700.2020.00123},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AhmadinejadKMPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanCS020,
author = {Josh Alman and
Timothy Chu and
Aaron Schild and
Zhao Song},
editor = {Sandy Irani},
title = {Algorithms and Hardness for Linear Algebra on Geometric Graphs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {541--552},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00057},
doi = {10.1109/FOCS46700.2020.00057},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanCS020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnariD20,
author = {Nima Anari and
Michal Derezinski},
editor = {Sandy Irani},
title = {Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision
Counting of Matroid Bases},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1331--1344},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00126},
doi = {10.1109/FOCS46700.2020.00126},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AnariD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnariLG20,
author = {Nima Anari and
Kuikui Liu and
Shayan Oveis Gharan},
editor = {Sandy Irani},
title = {Spectral Independence in High-Dimensional Expanders and Applications
to the Hardcore Model},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1319--1330},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00125},
doi = {10.1109/FOCS46700.2020.00125},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AnariLG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniN20,
author = {Alexandr Andoni and
Negev Shekel Nosatzki},
editor = {Sandy Irani},
title = {Edit Distance in Near-Linear Time: it's a Constant Factor},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {990--1001},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00096},
doi = {10.1109/FOCS46700.2020.00096},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndoniN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnshuAKS20,
author = {Anurag Anshu and
Srinivasan Arunachalam and
Tomotaka Kuwahara and
Mehdi Soleimanifar},
editor = {Sandy Irani},
title = {Sample-efficient learning of quantum many-body systems},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {685--691},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00069},
doi = {10.1109/FOCS46700.2020.00069},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnshuAKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ApersW20,
author = {Simon Apers and
Ronald de Wolf},
editor = {Sandy Irani},
title = {Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian
Solving},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {637--648},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00065},
doi = {10.1109/FOCS46700.2020.00065},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ApersW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ApplebaumKP20,
author = {Benny Applebaum and
Eliran Kachlon and
Arpita Patra},
editor = {Sandy Irani},
title = {The Round Complexity of Perfect {MPC} with Active Security and Optimal
Resiliency},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1277--1284},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00121},
doi = {10.1109/FOCS46700.2020.00121},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ApplebaumKP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AssadiKSY20,
author = {Sepehr Assadi and
Gillat Kol and
Raghuvansh R. Saxena and
Huacheng Yu},
editor = {Sandy Irani},
title = {Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT,
Matching Size, and Other Problems},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {354--364},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00041},
doi = {10.1109/FOCS46700.2020.00041},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AssadiKSY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AssadiR20,
author = {Sepehr Assadi and
Ran Raz},
editor = {Sandy Irani},
title = {Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {342--353},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00040},
doi = {10.1109/FOCS46700.2020.00040},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AssadiR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AxiotisMV20,
author = {Kyriakos Axiotis and
Aleksander Madry and
Adrian Vladu},
editor = {Sandy Irani},
title = {Circulation Control for Faster Minimum Cost Flow in Unit-Capacity
Graphs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {93--104},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00018},
doi = {10.1109/FOCS46700.2020.00018},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AxiotisMV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AzarT20,
author = {Yossi Azar and
Noam Touitou},
editor = {Sandy Irani},
title = {Beyond Tree Embeddings - a Deterministic Framework for Network Design
with Deadlines or Delay},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1368--1379},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00129},
doi = {10.1109/FOCS46700.2020.00129},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AzarT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BabichenkoR20,
author = {Yakov Babichenko and
Aviad Rubinstein},
editor = {Sandy Irani},
title = {Communication complexity of Nash equilibrium in potential games (extended
abstract)},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1439--1445},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00137},
doi = {10.1109/FOCS46700.2020.00137},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BabichenkoR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BakshiCJ20,
author = {Ainesh Bakshi and
Nadiia Chepurko and
Rajesh Jayaram},
editor = {Sandy Irani},
title = {Testing Positive Semi-Definiteness via Random Submatrices},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1191--1202},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00114},
doi = {10.1109/FOCS46700.2020.00114},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BakshiCJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BakshiCW20,
author = {Ainesh Bakshi and
Nadiia Chepurko and
David P. Woodruff},
editor = {Sandy Irani},
title = {Robust and Sample Optimal Algorithms for {PSD} Low Rank Approximation},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {506--516},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00054},
doi = {10.1109/FOCS46700.2020.00054},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BakshiCW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BakshiDHKKK20,
author = {Ainesh Bakshi and
Ilias Diakonikolas and
Samuel B. Hopkins and
Daniel Kane and
Sushrut Karmalkar and
Pravesh K. Kothari},
editor = {Sandy Irani},
title = {Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {149--159},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00023},
doi = {10.1109/FOCS46700.2020.00023},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BakshiDHKKK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Balliu0O20,
author = {Alkida Balliu and
Sebastian Brandt and
Dennis Olivetti},
editor = {Sandy Irani},
title = {Distributed Lower Bounds for Ruling Sets},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {365--376},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00042},
doi = {10.1109/FOCS46700.2020.00042},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Balliu0O20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BanksGKS20,
author = {Jess Banks and
Jorge Garza{-}Vargas and
Archit Kulkarni and
Nikhil Srivastava},
editor = {Sandy Irani},
title = {Pseudospectral Shattering, the Sign Function, and Diagonalization
in Nearly Matrix Multiplication Time},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {529--540},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00056},
doi = {10.1109/FOCS46700.2020.00056},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BanksGKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BehnezhadD20,
author = {Soheil Behnezhad and
Mahsa Derakhshan},
editor = {Sandy Irani},
title = {Stochastic Weighted Matching: (Stochastic Weighted Matching: (1-{\(\epsilon\)})
Approximation -{\textbackslash}varepsilon{\textdollar}) Approximation},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1392--1403},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00131},
doi = {10.1109/FOCS46700.2020.00131},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BehnezhadD20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-DavidB20,
author = {Shalev Ben{-}David and
Eric Blais},
editor = {Sandy Irani},
title = {A Tight Composition Theorem for the Randomized Query Complexity of
Partial Functions: Extended Abstract},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {240--246},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00031},
doi = {10.1109/FOCS46700.2020.00031},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-DavidB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-DavidB20a,
author = {Shalev Ben{-}David and
Eric Blais},
editor = {Sandy Irani},
title = {A New Minimax Theorem for Randomized Algorithms (Extended Abstract)},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {403--411},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00045},
doi = {10.1109/FOCS46700.2020.00045},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-DavidB20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-DavidCGKPW20,
author = {Shalev Ben{-}David and
Andrew M. Childs and
Andr{\'{a}}s Gily{\'{e}}n and
William Kretschmer and
Supartha Podder and
Daochen Wang},
editor = {Sandy Irani},
title = {Symmetries, Graph Properties, and Quantum Speedups},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {649--660},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00066},
doi = {10.1109/FOCS46700.2020.00066},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-DavidCGKPW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-SassonCIKS20,
author = {Eli Ben{-}Sasson and
Dan Carmon and
Yuval Ishai and
Swastik Kopparty and
Shubhangi Saraf},
editor = {Sandy Irani},
title = {Proximity Gaps for Reed-Solomon Codes},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {900--909},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00088},
doi = {10.1109/FOCS46700.2020.00088},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-SassonCIKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernsteinGS20,
author = {Aaron Bernstein and
Maximilian Probst Gutenberg and
Thatchaphol Saranurak},
editor = {Sandy Irani},
title = {Deterministic Decremental Reachability, SCC, and Shortest Paths via
Directed Expanders and Congestion Balancing},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1123--1134},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00108},
doi = {10.1109/FOCS46700.2020.00108},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BernsteinGS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BernsteinGW20,
author = {Aaron Bernstein and
Maximilian Probst Gutenberg and
Christian Wulff{-}Nilsen},
editor = {Sandy Irani},
title = {Near-Optimal Decremental {SSSP} in Dense Weighted Digraphs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1112--1122},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00107},
doi = {10.1109/FOCS46700.2020.00107},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BernsteinGW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhangaleHPT20,
author = {Amey Bhangale and
Prahladh Harsha and
Orr Paradise and
Avishay Tal},
editor = {Sandy Irani},
title = {Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex
Proofs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {858--869},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00084},
doi = {10.1109/FOCS46700.2020.00084},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhangaleHPT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Bonnet0TW20,
author = {{\'{E}}douard Bonnet and
Eun Jung Kim and
St{\'{e}}phan Thomass{\'{e}} and
R{\'{e}}mi Watrigant},
editor = {Sandy Irani},
title = {Twin-width {I:} tractable {FO} model checking},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {601--612},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00062},
doi = {10.1109/FOCS46700.2020.00062},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Bonnet0TW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BoodaghiansBHR20,
author = {Shant Boodaghians and
Joshua Brakensiek and
Samuel B. Hopkins and
Aviad Rubinstein},
editor = {Sandy Irani},
title = {Smoothed Complexity of 2-player Nash Equilibria},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {271--282},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00034},
doi = {10.1109/FOCS46700.2020.00034},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BoodaghiansBHR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BoyleCGIKS20,
author = {Elette Boyle and
Geoffroy Couteau and
Niv Gilboa and
Yuval Ishai and
Lisa Kohl and
Peter Scholl},
editor = {Sandy Irani},
title = {Correlated Pseudorandom Functions from Variable-Density {LPN}},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1069--1080},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00103},
doi = {10.1109/FOCS46700.2020.00103},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BoyleCGIKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrakensiekLS20,
author = {Joshua Brakensiek and
Ray Li and
Bruce Spang},
editor = {Sandy Irani},
title = {Coded trace reconstruction in a constant number of traces},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {482--493},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00052},
doi = {10.1109/FOCS46700.2020.00052},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BrakensiekLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrakerskiKS20,
author = {Zvika Brakerski and
Yael Tauman Kalai and
Raghuvansh R. Saxena},
editor = {Sandy Irani},
title = {Deterministic and Efficient Interactive Coding from Hard-to-Decode
Tree Codes},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {446--457},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00049},
doi = {10.1109/FOCS46700.2020.00049},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrakerskiKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrandLNPSS0W20,
author = {Jan van den Brand and
Yin Tat Lee and
Danupon Nanongkai and
Richard Peng and
Thatchaphol Saranurak and
Aaron Sidford and
Zhao Song and
Di Wang},
editor = {Sandy Irani},
title = {Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {919--930},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00090},
doi = {10.1109/FOCS46700.2020.00090},
timestamp = {Fri, 19 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BrandLNPSS0W20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanDMMUWZ20,
author = {Vladimir Braverman and
Petros Drineas and
Cameron Musco and
Christopher Musco and
Jalaj Upadhyay and
David P. Woodruff and
Samson Zhou},
editor = {Sandy Irani},
title = {Near Optimal Linear Algebra in the Online and Sliding Window Models},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {517--528},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00055},
doi = {10.1109/FOCS46700.2020.00055},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanDMMUWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanGW20,
author = {Mark Braverman and
Sumegha Garg and
David P. Woodruff},
editor = {Sandy Irani},
title = {The Coin Problem with Applications to Data Streams},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {318--329},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00038},
doi = {10.1109/FOCS46700.2020.00038},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanGW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BroadbentG20,
author = {Anne Broadbent and
Alex B. Grilo},
editor = {Sandy Irani},
title = {QMA-hardness of Consistency of Local Density Matrices with Applications
to Quantum Zero-Knowledge},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {196--205},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00027},
doi = {10.1109/FOCS46700.2020.00027},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BroadbentG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BubeckC020,
author = {S{\'{e}}bastien Bubeck and
Sitan Chen and
Jerry Li},
editor = {Sandy Irani},
title = {Entanglement is Necessary for Optimal Quantum Property Testing},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {692--703},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00070},
doi = {10.1109/FOCS46700.2020.00070},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BubeckC020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BunLM20,
author = {Mark Bun and
Roi Livni and
Shay Moran},
editor = {Sandy Irani},
title = {An Equivalence Between Private Classification and Online Prediction},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {389--402},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00044},
doi = {10.1109/FOCS46700.2020.00044},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BunLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CaiG20,
author = {Jin{-}Yi Cai and
Artem Govorov},
editor = {Sandy Irani},
title = {Dichotomy for Graph Homomorphisms with Complex Values on Bounded Degree
Graphs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1103--1111},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00106},
doi = {10.1109/FOCS46700.2020.00106},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CaiG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CamaraHJ20,
author = {Modibo K. Camara and
Jason D. Hartline and
Aleck C. Johnsen},
editor = {Sandy Irani},
title = {Mechanisms for a No-Regret Agent: Beyond the Common Prior},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {259--270},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00033},
doi = {10.1109/FOCS46700.2020.00033},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CamaraHJ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CarmonJST20,
author = {Yair Carmon and
Yujia Jin and
Aaron Sidford and
Kevin Tian},
editor = {Sandy Irani},
title = {Coordinate Methods for Matrix Games},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {283--293},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00035},
doi = {10.1109/FOCS46700.2020.00035},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CarmonJST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChandrasekaranC20,
author = {Karthekeyan Chandrasekaran and
Chandra Chekuri},
editor = {Sandy Irani},
title = {Hypergraph {\textdollar}k{\textdollar}-cut for fixed {\textdollar}k{\textdollar}
in deterministic polynomial time},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {810--821},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00080},
doi = {10.1109/FOCS46700.2020.00080},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChandrasekaranC20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChangS20,
author = {Yi{-}Jun Chang and
Thatchaphol Saranurak},
editor = {Sandy Irani},
title = {Deterministic Distributed Expander Decomposition and Routing with
Applications in Distributed Derandomization},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {377--388},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00043},
doi = {10.1109/FOCS46700.2020.00043},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChangS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Charalampopoulos20,
author = {Panagiotis Charalampopoulos and
Tomasz Kociumaka and
Philip Wellnitz},
editor = {Sandy Irani},
title = {Faster Approximate Pattern Matching: {A} Unified Approach},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {978--989},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00095},
doi = {10.1109/FOCS46700.2020.00095},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Charalampopoulos20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CharikarKNS20,
author = {Moses Charikar and
Michael Kapralov and
Navid Nouri and
Paris Siminelakis},
editor = {Sandy Irani},
title = {Kernel Density Estimation through Density Constrained Near Neighbor
Search},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {172--183},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00025},
doi = {10.1109/FOCS46700.2020.00025},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CharikarKNS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chatterjee0RST20,
author = {Prerona Chatterjee and
Mrinal Kumar and
C. Ramya and
Ramprasad Saptharishi and
Anamay Tengse},
editor = {Sandy Irani},
title = {On the Existence of Algebraically Natural Proofs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {870--880},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00085},
doi = {10.1109/FOCS46700.2020.00085},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Chatterjee0RST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChattopadhyayGG20,
author = {Eshan Chattopadhyay and
Jesse Goodman and
Vipul Goyal and
Ashutosh Kumar and
Xin Li and
Raghu Meka and
David Zuckerman},
editor = {Sandy Irani},
title = {Extractors and Secret Sharing Against Bounded Collusion Protocols},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1226--1242},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00117},
doi = {10.1109/FOCS46700.2020.00117},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChattopadhyayGG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chen0W20,
author = {Lijie Chen and
Xin Lyu and
R. Ryan Williams},
editor = {Sandy Irani},
title = {Almost-Everywhere Circuit Lower Bounds from Non-Trivial Derandomization},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1--12},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00009},
doi = {10.1109/FOCS46700.2020.00009},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Chen0W20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenGHPS20,
author = {Li Chen and
Gramoz Goranci and
Monika Henzinger and
Richard Peng and
Thatchaphol Saranurak},
editor = {Sandy Irani},
title = {Fast Dynamic Cuts, Distances and Effective Resistances via Vertex
Sparsifiers},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1135--1146},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00109},
doi = {10.1109/FOCS46700.2020.00109},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChenGHPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenKN20,
author = {Yu Chen and
Sanjeev Khanna and
Ansh Nagda},
editor = {Sandy Irani},
title = {Near-linear Size Hypergraph Cut Sparsifiers},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {61--72},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00015},
doi = {10.1109/FOCS46700.2020.00015},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenKN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenLV20,
author = {Zongchen Chen and
Kuikui Liu and
Eric Vigoda},
editor = {Sandy Irani},
title = {Rapid Mixing of Glauber Dynamics up to Uniqueness via Contraction},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1307--1318},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00124},
doi = {10.1109/FOCS46700.2020.00124},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenLV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenRTY20,
author = {Lijie Chen and
Ron D. Rothblum and
Roei Tell and
Eylon Yogev},
editor = {Sandy Irani},
title = {On Exponential-Time Hypotheses, Derandomization, and Circuit Lower
Bounds: Extended Abstract},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {13--23},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00010},
doi = {10.1109/FOCS46700.2020.00010},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenRTY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CheraghchiN20,
author = {Mahdi Cheraghchi and
Vasileios Nakos},
editor = {Sandy Irani},
title = {Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal
Decoding Time},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1203--1213},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00115},
doi = {10.1109/FOCS46700.2020.00115},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CheraghchiN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CherapanamjeriM20,
author = {Yeshwanth Cherapanamjeri and
Sidhanth Mohanty and
Morris Yau},
editor = {Sandy Irani},
title = {List Decodable Mean Estimation in Nearly Linear Time},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {141--148},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00022},
doi = {10.1109/FOCS46700.2020.00022},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CherapanamjeriM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChouGV20,
author = {Chi{-}Ning Chou and
Alexander Golovnev and
Santhoshini Velusamy},
editor = {Sandy Irani},
title = {Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-ksat},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {330--341},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00039},
doi = {10.1109/FOCS46700.2020.00039},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChouGV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChungGLQ20,
author = {Kai{-}Min Chung and
Siyao Guo and
Qipeng Liu and
Luowen Qian},
editor = {Sandy Irani},
title = {Tight Quantum Time-Space Tradeoffs for Function Inversion},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {673--684},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00068},
doi = {10.1109/FOCS46700.2020.00068},
timestamp = {Fri, 30 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChungGLQ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChuzhoyGLNPS20,
author = {Julia Chuzhoy and
Yu Gao and
Jason Li and
Danupon Nanongkai and
Richard Peng and
Thatchaphol Saranurak},
editor = {Sandy Irani},
title = {A Deterministic Algorithm for Balanced Cut with Applications to Dynamic
Connectivity, Flows, and Beyond},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1158--1167},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00111},
doi = {10.1109/FOCS46700.2020.00111},
timestamp = {Fri, 14 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChuzhoyGLNPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChuzhoyMT20,
author = {Julia Chuzhoy and
Sepideh Mahabadi and
Zihan Tan},
editor = {Sandy Irani},
title = {Towards Better Approximation of Graph Crossing Number},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {73--84},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00016},
doi = {10.1109/FOCS46700.2020.00016},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChuzhoyMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadFKL20,
author = {Vincent Cohen{-}Addad and
Arnold Filtser and
Philip N. Klein and
Hung Le},
editor = {Sandy Irani},
title = {On Light Spanners, Low-treewidth Embeddings and Efficient Traversing
in Minor-free Graphs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {589--600},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00061},
doi = {10.1109/FOCS46700.2020.00061},
timestamp = {Sun, 05 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadFKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DadushNV20,
author = {Daniel Dadush and
Bento Natura and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
editor = {Sandy Irani},
title = {Revisiting Tardos's Framework for Linear Programming: Faster Exact
Solutions using Approximate Solvers},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {931--942},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00091},
doi = {10.1109/FOCS46700.2020.00091},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DadushNV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DalirrooyfardLW20,
author = {Mina Dalirrooyfard and
Andrea Lincoln and
Virginia Vassilevska Williams},
editor = {Sandy Irani},
title = {New Techniques for Proving Fine-Grained Average-Case Hardness},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {774--785},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00077},
doi = {10.1109/FOCS46700.2020.00077},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DalirrooyfardLW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DaviesKRTZ20,
author = {Sami Davies and
Janardhan Kulkarni and
Thomas Rothvoss and
Jakub Tarnawski and
Yihao Zhang},
editor = {Sandy Irani},
title = {Scheduling with Communication Delays via {LP} Hierarchies and Clustering},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {822--833},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00081},
doi = {10.1109/FOCS46700.2020.00081},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DaviesKRTZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DiakonikolasK20,
author = {Ilias Diakonikolas and
Daniel M. Kane},
editor = {Sandy Irani},
title = {Small Covers for Near-Zero Sets of Polynomials and Learning Latent
Variable Models},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {184--195},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00026},
doi = {10.1109/FOCS46700.2020.00026},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DiakonikolasK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DoronMOZ20,
author = {Dean Doron and
Dana Moshkovitz and
Justin Oh and
David Zuckerman},
editor = {Sandy Irani},
title = {Nearly Optimal Pseudorandomness From Hardness},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1057--1068},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00102},
doi = {10.1109/FOCS46700.2020.00102},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DoronMOZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Drucker20,
author = {Andrew Drucker},
editor = {Sandy Irani},
title = {An Improved Exponential-Time Approximation Algorithm for Fully-Alternating
Games Against Nature},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1081--1090},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00104},
doi = {10.1109/FOCS46700.2020.00104},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Drucker20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DujmovicEGJMM20,
author = {Vida Dujmovic and
Louis Esperet and
Cyril Gavoille and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin},
editor = {Sandy Irani},
title = {Adjacency Labelling for Planar Graphs (and Beyond)},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {577--588},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00060},
doi = {10.1109/FOCS46700.2020.00060},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DujmovicEGJMM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DuttingKL20,
author = {Paul D{\"{u}}tting and
Thomas Kesselheim and
Brendan Lucier},
editor = {Sandy Irani},
title = {An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {306--317},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00037},
doi = {10.1109/FOCS46700.2020.00037},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DuttingKL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EfremenkoKS20,
author = {Klim Efremenko and
Gillat Kol and
Raghuvansh R. Saxena},
editor = {Sandy Irani},
title = {Binary Interactive Error Resilience Beyond {\textdollar}\{\{\}\{1\}\}{\textbackslash}!/{\textbackslash}!{\_}\{8\}{\textdollar}
(or why {\textdollar}(\{\{\}\{1\}\}{\textbackslash}!/{\textbackslash}!{\_}\{2\})\{3\}
{\textgreater} \{\{\}\{1\}\}{\textbackslash}!/{\textbackslash}!{\_}\{8\}){\textdollar}},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {470--481},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00051},
doi = {10.1109/FOCS46700.2020.00051},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/EfremenkoKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EvraKZ20,
author = {Shai Evra and
Tali Kaufman and
Gilles Z{\'{e}}mor},
editor = {Sandy Irani},
title = {Decodable quantum {LDPC} codes beyond the square root distance barrier
using high dimensional expanders},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {218--227},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00029},
doi = {10.1109/FOCS46700.2020.00029},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EvraKZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Fahrbach0TZ20,
author = {Matthew Fahrbach and
Zhiyi Huang and
Runzhou Tao and
Morteza Zadimoghaddam},
editor = {Sandy Irani},
title = {Edge-Weighted Online Bipartite Matching},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {412--423},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00046},
doi = {10.1109/FOCS46700.2020.00046},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Fahrbach0TZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalanisSV20,
author = {Andreas Galanis and
Daniel Stefankovic and
Eric Vigoda},
editor = {Sandy Irani},
title = {The complexity of approximating averages on bounded-degree graphs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1345--1355},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00127},
doi = {10.1109/FOCS46700.2020.00127},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalanisSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GamarnikJW20,
author = {David Gamarnik and
Aukosh Jagannath and
Alexander S. Wein},
editor = {Sandy Irani},
title = {Low-Degree Hardness of Random Optimization Problems},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {131--140},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00021},
doi = {10.1109/FOCS46700.2020.00021},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GamarnikJW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GargK020,
author = {Ankit Garg and
Neeraj Kayal and
Chandan Saha},
editor = {Sandy Irani},
title = {Learning sums of powers of low-degree polynomials in the non-degenerate
case},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {889--899},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00087},
doi = {10.1109/FOCS46700.2020.00087},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GargK020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GartlandL20,
author = {Peter Gartland and
Daniel Lokshtanov},
editor = {Sandy Irani},
title = {Independent Set on {\textdollar}{\textbackslash}mathrm\{P\}{\_}\{k\}{\textdollar}-Free
Graphs in Quasi-Polynomial Time},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {613--624},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00063},
doi = {10.1109/FOCS46700.2020.00063},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GartlandL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GhoshJJPR20,
author = {Mrinalkanti Ghosh and
Fernando Granha Jeronimo and
Chris Jones and
Aaron Potechin and
Goutham Rajendran},
editor = {Sandy Irani},
title = {Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted
Affine Planes},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {954--965},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00093},
doi = {10.1109/FOCS46700.2020.00093},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GhoshJJPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Gkatzelis0020,
author = {Vasilis Gkatzelis and
Daniel Halpern and
Nisarg Shah},
editor = {Sandy Irani},
title = {Resolving the Optimal Metric Distortion Conjecture},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1427--1438},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00134},
doi = {10.1109/FOCS46700.2020.00134},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Gkatzelis0020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GolovnevP0W20,
author = {Alexander Golovnev and
Gleb Posobin and
Oded Regev and
Omri Weinstein},
editor = {Sandy Irani},
title = {Polynomial Data Structure Lower Bounds in the Group Model},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {740--751},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00074},
doi = {10.1109/FOCS46700.2020.00074},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GolovnevP0W20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GroheWN20,
author = {Martin Grohe and
Daniel Wiebking and
Daniel Neuen},
editor = {Sandy Irani},
title = {Isomorphism Testing for Graphs Excluding Small Minors},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {625--636},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00064},
doi = {10.1109/FOCS46700.2020.00064},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GroheWN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuptaL20,
author = {Anupam Gupta and
Roie Levin},
editor = {Sandy Irani},
title = {Fully-Dynamic Submodular Cover with Bounded Recourse},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1147--1157},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00110},
doi = {10.1109/FOCS46700.2020.00110},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GuptaL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaeuplerWZ20,
author = {Bernhard Haeupler and
David Wajc and
Goran Zuzic},
editor = {Sandy Irani},
title = {Network Coding Gaps for Completion Times of Multiple Unicasts},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {494--505},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00053},
doi = {10.1109/FOCS46700.2020.00053},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HaeuplerWZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaitnerK20,
author = {Iftach Haitner and
Yonatan Karidi{-}Heller},
editor = {Sandy Irani},
title = {A Tight Lower Bound on Adaptively Secure Full-Information Coin Flip},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1268--1276},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00120},
doi = {10.1109/FOCS46700.2020.00120},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HaitnerK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HartlineJL20,
author = {Jason D. Hartline and
Aleck C. Johnsen and
Yingkai Li},
editor = {Sandy Irani},
title = {Benchmark Design and Prior-independent Optimization},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {294--305},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00036},
doi = {10.1109/FOCS46700.2020.00036},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HartlineJL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HarveyLPR20,
author = {Nicholas J. A. Harvey and
Christopher Liaw and
Edwin A. Perkins and
Sikander Randhawa},
editor = {Sandy Irani},
title = {Optimal anytime regret for two experts},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1404--1415},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00132},
doi = {10.1109/FOCS46700.2020.00132},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HarveyLPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Hirahara20,
author = {Shuichi Hirahara},
editor = {Sandy Irani},
title = {Characterizing Average-Case Complexity of {PH} by Worst-Case Meta-Complexity},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {50--60},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00014},
doi = {10.1109/FOCS46700.2020.00014},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Hirahara20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HopkinsKLM20,
author = {Max Hopkins and
Daniel Kane and
Shachar Lovett and
Gaurav Mahajan},
editor = {Sandy Irani},
title = {Point Location and Active Learning: Learning Halfspaces Almost Optimally},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1034--1044},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00100},
doi = {10.1109/FOCS46700.2020.00100},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HopkinsKLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HopkinsST20,
author = {Samuel B. Hopkins and
Tselil Schramm and
Luca Trevisan},
editor = {Sandy Irani},
title = {Subexponential LPs Approximate Max-Cut},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {943--953},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00092},
doi = {10.1109/FOCS46700.2020.00092},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HopkinsST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/IbrahimpurS20,
author = {Sharat Ibrahimpur and
Chaitanya Swamy},
editor = {Sandy Irani},
title = {Approximation Algorithms for Stochastic Minimum-Norm Combinatorial
Optimization},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {966--977},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00094},
doi = {10.1109/FOCS46700.2020.00094},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/IbrahimpurS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ilango20,
author = {Rahul Ilango},
editor = {Sandy Irani},
title = {Constant Depth Formula and Partial Function Versions of {MCSP} are
Hard},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {424--433},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00047},
doi = {10.1109/FOCS46700.2020.00047},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ilango20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JeronimoQST20,
author = {Fernando Granha Jeronimo and
Dylan Quintana and
Shashank Srivastava and
Madhur Tulsiani},
editor = {Sandy Irani},
title = {Unique Decoding of Explicit {\textdollar}{\textbackslash}varepsilon{\textdollar}-balanced
Codes Near the Gilbert-Varshamov Bound},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {434--445},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00048},
doi = {10.1109/FOCS46700.2020.00048},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JeronimoQST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JiangKLP020,
author = {Haotian Jiang and
Tarun Kathuria and
Yin Tat Lee and
Swati Padmanabhan and
Zhao Song},
editor = {Sandy Irani},
title = {A Faster Interior Point Method for Semidefinite Programming},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {910--918},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00089},
doi = {10.1109/FOCS46700.2020.00089},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JiangKLP020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Karpov0020,
author = {Nikolai Karpov and
Qin Zhang and
Yuan Zhou},
editor = {Sandy Irani},
title = {Collaborative Top Distribution Identifications with Limited Interaction
(Extended Abstract)},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {160--171},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00024},
doi = {10.1109/FOCS46700.2020.00024},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Karpov0020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KathuriaLS20,
author = {Tarun Kathuria and
Yang P. Liu and
Aaron Sidford},
editor = {Sandy Irani},
title = {Unit Capacity Maxflow in Almost {\textdollar}O(m\{4/3\}){\textdollar}
Time},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {119--130},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00020},
doi = {10.1109/FOCS46700.2020.00020},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KathuriaLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KelmanKLMS20,
author = {Esty Kelman and
Guy Kindler and
Noam Lifshitz and
Dor Minzer and
Muli Safra},
editor = {Sandy Irani},
title = {Towards a Proof of the Fourier-Entropy Conjecture?},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {247--258},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00032},
doi = {10.1109/FOCS46700.2020.00032},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KelmanKLMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KempaK20,
author = {Dominik Kempa and
Tomasz Kociumaka},
editor = {Sandy Irani},
title = {Resolution of the Burrows-Wheeler Transform Conjecture},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1002--1013},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00097},
doi = {10.1109/FOCS46700.2020.00097},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KempaK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KociumakaS20,
author = {Tomasz Kociumaka and
Barna Saha},
editor = {Sandy Irani},
title = {Sublinear-Time Algorithms for Computing {\&} Embedding Gap Edit
Distance},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1168--1179},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00112},
doi = {10.1109/FOCS46700.2020.00112},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KociumakaS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KulikS20,
author = {Ariel Kulik and
Hadas Shachnai},
editor = {Sandy Irani},
title = {Analysis of Two-variable Recurrence Relations with Application to
Parameterized Approximations},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {762--773},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00076},
doi = {10.1109/FOCS46700.2020.00076},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KulikS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kun-KoW20,
author = {Young Kun{-}Ko and
Omri Weinstein},
editor = {Sandy Irani},
title = {An Adaptive Step Toward the Multiphase Conjecture},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {752--761},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00075},
doi = {10.1109/FOCS46700.2020.00075},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kun-KoW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KushR20,
author = {Deepanshu Kush and
Benjamin Rossman},
editor = {Sandy Irani},
title = {Tree-depth and the Formula Complexity of Subgraph Isomorphism},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {31--42},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00012},
doi = {10.1109/FOCS46700.2020.00012},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KushR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiP20,
author = {Jason Li and
Debmalya Panigrahi},
editor = {Sandy Irani},
title = {Deterministic Min-cut in Poly-logarithmic Max-flows},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {85--92},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00017},
doi = {10.1109/FOCS46700.2020.00017},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiuP20,
author = {Yanyi Liu and
Rafael Pass},
editor = {Sandy Irani},
title = {On One-way Functions and Kolmogorov Complexity},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1243--1254},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00118},
doi = {10.1109/FOCS46700.2020.00118},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/LiuP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lokshtanov0S20,
author = {Daniel Lokshtanov and
Saket Saurabh and
Vaishali Surianarayanan},
editor = {Sandy Irani},
title = {A Parameterized Approximation Scheme for Min {\textdollar}k{\textdollar}-Cut},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {798--809},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00079},
doi = {10.1109/FOCS46700.2020.00079},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lokshtanov0S20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MadanNST20,
author = {Vivek Madan and
Aleksandar Nikolov and
Mohit Singh and
Uthaipon Tantipongpipat},
editor = {Sandy Irani},
title = {Maximizing Determinants under Matroid Constraints},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {565--576},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00059},
doi = {10.1109/FOCS46700.2020.00059},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MadanNST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MaitiRSSV20,
author = {Biswaroop Maiti and
Rajmohan Rajaraman and
David Stalfa and
Zoya Svitkina and
Aravindan Vijayaraghavan},
editor = {Sandy Irani},
title = {Scheduling Precedence-Constrained Jobs on Related Machines with Communication
Delay},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {834--845},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00082},
doi = {10.1109/FOCS46700.2020.00082},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MaitiRSSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MakamW20,
author = {Visu Makam and
Avi Wigderson},
editor = {Sandy Irani},
title = {Symbolic determinant identity testing {(SDIT)} is not a null cone
problem; and the symmetries of algebraic varieties},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {881--888},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00086},
doi = {10.1109/FOCS46700.2020.00086},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MakamW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MancinskaR20,
author = {Laura Mancinska and
David E. Roberson},
editor = {Sandy Irani},
title = {Quantum isomorphism is equivalent to equality of homomorphism counts
from planar graphs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {661--672},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00067},
doi = {10.1109/FOCS46700.2020.00067},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/MancinskaR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MosheiffRRSW20,
author = {Jonathan Mosheiff and
Nicolas Resch and
Noga Ron{-}Zewi and
Shashwat Silas and
Mary Wootters},
editor = {Sandy Irani},
title = {{LDPC} Codes Achieve List Decoding Capacity},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {458--469},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00050},
doi = {10.1109/FOCS46700.2020.00050},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MosheiffRRSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ODonnellW20,
author = {Ryan O'Donnell and
Xinyu Wu},
editor = {Sandy Irani},
title = {Explicit near-fully X-Ramanujan graphs},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1045--1056},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00101},
doi = {10.1109/FOCS46700.2020.00101},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ODonnellW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PassV20,
author = {Rafael Pass and
Muthuramakrishnan Venkitasubramaniam},
editor = {Sandy Irani},
title = {Is it Easier to Prove Theorems that are Guaranteed to be True?},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1255--1267},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00119},
doi = {10.1109/FOCS46700.2020.00119},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/PassV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RezendeMNPR20,
author = {Susanna F. de Rezende and
Or Meir and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere},
editor = {Sandy Irani},
title = {{KRW} Composition Theorems via Lifting},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {43--49},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00013},
doi = {10.1109/FOCS46700.2020.00013},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/RezendeMNPR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RezendeMNPRV20,
author = {Susanna F. de Rezende and
Or Meir and
Jakob Nordstr{\"{o}}m and
Toniann Pitassi and
Robert Robere and
Marc Vinyals},
editor = {Sandy Irani},
title = {Lifting with Simple Gadgets and Applications to Circuit and Proof
Complexity},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {24--30},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00011},
doi = {10.1109/FOCS46700.2020.00011},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/RezendeMNPRV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ron-ZewiR20,
author = {Noga Ron{-}Zewi and
Ron D. Rothblum},
editor = {Sandy Irani},
title = {Local Proofs Approaching the Witness Length [Extended Abstract]},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {846--857},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00083},
doi = {10.1109/FOCS46700.2020.00083},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Ron-ZewiR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Roth0W20,
author = {Marc Roth and
Johannes Schmitt and
Philip Wellnitz},
editor = {Sandy Irani},
title = {Counting Small Induced Subgraphs Satisfying Monotone Properties},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1356--1367},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00128},
doi = {10.1109/FOCS46700.2020.00128},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Roth0W20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SandlundW20,
author = {Bryce Sandlund and
Sebastian Wild},
editor = {Sandy Irani},
title = {Lazy Search Trees},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {704--715},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00071},
doi = {10.1109/FOCS46700.2020.00071},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SandlundW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ShuttyWH20,
author = {Noah Shutty and
Mary Wootters and
Patrick Hayden},
editor = {Sandy Irani},
title = {Tight Limits on Nonlocality from Nontrivial Communication Complexity;
a.k.a. Reliable Computation with Asymmetric Gate Noise},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {206--217},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00028},
doi = {10.1109/FOCS46700.2020.00028},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ShuttyWH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Tal20,
author = {Avishay Tal},
editor = {Sandy Irani},
title = {Towards Optimal Separations between Quantum and Randomized Query Complexities},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {228--239},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00030},
doi = {10.1109/FOCS46700.2020.00030},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Tal20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/TidorZ20,
author = {Jonathan Tidor and
Yufei Zhao},
editor = {Sandy Irani},
title = {Testing linear-invariant properties},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {1180--1190},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00113},
doi = {10.1109/FOCS46700.2020.00113},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/TidorZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/WilliamsX20,
author = {Virginia Vassilevska Williams and
Yinzhan Xu},
editor = {Sandy Irani},
title = {Monochromatic Triangles, Triangle Listing and {APSP}},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {786--797},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00078},
doi = {10.1109/FOCS46700.2020.00078},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/WilliamsX20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/dOrsiKNS20,
author = {Tommaso d'Orsi and
Pravesh K. Kothari and
Gleb Novikov and
David Steurer},
editor = {Sandy Irani},
title = {Sparse {PCA:} Algorithms, Adversarial Perturbations and Certificates},
booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
pages = {553--564},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020.00058},
doi = {10.1109/FOCS46700.2020.00058},
timestamp = {Mon, 25 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/dOrsiKNS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2020,
editor = {Sandy Irani},
title = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2020, Durham, NC, USA, November 16-19, 2020},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/FOCS46700.2020},
doi = {10.1109/FOCS46700.2020},
isbn = {978-1-7281-9621-3},
timestamp = {Wed, 15 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001SS19,
author = {Jingcheng Liu and
Alistair Sinclair and
Piyush Srivastava},
editor = {David Zuckerman},
title = {A Deterministic Algorithm for Counting Colorings with 2-Delta Colors},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1380--1404},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00085},
doi = {10.1109/FOCS.2019.00085},
timestamp = {Thu, 21 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/0001SS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0002MS19,
author = {Ashutosh Kumar and
Raghu Meka and
Amit Sahai},
editor = {David Zuckerman},
title = {Leakage-Resilient Secret Sharing Against Colluding Parties},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {636--660},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00045},
doi = {10.1109/FOCS.2019.00045},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0002MS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AaronsonGS19,
author = {Scott Aaronson and
Daniel Grier and
Luke Schaeffer},
editor = {David Zuckerman},
title = {A Quantum Query Complexity Trichotomy for Regular Languages},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {942--965},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00061},
doi = {10.1109/FOCS.2019.00061},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AaronsonGS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbbeY19,
author = {Emmanuel Abbe and
Min Ye},
editor = {David Zuckerman},
title = {Reed-Muller Codes Polarize},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {273--286},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00026},
doi = {10.1109/FOCS.2019.00026},
timestamp = {Sat, 25 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AbbeY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AchlioptasIS19,
author = {Dimitris Achlioptas and
Fotis Iliopoulos and
Alistair Sinclair},
editor = {David Zuckerman},
title = {Beyond the Lov{\'{a}}sz Local Lemma: Point to Set Correlations
and Their Algorithmic Applications},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {725--744},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00049},
doi = {10.1109/FOCS.2019.00049},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AchlioptasIS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AharonovG19,
author = {Dorit Aharonov and
Alex Bredariol Grilo},
editor = {David Zuckerman},
title = {Stoquastic {PCP} vs. Randomness},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1000--1023},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00065},
doi = {10.1109/FOCS.2019.00065},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AharonovG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlevJT19,
author = {Vedat Levi Alev and
Fernando Granha Jeronimo and
Madhur Tulsiani},
editor = {David Zuckerman},
title = {Approximating Constraint Satisfaction Problems on High-Dimensional
Expanders},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {180--201},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00021},
doi = {10.1109/FOCS.2019.00021},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlevJT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanC19,
author = {Josh Alman and
Lijie Chen},
editor = {David Zuckerman},
title = {Efficient Construction of Rigid Matrices Using an {NP} Oracle},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1034--1055},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00067},
doi = {10.1109/FOCS.2019.00067},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnariR19,
author = {Nima Anari and
Alireza Rezaei},
editor = {David Zuckerman},
title = {A Tight Analysis of Bethe Approximation for Permanent},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1434--1445},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.000-3},
doi = {10.1109/FOCS.2019.000-3},
timestamp = {Tue, 06 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnariR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnshuBT19,
author = {Anurag Anshu and
Naresh Goud Boddu and
Dave Touchette},
editor = {David Zuckerman},
title = {Quantum Log-Approximate-Rank Conjecture is Also False},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {982--994},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00063},
doi = {10.1109/FOCS.2019.00063},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnshuBT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ApplebaumK19,
author = {Benny Applebaum and
Eliran Kachlon},
editor = {David Zuckerman},
title = {Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders
with Negligible Error},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {171--179},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00020},
doi = {10.1109/FOCS.2019.00020},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ApplebaumK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ArmanGW19,
author = {Andrii Arman and
Pu Gao and
Nicholas C. Wormald},
editor = {David Zuckerman},
title = {Fast Uniform Generation of Random Graphs with Given Degree Sequences},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1371--1379},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00084},
doi = {10.1109/FOCS.2019.00084},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ArmanGW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Assadi019,
author = {Sepehr Assadi and
Sahil Singla},
editor = {David Zuckerman},
title = {Improved Truthful Mechanisms for Combinatorial Auctions with Submodular
Bidders},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {233--248},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00024},
doi = {10.1109/FOCS.2019.00024},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Assadi019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AtseriasM19,
author = {Albert Atserias and
Moritz M{\"{u}}ller},
editor = {David Zuckerman},
title = {Automating Resolution is NP-Hard},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {498--509},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00038},
doi = {10.1109/FOCS.2019.00038},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AtseriasM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AzarT19,
author = {Yossi Azar and
Noam Touitou},
editor = {David Zuckerman},
title = {General Framework for Metric Optimization Problems with Delay or with
Deadlines},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {60--71},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00013},
doi = {10.1109/FOCS.2019.00013},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AzarT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Balliu0HORS19,
author = {Alkida Balliu and
Sebastian Brandt and
Juho Hirvonen and
Dennis Olivetti and
Mika{\"{e}}l Rabie and
Jukka Suomela},
editor = {David Zuckerman},
title = {Lower Bounds for Maximal Matchings and Maximal Independent Sets},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {481--497},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00037},
doi = {10.1109/FOCS.2019.00037},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Balliu0HORS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ban0FSS19,
author = {Frank Ban and
Xi Chen and
Adam Freilich and
Rocco A. Servedio and
Sandip Sinha},
editor = {David Zuckerman},
title = {Beyond Trace Reconstruction: Population Recovery from the Deletion
Channel},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {745--768},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00050},
doi = {10.1109/FOCS.2019.00050},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ban0FSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BansalST19,
author = {Nikhil Bansal and
Ola Svensson and
Luca Trevisan},
editor = {David Zuckerman},
title = {New Notions and Constructions of Sparsification for Graphs and Hypergraphs},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {910--928},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00059},
doi = {10.1109/FOCS.2019.00059},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BansalST19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BarthaSZ19,
author = {Zsolt Bartha and
Nike Sun and
Yumeng Zhang},
editor = {David Zuckerman},
title = {Breaking of 1RSB in Random Regular {MAX-NAE-SAT}},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1405--1416},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00086},
doi = {10.1109/FOCS.2019.00086},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BarthaSZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BehnezhadDELM19,
author = {Soheil Behnezhad and
Laxman Dhulipala and
Hossein Esfandiari and
Jakub Lacki and
Vahab S. Mirrokni},
editor = {David Zuckerman},
title = {Near-Optimal Massively Parallel Graph Connectivity},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1615--1636},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00095},
doi = {10.1109/FOCS.2019.00095},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BehnezhadDELM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BehnezhadDHSS19,
author = {Soheil Behnezhad and
Mahsa Derakhshan and
MohammadTaghi Hajiaghayi and
Cliff Stein and
Madhu Sudan},
editor = {David Zuckerman},
title = {Fully Dynamic Maximal Independent Set with Polylogarithmic Update
Time},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {382--405},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00032},
doi = {10.1109/FOCS.2019.00032},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BehnezhadDHSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BehnezhadHH19,
author = {Soheil Behnezhad and
MohammadTaghi Hajiaghayi and
David G. Harris},
editor = {David Zuckerman},
title = {Exponentially Faster Massively Parallel Maximal Matching},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1637--1649},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00096},
doi = {10.1109/FOCS.2019.00096},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BehnezhadHH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-EliezerCLW19,
author = {Omri Ben{-}Eliezer and
Cl{\'{e}}ment L. Canonne and
Shoham Letzter and
Erik Waingarten},
editor = {David Zuckerman},
title = {Finding Monotone Patterns in Sublinear Time},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1469--1494},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.000-1},
doi = {10.1109/FOCS.2019.000-1},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Ben-EliezerCLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhaskaraCPV19,
author = {Aditya Bhaskara and
Aidao Chen and
Aidan Perreault and
Aravindan Vijayaraghavan},
editor = {David Zuckerman},
title = {Smoothed Analysis in Unsupervised Learning via Decoupling},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {582--610},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00043},
doi = {10.1109/FOCS.2019.00043},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhaskaraCPV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhaskaraLVZ19,
author = {Aditya Bhaskara and
Silvio Lattanzi and
Sergei Vassilvitskii and
Morteza Zadimoghaddam},
editor = {David Zuckerman},
title = {Residual Based Sampling for Online Low Rank Approximation},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1596--1614},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00094},
doi = {10.1109/FOCS.2019.00094},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhaskaraLVZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhattacharyaHN19,
author = {Sayan Bhattacharya and
Monika Henzinger and
Danupon Nanongkai},
editor = {David Zuckerman},
title = {A New Deterministic Algorithm for Dynamic Set Cover},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {406--423},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00033},
doi = {10.1109/FOCS.2019.00033},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhattacharyaHN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BlasiokLLMR19,
author = {Jaroslaw Blasiok and
Patrick Lopatto and
Kyle Luh and
Jake Marcinek and
Shravas Rao},
editor = {David Zuckerman},
title = {An Improved Lower Bound for Sparse Reconstruction from Subsampled
Hadamard Matrices},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1564--1567},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00091},
doi = {10.1109/FOCS.2019.00091},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BlasiokLLMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Boix-AdseraBB19,
author = {Enric Boix{-}Adser{\`{a}} and
Matthew S. Brennan and
Guy Bresler},
editor = {David Zuckerman},
title = {The Average-Case Complexity of Counting Cliques in Erd{\H{o}}s-R{\'{e}}nyi
Hypergraphs},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1256--1280},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00078},
doi = {10.1109/FOCS.2019.00078},
timestamp = {Tue, 17 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Boix-AdseraBB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrandN19,
author = {Jan van den Brand and
Danupon Nanongkai},
editor = {David Zuckerman},
title = {Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case
Update Time},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {436--455},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00035},
doi = {10.1109/FOCS.2019.00035},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BrandN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrandNS19,
author = {Jan van den Brand and
Danupon Nanongkai and
Thatchaphol Saranurak},
editor = {David Zuckerman},
title = {Dynamic Matrix Inverse: Improved Algorithms and Matching Conditional
Lower Bounds},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {456--480},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00036},
doi = {10.1109/FOCS.2019.00036},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BrandNS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrandS19,
author = {Jan van den Brand and
Thatchaphol Saranurak},
editor = {David Zuckerman},
title = {Sensitive Distance and Reachability Oracles for Large Batch Updates},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {424--435},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00034},
doi = {10.1109/FOCS.2019.00034},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BrandS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravyiGKT19,
author = {Sergey Bravyi and
David Gosset and
Robert K{\"{o}}nig and
Marco Tomamichel},
editor = {David Zuckerman},
title = {Quantum Advantage with Noisy Shallow Circuits in 3D},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {995--999},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00064},
doi = {10.1109/FOCS.2019.00064},
timestamp = {Wed, 13 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BravyiGKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BurgisserFGOWW19,
author = {Peter B{\"{u}}rgisser and
Cole Franks and
Ankit Garg and
Rafael Mendes de Oliveira and
Michael Walter and
Avi Wigderson},
editor = {David Zuckerman},
title = {Towards a Theory of Non-Commutative Optimization: Geodesic 1st and
2nd Order Methods for Moment Maps and Polytopes},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {845--861},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00055},
doi = {10.1109/FOCS.2019.00055},
timestamp = {Fri, 17 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BurgisserFGOWW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChakrabartyLS0W19,
author = {Deeparnab Chakrabarty and
Yin Tat Lee and
Aaron Sidford and
Sahil Singla and
Sam Chiu{-}wai Wong},
editor = {David Zuckerman},
title = {Faster Matroid Intersection},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1146--1168},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00072},
doi = {10.1109/FOCS.2019.00072},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChakrabartyLS0W19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChapmanLP19,
author = {Michael Chapman and
Nati Linial and
Yuval Peled},
editor = {David Zuckerman},
title = {Expander Graphs - Both Local and Global},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {158--170},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00019},
doi = {10.1109/FOCS.2019.00019},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChapmanLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CharikarS19,
author = {Moses Charikar and
Paris Siminelakis},
editor = {David Zuckerman},
title = {Multi-resolution Hashing for Fast Pairwise Summations},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {769--792},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00051},
doi = {10.1109/FOCS.2019.00051},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CharikarS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChechikZ19,
author = {Shiri Chechik and
Tianyi Zhang},
editor = {David Zuckerman},
title = {Fully Dynamic Maximal Independent Set in Expected Poly-Log Update
Time},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {370--381},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00031},
doi = {10.1109/FOCS.2019.00031},
timestamp = {Fri, 25 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChechikZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chen19,
author = {Lijie Chen},
editor = {David Zuckerman},
title = {Non-deterministic Quasi-Polynomial Time is Average-Case Hard for {ACC}
Circuits},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1281--1304},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00079},
doi = {10.1109/FOCS.2019.00079},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Chen19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenJW19,
author = {Lijie Chen and
Ce Jin and
R. Ryan Williams},
editor = {David Zuckerman},
title = {Hardness Magnification for all Sparse {NP} Languages},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1240--1255},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00077},
doi = {10.1109/FOCS.2019.00077},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChenJW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadPP19,
author = {Vincent Cohen{-}Addad and
Michal Pilipczuk and
Marcin Pilipczuk},
editor = {David Zuckerman},
title = {A Polynomial-Time Approximation Scheme for Facility Location on Planar
Graphs},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {560--581},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00042},
doi = {10.1109/FOCS.2019.00042},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadS19,
author = {Vincent Cohen{-}Addad and
{Karthik {C. S.}}},
editor = {David Zuckerman},
title = {Inapproximability of Clustering in Lp Metrics},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {519--539},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00040},
doi = {10.1109/FOCS.2019.00040},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohenPW19,
author = {Ilan Reuven Cohen and
Binghui Peng and
David Wajc},
editor = {David Zuckerman},
title = {Tight Bounds for Online Edge Coloring},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1--25},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00010},
doi = {10.1109/FOCS.2019.00010},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CohenPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cryan0M19,
author = {Mary Cryan and
Heng Guo and
Giorgos Mousa},
editor = {David Zuckerman},
title = {Modified log-Sobolev Inequalities for Strongly Log-Concave Distributions},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1358--1370},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00083},
doi = {10.1109/FOCS.2019.00083},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cryan0M19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CzumajS19,
author = {Artur Czumaj and
Christian Sohler},
editor = {David Zuckerman},
title = {A Characterization of Graph Properties Testable for General Planar
Graphs with one-Sided Error (It's all About Forbidden Subgraphs)},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1525--1548},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00089},
doi = {10.1109/FOCS.2019.00089},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CzumajS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DeMN19,
author = {Anindya De and
Elchanan Mossel and
Joe Neeman},
editor = {David Zuckerman},
title = {Junta Correlation is Testable},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1549--1563},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00090},
doi = {10.1109/FOCS.2019.00090},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DeMN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DiksteinD19,
author = {Yotam Dikstein and
Irit Dinur},
editor = {David Zuckerman},
title = {Agreement Testing Theorems on Layered Set Systems},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1495--1524},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00088},
doi = {10.1109/FOCS.2019.00088},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DiksteinD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DottlingGGM19,
author = {Nico D{\"{o}}ttling and
Sanjam Garg and
Vipul Goyal and
Giulio Malavolta},
editor = {David Zuckerman},
title = {Laconic Conditional Disclosure of Secrets and Applications},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {661--685},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00046},
doi = {10.1109/FOCS.2019.00046},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DottlingGGM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DujmovicJMMUW19,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
Torsten Ueckerdt and
David R. Wood},
editor = {David Zuckerman},
title = {Planar Graphs have Bounded Queue-Number},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {862--875},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00056},
doi = {10.1109/FOCS.2019.00056},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DujmovicJMMUW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DworkKRRY19,
author = {Cynthia Dwork and
Michael P. Kim and
Omer Reingold and
Guy N. Rothblum and
Gal Yona},
editor = {David Zuckerman},
title = {Learning from Outcomes: Evidence-Based Rankings},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {106--125},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00016},
doi = {10.1109/FOCS.2019.00016},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DworkKRRY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EfremenkoKS19,
author = {Klim Efremenko and
Gillat Kol and
Raghuvansh Saxena},
editor = {David Zuckerman},
title = {Radio Network Coding Requires Logarithmic Overhead},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {348--369},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00030},
doi = {10.1109/FOCS.2019.00030},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/EfremenkoKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EnglertRS19,
author = {Matthias Englert and
Harald R{\"{a}}cke and
Richard Stotz},
editor = {David Zuckerman},
title = {Polylogarithmic Guarantees for Generalized Reordering Buffer Management},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {38--59},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00012},
doi = {10.1109/FOCS.2019.00012},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EnglertRS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EzraFNTW19,
author = {Tomer Ezra and
Michal Feldman and
Eric Neyman and
Inbal Talgam{-}Cohen and
S. Matthew Weinberg},
editor = {David Zuckerman},
title = {Settling the Communication Complexity of Combinatorial Auctions with
Two Subadditive Buyers},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {249--272},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00025},
doi = {10.1109/FOCS.2019.00025},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/EzraFNTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GajjarR19,
author = {Kshitij Gajjar and
Jaikumar Radhakrishnan},
editor = {David Zuckerman},
title = {Parametric Shortest Paths in Planar Graphs},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {876--895},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00057},
doi = {10.1109/FOCS.2019.00057},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GajjarR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalesiKT19,
author = {Nicola Galesi and
Leszek Aleksander Kolodziejczyk and
Neil Thapen},
editor = {David Zuckerman},
title = {Polynomial Calculus Space and Resolution Width},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1325--1337},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00081},
doi = {10.1109/FOCS.2019.00081},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalesiKT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GamlathKMSW19,
author = {Buddhima Gamlath and
Michael Kapralov and
Andreas Maggiori and
Ola Svensson and
David Wajc},
editor = {David Zuckerman},
title = {Online Matching with General Arrivals},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {26--37},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00011},
doi = {10.1109/FOCS.2019.00011},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GamlathKMSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GanardiJL19,
author = {Moses Ganardi and
Artur Jez and
Markus Lohrey},
editor = {David Zuckerman},
title = {Balancing Straight-Line Programs},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1169--1183},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00073},
doi = {10.1109/FOCS.2019.00073},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GanardiJL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GargMOW19,
author = {Ankit Garg and
Visu Makam and
Rafael Mendes de Oliveira and
Avi Wigderson},
editor = {David Zuckerman},
title = {More Barriers for Rank Methods, via a "numeric to Symbolic" Transfer},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {824--844},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00054},
doi = {10.1109/FOCS.2019.00054},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GargMOW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GhaffariKU19,
author = {Mohsen Ghaffari and
Fabian Kuhn and
Jara Uitto},
editor = {David Zuckerman},
title = {Conditional Hardness Results for Massively Parallel Computation from
Distributed Lower Bounds},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1650--1663},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00097},
doi = {10.1109/FOCS.2019.00097},
timestamp = {Mon, 23 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GhaffariKU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GheorghiuV19,
author = {Alexandru Gheorghiu and
Thomas Vidick},
editor = {David Zuckerman},
title = {Computationally-Secure and Composable Remote State Preparation},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1024--1033},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00066},
doi = {10.1109/FOCS.2019.00066},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GheorghiuV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoldenbergKS19,
author = {Elazar Goldenberg and
Robert Krauthgamer and
Barna Saha},
editor = {David Zuckerman},
title = {Sublinear Algorithms for Gap Edit Distance},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1101--1120},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00070},
doi = {10.1109/FOCS.2019.00070},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GoldenbergKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoyalR19,
author = {Vipul Goyal and
Silas Richelson},
editor = {David Zuckerman},
title = {Non-Malleable Commitments using Goldreich-Levin List Decoding},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {686--699},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00047},
doi = {10.1109/FOCS.2019.00047},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GoyalR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GriloSY19,
author = {Alex Bredariol Grilo and
William Slofstra and
Henry Yuen},
editor = {David Zuckerman},
title = {Perfect Zero Knowledge for Quantum Multiprover Interactive Proofs},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {611--635},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00044},
doi = {10.1109/FOCS.2019.00044},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GriloSY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Guo0SS19,
author = {Zeyu Guo and
Mrinal Kumar and
Ramprasad Saptharishi and
Noam Solomon},
editor = {David Zuckerman},
title = {Derandomization from Algebraic Hardness: Treading the Borders},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {147--157},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00018},
doi = {10.1109/FOCS.2019.00018},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Guo0SS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Haeupler19,
author = {Bernhard Haeupler},
editor = {David Zuckerman},
title = {Optimal Document Exchange and New Codes for Insertions and Deletions},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {334--347},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00029},
doi = {10.1109/FOCS.2019.00029},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Haeupler19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Harris19,
author = {David G. Harris},
editor = {David Zuckerman},
title = {Distributed Local Approximation Algorithms for Maximum Matching in
Graphs and Hypergraphs},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {700--724},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00048},
doi = {10.1109/FOCS.2019.00048},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Harris19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HolmKTZZ19,
author = {Jacob Holm and
Valerie King and
Mikkel Thorup and
Or Zamir and
Uri Zwick},
editor = {David Zuckerman},
title = {Random k-out Subgraph Leaves only O(n/k) Inter-Component Edges},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {896--909},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00058},
doi = {10.1109/FOCS.2019.00058},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HolmKTZZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImmorlicaSSS19,
author = {Nicole Immorlica and
Karthik Abinav Sankararaman and
Robert E. Schapire and
Aleksandrs Slivkins},
editor = {David Zuckerman},
title = {Adversarial Bandits with Knapsacks},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {202--219},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00022},
doi = {10.1109/FOCS.2019.00022},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImmorlicaSSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JosephMN019,
author = {Matthew Joseph and
Jieming Mao and
Seth Neel and
Aaron Roth},
editor = {David Zuckerman},
title = {The Role of Interactivity in Local Differential Privacy},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {94--105},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00015},
doi = {10.1109/FOCS.2019.00015},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/JosephMN019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KontonisTZ19,
author = {Vasilis Kontonis and
Christos Tzamos and
Manolis Zampetakis},
editor = {David Zuckerman},
title = {Efficient Truncated Statistics with Unknown Truncation},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1578--1595},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00093},
doi = {10.1109/FOCS.2019.00093},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KontonisTZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kothari0MSW19,
author = {Pravesh Kothari and
Sahil Singla and
Divyarthi Mohan and
Ariel Schvartzman and
S. Matthew Weinberg},
editor = {David Zuckerman},
title = {Approximation Schemes for a Unit-Demand Buyer with Independent Items
via Symmetries},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {220--232},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00023},
doi = {10.1109/FOCS.2019.00023},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Kothari0MSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KrokhinO19,
author = {Andrei A. Krokhin and
Jakub Oprsal},
editor = {David Zuckerman},
title = {The Complexity of 3-Colouring H-Colourable Graphs},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1227--1239},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00076},
doi = {10.1109/FOCS.2019.00076},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KrokhinO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KwokLR19,
author = {Tsz Chiu Kwok and
Lap Chi Lau and
Akshay Ramachandran},
editor = {David Zuckerman},
title = {Spectral Analysis of Matrix Scaling and Operator Scaling},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1184--1204},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00074},
doi = {10.1109/FOCS.2019.00074},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KwokLR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeS19,
author = {Hung Le and
Shay Solomon},
editor = {David Zuckerman},
title = {Truly Optimal Euclidean Spanners},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1078--1100},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00069},
doi = {10.1109/FOCS.2019.00069},
timestamp = {Sun, 05 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/LeS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Li19,
author = {Jason Li},
editor = {David Zuckerman},
title = {Faster Minimum k-cut of a Simple Graph},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1056--1077},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00068},
doi = {10.1109/FOCS.2019.00068},
timestamp = {Fri, 13 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Li19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LifshitzM19,
author = {Noam Lifshitz and
Dor Minzer},
editor = {David Zuckerman},
title = {Noise Sensitivity on the p -Biased Hypercube},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1205--1226},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00075},
doi = {10.1109/FOCS.2019.00075},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LifshitzM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiuJS19,
author = {Yang P. Liu and
Arun Jambulapati and
Aaron Sidford},
editor = {David Zuckerman},
title = {Parallel Reachability in Almost Linear Work and Square Root Depth},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1664--1686},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00098},
doi = {10.1109/FOCS.2019.00098},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiuJS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MangoubiV19,
author = {Oren Mangoubi and
Nisheeth K. Vishnoi},
editor = {David Zuckerman},
title = {Faster Polytope Rounding, Sampling, and Volume Computation via a Sub-Linear
Ball Walk},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1338--1357},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00082},
doi = {10.1109/FOCS.2019.00082},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MangoubiV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Montanari19,
author = {Andrea Montanari},
editor = {David Zuckerman},
title = {Optimization of the Sherrington-Kirkpatrick Hamiltonian},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1417--1433},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00087},
doi = {10.1109/FOCS.2019.00087},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Montanari19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NakosSW19,
author = {Vasileios Nakos and
Zhao Song and
Zhengyu Wang},
editor = {David Zuckerman},
title = {(Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension;
RIPless and Filterless},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1568--1577},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00092},
doi = {10.1109/FOCS.2019.00092},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NakosSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Natarajan019,
author = {Anand Natarajan and
John Wright},
editor = {David Zuckerman},
title = {{NEEXP} is Contained in {MIP}},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {510--518},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00039},
doi = {10.1109/FOCS.2019.00039},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Natarajan019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Neel0W19,
author = {Seth Neel and
Aaron Roth and
Zhiwei Steven Wu},
editor = {David Zuckerman},
title = {How to Use Heuristics for Differential Privacy},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {72--93},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00014},
doi = {10.1109/FOCS.2019.00014},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Neel0W19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PichS19,
author = {J{\'{a}}n Pich and
Rahul Santhanam},
editor = {David Zuckerman},
title = {Why are Proof Complexity Lower Bounds Hard?},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1305--1324},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00080},
doi = {10.1109/FOCS.2019.00080},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/PichS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Postle19,
author = {Luke Postle},
editor = {David Zuckerman},
title = {Linear-Time and Efficient Distributed Algorithms for List Coloring
Graphs on Surfaces},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {929--941},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00060},
doi = {10.1109/FOCS.2019.00060},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Postle19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Pratt19,
author = {Kevin Pratt},
editor = {David Zuckerman},
title = {Waring Rank, Parameterized and Exact Algorithms},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {806--823},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00053},
doi = {10.1109/FOCS.2019.00053},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Pratt19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RubinsteinSSS19,
author = {Aviad Rubinstein and
Saeed Seddighin and
Zhao Song and
Xiaorui Sun},
editor = {David Zuckerman},
title = {Approximation Algorithms for {LCS} and {LIS} with Truly Improved Running
Times},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1121--1145},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00071},
doi = {10.1109/FOCS.2019.00071},
timestamp = {Sat, 05 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RubinsteinSSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SaulpicCF19,
author = {David Saulpic and
Vincent Cohen{-}Addad and
Andreas Emil Feldmann},
editor = {David Zuckerman},
title = {Near-Linear Time Approximations Schemes for Clustering in Doubling
Metrics},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {540--559},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00041},
doi = {10.1109/FOCS.2019.00041},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/SaulpicCF19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SilbakKS19,
author = {Jad Silbak and
Swastik Kopparty and
Ronen Shaltiel},
editor = {David Zuckerman},
title = {Quasilinear Time List-Decodable Codes for Space Bounded Channels},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {302--333},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00028},
doi = {10.1109/FOCS.2019.00028},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SilbakKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SinhaW19,
author = {Makrand Sinha and
Ronald de Wolf},
editor = {David Zuckerman},
title = {Exponential Separation between Quantum Communication and Logarithm
of Approximate Rank},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {966--981},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00062},
doi = {10.1109/FOCS.2019.00062},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SinhaW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Stephens-Davidowitz19,
author = {Noah Stephens{-}Davidowitz and
Vinod Vaikuntanathan},
editor = {David Zuckerman},
title = {SETH-Hardness of Coding Problems},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {287--301},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00027},
doi = {10.1109/FOCS.2019.00027},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Stephens-Davidowitz19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Tao0019,
author = {Chao Tao and
Qin Zhang and
Yuan Zhou},
editor = {David Zuckerman},
title = {Collaborative Learning with Limited Interaction: Tight Bounds for
Distributed Exploration in Multi-armed Bandits},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {126--146},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00017},
doi = {10.1109/FOCS.2019.00017},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Tao0019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Umans19,
author = {Chris Umans},
editor = {David Zuckerman},
title = {Fast Generalized DFTs for all Finite Groups},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {793--805},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00052},
doi = {10.1109/FOCS.2019.00052},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Umans19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/WeinAM19,
author = {Alexander S. Wein and
Ahmed El Alaoui and
Cristopher Moore},
editor = {David Zuckerman},
title = {The Kikuchi Hierarchy and Tensor {PCA}},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1446--1468},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.000-2},
doi = {10.1109/FOCS.2019.000-2},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/WeinAM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2019,
editor = {David Zuckerman},
title = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://ieeexplore.ieee.org/xpl/conhome/8936052/proceeding},
isbn = {978-1-7281-4952-3},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0002PP18,
author = {Marco Bressan and
Enoch Peserico and
Luca Pretto},
editor = {Mikkel Thorup},
title = {Sublinear Algorithms for Local Graph Centrality Estimation},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {709--718},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00073},
doi = {10.1109/FOCS.2018.00073},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0002PP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0003SS18,
author = {Akash Kumar and
C. Seshadhri and
Andrew Stolman},
editor = {Mikkel Thorup},
title = {Finding Forbidden Minors in Sublinear Time: {A} n1/2+o(1)-Query One-Sided
Tester for Minor Closed Properties on Bounded Degree Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {509--520},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00055},
doi = {10.1109/FOCS.2018.00055},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0003SS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Adamczyk018,
author = {Marek Adamczyk and
Michal Wlodarczyk},
editor = {Mikkel Thorup},
title = {Random Order Contention Resolution Schemes},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {790--801},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00080},
doi = {10.1109/FOCS.2018.00080},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Adamczyk018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanW18,
author = {Josh Alman and
Virginia Vassilevska Williams},
editor = {Mikkel Thorup},
title = {Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {580--591},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00061},
doi = {10.1109/FOCS.2018.00061},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnariGV18,
author = {Nima Anari and
Shayan Oveis Gharan and
Cynthia Vinzant},
editor = {Mikkel Thorup},
title = {Log-Concave Polynomials, Entropy, and a Deterministic Approximation
Algorithm for Counting Bases of Matroids},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {35--46},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00013},
doi = {10.1109/FOCS.2018.00013},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnariGV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnariV18,
author = {Nima Anari and
Vijay V. Vazirani},
editor = {Mikkel Thorup},
title = {Planar Graph Perfect Matching Is in {NC}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {650--661},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00068},
doi = {10.1109/FOCS.2018.00068},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnariV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniNNRW18,
author = {Alexandr Andoni and
Assaf Naor and
Aleksandar Nikolov and
Ilya P. Razenshteyn and
Erik Waingarten},
editor = {Mikkel Thorup},
title = {H{\"{o}}lder Homeomorphisms and Approximate Nearest Neighbors},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {159--169},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00024},
doi = {10.1109/FOCS.2018.00024},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndoniNNRW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndoniSSWZ18,
author = {Alexandr Andoni and
Zhao Song and
Clifford Stein and
Zhengyu Wang and
Peilin Zhong},
editor = {Mikkel Thorup},
title = {Parallel Graph Connectivity in Log Diameter Rounds},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {674--685},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00070},
doi = {10.1109/FOCS.2018.00070},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndoniSSWZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AwasthiV18,
author = {Pranjal Awasthi and
Aravindan Vijayaraghavan},
editor = {Mikkel Thorup},
title = {Towards Learning Sparsely Used Dictionaries with Arbitrary Supports},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {283--296},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00035},
doi = {10.1109/FOCS.2018.00035},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AwasthiV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AzarT18,
author = {Yossi Azar and
Noam Touitou},
editor = {Mikkel Thorup},
title = {Improved Online Algorithm for Weighted Flow Time},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {427--437},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00048},
doi = {10.1109/FOCS.2018.00048},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AzarT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BackursCIS18,
author = {Arturs Backurs and
Moses Charikar and
Piotr Indyk and
Paris Siminelakis},
editor = {Mikkel Thorup},
title = {Efficient Density Evaluation for Smooth Kernels},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {615--626},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00065},
doi = {10.1109/FOCS.2018.00065},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BackursCIS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BalcanDV18,
author = {Maria{-}Florina Balcan and
Travis Dick and
Ellen Vitercik},
editor = {Mikkel Thorup},
title = {Dispersion for Data-Driven Algorithm Design, Online Learning, and
Private Optimization},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {603--614},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00064},
doi = {10.1109/FOCS.2018.00064},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BalcanDV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BallDGMT18,
author = {Marshall Ball and
Dana Dachman{-}Soled and
Siyao Guo and
Tal Malkin and
Li{-}Yang Tan},
editor = {Mikkel Thorup},
title = {Non-Malleable Codes for Small-Depth Circuits},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {826--837},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00083},
doi = {10.1109/FOCS.2018.00083},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BallDGMT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Batra0K18,
author = {Jatin Batra and
Naveen Garg and
Amit Kumar},
editor = {Mikkel Thorup},
title = {Constant Factor Approximation Algorithm for Weighted Flow Time on
a Single Machine in Pseudo-Polynomial Time},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {778--789},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00079},
doi = {10.1109/FOCS.2018.00079},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Batra0K18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BeimelHMO18,
author = {Amos Beimel and
Iftach Haitner and
Nikolaos Makriyannis and
Eran Omri},
editor = {Mikkel Thorup},
title = {Tighter Bounds on Multi-Party Coin Flipping via Augmented Weak Martingales
and Differentially Private Sampling},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {838--849},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00084},
doi = {10.1109/FOCS.2018.00084},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BeimelHMO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-DavidBGK18,
author = {Shalev Ben{-}David and
Adam Bouland and
Ankit Garg and
Robin Kothari},
editor = {Mikkel Thorup},
title = {Classical Lower Bounds from Quantum Upper Bounds},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {339--349},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00040},
doi = {10.1109/FOCS.2018.00040},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-DavidBGK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BenderFGJM018,
author = {Michael A. Bender and
Martin Farach{-}Colton and
Mayank Goswami and
Rob Johnson and
Samuel McCauley and
Shikha Singh},
editor = {Mikkel Thorup},
title = {Bloom Filters, Adaptivity, and the Dictionary Problem},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {182--193},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00026},
doi = {10.1109/FOCS.2018.00026},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BenderFGJM018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BergBKK18,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
Sudeshna Kolay},
editor = {Mikkel Thorup},
title = {An ETH-Tight Exact Algorithm for Euclidean {TSP}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {450--461},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00050},
doi = {10.1109/FOCS.2018.00050},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BergBKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhargavaSV18,
author = {Vishwas Bhargava and
Shubhangi Saraf and
Ilya Volkovich},
editor = {Mikkel Thorup},
title = {Deterministic Factorization of Sparse Polynomials with Bounded Individual
Degree},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {485--496},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00053},
doi = {10.1109/FOCS.2018.00053},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BhargavaSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BonamyBBCT18,
author = {Marthe Bonamy and
Edouard Bonnet and
Nicolas Bousquet and
Pierre Charbit and
St{\'{e}}phan Thomass{\'{e}}},
editor = {Mikkel Thorup},
title = {{EPTAS} for Max Clique on Disks and Unit Balls},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {568--579},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00060},
doi = {10.1109/FOCS.2018.00060},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BonamyBBCT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BorgsCSZ18,
author = {Christian Borgs and
Jennifer T. Chayes and
Adam D. Smith and
Ilias Zadik},
editor = {Mikkel Thorup},
title = {Revealing Network Structure, Confidentially: Improved Rates for Node-Private
Graphon Estimation},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {533--543},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00057},
doi = {10.1109/FOCS.2018.00057},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BorgsCSZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrakerskiCMVV18,
author = {Zvika Brakerski and
Paul F. Christiano and
Urmila Mahadev and
Umesh V. Vazirani and
Thomas Vidick},
editor = {Mikkel Thorup},
title = {A Cryptographic Test of Quantumness and Certifiable Randomness from
a Single Quantum Device},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {320--331},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00038},
doi = {10.1109/FOCS.2018.00038},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrakerskiCMVV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BurgisserFGOWW18,
author = {Peter B{\"{u}}rgisser and
Cole Franks and
Ankit Garg and
Rafael Mendes de Oliveira and
Michael Walter and
Avi Wigderson},
editor = {Mikkel Thorup},
title = {Efficient Algorithms for Tensor Scaling, Quantum Marginals, and Moment
Polytopes},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {883--897},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00088},
doi = {10.1109/FOCS.2018.00088},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BurgisserFGOWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Carbonnel0Z18,
author = {Cl{\'{e}}ment Carbonnel and
Miguel Romero and
Stanislav Zivn{\'{y}}},
editor = {Mikkel Thorup},
title = {The Complexity of General-Valued CSPs Seen from the Other Side},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {236--246},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00031},
doi = {10.1109/FOCS.2018.00031},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Carbonnel0Z18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChakrabortyDGKS18,
author = {Diptarka Chakraborty and
Debarati Das and
Elazar Goldenberg and
Michal Kouck{\'{y}} and
Michael E. Saks},
editor = {Mikkel Thorup},
title = {Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic
Time},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {979--990},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00096},
doi = {10.1109/FOCS.2018.00096},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChakrabortyDGKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChattopadhyayM18,
author = {Arkadev Chattopadhyay and
Nikhil S. Mande},
editor = {Mikkel Thorup},
title = {A Short List of Equalities Induces Large Sign Rank},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {47--58},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00014},
doi = {10.1109/FOCS.2018.00014},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChattopadhyayM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Chechik18,
author = {Shiri Chechik},
editor = {Mikkel Thorup},
title = {Near-Optimal Approximate Decremental All Pairs Shortest Paths},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {170--181},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00025},
doi = {10.1109/FOCS.2018.00025},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Chechik18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChengJLW18,
author = {Kuan Cheng and
Zhengzhong Jin and
Xin Li and
Ke Wu},
editor = {Mikkel Thorup},
title = {Deterministic Document Exchange Protocols, and Almost Optimal Binary
Codes for Edit Errors},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {200--211},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00028},
doi = {10.1109/FOCS.2018.00028},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChengJLW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChiesaFGS18,
author = {Alessandro Chiesa and
Michael A. Forbes and
Tom Gur and
Nicholas Spooner},
editor = {Mikkel Thorup},
title = {Spatial Isolation Implies Zero Knowledge Even in a Quantum World},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {755--765},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00077},
doi = {10.1109/FOCS.2018.00077},
timestamp = {Tue, 30 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChiesaFGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChillaraEL018,
author = {Suryajith Chillara and
Christian Engels and
Nutan Limaye and
Srikanth Srinivasan},
editor = {Mikkel Thorup},
title = {A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear
Circuits},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {934--945},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00092},
doi = {10.1109/FOCS.2018.00092},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChillaraEL018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChiplunkarKKMP18,
author = {Ashish Chiplunkar and
Michael Kapralov and
Sanjeev Khanna and
Aida Mousavifar and
Yuval Peres},
editor = {Mikkel Thorup},
title = {Testing Graph Clusterability: Algorithms and Lower Bounds},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {497--508},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00054},
doi = {10.1109/FOCS.2018.00054},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChiplunkarKKMP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChuGPSSW18,
author = {Timothy Chu and
Yu Gao and
Richard Peng and
Sushant Sachdeva and
Saurabh Sawlani and
Junxing Wang},
editor = {Mikkel Thorup},
title = {Graph Sparsification, Spectral Sketches, and Faster Resistance Computation,
via Short Cycle Decompositions},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {361--372},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00042},
doi = {10.1109/FOCS.2018.00042},
timestamp = {Fri, 14 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChuGPSSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohenKKPPRS18,
author = {Michael B. Cohen and
Jonathan A. Kelner and
Rasmus Kyng and
John Peebles and
Richard Peng and
Anup B. Rao and
Aaron Sidford},
editor = {Mikkel Thorup},
title = {Solving Directed Laplacian Systems in Nearly-Linear Time through Sparse
{LU} Factorizations},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {898--909},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00089},
doi = {10.1109/FOCS.2018.00089},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CohenKKPPRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DadushNTT18,
author = {Daniel Dadush and
Aleksandar Nikolov and
Kunal Talwar and
Nicole Tomczak{-}Jaegermann},
editor = {Mikkel Thorup},
title = {Balancing Vectors in Any Norm},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {1--10},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00010},
doi = {10.1109/FOCS.2018.00010},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DadushNTT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DaskalakisGTZ18,
author = {Constantinos Daskalakis and
Themis Gouleakis and
Christos Tzamos and
Manolis Zampetakis},
editor = {Mikkel Thorup},
title = {Efficient Statistics, in High Dimensions, from Truncated Samples},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {639--649},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00067},
doi = {10.1109/FOCS.2018.00067},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DaskalakisGTZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DeLS18,
author = {Anindya De and
Philip M. Long and
Rocco A. Servedio},
editor = {Mikkel Thorup},
title = {Learning Sums of Independent Random Variables with Sparse Collective
Support},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {297--308},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00036},
doi = {10.1109/FOCS.2018.00036},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DeLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EldarM18,
author = {Lior Eldar and
Saeed Mehraban},
editor = {Mikkel Thorup},
title = {Approximating the Permanent of a Random Matrix with Vanishing Mean},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {23--34},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00012},
doi = {10.1109/FOCS.2018.00012},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EldarM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EsfandiariM18,
author = {Hossein Esfandiari and
Michael Mitzenmacher},
editor = {Mikkel Thorup},
title = {Metric Sublinear Algorithms via Linear Sampling},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {11--22},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00011},
doi = {10.1109/FOCS.2018.00011},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EsfandiariM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FahrbachMPSWX18,
author = {Matthew Fahrbach and
Gary L. Miller and
Richard Peng and
Saurabh Sawlani and
Junxing Wang and
Shen Chen Xu},
editor = {Mikkel Thorup},
title = {Graph Sketching against Adaptive Adversaries Applied to the Minimum
Degree Algorithm},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {101--112},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00019},
doi = {10.1109/FOCS.2018.00019},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FahrbachMPSWX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FawziGL18,
author = {Omar Fawzi and
Antoine Grospellier and
Anthony Leverrier},
editor = {Mikkel Thorup},
title = {Constant Overhead Quantum Fault-Tolerance with Quantum Expander Codes},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {743--754},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00076},
doi = {10.1109/FOCS.2018.00076},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FawziGL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmanMTT18,
author = {Vitaly Feldman and
Ilya Mironov and
Kunal Talwar and
Abhradeep Thakurta},
editor = {Mikkel Thorup},
title = {Privacy Amplification by Iteration},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {521--532},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00056},
doi = {10.1109/FOCS.2018.00056},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeldmanMTT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FengH18,
author = {Yiding Feng and
Jason D. Hartline},
editor = {Mikkel Thorup},
title = {An End-to-End Argument in Mechanism Design (Prior-Independent Auctions
for Budgeted Agents)},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {404--415},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00046},
doi = {10.1109/FOCS.2018.00046},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FengH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FerberJ18,
author = {Asaf Ferber and
Vishesh Jain},
editor = {Mikkel Thorup},
title = {1-Factorizations of Pseudorandom Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {698--708},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00072},
doi = {10.1109/FOCS.2018.00072},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FerberJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ForbesK18,
author = {Michael A. Forbes and
Zander Kelley},
editor = {Mikkel Thorup},
title = {Pseudorandom Generators for Read-Once Branching Programs, in Any Order},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {946--955},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00093},
doi = {10.1109/FOCS.2018.00093},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ForbesK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ForsterN18,
author = {Sebastian Forster and
Danupon Nanongkai},
editor = {Mikkel Thorup},
title = {A Faster Distributed Single-Source Shortest Paths Algorithm},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {686--697},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00071},
doi = {10.1109/FOCS.2018.00071},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ForsterN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GhaffariHK18,
author = {Mohsen Ghaffari and
David G. Harris and
Fabian Kuhn},
editor = {Mikkel Thorup},
title = {On Derandomizing Local Distributed Algorithms},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {662--673},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00069},
doi = {10.1109/FOCS.2018.00069},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GhaffariHK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoldreichR18,
author = {Oded Goldreich and
Guy N. Rothblum},
editor = {Mikkel Thorup},
title = {Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct
Interactive Proof Systems},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {77--88},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00017},
doi = {10.1109/FOCS.2018.00017},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoldreichR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GonczarowskiW18,
author = {Yannai A. Gonczarowski and
S. Matthew Weinberg},
editor = {Mikkel Thorup},
title = {The Sample Complexity of Up-to-{\(\epsilon\)} Multi-Dimensional Revenue
Maximization},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {416--426},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00047},
doi = {10.1109/FOCS.2018.00047},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GonczarowskiW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoosR18,
author = {Mika G{\"{o}}{\"{o}}s and
Aviad Rubinstein},
editor = {Mikkel Thorup},
title = {Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {397--403},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00045},
doi = {10.1109/FOCS.2018.00045},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoosR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GrinbergSV18,
author = {Aryeh Grinberg and
Ronen Shaltiel and
Emanuele Viola},
editor = {Mikkel Thorup},
title = {Indistinguishability by Adaptive Procedures with Advice, and Lower
Bounds on Hardness Amplification Proofs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {956--966},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00094},
doi = {10.1109/FOCS.2018.00094},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GrinbergSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GroheNS18,
author = {Martin Grohe and
Daniel Neuen and
Pascal Schweitzer},
editor = {Mikkel Thorup},
title = {A Faster Isomorphism Test for Graphs of Small Degree},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {89--100},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00018},
doi = {10.1109/FOCS.2018.00018},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GroheNS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuptaLL18,
author = {Anupam Gupta and
Euiwoong Lee and
Jason Li},
editor = {Mikkel Thorup},
title = {Faster Exact and Approximate Algorithms for k-Cut},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {113--123},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00020},
doi = {10.1109/FOCS.2018.00020},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GuptaLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaahHKL18,
author = {Jeongwan Haah and
Matthew B. Hastings and
Robin Kothari and
Guang Hao Low},
editor = {Mikkel Thorup},
title = {Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {350--360},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00041},
doi = {10.1109/FOCS.2018.00041},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HaahHKL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HaitnerNOSS18,
author = {Iftach Haitner and
Kobbi Nissim and
Eran Omri and
Ronen Shaltiel and
Jad Silbak},
editor = {Mikkel Thorup},
title = {Computational Two-Party Correlation: {A} Dichotomy for Key-Agreement
Protocols},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {136--147},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00022},
doi = {10.1109/FOCS.2018.00022},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HaitnerNOSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Hastad18,
author = {Johan H{\aa}stad},
editor = {Mikkel Thorup},
title = {Knuth Prize Lecture: On the Difficulty of Approximating Boolean Max-CSPs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {602},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00063},
doi = {10.1109/FOCS.2018.00063},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Hastad18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Hirahara18,
author = {Shuichi Hirahara},
editor = {Mikkel Thorup},
title = {Non-Black-Box Worst-Case to Average-Case Reductions within {NP}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {247--258},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00032},
doi = {10.1109/FOCS.2018.00032},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Hirahara18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HolmgrenL18,
author = {Justin Holmgren and
Alex Lombardi},
editor = {Mikkel Thorup},
title = {Cryptographic Hashing from Strong One-Way Functions (Or: One-Way Product
Functions and Their Applications)},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {850--858},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00085},
doi = {10.1109/FOCS.2018.00085},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HolmgrenL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HolmgrenR18,
author = {Justin Holmgren and
Ron Rothblum},
editor = {Mikkel Thorup},
title = {Delegating Computations with (Almost) Minimal Time and Space Overhead},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {124--135},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00021},
doi = {10.1109/FOCS.2018.00021},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HolmgrenR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HozaZ18,
author = {William Hoza and
David Zuckerman},
editor = {Mikkel Thorup},
title = {Simple Optimal Hitting Sets for Small-Success {RL}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {59--64},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00015},
doi = {10.1109/FOCS.2018.00015},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HozaZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HuangJLW18,
author = {Lingxiao Huang and
Shaofeng H.{-}C. Jiang and
Jian Li and
Xuan Wu},
editor = {Mikkel Thorup},
title = {Epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {814--825},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00082},
doi = {10.1109/FOCS.2018.00082},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HuangJLW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/IwataYY18,
author = {Yoichi Iwata and
Yutaro Yamaguchi and
Yuichi Yoshida},
editor = {Mikkel Thorup},
title = {0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time {FPT}
Algorithms},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {462--473},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00051},
doi = {10.1109/FOCS.2018.00051},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/IwataYY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JayaramW18,
author = {Rajesh Jayaram and
David P. Woodruff},
editor = {Mikkel Thorup},
title = {Perfect Lp Sampling in a Data Stream},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {544--555},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00058},
doi = {10.1109/FOCS.2018.00058},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JayaramW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KallaugherKP18,
author = {John Kallaugher and
Michael Kapralov and
Eric Price},
editor = {Mikkel Thorup},
title = {The Sketching Complexity of Graph and Hypergraph Counting},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {556--567},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00059},
doi = {10.1109/FOCS.2018.00059},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KallaugherKP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KhotMS18,
author = {Subhash Khot and
Dor Minzer and
Muli Safra},
editor = {Mikkel Thorup},
title = {Pseudorandom Sets in Grassmann Graph Have Near-Perfect Expansion},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {592--601},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00062},
doi = {10.1109/FOCS.2018.00062},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KhotMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KleinbergI18,
author = {Robert Kleinberg and
Nicole Immorlica},
editor = {Mikkel Thorup},
title = {Recharging Bandits},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {309--319},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00037},
doi = {10.1109/FOCS.2018.00037},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KleinbergI18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KoppartyRSW18,
author = {Swastik Kopparty and
Noga Ron{-}Zewi and
Shubhangi Saraf and
Mary Wootters},
editor = {Mikkel Thorup},
title = {Improved Decoding of Folded Reed-Solomon and Multiplicity Codes},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {212--223},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00029},
doi = {10.1109/FOCS.2018.00029},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KoppartyRSW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KyngS18,
author = {Rasmus Kyng and
Zhao Song},
editor = {Mikkel Thorup},
title = {A Matrix Chernoff Bound for Strongly Rayleigh Distributions and Spectral
Sparsifiers from a few Random Spanning Trees},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {373--384},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00043},
doi = {10.1109/FOCS.2018.00043},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KyngS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lee18,
author = {James R. Lee},
editor = {Mikkel Thorup},
title = {Fusible HSTs and the Randomized k-Server Conjecture},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {438--449},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00049},
doi = {10.1109/FOCS.2018.00049},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lee18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LemeS18,
author = {Renato Paes Leme and
Jon Schneider},
editor = {Mikkel Thorup},
title = {Contextual Search via Intrinsic Volumes},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {268--282},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00034},
doi = {10.1109/FOCS.2018.00034},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LemeS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiS18,
author = {Huan Li and
Aaron Schild},
editor = {Mikkel Thorup},
title = {Spectral Subspace Sparsification},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {385--396},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00044},
doi = {10.1109/FOCS.2018.00044},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/LiS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiuM18,
author = {Allen Liu and
Ankur Moitra},
editor = {Mikkel Thorup},
title = {Efficiently Learning Mixtures of Mallows Models},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {627--638},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00066},
doi = {10.1109/FOCS.2018.00066},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiuM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lovett18,
author = {Shachar Lovett},
editor = {Mikkel Thorup},
title = {{MDS} Matrices over Small Fields: {A} Proof of the {GM-MDS} Conjecture},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {194--199},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00027},
doi = {10.1109/FOCS.2018.00027},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lovett18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Mahadev18,
author = {Urmila Mahadev},
editor = {Mikkel Thorup},
title = {Classical Verification of Quantum Computations},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {259--267},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00033},
doi = {10.1109/FOCS.2018.00033},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Mahadev18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Mahadev18a,
author = {Urmila Mahadev},
editor = {Mikkel Thorup},
title = {Classical Homomorphic Encryption for Quantum Circuits},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {332--338},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00039},
doi = {10.1109/FOCS.2018.00039},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Mahadev18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MarxPP18,
author = {D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk},
editor = {Mikkel Thorup},
title = {On Subexponential Parameterized Algorithms for Steiner Tree and Directed
Subset {TSP} on Planar Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {474--484},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00052},
doi = {10.1109/FOCS.2018.00052},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MarxPP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MoharJ18,
author = {Bojan Mohar and
Yifan Jing},
editor = {Mikkel Thorup},
title = {Efficient Polynomial-Time Approximation Scheme for the Genus of Dense
Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {719--730},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00074},
doi = {10.1109/FOCS.2018.00074},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MoharJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NatarajanV18,
author = {Anand Natarajan and
Thomas Vidick},
editor = {Mikkel Thorup},
title = {Low-Degree Testing for Quantum States, and a Quantum Entangled Games
{PCP} for {QMA}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {731--742},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00075},
doi = {10.1109/FOCS.2018.00075},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NatarajanV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/OliveiraS18,
author = {Igor Carboni Oliveira and
Rahul Santhanam},
editor = {Mikkel Thorup},
title = {Hardness Magnification for Natural Problems},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {65--76},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00016},
doi = {10.1109/FOCS.2018.00016},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/OliveiraS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PatelP0Y18,
author = {Sarvar Patel and
Giuseppe Persiano and
Mariana Raykova and
Kevin Yeo},
editor = {Mikkel Thorup},
title = {PanORAMa: Oblivious {RAM} with Logarithmic Overhead},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {871--882},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00087},
doi = {10.1109/FOCS.2018.00087},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PatelP0Y18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/QuachWW18,
author = {Willy Quach and
Hoeteck Wee and
Daniel Wichs},
editor = {Mikkel Thorup},
title = {Laconic Function Evaluation and Applications},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {859--870},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00086},
doi = {10.1109/FOCS.2018.00086},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/QuachWW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Rubin18,
author = {Natan Rubin},
editor = {Mikkel Thorup},
title = {An Improved Bound for Weak Epsilon-Nets in the Plane},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {224--235},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00030},
doi = {10.1109/FOCS.2018.00030},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Rubin18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Saglam18,
author = {Mert Saglam},
editor = {Mikkel Thorup},
title = {Near Log-Convexity of Measured Heat in (Discrete) Time and Consequences},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {967--978},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00095},
doi = {10.1109/FOCS.2018.00095},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Saglam18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Sanita18,
author = {Laura Sanit{\`{a}}},
editor = {Mikkel Thorup},
title = {The Diameter of the Fractional Matching Polytope and Its Hardness
Implications},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {910--921},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00090},
doi = {10.1109/FOCS.2018.00090},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Sanita18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SidfordT18,
author = {Aaron Sidford and
Kevin Tian},
editor = {Mikkel Thorup},
title = {Coordinate Methods for Accelerating {\(\mathscr{l}\)}{\(\infty\)}
Regression and Faster Approximate Maximum Flow},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {922--933},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00091},
doi = {10.1109/FOCS.2018.00091},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SidfordT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SohlerW18,
author = {Christian Sohler and
David P. Woodruff},
editor = {Mikkel Thorup},
title = {Strong Coresets for k-Median and Subspace Approximation: Goodbye Dimension},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {802--813},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00081},
doi = {10.1109/FOCS.2018.00081},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/SohlerW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SotirakiZZ18,
author = {Katerina Sotiraki and
Manolis Zampetakis and
Giorgos Zirdelis},
editor = {Mikkel Thorup},
title = {PPP-Completeness with Connections to Cryptography},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {148--158},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00023},
doi = {10.1109/FOCS.2018.00023},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/SotirakiZZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/TraubV18,
author = {Vera Traub and
Jens Vygen},
editor = {Mikkel Thorup},
title = {Beating the Integrality Ratio for s-t-Tours in Graphs},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {766--777},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00078},
doi = {10.1109/FOCS.2018.00078},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/TraubV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2018,
editor = {Mikkel Thorup},
title = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://ieeexplore.ieee.org/xpl/conhome/8554191/proceeding},
isbn = {978-1-5386-4230-6},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001D17,
author = {Yang Cai and
Constantinos Daskalakis},
editor = {Chris Umans},
title = {Learning Multi-Item Auctions with (or without) Samples},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {516--527},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.54},
doi = {10.1109/FOCS.2017.54},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001D17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001SS17,
author = {Jingcheng Liu and
Alistair Sinclair and
Piyush Srivastava},
editor = {Chris Umans},
title = {The Ising Partition Function: Zeros and Deterministic Approximation},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {986--997},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.95},
doi = {10.1109/FOCS.2017.95},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001SS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/0001V17,
author = {Oded Regev and
Aravindan Vijayaraghavan},
editor = {Chris Umans},
title = {On Learning Mixtures of Well-Separated Gaussians},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {85--96},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.17},
doi = {10.1109/FOCS.2017.17},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/0001V17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudBBK17,
author = {Amir Abboud and
Arturs Backurs and
Karl Bringmann and
Marvin K{\"{u}}nnemann},
editor = {Chris Umans},
title = {Fine-Grained Complexity of Analyzing Compressed Data: Quantifying
Improvements over Decompress-and-Solve},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {192--203},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.26},
doi = {10.1109/FOCS.2017.26},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbboudBBK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudRW17,
author = {Amir Abboud and
Aviad Rubinstein and
R. Ryan Williams},
editor = {Chris Umans},
title = {Distributed {PCP} Theorems for Hardness of Approximation in {P}},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {25--36},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.12},
doi = {10.1109/FOCS.2017.12},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbboudRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ahle17,
author = {Thomas Dybdahl Ahle},
editor = {Chris Umans},
title = {Optimal Las Vegas Locality Sensitive Data Structures},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {938--949},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.91},
doi = {10.1109/FOCS.2017.91},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ahle17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AhmadianNSW17,
author = {Sara Ahmadian and
Ashkan Norouzi{-}Fard and
Ola Svensson and
Justin Ward},
editor = {Chris Umans},
title = {Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual
Algorithms},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {61--72},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.15},
doi = {10.1109/FOCS.2017.15},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AhmadianNSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Allen-ZhuL17,
author = {Zeyuan Allen{-}Zhu and
Yuanzhi Li},
editor = {Chris Umans},
title = {First Efficient Convergence for Streaming k-PCA: {A} Global, Gap-Free,
and Near-Optimal Rate},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {487--492},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.51},
doi = {10.1109/FOCS.2017.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Allen-ZhuL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Allen-ZhuLOW17,
author = {Zeyuan Allen{-}Zhu and
Yuanzhi Li and
Rafael Mendes de Oliveira and
Avi Wigderson},
editor = {Chris Umans},
title = {Much Faster Algorithms for Matrix Scaling},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {890--901},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.87},
doi = {10.1109/FOCS.2017.87},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Allen-ZhuLOW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonBF17,
author = {Noga Alon and
Omri Ben{-}Eliezer and
Eldar Fischer},
editor = {Chris Umans},
title = {Testing Hereditary Properties of Ordered Graphs and Matrices},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {848--858},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.83},
doi = {10.1109/FOCS.2017.83},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlonBF17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonK17,
author = {Noga Alon and
Bo'az Klartag},
editor = {Chris Umans},
title = {Optimal Compression of Approximate Inner Products and Dimension Reduction},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {639--650},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.65},
doi = {10.1109/FOCS.2017.65},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlonK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnariGGS17,
author = {Nima Anari and
Leonid Gurvits and
Shayan Oveis Gharan and
Amin Saberi},
editor = {Chris Umans},
title = {Simply Exponential Approximation of the Permanent of Positive Semidefinite
Matrices},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {914--925},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.89},
doi = {10.1109/FOCS.2017.89},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnariGGS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ApeldoornGGW17,
author = {Joran van Apeldoorn and
Andr{\'{a}}s Gily{\'{e}}n and
Sander Gribling and
Ronald de Wolf},
editor = {Chris Umans},
title = {Quantum SDP-Solvers: Better Upper and Lower Bounds},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {403--414},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.44},
doi = {10.1109/FOCS.2017.44},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ApeldoornGGW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Applebaum17,
author = {Benny Applebaum},
editor = {Chris Umans},
title = {Exponentially-Hard Gap-CSP and Local {PRG} via Local Hardcore Functions},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {836--847},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.82},
doi = {10.1109/FOCS.2017.82},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Applebaum17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BansalEK17,
author = {Nikhil Bansal and
Marek Eli{\'{a}}s and
Grigorios Koumoutsos},
editor = {Chris Umans},
title = {Weighted k-Server Bounds via Combinatorial Dichotomies},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {493--504},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.52},
doi = {10.1109/FOCS.2017.52},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BansalEK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BatuC17,
author = {Tugkan Batu and
Cl{\'{e}}ment L. Canonne},
editor = {Chris Umans},
title = {Generalized Uniformity Testing},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {880--889},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.86},
doi = {10.1109/FOCS.2017.86},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BatuC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BennettGS17,
author = {Huck Bennett and
Alexander Golovnev and
Noah Stephens{-}Davidowitz},
editor = {Chris Umans},
title = {On the Quantitative Hardness of {CVP}},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {13--24},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.11},
doi = {10.1109/FOCS.2017.11},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BennettGS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Berg17,
author = {Mark de Berg},
editor = {Chris Umans},
title = {Removing Depth-Order Cycles among Triangles: An Efficient Algorithm
Generating Triangular Fragments},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {272--282},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.33},
doi = {10.1109/FOCS.2017.33},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Berg17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhattiproluGGLT17,
author = {Vijay Bhattiprolu and
Mrinalkanti Ghosh and
Venkatesan Guruswami and
Euiwoong Lee and
Madhur Tulsiani},
editor = {Chris Umans},
title = {Weak Decoupling, Polynomial Folds and Approximate Optimization over
the Sphere},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {1008--1019},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.97},
doi = {10.1109/FOCS.2017.97},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhattiproluGGLT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BorradaileLW17,
author = {Glencora Borradaile and
Hung Le and
Christian Wulff{-}Nilsen},
editor = {Chris Umans},
title = {Minor-Free Graphs Have Light Spanners},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {767--778},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.76},
doi = {10.1109/FOCS.2017.76},
timestamp = {Sun, 05 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BorradaileLW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BoulandCHTV17,
author = {Adam Bouland and
Lijie Chen and
Dhiraj Holden and
Justin Thaler and
Prashant Nalini Vasudevan},
editor = {Chris Umans},
title = {On the Power of Statistical Zero Knowledge},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {708--719},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.71},
doi = {10.1109/FOCS.2017.71},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BoulandCHTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrandaoS17,
author = {Fernando G. S. L. Brand{\~{a}}o and
Krysta M. Svore},
editor = {Chris Umans},
title = {Quantum Speed-Ups for Solving Semidefinite Programs},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {415--426},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.45},
doi = {10.1109/FOCS.2017.45},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrandaoS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanO17,
author = {Mark Braverman and
Rotem Oshman},
editor = {Chris Umans},
title = {A Rounds vs. Communication Tradeoff for Multi-Party Set Disjointness},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {144--155},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.22},
doi = {10.1109/FOCS.2017.22},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BringmannGL17,
author = {Karl Bringmann and
Allan Gr{\o}nlund and
Kasper Green Larsen},
editor = {Chris Umans},
title = {A Dichotomy for Regular Expression Membership Testing},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {307--318},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.36},
doi = {10.1109/FOCS.2017.36},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BringmannGL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Bulatov17,
author = {Andrei A. Bulatov},
editor = {Chris Umans},
title = {A Dichotomy Theorem for Nonuniform CSPs},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {319--330},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.37},
doi = {10.1109/FOCS.2017.37},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Bulatov17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BunT17,
author = {Mark Bun and
Justin Thaler},
editor = {Chris Umans},
title = {A Nearly Optimal Lower Bound on the Approximate Degree of AC\({}^{\mbox{0}}\)},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {1--12},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.10},
doi = {10.1109/FOCS.2017.10},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BunT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChalermsookCKLM17,
author = {Parinya Chalermsook and
Marek Cygan and
Guy Kortsarz and
Bundit Laekhanukit and
Pasin Manurangsi and
Danupon Nanongkai and
Luca Trevisan},
editor = {Chris Umans},
title = {From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and
More},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {743--754},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.74},
doi = {10.1109/FOCS.2017.74},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChalermsookCKLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChangP17,
author = {Yi{-}Jun Chang and
Seth Pettie},
editor = {Chris Umans},
title = {A Time Hierarchy Theorem for the {LOCAL} Model},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {156--167},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.23},
doi = {10.1109/FOCS.2017.23},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChangP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CharikarS17,
author = {Moses Charikar and
Paris Siminelakis},
editor = {Chris Umans},
title = {Hashing-Based-Estimators for Kernel Density in High Dimensions},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {1032--1043},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.99},
doi = {10.1109/FOCS.2017.99},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/CharikarS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChekuriQ17,
author = {Chandra Chekuri and
Kent Quanrud},
editor = {Chris Umans},
title = {Approximating the Held-Karp Bound for Metric {TSP} in Nearly-Linear
Time},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {789--800},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.78},
doi = {10.1109/FOCS.2017.78},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChekuriQ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenWX17,
author = {Xi Chen and
Erik Waingarten and
Jinyu Xie},
editor = {Chris Umans},
title = {Boolean Unateness Testing with {\~{O}}(n\({}^{\mbox{3/4}}\)) Adaptive
Queries},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {868--879},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.85},
doi = {10.1109/FOCS.2017.85},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenWX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadDW17,
author = {Vincent Cohen{-}Addad and
S{\o}ren Dahlgaard and
Christian Wulff{-}Nilsen},
editor = {Chris Umans},
title = {Fast and Compact Exact Distance Oracle for Planar Graphs},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {962--973},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.93},
doi = {10.1109/FOCS.2017.93},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadDW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadS17,
author = {Vincent Cohen{-}Addad and
Chris Schwiegelshohn},
editor = {Chris Umans},
title = {On the Local Structure of Stable Clustering Instances},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {49--60},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.14},
doi = {10.1109/FOCS.2017.14},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohenMTV17,
author = {Michael B. Cohen and
Aleksander Madry and
Dimitris Tsipras and
Adrian Vladu},
editor = {Chris Umans},
title = {Matrix Scaling and Balancing via Box Constrained Newton's Method and
Interior Point Methods},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {902--913},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.88},
doi = {10.1109/FOCS.2017.88},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CohenMTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DahlgaardKT17,
author = {S{\o}ren Dahlgaard and
Mathias B{\ae}k Tejs Knudsen and
Mikkel Thorup},
editor = {Chris Umans},
title = {Fast Similarity Sketching},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {663--671},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.67},
doi = {10.1109/FOCS.2017.67},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DahlgaardKT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DiakonikolasKS17,
author = {Ilias Diakonikolas and
Daniel M. Kane and
Alistair Stewart},
editor = {Chris Umans},
title = {Statistical Query Lower Bounds for Robust Estimation of High-Dimensional
Gaussians and Gaussian Mixtures},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {73--84},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.16},
doi = {10.1109/FOCS.2017.16},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DiakonikolasKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DinurK17,
author = {Irit Dinur and
Tali Kaufman},
editor = {Chris Umans},
title = {High Dimensional Expanders Imply Agreement Expanders},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {974--985},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.94},
doi = {10.1109/FOCS.2017.94},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DinurK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DudikHLSSV17,
author = {Miroslav Dud{\'{\i}}k and
Nika Haghtalab and
Haipeng Luo and
Robert E. Schapire and
Vasilis Syrgkanis and
Jennifer Wortman Vaughan},
editor = {Chris Umans},
title = {Oracle-Efficient Online Learning and Auction Design},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {528--539},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.55},
doi = {10.1109/FOCS.2017.55},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DudikHLSSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DuettingFKL17,
author = {Paul Duetting and
Michal Feldman and
Thomas Kesselheim and
Brendan Lucier},
editor = {Chris Umans},
title = {Prophet Inequalities Made Easy: Stochastic Optimization by Pricing
Non-Stochastic Inputs},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {540--551},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.56},
doi = {10.1109/FOCS.2017.56},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/DuettingFKL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DurfeePPR17,
author = {David Durfee and
John Peebles and
Richard Peng and
Anup B. Rao},
editor = {Chris Umans},
title = {Determinant-Preserving Sparsification of {SDDM} Matrices with Applications
to Counting and Sampling Spanning Trees},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {926--937},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.90},
doi = {10.1109/FOCS.2017.90},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DurfeePPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EbrahimiSV17,
author = {Javad B. Ebrahimi and
Damian Straszak and
Nisheeth K. Vishnoi},
editor = {Chris Umans},
title = {Subdeterminant Maximization via Nonconvex Relaxations and Anti-Concentration},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {1020--1031},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.98},
doi = {10.1109/FOCS.2017.98},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EbrahimiSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EldarH17,
author = {Lior Eldar and
Aram W. Harrow},
editor = {Chris Umans},
title = {Local Hamiltonians Whose Ground States Are Hard to Approximate},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {427--438},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.46},
doi = {10.1109/FOCS.2017.46},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EldarH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FischerGK17,
author = {Manuela Fischer and
Mohsen Ghaffari and
Fabian Kuhn},
editor = {Chris Umans},
title = {Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {180--191},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.25},
doi = {10.1109/FOCS.2017.25},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FischerGK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FlemingPPR17,
author = {Noah Fleming and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
editor = {Chris Umans},
title = {Random {\(\Theta\)}(log n)-CNFs Are Hard for Cutting Planes},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {109--120},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.19},
doi = {10.1109/FOCS.2017.19},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FlemingPPR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalvezGHI0W17,
author = {Waldo G{\'{a}}lvez and
Fabrizio Grandoni and
Sandy Heydrich and
Salvatore Ingala and
Arindam Khan and
Andreas Wiese},
editor = {Chris Umans},
title = {Approximating Geometric Knapsack via L-Packings},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {260--271},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.32},
doi = {10.1109/FOCS.2017.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalvezGHI0W17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GargS17,
author = {Sanjam Garg and
Akshayaram Srinivasan},
editor = {Chris Umans},
title = {Garbled Protocols and Two-Round {MPC} from Bilinear Maps},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {588--599},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.60},
doi = {10.1109/FOCS.2017.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GargS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GilyenS17,
author = {Andr{\'{a}}s Pal Gily{\'{e}}n and
Or Sattath},
editor = {Chris Umans},
title = {On Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum
Lov{\'{a}}sz Local Lemma},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {439--450},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.47},
doi = {10.1109/FOCS.2017.47},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GilyenS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoosP017,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
editor = {Chris Umans},
title = {Query-to-Communication Lifting for {BPP}},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {132--143},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.21},
doi = {10.1109/FOCS.2017.21},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoosP017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoyalKW17,
author = {Rishab Goyal and
Venkata Koppula and
Brent Waters},
editor = {Chris Umans},
title = {Lockable Obfuscation},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {612--621},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.62},
doi = {10.1109/FOCS.2017.62},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoyalKW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Hastad17,
author = {Johan H{\aa}stad},
editor = {Chris Umans},
title = {On Small-Depth Frege Proofs for Tseitin for Grids},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {97--108},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.18},
doi = {10.1109/FOCS.2017.18},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Hastad17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HeLLWX17,
author = {Kun He and
Liang Li and
Xingwu Liu and
Yuyi Wang and
Mingji Xia},
editor = {Chris Umans},
title = {Variable-Version Lov{\'{a}}sz Local Lemma: Beyond Shearer's Bound},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {451--462},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.48},
doi = {10.1109/FOCS.2017.48},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HeLLWX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HemenwayRW17,
author = {Brett Hemenway and
Noga Ron{-}Zewi and
Mary Wootters},
editor = {Chris Umans},
title = {Local List Recovery of High-Rate Tensor Codes {\&} Applications},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {204--215},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.27},
doi = {10.1109/FOCS.2017.27},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HemenwayRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HopkinsKPRSS17,
author = {Samuel B. Hopkins and
Pravesh K. Kothari and
Aaron Potechin and
Prasad Raghavendra and
Tselil Schramm and
David Steurer},
editor = {Chris Umans},
title = {The Power of Sum-of-Squares for Detecting Hidden Structures},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {720--731},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.72},
doi = {10.1109/FOCS.2017.72},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HopkinsKPRSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HopkinsS17,
author = {Samuel B. Hopkins and
David Steurer},
editor = {Chris Umans},
title = {Efficient Bayesian Estimation from Few Samples: Community Detection
and Related Problems},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {379--390},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.42},
doi = {10.1109/FOCS.2017.42},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HopkinsS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HrubesP17,
author = {Pavel Hrubes and
Pavel Pudl{\'{a}}k},
editor = {Chris Umans},
title = {Random Formulas, Monotone Circuits, and Interpolation},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {121--131},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.20},
doi = {10.1109/FOCS.2017.20},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HrubesP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HuangNS17,
author = {Chien{-}Chung Huang and
Danupon Nanongkai and
Thatchaphol Saranurak},
editor = {Chris Umans},
title = {Distributed Exact Weighted All-Pairs Shortest Paths in {\~{O}}(n\({}^{\mbox{5/4}}\))
Rounds},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {168--179},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.24},
doi = {10.1109/FOCS.2017.24},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HuangNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JoosKKO17,
author = {Felix Joos and
Jaehoon Kim and
Daniela K{\"{u}}hn and
Deryk Osthus},
editor = {Chris Umans},
title = {A Characterization of Testable Hypergraph Properties},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {859--867},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.84},
doi = {10.1109/FOCS.2017.84},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JoosKKO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KaneKP17,
author = {Daniel Kane and
Sushrut Karmalkar and
Eric Price},
editor = {Chris Umans},
title = {Robust Polynomial Regression up to the Information Theoretic Limit},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {391--402},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.43},
doi = {10.1109/FOCS.2017.43},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KaneKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KaneLMZ17,
author = {Daniel M. Kane and
Shachar Lovett and
Shay Moran and
Jiapeng Zhang},
editor = {Chris Umans},
title = {Active Classification with Comparison Queries},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {355--366},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.40},
doi = {10.1109/FOCS.2017.40},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KaneLMZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KaneLR17,
author = {Daniel Kane and
Shachar Lovett and
Sankeerth Rao},
editor = {Chris Umans},
title = {The Independence Number of the Birkhoff Polytope Graph, and Applications
to Maximally Recoverable Codes},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {252--259},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.31},
doi = {10.1109/FOCS.2017.31},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KaneLR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kapralov17,
author = {Michael Kapralov},
editor = {Chris Umans},
title = {Sample Efficient Estimation and Recovery in Sparse {FFT} via Isolation
on Average},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {651--662},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.66},
doi = {10.1109/FOCS.2017.66},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kapralov17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KapralovNPWWY17,
author = {Michael Kapralov and
Jelani Nelson and
Jakub Pachocki and
Zhengyu Wang and
David P. Woodruff and
Mobin Yahyazadeh},
editor = {Chris Umans},
title = {Optimal Lower Bounds for Universal Relation, and for Samplers and
Finding Duplicates in Streams},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {475--486},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.50},
doi = {10.1109/FOCS.2017.50},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KapralovNPWWY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Karger17,
author = {David R. Karger},
editor = {Chris Umans},
title = {Faster (and Still Pretty Simple) Unbiased Estimators for Network (Un)reliability},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {755--766},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.75},
doi = {10.1109/FOCS.2017.75},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Karger17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KawarabayashiS17,
author = {Ken{-}ichi Kawarabayashi and
Anastasios Sidiropoulos},
editor = {Chris Umans},
title = {Polylogarithmic Approximation for Minimum Planarization (Almost)},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {779--788},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.77},
doi = {10.1109/FOCS.2017.77},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KawarabayashiS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KhuranaS17,
author = {Dakshita Khurana and
Amit Sahai},
editor = {Chris Umans},
title = {How to Achieve Non-Malleability in One or Two Rounds},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {564--575},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.58},
doi = {10.1109/FOCS.2017.58},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KhuranaS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KlivansM17,
author = {Adam R. Klivans and
Raghu Meka},
editor = {Chris Umans},
title = {Learning Graphical Models Using Multiplicative Weights},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {343--354},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.39},
doi = {10.1109/FOCS.2017.39},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KlivansM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KomargodskiNY17,
author = {Ilan Komargodski and
Moni Naor and
Eylon Yogev},
editor = {Chris Umans},
title = {White-Box vs. Black-Box Complexity of Search Problems: Ramsey and
Graph Property Testing},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {622--632},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.63},
doi = {10.1109/FOCS.2017.63},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KomargodskiNY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KyngZ17,
author = {Rasmus Kyng and
Peng Zhang},
editor = {Chris Umans},
title = {Hardness Results for Structured Linear Systems},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {684--695},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.69},
doi = {10.1109/FOCS.2017.69},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KyngZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LarsenN17,
author = {Kasper Green Larsen and
Jelani Nelson},
editor = {Chris Umans},
title = {Optimality of the Johnson-Lindenstrauss Lemma},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {633--638},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.64},
doi = {10.1109/FOCS.2017.64},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LarsenN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeV17,
author = {Yin Tat Lee and
Santosh Srinivas Vempala},
editor = {Chris Umans},
title = {Eldan's Stochastic Localization and the {KLS} Hyperplane Conjecture:
An Improved Lower Bound for Expansion},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {998--1007},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.96},
doi = {10.1109/FOCS.2017.96},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LeeV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Li17,
author = {Shi Li},
editor = {Chris Umans},
title = {Scheduling to Minimize Total Weighted Completion Time via Time-Indexed
Linear Programming Relaxations},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {283--294},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.34},
doi = {10.1109/FOCS.2017.34},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Li17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LiQ17,
author = {Yinan Li and
Youming Qiao},
editor = {Chris Umans},
title = {Linear Algebraic Analogues of the Graph Isomorphism Problem and the
Erd{\H{o}}s-R{\'{e}}nyi Model},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {463--474},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.49},
doi = {10.1109/FOCS.2017.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LiQ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LinPS17,
author = {Huijia Lin and
Rafael Pass and
Pratik Soni},
editor = {Chris Umans},
title = {Two-Round and Non-Interactive Concurrent Non-Malleable Commitments
from Time-Lock Puzzles},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {576--587},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.59},
doi = {10.1109/FOCS.2017.59},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/LinPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MurtaghRSV17,
author = {Jack Murtagh and
Omer Reingold and
Aaron Sidford and
Salil P. Vadhan},
editor = {Chris Umans},
title = {Derandomization Beyond Connectivity: Undirected Laplacian Systems
in Nearly Logarithmic Space},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {801--812},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.79},
doi = {10.1109/FOCS.2017.79},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MurtaghRSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MuscoW17,
author = {Cameron Musco and
David P. Woodruff},
editor = {Chris Umans},
title = {Sublinear Time Low-Rank Approximation of Positive Semidefinite Matrices},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {672--683},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.68},
doi = {10.1109/FOCS.2017.68},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MuscoW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NanongkaiSW17,
author = {Danupon Nanongkai and
Thatchaphol Saranurak and
Christian Wulff{-}Nilsen},
editor = {Chris Umans},
title = {Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update
Time},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {950--961},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.92},
doi = {10.1109/FOCS.2017.92},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NanongkaiSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NayyarR17,
author = {Krati Nayyar and
Sharath Raghvendra},
editor = {Chris Umans},
title = {An Input Sensitive Online Algorithm for the Metric Bipartite Matching
Problem},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {505--515},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.53},
doi = {10.1109/FOCS.2017.53},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NayyarR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NguyenP17,
author = {Danny Nguyen and
Igor Pak},
editor = {Chris Umans},
title = {Short Presburger Arithmetic Is Hard},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {37--48},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.13},
doi = {10.1109/FOCS.2017.13},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NguyenP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PeresZ17,
author = {Yuval Peres and
Alex Zhai},
editor = {Chris Umans},
title = {Average-Case Reconstruction for the Deletion Channel: Subpolynomially
Many Traces Suffice},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {228--239},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.29},
doi = {10.1109/FOCS.2017.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PeresZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Raz17,
author = {Ran Raz},
editor = {Chris Umans},
title = {A Time-Space Lower Bound for a Large Class of Learning Problems},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {732--742},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.73},
doi = {10.1109/FOCS.2017.73},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Raz17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Saha17,
author = {Barna Saha},
editor = {Chris Umans},
title = {Fast {\&} Space-Efficient Approximations of Language Edit Distance
and {RNA} Folding: An Amnesic Dynamic Programming Approach},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {295--306},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.35},
doi = {10.1109/FOCS.2017.35},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Saha17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ServedioT17,
author = {Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Chris Umans},
title = {Deterministic Search for {CNF} Satisfying Assignments in Almost Polynomial
Time},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {813--823},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.80},
doi = {10.1109/FOCS.2017.80},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ServedioT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ServedioT17a,
author = {Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Chris Umans},
title = {Fooling Intersections of Low-Weight Halfspaces},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {824--835},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.81},
doi = {10.1109/FOCS.2017.81},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ServedioT17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SherstovW17,
author = {Alexander A. Sherstov and
Pei Wu},
editor = {Chris Umans},
title = {Optimal Interactive Coding for Insertions, Deletions, and Substitutions},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {240--251},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.30},
doi = {10.1109/FOCS.2017.30},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SherstovW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SteinkeU17,
author = {Thomas Steinke and
Jonathan R. Ullman},
editor = {Chris Umans},
title = {Tight Lower Bounds for Differentially Private Selection},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {552--563},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.57},
doi = {10.1109/FOCS.2017.57},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SteinkeU17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SvenssonT17,
author = {Ola Svensson and
Jakub Tarnawski},
editor = {Chris Umans},
title = {The Matching Problem in General Graphs Is in Quasi-NC},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {696--707},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.70},
doi = {10.1109/FOCS.2017.70},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SvenssonT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Tamo0B17,
author = {Itzhak Tamo and
Min Ye and
Alexander Barg},
editor = {Chris Umans},
title = {Optimal Repair of Reed-Solomon Codes: Achieving the Cut-Set Bound},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {216--227},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.28},
doi = {10.1109/FOCS.2017.28},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Tamo0B17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Valiant17,
author = {Leslie G. Valiant},
editor = {Chris Umans},
title = {Capacity of Neural Networks for Lifelong Learning of Composable Tasks},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {367--378},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.41},
doi = {10.1109/FOCS.2017.41},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Valiant17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/WichsZ17,
author = {Daniel Wichs and
Giorgos Zirdelis},
editor = {Chris Umans},
title = {Obfuscating Compute-and-Compare Programs under {LWE}},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {600--611},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.61},
doi = {10.1109/FOCS.2017.61},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/WichsZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Zhuk17,
author = {Dmitriy Zhuk},
editor = {Chris Umans},
title = {A Proof of {CSP} Dichotomy Conjecture},
booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
pages = {331--342},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/FOCS.2017.38},
doi = {10.1109/FOCS.2017.38},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Zhuk17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2017,
editor = {Chris Umans},
title = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2017, Berkeley, CA, USA, October 15-17, 2017},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://ieeexplore.ieee.org/xpl/conhome/8100284/proceeding},
isbn = {978-1-5386-3464-6},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudD16,
author = {Amir Abboud and
S{\o}ren Dahlgaard},
editor = {Irit Dinur},
title = {Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {477--486},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.58},
doi = {10.1109/FOCS.2016.58},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbboudD16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbrahamDKKP16,
author = {Ittai Abraham and
David Durfee and
Ioannis Koutis and
Sebastian Krinninger and
Richard Peng},
editor = {Irit Dinur},
title = {On Fully Dynamic Graph Sparsifiers},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {335--344},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.44},
doi = {10.1109/FOCS.2016.44},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbrahamDKKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanCW16,
author = {Josh Alman and
Timothy M. Chan and
R. Ryan Williams},
editor = {Irit Dinur},
title = {Polynomial Representations of Threshold Functions and Algorithmic
Applications},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {467--476},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.57},
doi = {10.1109/FOCS.2016.57},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanCW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnshuBBG0KLS16,
author = {Anurag Anshu and
Aleksandrs Belovs and
Shalev Ben{-}David and
Mika G{\"{o}}{\"{o}}s and
Rahul Jain and
Robin Kothari and
Troy Lee and
Miklos Santha},
editor = {Irit Dinur},
title = {Separations in Communication Complexity Using Cheat Sheets and Information
Complexity},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {555--564},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.66},
doi = {10.1109/FOCS.2016.66},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnshuBBG0KLS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AzarBCCCG0KNNP16,
author = {Yossi Azar and
Niv Buchbinder and
T.{-}H. Hubert Chan and
Shahar Chen and
Ilan Reuven Cohen and
Anupam Gupta and
Zhiyi Huang and
Ning Kang and
Viswanath Nagarajan and
Joseph Naor and
Debmalya Panigrahi},
editor = {Irit Dinur},
title = {Online Algorithms for Covering and Packing Problems with Convex Objectives},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {148--157},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.24},
doi = {10.1109/FOCS.2016.24},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AzarBCCCG0KNNP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AzizM16,
author = {Haris Aziz and
Simon Mackenzie},
editor = {Irit Dinur},
title = {A Discrete and Bounded Envy-Free Cake Cutting Protocol for Any Number
of Agents},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {416--427},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.52},
doi = {10.1109/FOCS.2016.52},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AzizM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BackursI16,
author = {Arturs Backurs and
Piotr Indyk},
editor = {Irit Dinur},
title = {Which Regular Expression Patterns Are Hard to Match?},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {457--466},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.56},
doi = {10.1109/FOCS.2016.56},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BackursI16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BansalDG16,
author = {Nikhil Bansal and
Daniel Dadush and
Shashwat Garg},
editor = {Irit Dinur},
title = {An Algorithm for Koml{\'{o}}s Conjecture Matching Banaszczyk's
Bound},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {788--799},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.89},
doi = {10.1109/FOCS.2016.89},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BansalDG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BarakHKKMP16,
author = {Boaz Barak and
Samuel B. Hopkins and
Jonathan A. Kelner and
Pravesh Kothari and
Ankur Moitra and
Aaron Potechin},
editor = {Irit Dinur},
title = {A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {428--437},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.53},
doi = {10.1109/FOCS.2016.53},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BarakHKKMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BarbosaENW16,
author = {Rafael da Ponte Barbosa and
Alina Ene and
Huy L. Nguyen and
Justin Ward},
editor = {Irit Dinur},
title = {A New Framework for Distributed Submodular Maximization},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {645--654},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.74},
doi = {10.1109/FOCS.2016.74},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BarbosaENW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BelazzouguiZ16,
author = {Djamal Belazzougui and
Qin Zhang},
editor = {Irit Dinur},
title = {Edit Distance: Sketching, Streaming, and Document Exchange},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {51--60},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.15},
doi = {10.1109/FOCS.2016.15},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BelazzouguiZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BringmannGSW16,
author = {Karl Bringmann and
Fabrizio Grandoni and
Barna Saha and
Virginia Vassilevska Williams},
editor = {Irit Dinur},
title = {Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding
via Fast Bounded-Difference Min-Plus Product},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {375--384},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.48},
doi = {10.1109/FOCS.2016.48},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BringmannGSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BroadbentJ0W16,
author = {Anne Broadbent and
Zhengfeng Ji and
Fang Song and
John Watrous},
editor = {Irit Dinur},
title = {Zero-Knowledge Proof Systems for {QMA}},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {31--40},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.13},
doi = {10.1109/FOCS.2016.13},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BroadbentJ0W16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BurgisserIP16,
author = {Peter B{\"{u}}rgisser and
Christian Ikenmeyer and
Greta Panova},
editor = {Irit Dinur},
title = {No Occurrence Obstructions in Geometric Complexity Theory},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {386--395},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.49},
doi = {10.1109/FOCS.2016.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BurgisserIP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChakrabartiK16,
author = {Amit Chakrabarti and
Sagar Kale},
editor = {Irit Dinur},
title = {Strong Fooling Sets for Multi-player Communication with Applications
to Deterministic Estimation of Stream Statistics},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {41--50},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.14},
doi = {10.1109/FOCS.2016.14},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChakrabartiK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChanHJ16,
author = {T.{-}H. Hubert Chan and
Shuguang Hu and
Shaofeng H.{-}C. Jiang},
editor = {Irit Dinur},
title = {A {PTAS} for the Steiner Forest Problem in Doubling Metrics},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {810--819},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.91},
doi = {10.1109/FOCS.2016.91},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChanHJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChangKP16,
author = {Yi{-}Jun Chang and
Tsvi Kopelowitz and
Seth Pettie},
editor = {Irit Dinur},
title = {An Exponential Separation between Randomized and Deterministic Complexity
in the {LOCAL} Model},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {615--624},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.72},
doi = {10.1109/FOCS.2016.72},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChangKP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChattopadhyayL16,
author = {Eshan Chattopadhyay and
Xin Li},
editor = {Irit Dinur},
title = {Explicit Non-malleable Extractors, Multi-source Extractors, and Almost
Optimal Privacy Amplification Protocols},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {158--167},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.25},
doi = {10.1109/FOCS.2016.25},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChattopadhyayL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChechikHILP16,
author = {Shiri Chechik and
Thomas Dueholm Hansen and
Giuseppe F. Italiano and
Jakub Lacki and
Nikos Parotsidis},
editor = {Irit Dinur},
title = {Decremental Single-Source Reachability and Strongly Connected Components
in {\~{O}}(m{\(\surd\)}n) Total Update Time},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {315--324},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.42},
doi = {10.1109/FOCS.2016.42},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChechikHILP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenKPS16,
author = {Xue Chen and
Daniel M. Kane and
Eric Price and
Zhao Song},
editor = {Irit Dinur},
title = {Fourier-Sparse Interpolation without a Frequency Gap},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {741--750},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.84},
doi = {10.1109/FOCS.2016.84},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenKPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenL16,
author = {Yijia Chen and
Bingkai Lin},
editor = {Irit Dinur},
title = {The Constant Inapproximability of the Parameterized Dominating Set
Problem},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {505--514},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.61},
doi = {10.1109/FOCS.2016.61},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenP16,
author = {Shiteng Chen and
Periklis A. Papakonstantinou},
editor = {Irit Dinur},
title = {Depth-Reduction for Composites},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {99--108},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.20},
doi = {10.1109/FOCS.2016.20},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenVY16,
author = {Hubie Chen and
Matthew Valeriote and
Yuichi Yoshida},
editor = {Irit Dinur},
title = {Testing Assignments to Constraint Satisfaction Problems},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {525--534},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.63},
doi = {10.1109/FOCS.2016.63},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenVY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenW16,
author = {Yiling Chen and
Bo Waggoner},
editor = {Irit Dinur},
title = {Informational Substitutes},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {239--247},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.33},
doi = {10.1109/FOCS.2016.33},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChuzhoyE16,
author = {Julia Chuzhoy and
Alina Ene},
editor = {Irit Dinur},
title = {On Approximating Maximum Independent Set of Rectangles},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {820--829},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.92},
doi = {10.1109/FOCS.2016.92},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChuzhoyE16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen-AddadKM16,
author = {Vincent Cohen{-}Addad and
Philip N. Klein and
Claire Mathieu},
editor = {Irit Dinur},
title = {Local Search Yields Approximation Schemes for k-Means and k-Median
in Euclidean and Minor-Free Metrics},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {353--364},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.46},
doi = {10.1109/FOCS.2016.46},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen-AddadKM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen16,
author = {Gil Cohen},
editor = {Irit Dinur},
title = {Making the Most of Advice: New Correlation Breakers and Their Applications},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {188--196},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.28},
doi = {10.1109/FOCS.2016.28},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen16a,
author = {Michael B. Cohen},
editor = {Irit Dinur},
title = {Ramanujan Graphs in Polynomial Time},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {276--281},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.37},
doi = {10.1109/FOCS.2016.37},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohenKPPSV16,
author = {Michael B. Cohen and
Jonathan A. Kelner and
John Peebles and
Richard Peng and
Aaron Sidford and
Adrian Vladu},
editor = {Irit Dinur},
title = {Faster Algorithms for Computing the Stationary Distribution, Simulating
Random Walks, and More},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {583--592},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.69},
doi = {10.1109/FOCS.2016.69},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CohenKPPSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CohenS16,
author = {Gil Cohen and
Leonard J. Schulman},
editor = {Irit Dinur},
title = {Extractors for Near Logarithmic Min-Entropy},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {178--187},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.27},
doi = {10.1109/FOCS.2016.27},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CohenS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CrossonH16,
author = {Elizabeth Crosson and
Aram W. Harrow},
editor = {Irit Dinur},
title = {Simulated Quaotum Annealing Can Be Exponentially Faster Than Classical
Simulated Annealing},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {714--723},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.81},
doi = {10.1109/FOCS.2016.81},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CrossonH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DadushR16,
author = {Daniel Dadush and
Oded Regev},
editor = {Irit Dinur},
title = {Towards Strong Reverse Minkowski-Type Inequalities for Lattices},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {447--456},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.55},
doi = {10.1109/FOCS.2016.55},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DadushR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DaskalakisS16,
author = {Constantinos Daskalakis and
Vasilis Syrgkanis},
editor = {Irit Dinur},
title = {Learning in Auctions: Regret is Hard, Envy is Easy},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {219--228},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.31},
doi = {10.1109/FOCS.2016.31},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DaskalakisS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DeST16,
author = {Anindya De and
Michael E. Saks and
Sijian Tang},
editor = {Irit Dinur},
title = {Noisy Population Recovery in Polynomial Time},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {675--684},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.77},
doi = {10.1109/FOCS.2016.77},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DeST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DiakonikolasK16,
author = {Ilias Diakonikolas and
Daniel M. Kane},
editor = {Irit Dinur},
title = {A New Approach for Testing Properties of Discrete Distributions},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {685--694},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.78},
doi = {10.1109/FOCS.2016.78},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DiakonikolasK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DiakonikolasKK016,
author = {Ilias Diakonikolas and
Gautam Kamath and
Daniel M. Kane and
Jerry Li and
Ankur Moitra and
Alistair Stewart},
editor = {Irit Dinur},
title = {Robust Estimators in High Dimensions without the Computational Intractability},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {655--664},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.85},
doi = {10.1109/FOCS.2016.85},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DiakonikolasKK016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Dobzinski16,
author = {Shahar Dobzinski},
editor = {Irit Dinur},
title = {Computational Efficiency Requires Simple Taxation},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {209--218},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.30},
doi = {10.1109/FOCS.2016.30},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Dobzinski16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EfthymiouHSVY16,
author = {Charilaos Efthymiou and
Thomas P. Hayes and
Daniel Stefankovic and
Eric Vigoda and
Yitong Yin},
editor = {Irit Dinur},
title = {Convergence of {MCMC} and Loopy {BP} in the Tree Uniqueness Region
for the Hard-Core Model},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {704--713},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.80},
doi = {10.1109/FOCS.2016.80},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EfthymiouHSVY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ElkinN16,
author = {Michael Elkin and
Ofer Neiman},
editor = {Irit Dinur},
title = {Hopsets with Constant Hopbound, and Applications to Approximate Shortest
Paths},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {128--137},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.22},
doi = {10.1109/FOCS.2016.22},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ElkinN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EneN16,
author = {Alina Ene and
Huy L. Nguyen},
editor = {Irit Dinur},
title = {Constrained Submodular Maximization: Beyond 1/e},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {248--257},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.34},
doi = {10.1109/FOCS.2016.34},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EneN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FindGHK16,
author = {Magnus Gausdal Find and
Alexander Golovnev and
Edward A. Hirsch and
Alexander S. Kulikov},
editor = {Irit Dinur},
title = {A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit
Function},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {89--98},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.19},
doi = {10.1109/FOCS.2016.19},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FindGHK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FominLMPPS16,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
D{\'{a}}niel Marx and
Marcin Pilipczuk and
Michal Pilipczuk and
Saket Saurabh},
editor = {Irit Dinur},
title = {Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free
Graphs via Low Treewidth Pattern Covering},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {515--524},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.62},
doi = {10.1109/FOCS.2016.62},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FominLMPPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FraigniaudHK16,
author = {Pierre Fraigniaud and
Marc Heinrich and
Adrian Kosowski},
editor = {Irit Dinur},
title = {Local Conflict Coloring},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {625--634},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.73},
doi = {10.1109/FOCS.2016.73},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FraigniaudHK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FriggstadRS16,
author = {Zachary Friggstad and
Mohsen Rezapour and
Mohammad R. Salavatipour},
editor = {Irit Dinur},
title = {Local Search Yields a {PTAS} for k-Means in Doubling Metrics},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {365--374},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.47},
doi = {10.1109/FOCS.2016.47},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FriggstadRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GandikotaGG16,
author = {Venkata Gandikota and
Badih Ghazi and
Elena Grigorescu},
editor = {Irit Dinur},
title = {NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott
Problem},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {760--769},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.86},
doi = {10.1109/FOCS.2016.86},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GandikotaGG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GargGOW16,
author = {Ankit Garg and
Leonid Gurvits and
Rafael Mendes de Oliveira and
Avi Wigderson},
editor = {Irit Dinur},
title = {A Deterministic Polynomial Time Algorithm for Non-commutative Rational
Identity Testing},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {109--117},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.95},
doi = {10.1109/FOCS.2016.95},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GargGOW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GhaziKS16,
author = {Badih Ghazi and
Pritish Kamath and
Madhu Sudan},
editor = {Irit Dinur},
title = {Decidability of Non-interactive Simulation of Joint Distributions},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {545--554},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.65},
doi = {10.1109/FOCS.2016.65},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GhaziKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Goos0016,
author = {Mika G{\"{o}}{\"{o}}s and
Rahul Jain and
Thomas Watson},
editor = {Irit Dinur},
title = {Extension Complexity of Independent Set Polytopes},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {565--572},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.67},
doi = {10.1109/FOCS.2016.67},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Goos0016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GowersV16,
author = {W. T. Gowers and
Emanuele Viola},
editor = {Irit Dinur},
title = {The Multiparty Communication Complexity of Interleaved Group Products},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {289--294},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.39},
doi = {10.1109/FOCS.2016.39},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GowersV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoyalIMSS16,
author = {Vipul Goyal and
Yuval Ishai and
Hemanta K. Maji and
Amit Sahai and
Alexander A. Sherstov},
editor = {Irit Dinur},
title = {Bounded-Communication Leakage Resilience via Parity-Resilient Circuits},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {1--10},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.10},
doi = {10.1109/FOCS.2016.10},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoyalIMSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoyalKS16,
author = {Vipul Goyal and
Dakshita Khurana and
Amit Sahai},
editor = {Irit Dinur},
title = {Breaking the Three Round Barrier for Non-malleable Commitments},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {21--30},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.12},
doi = {10.1109/FOCS.2016.12},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoyalKS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GrossmanM16,
author = {Ofer Grossman and
Dana Moshkovitz},
editor = {Irit Dinur},
title = {Amplification and Derandomization without Slowdown},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {770--779},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.87},
doi = {10.1109/FOCS.2016.87},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GrossmanM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuruswamiZ16,
author = {Venkatesan Guruswami and
David Zuckerman},
editor = {Irit Dinur},
title = {Robust Fourier and Polynomial Curve Fitting},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {751--759},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.75},
doi = {10.1109/FOCS.2016.75},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuruswamiZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Hastad16,
author = {Johan H{\aa}stad},
editor = {Irit Dinur},
title = {An Average-Case Depth Hierarchy Theorem for Higher Depth},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {79--88},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.18},
doi = {10.1109/FOCS.2016.18},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Hastad16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HatamiHL16,
author = {Hamed Hatami and
Kaave Hosseini and
Shachar Lovett},
editor = {Irit Dinur},
title = {Structure of Protocols for {XOR} Functions},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {282--288},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.38},
doi = {10.1109/FOCS.2016.38},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HatamiHL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HendricksPR16,
author = {Jacob Hendricks and
Matthew J. Patitz and
Trent A. Rogers},
editor = {Irit Dinur},
title = {Universal Simulation of Directed Systems in the Abstract Tile Assembly
Model Requires Undirectedness},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {800--809},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.90},
doi = {10.1109/FOCS.2016.90},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/HendricksPR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/IkenmeyerP16,
author = {Christian Ikenmeyer and
Greta Panova},
editor = {Irit Dinur},
title = {Rectangular Kronecker Coefficients and Plethysms in Geometric Complexity
Theory},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {396--405},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.50},
doi = {10.1109/FOCS.2016.50},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/IkenmeyerP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImL16,
author = {Sungjin Im and
Shi Li},
editor = {Irit Dinur},
title = {Better Unrelated Machine Scheduling for Weighted Completion Time via
Random Offsets from Non-uniform Distributions},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {138--147},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.23},
doi = {10.1109/FOCS.2016.23},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JoosPRR16,
author = {Felix Joos and
Guillem Perarnau and
Dieter Rautenbach and
Bruce A. Reed},
editor = {Irit Dinur},
title = {How to Determine if a Random Graph with a Fixed Degree Sequence Has
a Giant Component},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {695--703},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.79},
doi = {10.1109/FOCS.2016.79},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JoosPRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Karger16,
author = {David R. Karger},
editor = {Irit Dinur},
title = {A Fast and Simple Unbiased Estimator for Network (Un)reliability},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {635--644},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.96},
doi = {10.1109/FOCS.2016.96},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Karger16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KarninLL16,
author = {Zohar S. Karnin and
Kevin J. Lang and
Edo Liberty},
editor = {Irit Dinur},
title = {Optimal Quantile Approximation in Streams},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {71--78},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.17},
doi = {10.1109/FOCS.2016.17},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KarninLL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Knudsen16,
author = {Mathias B{\ae}k Tejs Knudsen},
editor = {Irit Dinur},
title = {Linear Hashing Is Awesome},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {345--352},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.45},
doi = {10.1109/FOCS.2016.45},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Knudsen16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Kolmogorov16,
author = {Vladimir Kolmogorov},
editor = {Irit Dinur},
title = {Commutativity in the Algorithmic Lov{\'{a}}sz Local Lemma},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {780--787},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.88},
doi = {10.1109/FOCS.2016.88},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Kolmogorov16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KyngS16,
author = {Rasmus Kyng and
Sushant Sachdeva},
editor = {Irit Dinur},
title = {Approximate Gaussian Elimination for Laplacians - Fast, Sparse, and
Simple},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {573--582},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.68},
doi = {10.1109/FOCS.2016.68},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KyngS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LaiRV16,
author = {Kevin A. Lai and
Anup B. Rao and
Santosh S. Vempala},
editor = {Irit Dinur},
title = {Agnostic Estimation of Mean and Covariance},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {665--674},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.76},
doi = {10.1109/FOCS.2016.76},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LaiRV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LarsenNNT16,
author = {Kasper Green Larsen and
Jelani Nelson and
Huy L. Nguyen and
Mikkel Thorup},
editor = {Irit Dinur},
title = {Heavy Hitters via Cluster-Preserving Clustering},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {61--70},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.16},
doi = {10.1109/FOCS.2016.16},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LarsenNNT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeV16,
author = {Jasper C. H. Lee and
Paul Valiant},
editor = {Irit Dinur},
title = {Optimizing Star-Convex Functions},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {603--614},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.71},
doi = {10.1109/FOCS.2016.71},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LeeV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Li16,
author = {Xin Li},
editor = {Irit Dinur},
title = {Improved Two-Source Extractors, and Affine Extractors for Polylogarithmic
Entropy},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {168--177},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.26},
doi = {10.1109/FOCS.2016.26},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Li16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LinV16,
author = {Huijia Lin and
Vinod Vaikuntanathan},
editor = {Irit Dinur},
title = {Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree
Graded Encodings},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {11--20},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.11},
doi = {10.1109/FOCS.2016.11},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LinV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LouisV16,
author = {Anand Louis and
Santosh S. Vempala},
editor = {Irit Dinur},
title = {Accelerated Newton Iteration for Roots of Black Box Polynomials},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {732--740},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.83},
doi = {10.1109/FOCS.2016.83},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LouisV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MaSS16,
author = {Tengyu Ma and
Jonathan Shi and
David Steurer},
editor = {Irit Dinur},
title = {Polynomial-Time Tensor Decompositions with Sum-of-Squares},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {438--446},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.54},
doi = {10.1109/FOCS.2016.54},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MaSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Madry16,
author = {Aleksander Madry},
editor = {Irit Dinur},
title = {Computing Maximum Flow with Augmenting Electrical Flows},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {593--602},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.70},
doi = {10.1109/FOCS.2016.70},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Madry16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Nisan16,
author = {Noam Nisan},
editor = {Irit Dinur},
title = {Knuth Prize Lecture: Complexity of Communication in Markets},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {385},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.97},
doi = {10.1109/FOCS.2016.97},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Nisan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RaskhodnikovaS16,
author = {Sofya Raskhodnikova and
Adam D. Smith},
editor = {Irit Dinur},
title = {Lipschitz Extensions for Node-Private Graph Statistics and the Generalized
Exponential Mechanism},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {495--504},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.60},
doi = {10.1109/FOCS.2016.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RaskhodnikovaS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Raz16,
author = {Ran Raz},
editor = {Irit Dinur},
title = {Fast Learning Requires Good Memory: {A} Time-Space Lower Bound for
Parity Learning},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {266--275},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.36},
doi = {10.1109/FOCS.2016.36},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Raz16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Remscrim16,
author = {Zachary Remscrim},
editor = {Irit Dinur},
title = {The Hilbert Function, Algebraic Extractors, and Recursive Fourier
Sampling},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {197--208},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.29},
doi = {10.1109/FOCS.2016.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Remscrim16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RezendeNV16,
author = {Susanna F. de Rezende and
Jakob Nordstr{\"{o}}m and
Marc Vinyals},
editor = {Irit Dinur},
title = {How Limited Interaction Hinders Real Communication (and What It Means
for Proof and Circuit Complexity)},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {295--304},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.40},
doi = {10.1109/FOCS.2016.40},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RezendeNV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RoberePRC16,
author = {Robert Robere and
Toniann Pitassi and
Benjamin Rossman and
Stephen A. Cook},
editor = {Irit Dinur},
title = {Exponential Lower Bounds for Monotone Span Programs},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {406--415},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.51},
doi = {10.1109/FOCS.2016.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RoberePRC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RogersRST16,
author = {Ryan M. Rogers and
Aaron Roth and
Adam D. Smith and
Om Thakkar},
editor = {Irit Dinur},
title = {Max-Information, Differential Privacy, and Post-selection Hypothesis
Testing},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {487--494},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.59},
doi = {10.1109/FOCS.2016.59},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/RogersRST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RoughgardenW16,
author = {Tim Roughgarden and
Omri Weinstein},
editor = {Irit Dinur},
title = {On the Communication Complexity of Approximate Fixed Points},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {229--238},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.32},
doi = {10.1109/FOCS.2016.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RoughgardenW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Rubinstein16,
author = {Aviad Rubinstein},
editor = {Irit Dinur},
title = {Settling the Complexity of Computing Approximate Two-Player Nash Equilibria},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {258--265},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.35},
doi = {10.1109/FOCS.2016.35},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Rubinstein16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SeboZ16,
author = {Andr{\'{a}}s Seb{\"{o}} and
Anke van Zuylen},
editor = {Irit Dinur},
title = {The Salesman's Improved Paths: {A} 3/2+1/34 Approximation},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {118--127},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.21},
doi = {10.1109/FOCS.2016.21},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SeboZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Sherstov16,
author = {Alexander A. Sherstov},
editor = {Irit Dinur},
title = {Compressing Interactive Communication under Product Distributions},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {535--544},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.64},
doi = {10.1109/FOCS.2016.64},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Sherstov16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SlySZ16,
author = {Allan Sly and
Nike Sun and
Yumeng Zhang},
editor = {Irit Dinur},
title = {The Number of Solutions for Random Regular {NAE-SAT}},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {724--731},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.82},
doi = {10.1109/FOCS.2016.82},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SlySZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Solomon16,
author = {Shay Solomon},
editor = {Irit Dinur},
title = {Fully Dynamic Maximal Matching in Constant Update Time},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {325--334},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.43},
doi = {10.1109/FOCS.2016.43},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Solomon16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/WeinsteinY16,
author = {Omri Weinstein and
Huacheng Yu},
editor = {Irit Dinur},
title = {Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {305--314},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.41},
doi = {10.1109/FOCS.2016.41},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/WeinsteinY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2016,
editor = {Irit Dinur},
title = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://ieeexplore.ieee.org/xpl/conhome/7781469/proceeding},
isbn = {978-1-5090-3933-3},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbbeS15,
author = {Emmanuel Abbe and
Colin Sandon},
editor = {Venkatesan Guruswami},
title = {Community Detection in General Stochastic Block models: Fundamental
Limits and Efficient Algorithms for Recovery},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {670--688},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.47},
doi = {10.1109/FOCS.2015.47},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbbeS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudBW15,
author = {Amir Abboud and
Arturs Backurs and
Virginia Vassilevska Williams},
editor = {Venkatesan Guruswami},
title = {Tight Hardness Results for {LCS} and Other Sequence Similarity Measures},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {59--78},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.14},
doi = {10.1109/FOCS.2015.14},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbboudBW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudBW15a,
author = {Amir Abboud and
Arturs Backurs and
Virginia Vassilevska Williams},
editor = {Venkatesan Guruswami},
title = {If the Current Clique Algorithms are Optimal, So is Valiant's Parser},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {98--117},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.16},
doi = {10.1109/FOCS.2015.16},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbboudBW15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AggarwalDS15,
author = {Divesh Aggarwal and
Daniel Dadush and
Noah Stephens{-}Davidowitz},
editor = {Venkatesan Guruswami},
title = {Solving the Closest Vector Problem in 2n Time - The Discrete Gaussian
Strikes Again!},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {563--582},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.41},
doi = {10.1109/FOCS.2015.41},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AggarwalDS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlaeiHNPY15,
author = {Saeed Alaei and
Jason D. Hartline and
Rad Niazadeh and
Emmanouil Pountourakis and
Yang Yuan},
editor = {Venkatesan Guruswami},
title = {Optimal Auctions vs. Anonymous Pricing},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1446--1463},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.92},
doi = {10.1109/FOCS.2015.92},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AlaeiHNPY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AllenOW15,
author = {Sarah R. Allen and
Ryan O'Donnell and
David Witmer},
editor = {Venkatesan Guruswami},
title = {How to Refute a Random {CSP}},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {689--708},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.48},
doi = {10.1109/FOCS.2015.48},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AllenOW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlmanW15,
author = {Josh Alman and
Ryan Williams},
editor = {Venkatesan Guruswami},
title = {Probabilistic Polynomials and Hamming Nearest Neighbors},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {136--150},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.18},
doi = {10.1109/FOCS.2015.18},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlmanW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonNRW15,
author = {Noga Alon and
Noam Nisan and
Ran Raz and
Omri Weinstein},
editor = {Venkatesan Guruswami},
title = {Welfare Maximization with Limited Interaction},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1499--1512},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.95},
doi = {10.1109/FOCS.2015.95},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AlonNRW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlstrupDK15,
author = {Stephen Alstrup and
S{\o}ren Dahlgaard and
Mathias B{\ae}k Tejs Knudsen},
editor = {Venkatesan Guruswami},
title = {Optimal Induced Universal Graphs and Adjacency Labeling for Trees},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1311--1326},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.84},
doi = {10.1109/FOCS.2015.84},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlstrupDK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnariG15,
author = {Nima Anari and
Shayan Oveis Gharan},
editor = {Venkatesan Guruswami},
title = {Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric
{TSP}},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {20--39},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.11},
doi = {10.1109/FOCS.2015.11},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnariG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AndersonGNR15,
author = {Joseph Anderson and
Navin Goyal and
Anupama Nandi and
Luis Rademacher},
editor = {Venkatesan Guruswami},
title = {Heavy-Tailed Independent Component Analysis},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {290--309},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.26},
doi = {10.1109/FOCS.2015.26},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AndersonGNR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AsharovS15,
author = {Gilad Asharov and
Gil Segev},
editor = {Venkatesan Guruswami},
title = {Limits on the Power of Indistinguishability Obfuscation and Functional
Encryption},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {191--209},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.21},
doi = {10.1109/FOCS.2015.21},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AsharovS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AugustineP0RU15,
author = {John Augustine and
Gopal Pandurangan and
Peter Robinson and
Scott T. Roche and
Eli Upfal},
editor = {Venkatesan Guruswami},
title = {Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer
Networks},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {350--369},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.29},
doi = {10.1109/FOCS.2015.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AugustineP0RU15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BazziFPS15,
author = {Abbas Bazzi and
Samuel Fiorini and
Sebastian Pokutta and
Ola Svensson},
editor = {Venkatesan Guruswami},
title = {No Small Linear Program Approximates Vertex Cover within a Factor
2 - e},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1123--1142},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.73},
doi = {10.1109/FOCS.2015.73},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BazziFPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BerryCK15,
author = {Dominic W. Berry and
Andrew M. Childs and
Robin Kothari},
editor = {Venkatesan Guruswami},
title = {Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {792--809},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.54},
doi = {10.1109/FOCS.2015.54},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BerryCK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BitanskyPR15,
author = {Nir Bitansky and
Omer Paneth and
Alon Rosen},
editor = {Venkatesan Guruswami},
title = {On the Cryptographic Hardness of Finding a Nash Equilibrium},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1480--1498},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.94},
doi = {10.1109/FOCS.2015.94},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BitanskyPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BitanskyV15,
author = {Nir Bitansky and
Vinod Vaikuntanathan},
editor = {Venkatesan Guruswami},
title = {Indistinguishability Obfuscation from Functional Encryption},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {171--190},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.20},
doi = {10.1109/FOCS.2015.20},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BitanskyV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BordenaveLM15,
author = {Charles Bordenave and
Marc Lelarge and
Laurent Massouli{\'{e}}},
editor = {Venkatesan Guruswami},
title = {Non-backtracking Spectrum of Random Graphs: Community Detection and
Non-regular Ramanujan Graphs},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1347--1357},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.86},
doi = {10.1109/FOCS.2015.86},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BordenaveLM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanGKMT15,
author = {Mark Braverman and
Ankit Garg and
Young Kun{-}Ko and
Jieming Mao and
Dave Touchette},
editor = {Venkatesan Guruswami},
title = {Near-Optimal Bounds on Bounded-Round Quantum Communication Complexity
of Disjointness},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {773--791},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.53},
doi = {10.1109/FOCS.2015.53},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanGKMT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrietRS15,
author = {Jop Bri{\"{e}}t and
Oded Regev and
Rishi Saket},
editor = {Venkatesan Guruswami},
title = {Tight Hardness of the Non-commutative Grothendieck Problem},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1108--1122},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.72},
doi = {10.1109/FOCS.2015.72},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BrietRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BringmannK15,
author = {Karl Bringmann and
Marvin K{\"{u}}nnemann},
editor = {Venkatesan Guruswami},
title = {Quadratic Conditional Lower Bounds for String Problems and Dynamic
Time Warping},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {79--97},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.15},
doi = {10.1109/FOCS.2015.15},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BringmannK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BunNSV15,
author = {Mark Bun and
Kobbi Nissim and
Uri Stemmer and
Salil P. Vadhan},
editor = {Venkatesan Guruswami},
title = {Differentially Private Release and Learning of Threshold Functions},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {634--649},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.45},
doi = {10.1109/FOCS.2015.45},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BunNSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CaiFGW15,
author = {Jin{-}Yi Cai and
Zhiguo Fu and
Heng Guo and
Tyson Williams},
editor = {Venkatesan Guruswami},
title = {A Holant Dichotomy: Is the {FKT} Algorithm Universal?},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1259--1276},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.81},
doi = {10.1109/FOCS.2015.81},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CaiFGW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChalermsookG0MS15,
author = {Parinya Chalermsook and
Mayank Goswami and
L{\'{a}}szl{\'{o}} Kozma and
Kurt Mehlhorn and
Thatchaphol Saranurak},
editor = {Venkatesan Guruswami},
title = {Pattern-Avoiding Access in Binary Search Trees},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {410--423},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.32},
doi = {10.1109/FOCS.2015.32},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ChalermsookG0MS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChanLNV15,
author = {Siu Man Chan and
Massimo Lauria and
Jakob Nordstr{\"{o}}m and
Marc Vinyals},
editor = {Venkatesan Guruswami},
title = {Hardness of Approximation in {PSPACE} and Separation Results for Pebble
Games},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {466--485},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.36},
doi = {10.1109/FOCS.2015.36},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChanLNV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChanN15,
author = {Timothy M. Chan and
Yakov Nekrich},
editor = {Venkatesan Guruswami},
title = {Towards an Optimal Method for Dynamic Planar Point Location},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {390--409},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.31},
doi = {10.1109/FOCS.2015.31},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChanN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenDOPSY15,
author = {Xi Chen and
Ilias Diakonikolas and
Anthi Orfanou and
Dimitris Paparas and
Xiaorui Sun and
Mihalis Yannakakis},
editor = {Venkatesan Guruswami},
title = {On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1464--1479},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.93},
doi = {10.1109/FOCS.2015.93},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenDOPSY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChengCDEHT15,
author = {Yu Cheng and
Ho Yee Cheung and
Shaddin Dughmi and
Ehsan Emamjomeh{-}Zadeh and
Li Han and
Shang{-}Hua Teng},
editor = {Venkatesan Guruswami},
title = {Mixture Selection, Mechanism Design, and Signaling},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1426--1445},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.91},
doi = {10.1109/FOCS.2015.91},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChengCDEHT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChierichettiD0K15,
author = {Flavio Chierichetti and
Abhimanyu Das and
Anirban Dasgupta and
Ravi Kumar},
editor = {Venkatesan Guruswami},
title = {Approximate Modularity},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1143--1162},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.74},
doi = {10.1109/FOCS.2015.74},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChierichettiD0K15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ClarksonW15,
author = {Kenneth L. Clarkson and
David P. Woodruff},
editor = {Venkatesan Guruswami},
title = {Input Sparsity and Hardness for Robust Subspace Approximation},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {310--329},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.27},
doi = {10.1109/FOCS.2015.27},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ClarksonW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CliffordGL15,
author = {Rapha{\"{e}}l Clifford and
Allan Gr{\o}nlund and
Kasper Green Larsen},
editor = {Venkatesan Guruswami},
title = {New Unconditional Hardness Results for Dynamic and Online Problems},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1089--1107},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.71},
doi = {10.1109/FOCS.2015.71},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CliffordGL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Cohen15,
author = {Gil Cohen},
editor = {Venkatesan Guruswami},
title = {Local Correlation Breakers and Applications to Three-Source Extractors
and Mergers},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {845--862},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.57},
doi = {10.1109/FOCS.2015.57},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Cohen15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CurticapeanX15,
author = {Radu Curticapean and
Mingji Xia},
editor = {Venkatesan Guruswami},
title = {Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod
2k},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {994--1009},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.65},
doi = {10.1109/FOCS.2015.65},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CurticapeanX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DahlgaardKRT15,
author = {S{\o}ren Dahlgaard and
Mathias B{\ae}k Tejs Knudsen and
Eva Rotenberg and
Mikkel Thorup},
editor = {Venkatesan Guruswami},
title = {Hashing for Statistics over K-Partitions},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1292--1310},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.83},
doi = {10.1109/FOCS.2015.83},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DahlgaardKRT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DaskalakisKT15,
author = {Constantinos Daskalakis and
Gautam Kamath and
Christos Tzamos},
editor = {Venkatesan Guruswami},
title = {On the Structure, Covering, and Learning of Poisson Multinomial Distributions},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1203--1217},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.77},
doi = {10.1109/FOCS.2015.77},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DaskalakisKT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/De15,
author = {Anindya De},
editor = {Venkatesan Guruswami},
title = {Beyond the Central Limit theorem: Asymptotic Expansions and Pseudorandomness
for Combinatorial Sums},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {883--902},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.59},
doi = {10.1109/FOCS.2015.59},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/De15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DiakonikolasKN15,
author = {Ilias Diakonikolas and
Daniel M. Kane and
Vladimir Nikishkin},
editor = {Venkatesan Guruswami},
title = {Optimal Algorithms and Lower Bounds for Testing Closeness of Structured
Distributions},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1183--1202},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.76},
doi = {10.1109/FOCS.2015.76},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DiakonikolasKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DworkSSUV15,
author = {Cynthia Dwork and
Adam D. Smith and
Thomas Steinke and
Jonathan R. Ullman and
Salil P. Vadhan},
editor = {Venkatesan Guruswami},
title = {Robust Traceability from Trace Amounts},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {650--669},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.46},
doi = {10.1109/FOCS.2015.46},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DworkSSUV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EdenLRS15,
author = {Talya Eden and
Amit Levi and
Dana Ron and
C. Seshadhri},
editor = {Venkatesan Guruswami},
title = {Approximately Counting Triangles in Sublinear Time},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {614--633},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.44},
doi = {10.1109/FOCS.2015.44},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EdenLRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EldanL15,
author = {Ronen Eldan and
James R. Lee},
editor = {Venkatesan Guruswami},
title = {Talagrand's Convolution Conjecture on Gaussian Space},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1395--1408},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.89},
doi = {10.1109/FOCS.2015.89},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EldanL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EneCKP15,
author = {Alina Ene and
Deeparnab Chakrabarty and
Ravishankar Krishnaswamy and
Debmalya Panigrahi},
editor = {Venkatesan Guruswami},
title = {Online Buy-at-Bulk Network Design},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {545--562},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.40},
doi = {10.1109/FOCS.2015.40},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EneCKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmanV15,
author = {Vitaly Feldman and
Jan Vondr{\'{a}}k},
editor = {Venkatesan Guruswami},
title = {Tight Bounds on Low-Degree Spectral Concentration of Submodular and
{XOS} Functions},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {923--942},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.61},
doi = {10.1109/FOCS.2015.61},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeldmanV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmanZ15,
author = {Moran Feldman and
Rico Zenklusen},
editor = {Venkatesan Guruswami},
title = {The Submodular Secretary Problem Goes Linear},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {486--505},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.37},
doi = {10.1109/FOCS.2015.37},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeldmanZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FischerLV15,
author = {Eldar Fischer and
Oded Lachish and
Yadu Vasudev},
editor = {Venkatesan Guruswami},
title = {Trading Query Complexity for Sample-Based Testing and Multi-testing
Scalability},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1163--1182},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.75},
doi = {10.1109/FOCS.2015.75},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FischerLV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Forbes15,
author = {Michael A. Forbes},
editor = {Venkatesan Guruswami},
title = {Deterministic Divisibility Testing via Shifted Partial Derivatives},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {451--465},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.35},
doi = {10.1109/FOCS.2015.35},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Forbes15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GajarskyHLOORS15,
author = {Jakub Gajarsk{\'{y}} and
Petr Hlinen{\'{y}} and
Daniel Lokshtanov and
Jan Obdrz{\'{a}}lek and
Sebastian Ordyniak and
M. S. Ramanujan and
Saket Saurabh},
editor = {Venkatesan Guruswami},
title = {{FO} Model Checking on Posets of Bounded Width},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {963--974},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.63},
doi = {10.1109/FOCS.2015.63},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GajarskyHLOORS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GaoW15,
author = {Pu Gao and
Nicholas C. Wormald},
editor = {Venkatesan Guruswami},
title = {Uniform Generation of Random Regular Graphs},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1218--1230},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.78},
doi = {10.1109/FOCS.2015.78},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GaoW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GargLO15,
author = {Sanjam Garg and
Steve Lu and
Rafail Ostrovsky},
editor = {Venkatesan Guruswami},
title = {Black-Box Garbled {RAM}},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {210--229},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.22},
doi = {10.1109/FOCS.2015.22},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GargLO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GentryLSW15,
author = {Craig Gentry and
Allison Bishop Lewko and
Amit Sahai and
Brent Waters},
editor = {Venkatesan Guruswami},
title = {Indistinguishability Obfuscation from the Multilinear Subgroup Elimination
Assumption},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {151--170},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.19},
doi = {10.1109/FOCS.2015.19},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GentryLSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Goos15,
author = {Mika G{\"{o}}{\"{o}}s},
editor = {Venkatesan Guruswami},
title = {Lower Bounds for Clique vs. Independent Set},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1066--1076},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.69},
doi = {10.1109/FOCS.2015.69},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Goos15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoosP015,
author = {Mika G{\"{o}}{\"{o}}s and
Toniann Pitassi and
Thomas Watson},
editor = {Venkatesan Guruswami},
title = {Deterministic Communication vs. Partition Number},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1077--1088},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.70},
doi = {10.1109/FOCS.2015.70},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoosP015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GopalanKM15,
author = {Parikshit Gopalan and
Daniel M. Kane and
Raghu Meka},
editor = {Venkatesan Guruswami},
title = {Pseudorandomness via the Discrete Fourier Transform},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {903--922},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.60},
doi = {10.1109/FOCS.2015.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GopalanKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Gottlieb15,
author = {Lee{-}Ad Gottlieb},
editor = {Venkatesan Guruswami},
title = {A Light Metric Spanner},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {759--772},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.52},
doi = {10.1109/FOCS.2015.52},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Gottlieb15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GroheS15,
author = {Martin Grohe and
Pascal Schweitzer},
editor = {Venkatesan Guruswami},
title = {Isomorphism Testing for Graphs of Bounded Rank Width},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1010--1029},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.66},
doi = {10.1109/FOCS.2015.66},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GroheS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GuoHS15,
author = {Alan Guo and
Elad Haramaty and
Madhu Sudan},
editor = {Venkatesan Guruswami},
title = {Robust Testing of Lifted Codes with Applications to Low-Degree Testing},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {825--844},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.56},
doi = {10.1109/FOCS.2015.56},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GuoHS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HarveyV15,
author = {Nicholas J. A. Harvey and
Jan Vondr{\'{a}}k},
editor = {Venkatesan Guruswami},
title = {An Algorithmic Proof of the Lovasz Local Lemma via Resampling Oracles},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1327--1346},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.85},
doi = {10.1109/FOCS.2015.85},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HarveyV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HolmRT15,
author = {Jacob Holm and
Eva Rotenberg and
Mikkel Thorup},
editor = {Venkatesan Guruswami},
title = {Planar Reachability in Linear Space and Constant Time},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {370--389},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.30},
doi = {10.1109/FOCS.2015.30},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HolmRT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImKKP15,
author = {Sungjin Im and
Nathaniel Kell and
Janardhan Kulkarni and
Debmalya Panigrahi},
editor = {Venkatesan Guruswami},
title = {Tight Bounds for Online Vector Scheduling},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {525--544},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.39},
doi = {10.1109/FOCS.2015.39},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImKKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImKM15,
author = {Sungjin Im and
Janardhan Kulkarni and
Kamesh Munagala},
editor = {Venkatesan Guruswami},
title = {Competitive Flow Time Algorithms for Polyhedral Scheduling},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {506--524},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.38},
doi = {10.1109/FOCS.2015.38},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/ImKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KantorLPP15,
author = {Erez Kantor and
Zvi Lotker and
Merav Parter and
David Peleg},
editor = {Venkatesan Guruswami},
title = {The Minimum Principle of {SINR:} {A} Useful Discretization Tool for
Wireless Communication},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {330--349},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.28},
doi = {10.1109/FOCS.2015.28},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KantorLPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KhotMS15,
author = {Subhash Khot and
Dor Minzer and
Muli Safra},
editor = {Venkatesan Guruswami},
title = {On Monotonicity Testing and Boolean Isoperimetric Type Theorems},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {52--58},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.13},
doi = {10.1109/FOCS.2015.13},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KhotMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KolmogorovKR15,
author = {Vladimir Kolmogorov and
Andrei A. Krokhin and
Michal Rol{\'{\i}}nek},
editor = {Venkatesan Guruswami},
title = {The Complexity of General-Valued CSPs},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1246--1258},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.80},
doi = {10.1109/FOCS.2015.80},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KolmogorovKR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KopelowitzP15,
author = {Tsvi Kopelowitz and
Ely Porat},
editor = {Venkatesan Guruswami},
title = {Breaking the Variance: Approximating the Hamming Distance in 1/{\(\epsilon\)}
Time Per Alignment},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {601--613},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.43},
doi = {10.1109/FOCS.2015.43},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KopelowitzP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeS15,
author = {Yin Tat Lee and
Aaron Sidford},
editor = {Venkatesan Guruswami},
title = {Efficient Inverse Maintenance and Faster Algorithms for Linear Programming},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {230--249},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.23},
doi = {10.1109/FOCS.2015.23},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LeeS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeS15a,
author = {Yin Tat Lee and
He Sun},
editor = {Venkatesan Guruswami},
title = {Constructing Linear-Sized Spectral Sparsification in Almost-Linear
Time},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {250--269},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.24},
doi = {10.1109/FOCS.2015.24},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LeeS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeeSW15,
author = {Yin Tat Lee and
Aaron Sidford and
Sam Chiu{-}wai Wong},
editor = {Venkatesan Guruswami},
title = {A Faster Cutting Plane Method and its Implications for Combinatorial
and Convex Optimization},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1049--1065},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.68},
doi = {10.1109/FOCS.2015.68},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LeeSW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LeverrierTZ15,
author = {Anthony Leverrier and
Jean{-}Pierre Tillich and
Gilles Z{\'{e}}mor},
editor = {Venkatesan Guruswami},
title = {Quantum Expander Codes},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {810--824},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.55},
doi = {10.1109/FOCS.2015.55},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LeverrierTZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Li15,
author = {Xin Li},
editor = {Venkatesan Guruswami},
title = {Three-Source Extractors for Polylogarithmic Min-Entropy},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {863--882},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.58},
doi = {10.1109/FOCS.2015.58},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Li15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/LuhV15,
author = {Kyle Luh and
Van Vu},
editor = {Venkatesan Guruswami},
title = {Random Matrices: l1 Concentration and Dictionary Learning with Few
Samples},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1409--1425},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.90},
doi = {10.1109/FOCS.2015.90},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/LuhV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MakarychevMZ15,
author = {Konstantin Makarychev and
Yury Makarychev and
Yuan Zhou},
editor = {Venkatesan Guruswami},
title = {Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {975--993},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.64},
doi = {10.1109/FOCS.2015.64},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MakarychevMZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MarcusSS15,
author = {Adam W. Marcus and
Daniel A. Spielman and
Nikhil Srivastava},
editor = {Venkatesan Guruswami},
title = {Interlacing Families {IV:} Bipartite Ramanujan Graphs of All Sizes},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1358--1377},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.87},
doi = {10.1109/FOCS.2015.87},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MarcusSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MoranSWY15,
author = {Shay Moran and
Amir Shpilka and
Avi Wigderson and
Amir Yehudayoff},
editor = {Venkatesan Guruswami},
title = {Compressing and Teaching for Low VC-Dimension},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {40--51},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.12},
doi = {10.1109/FOCS.2015.12},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/MoranSWY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/NayyeriR15,
author = {Amir Nayyeri and
Benjamin Raichel},
editor = {Venkatesan Guruswami},
title = {Reality Distortion: Exact and Approximate Algorithms for Embedding
into the Line},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {729--747},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.50},
doi = {10.1109/FOCS.2015.50},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/NayyeriR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PriceS15,
author = {Eric Price and
Zhao Song},
editor = {Venkatesan Guruswami},
title = {A Robust Sparse Fourier Transform in the Continuous Setting},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {583--600},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.42},
doi = {10.1109/FOCS.2015.42},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PriceS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Rossman15,
author = {Benjamin Rossman},
editor = {Venkatesan Guruswami},
title = {The Average Sensitivity of Bounded-Depth Formulas},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {424--430},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.33},
doi = {10.1109/FOCS.2015.33},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Rossman15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RossmanST15,
author = {Benjamin Rossman and
Rocco A. Servedio and
Li{-}Yang Tan},
editor = {Venkatesan Guruswami},
title = {An Average-Case Depth Hierarchy Theorem for Boolean Circuits},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1030--1048},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.67},
doi = {10.1109/FOCS.2015.67},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RossmanST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Saha15,
author = {Barna Saha},
editor = {Venkatesan Guruswami},
title = {Language Edit Distance and Maximum Likelihood Parsing of Stochastic
Grammars: Faster Algorithms and Connection to Fundamental Graph Problems},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {118--135},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.17},
doi = {10.1109/FOCS.2015.17},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Saha15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SchulmanSS15,
author = {Leonard J. Schulman and
Alistair Sinclair and
Piyush Srivastava},
editor = {Venkatesan Guruswami},
title = {Symbolic Integration and the Complexity of Computing Averages},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1231--1245},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.79},
doi = {10.1109/FOCS.2015.79},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SchulmanSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SeidlMK15,
author = {Helmut Seidl and
Sebastian Maneth and
Gregor Kemper},
editor = {Venkatesan Guruswami},
title = {Equivalence of Deterministic Top-Down Tree-to-String Transducers is
Decidable},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {943--962},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.62},
doi = {10.1109/FOCS.2015.62},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SeidlMK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SharirS15,
author = {Micha Sharir and
Noam Solomon},
editor = {Venkatesan Guruswami},
title = {Incidences between Points and Lines in {R4}},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1378--1394},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.88},
doi = {10.1109/FOCS.2015.88},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SharirS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ShepherdVW15,
author = {F. Bruce Shepherd and
Adrian Vetta and
Gordon T. Wilfong},
editor = {Venkatesan Guruswami},
title = {Polylogarithmic Approximations for the Capacitated Single-Sink Confluent
Flow Problem},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {748--758},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.51},
doi = {10.1109/FOCS.2015.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ShepherdVW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Sherstov15,
author = {Alexander A. Sherstov},
editor = {Venkatesan Guruswami},
title = {The Power of Asymmetry in Constant-Depth Circuits},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {431--450},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.34},
doi = {10.1109/FOCS.2015.34},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Sherstov15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SunL15,
author = {Ruoyu Sun and
Zhi{-}Quan Luo},
editor = {Venkatesan Guruswami},
title = {Guaranteed Matrix Completion via Nonconvex Factorization},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {270--289},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.25},
doi = {10.1109/FOCS.2015.25},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SunL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Svensson15,
author = {Ola Svensson},
editor = {Venkatesan Guruswami},
title = {Approximating {ATSP} by Relaxing Connectivity},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1--19},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.10},
doi = {10.1109/FOCS.2015.10},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Svensson15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Thorup15,
author = {Mikkel Thorup},
editor = {Venkatesan Guruswami},
title = {Sample (x) = (a*x{\textless}=t) is a Distinguisher with Probability
1/8},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1277--1291},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.82},
doi = {10.1109/FOCS.2015.82},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Thorup15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Zenklusen15,
author = {Rico Zenklusen},
editor = {Venkatesan Guruswami},
title = {An O(1)-Approximation for Minimum Spanning Tree Interdiction},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {709--728},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.49},
doi = {10.1109/FOCS.2015.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Zenklusen15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/focs/2015,
editor = {Venkatesan Guruswami},
title = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://ieeexplore.ieee.org/xpl/conhome/7352273/proceeding},
isbn = {978-1-4673-8191-8},
timestamp = {Wed, 16 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbboudW14,
author = {Amir Abboud and
Virginia Vassilevska Williams},
title = {Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {434--443},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.53},
doi = {10.1109/FOCS.2014.53},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AbboudW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AbdullahAKK14,
author = {Amirali Abdullah and
Alexandr Andoni and
Ravindran Kannan and
Robert Krauthgamer},
title = {Spectral Approaches to Nearest Neighbor Search},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {581--590},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.68},
doi = {10.1109/FOCS.2014.68},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/AbdullahAKK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AchlioptasI14,
author = {Dimitris Achlioptas and
Fotis Iliopoulos},
title = {Random Walks That Find Perfect Objects and the Lovasz Local Lemma},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {494--503},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.59},
doi = {10.1109/FOCS.2014.59},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AchlioptasI14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AharonovHLNSV14,
author = {Dorit Aharonov and
Aram W. Harrow and
Zeph Landau and
Daniel Nagaj and
Mario Szegedy and
Umesh V. Vazirani},
title = {Local Tests of Global Entanglement and a Counterexample to the Generalized
Area Law},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {246--255},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.34},
doi = {10.1109/FOCS.2014.34},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AharonovHLNSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AmbainisRU14,
author = {Andris Ambainis and
Ansis Rosmanis and
Dominique Unruh},
title = {Quantum Attacks on Classical Proof Systems: The Hardness of Quantum
Rewinding},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {474--483},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.57},
doi = {10.1109/FOCS.2014.57},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AmbainisRU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnSS14,
author = {Hyung{-}Chan An and
Mohit Singh and
Ola Svensson},
title = {LP-Based Algorithms for Capacitated Facility Location},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {256--265},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.35},
doi = {10.1109/FOCS.2014.35},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AnariGN14,
author = {Nima Anari and
Gagan Goel and
Afshin Nikzad},
title = {Mechanism Design for Crowdsourcing: An Optimal 1-1/e Competitive Budget-Feasible
Mechanism for Large Markets},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {266--275},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.36},
doi = {10.1109/FOCS.2014.36},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AnariGN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AustrinHG14,
author = {Per Austrin and
Johan H{\aa}stad and
Venkatesan Guruswami},
title = {{(2} + epsilon)-Sat Is NP-Hard},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {1--10},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.9},
doi = {10.1109/FOCS.2014.9},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AustrinHG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BabaioffILW14,
author = {Moshe Babaioff and
Nicole Immorlica and
Brendan Lucier and
S. Matthew Weinberg},
title = {A Simple and Approximately Optimal Mechanism for an Additive Buyer},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {21--30},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.11},
doi = {10.1109/FOCS.2014.11},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BabaioffILW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BarmpaliasEL14,
author = {George Barmpalias and
Richard Elwes and
Andy Lewis{-}Pye},
title = {Digital Morphogenesis via Schelling Segregation},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {156--165},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.25},
doi = {10.1109/FOCS.2014.25},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BarmpaliasEL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BassilyST14,
author = {Raef Bassily and
Adam D. Smith and
Abhradeep Thakurta},
title = {Private Empirical Risk Minimization: Efficient Algorithms and Tight
Error Bounds},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {464--473},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.56},
doi = {10.1109/FOCS.2014.56},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BassilyST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BenjaminiCS14,
author = {Itai Benjamini and
Gil Cohen and
Igor Shinkar},
title = {Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {81--89},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.17},
doi = {10.1109/FOCS.2014.17},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BenjaminiCS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhaskarLSS14,
author = {Umang Bhaskar and
Katrina Ligett and
Leonard J. Schulman and
Chaitanya Swamy},
title = {Achieving Target Equilibria in Network Routing Games without Knowing
the Latency Functions},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {31--40},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.12},
doi = {10.1109/FOCS.2014.12},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhaskarLSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BonacinaGT14,
author = {Ilario Bonacina and
Nicola Galesi and
Neil Thapen},
title = {Total Space in Resolution},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {641--650},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.74},
doi = {10.1109/FOCS.2014.74},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BonacinaGT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BosekLSZ14,
author = {Bartlomiej Bosek and
Dariusz Leniowski and
Piotr Sankowski and
Anna Zych},
title = {Online Bipartite Matching in Offline Time},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {384--393},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.48},
doi = {10.1109/FOCS.2014.48},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BosekLSZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BrassardNTTU14,
author = {Gilles Brassard and
Ashwin Nayak and
Alain Tapp and
Dave Touchette and
Falk Unger},
title = {Noisy Interactive Quantum Communication},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {296--305},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.39},
doi = {10.1109/FOCS.2014.39},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BrassardNTTU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BravermanE14,
author = {Mark Braverman and
Klim Efremenko},
title = {List and Unique Coding for Interactive Communication in the Presence
of Adversarial Noise},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {236--245},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.33},
doi = {10.1109/FOCS.2014.33},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BravermanE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Bringmann14,
author = {Karl Bringmann},
title = {Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic
Algorithms Unless {SETH} Fails},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {661--670},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.76},
doi = {10.1109/FOCS.2014.76},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Bringmann14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CaiGW14,
author = {Jin{-}Yi Cai and
Heng Guo and
Tyson Williams},
title = {The Complexity of Counting Edge Colorings and a Dichotomy for Some
Higher Domain Holant Problems},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {601--610},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.70},
doi = {10.1109/FOCS.2014.70},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CaiGW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChalermsookLN14,
author = {Parinya Chalermsook and
Bundit Laekhanukit and
Danupon Nanongkai},
title = {Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs
and Approximating {EDP} on DAGs},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {444--453},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.54},
doi = {10.1109/FOCS.2014.54},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChalermsookLN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChattopadhyayRR14,
author = {Arkadev Chattopadhyay and
Jaikumar Radhakrishnan and
Atri Rudra},
title = {Topology Matters in Communication},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {631--640},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.73},
doi = {10.1109/FOCS.2014.73},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChattopadhyayRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChattopadhyayZ14,
author = {Eshan Chattopadhyay and
David Zuckerman},
title = {Non-malleable Codes against Constant Split-State Tampering},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {306--315},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.40},
doi = {10.1109/FOCS.2014.40},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChattopadhyayZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenST14,
author = {Xi Chen and
Rocco A. Servedio and
Li{-}Yang Tan},
title = {New Algorithms and Lower Bounds for Monotonicity Testing},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {286--295},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.38},
doi = {10.1109/FOCS.2014.38},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChristianiP14,
author = {Tobias Christiani and
Rasmus Pagh},
title = {Generating k-Independent Variables in Constant Time},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {196--205},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.29},
doi = {10.1109/FOCS.2014.29},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChristianiP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CubittM14,
author = {Toby S. Cubitt and
Ashley Montanaro},
title = {Complexity Classification of Local Hamiltonian Problems},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {120--129},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.21},
doi = {10.1109/FOCS.2014.21},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CubittM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CurticapeanM14,
author = {Radu Curticapean and
D{\'{a}}niel Marx},
title = {Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover
Number Counts},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {130--139},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.22},
doi = {10.1109/FOCS.2014.22},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CurticapeanM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DaskalakisP14,
author = {Constantinos Daskalakis and
Qinxuan Pan},
title = {A Counter-example to Karlin's Strong Conjecture for Fictitious Play},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {11--20},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.10},
doi = {10.1109/FOCS.2014.10},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DaskalakisP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Dughmi14,
author = {Shaddin Dughmi},
title = {On the Hardness of Signaling},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {354--363},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.45},
doi = {10.1109/FOCS.2014.45},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Dughmi14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeigeKT14,
author = {Uriel Feige and
Tomer Koren and
Moshe Tennenholtz},
title = {Chasing Ghosts: Competing with Stateful Policies},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {100--109},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.19},
doi = {10.1109/FOCS.2014.19},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeigeKT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Gall14,
author = {Fran{\c{c}}ois Le Gall},
title = {Improved Quantum Algorithm for Triangle Finding via Combinatorial
Arguments},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {216--225},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.31},
doi = {10.1109/FOCS.2014.31},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Gall14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GanorKR14,
author = {Anat Ganor and
Gillat Kol and
Ran Raz},
title = {Exponential Separation of Information and Communication},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {176--185},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.27},
doi = {10.1109/FOCS.2014.27},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GanorKR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GentryH0W14,
author = {Craig Gentry and
Shai Halevi and
Mariana Raykova and
Daniel Wichs},
title = {Outsourcing Private {RAM} Computation},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {404--413},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.50},
doi = {10.1109/FOCS.2014.50},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GentryH0W14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GhaffariH14,
author = {Mohsen Ghaffari and
Bernhard Haeupler},
title = {Optimal Error Rates for Interactive Coding {II:} Efficiency and List
Decoding},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {394--403},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.49},
doi = {10.1109/FOCS.2014.49},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GhaffariH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GiakkoupisW14,
author = {George Giakkoupis and
Philipp Woelfel},
title = {Randomized Mutual Exclusion with Constant Amortized {RMR} Complexity
on the {DSM}},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {504--513},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.60},
doi = {10.1109/FOCS.2014.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GiakkoupisW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoldreichR14,
author = {Oded Goldreich and
Dana Ron},
title = {On Learning and Testing Dynamic Environments},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {336--343},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.43},
doi = {10.1109/FOCS.2014.43},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoldreichR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GoyalRRV14,
author = {Vipul Goyal and
Silas Richelson and
Alon Rosen and
Margarita Vald},
title = {An Algebraic Approach to Non-malleability},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {41--50},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.13},
doi = {10.1109/FOCS.2014.13},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GoyalRRV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GrochowP14,
author = {Joshua A. Grochow and
Toniann Pitassi},
title = {Circuit Complexity, Proof Complexity, and Polynomial Identity Testing},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {110--119},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.20},
doi = {10.1109/FOCS.2014.20},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GrochowP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GurvitsS14,
author = {Leonid Gurvits and
Alex Samorodnitsky},
title = {Bounds on the Permanent and Some Applications},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {90--99},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.18},
doi = {10.1109/FOCS.2014.18},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GurvitsS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Haeupler14,
author = {Bernhard Haeupler},
title = {Interactive Channel Capacity Revisited},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {226--235},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.32},
doi = {10.1109/FOCS.2014.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Haeupler14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Hardt14,
author = {Moritz Hardt},
title = {Understanding Alternating Minimization for Matrix Completion},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {651--660},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.75},
doi = {10.1109/FOCS.2014.75},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Hardt14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HardtU14,
author = {Moritz Hardt and
Jonathan R. Ullman},
title = {Preventing False Discovery in Interactive Data Analysis Is Hard},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {454--463},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.55},
doi = {10.1109/FOCS.2014.55},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HardtU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HenzingerKN14,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear
Total Update Time},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {146--155},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.24},
doi = {10.1109/FOCS.2014.24},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HenzingerKN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HuangY14,
author = {Zengfeng Huang and
Ke Yi},
title = {The Communication Complexity of Distributed epsilon-Approximations},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {591--600},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.69},
doi = {10.1109/FOCS.2014.69},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HuangY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ImKMP14,
author = {Sungjin Im and
Janardhan Kulkarni and
Kamesh Munagala and
Kirk Pruhs},
title = {SelfishMigrate: {A} Scalable Algorithm for Non-clairvoyantly Scheduling
Heterogeneous Processors},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {531--540},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.63},
doi = {10.1109/FOCS.2014.63},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ImKMP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/IndykK14,
author = {Piotr Indyk and
Michael Kapralov},
title = {Sample-Optimal Fourier Sampling in Any Constant Dimension},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {514--523},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.61},
doi = {10.1109/FOCS.2014.61},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/IndykK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JorgensenP14,
author = {Allan Gr{\o}nlund J{\o}rgensen and
Seth Pettie},
title = {Threesomes, Degenerates, and Love Triangles},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {621--630},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.72},
doi = {10.1109/FOCS.2014.72},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JorgensenP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KapralovLMMS14,
author = {Michael Kapralov and
Yin Tat Lee and
Cameron Musco and
Christopher Musco and
Aaron Sidford},
title = {Single Pass Spectral Sparsification in Dynamic Streams},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {561--570},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.66},
doi = {10.1109/FOCS.2014.66},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KapralovLMMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KaufmanKL14,
author = {Tali Kaufman and
David Kazhdan and
Alexander Lubotzky},
title = {Ramanujan Complexes and Bounded Degree Topological Expanders},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {484--493},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.58},
doi = {10.1109/FOCS.2014.58},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KaufmanKL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KayalLSS14,
author = {Neeraj Kayal and
Nutan Limaye and
Chandan Saha and
Srikanth Srinivasan},
title = {An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {61--70},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.15},
doi = {10.1109/FOCS.2014.15},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KayalLSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KhotS14,
author = {Subhash Khot and
Rishi Saket},
title = {Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log\{Omega(1)\}
n) Colors},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {206--215},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.30},
doi = {10.1109/FOCS.2014.30},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KhotS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KomargodskiMNPRY14,
author = {Ilan Komargodski and
Tal Moran and
Moni Naor and
Rafael Pass and
Alon Rosen and
Eylon Yogev},
title = {One-Way Functions and (Im)Perfect Obfuscation},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {374--383},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.47},
doi = {10.1109/FOCS.2014.47},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/KomargodskiMNPRY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KumarS14,
author = {Mrinal Kumar and
Shubhangi Saraf},
title = {On the Power of Homogeneous Depth 4 Arithmetic Circuits},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {364--373},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.46},
doi = {10.1109/FOCS.2014.46},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KumarS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Lachish14,
author = {Oded Lachish},
title = {O(log log Rank) Competitive Ratio for the Matroid Secretary Problem},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {326--335},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.42},
doi = {10.1109/FOCS.2014.42},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Lachish14.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-06-16 19:04 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:
