Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/focs/focs2019.bht:"
download as .bib file
@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 = {Wed, 19 Jul 2023 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 Jan 2020 00:00:00 +0100},
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 = {Sat, 30 Sep 2023 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 = {Sat, 30 Sep 2023 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 Jan 2020 00:00:00 +0100},
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 = {Tue, 07 Jan 2020 00:00:00 +0100},
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 = {Mon, 05 Feb 2024 00:00:00 +0100},
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}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-04-25 09:13 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:
