default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/innovations/innovations2021.bht:"
download as .bib file
@inproceedings{DBLP:conf/innovations/000121,
author = {Spyros Angelopoulos},
editor = {James R. Lee},
title = {Online Search with a Hint},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {51:1--51:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.51},
doi = {10.4230/LIPICS.ITCS.2021.51},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/000121.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0001DLSS21,
author = {Xi Chen and
Anindya De and
Chin Ho Lee and
Rocco A. Servedio and
Sandip Sinha},
editor = {James R. Lee},
title = {Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {20:1--20:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.20},
doi = {10.4230/LIPICS.ITCS.2021.20},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/0001DLSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0001V21,
author = {Mrinal Kumar and
Ben Lee Volk},
editor = {James R. Lee},
title = {A Polynomial Degree Bound on Equations for Non-Rigid Matrices and
Small Linear Circuits},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {9:1--9:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.9},
doi = {10.4230/LIPICS.ITCS.2021.9},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/0001V21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/0001V21a,
author = {Yang Cai and
Grigoris Velegkas},
editor = {James R. Lee},
title = {How to Sell Information Optimally: An Algorithmic Study},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {81:1--81:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.81},
doi = {10.4230/LIPICS.ITCS.2021.81},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/0001V21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/00020V21,
author = {Peter Dixon and
A. Pavan and
N. V. Vinodchandran},
editor = {James R. Lee},
title = {Complete Problems for Multi-Pseudodeterministic Computations},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {66:1--66:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.66},
doi = {10.4230/LIPICS.ITCS.2021.66},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/00020V21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AharonovG21,
author = {Dorit Aharonov and
Alex B. Grilo},
editor = {James R. Lee},
title = {Two Combinatorial MA-Complete Problems},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {36:1--36:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.36},
doi = {10.4230/LIPICS.ITCS.2021.36},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AharonovG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AhmadianLPZ21,
author = {Sara Ahmadian and
Allen Liu and
Binghui Peng and
Morteza Zadimoghaddam},
editor = {James R. Lee},
title = {Distributed Load Balancing: {A} New Framework and Improved Guarantees},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {79:1--79:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.79},
doi = {10.4230/LIPICS.ITCS.2021.79},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AhmadianLPZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AnariHSS21,
author = {Nima Anari and
Nathan Hu and
Amin Saberi and
Aaron Schild},
editor = {James R. Lee},
title = {Sampling Arborescences in Parallel},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {83:1--83:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.83},
doi = {10.4230/LIPICS.ITCS.2021.83},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/AnariHSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ArunachalamP21,
author = {Srinivasan Arunachalam and
Supartha Podder},
editor = {James R. Lee},
title = {Communication Memento: Memoryless Communication Complexity},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {61:1--61:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.61},
doi = {10.4230/LIPICS.ITCS.2021.61},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/ArunachalamP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Arunachaleswaran21,
author = {Eshwar Ram Arunachaleswaran and
Sampath Kannan and
Aaron Roth and
Juba Ziani},
editor = {James R. Lee},
title = {Pipeline Interventions},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {8:1--8:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.8},
doi = {10.4230/LIPICS.ITCS.2021.8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Arunachaleswaran21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AshlagiBSTZ21,
author = {Itai Ashlagi and
Mark Braverman and
Amin Saberi and
Clayton Thomas and
Geng Zhao},
editor = {James R. Lee},
title = {Tiered Random Matching Markets: Rank Is Proportional to Popularity},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {46:1--46:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.46},
doi = {10.4230/LIPICS.ITCS.2021.46},
timestamp = {Tue, 17 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AshlagiBSTZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Babaioff0HIL21,
author = {Moshe Babaioff and
Richard Cole and
Jason D. Hartline and
Nicole Immorlica and
Brendan Lucier},
editor = {James R. Lee},
title = {Non-Quasi-Linear Agents in Quasi-Linear Mechanisms (Extended Abstract)},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {84:1--84:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.84},
doi = {10.4230/LIPICS.ITCS.2021.84},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Babaioff0HIL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BarakCG21,
author = {Boaz Barak and
Chi{-}Ning Chou and
Xun Gao},
editor = {James R. Lee},
title = {Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {30:1--30:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.30},
doi = {10.4230/LIPICS.ITCS.2021.30},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BarakCG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BechtelD21,
author = {Curtis Bechtel and
Shaddin Dughmi},
editor = {James R. Lee},
title = {Delegated Stochastic Probing},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {37:1--37:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.37},
doi = {10.4230/LIPICS.ITCS.2021.37},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BechtelD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Ben-EliezerFLY21,
author = {Omri Ben{-}Eliezer and
Eldar Fischer and
Amit Levi and
Yuichi Yoshida},
editor = {James R. Lee},
title = {Ordered Graph Limits and Their Applications},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {42:1--42:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.42},
doi = {10.4230/LIPICS.ITCS.2021.42},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Ben-EliezerFLY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeyersdorffB21,
author = {Olaf Beyersdorff and
Benjamin B{\"{o}}hm},
editor = {James R. Lee},
title = {Understanding the Relative Strength of {QBF} {CDCL} Solvers and {QBF}
Resolution},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {12:1--12:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.12},
doi = {10.4230/LIPICS.ITCS.2021.12},
timestamp = {Wed, 22 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BeyersdorffB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeyhaghiT21,
author = {Hedyeh Beyhaghi and
{\'{E}}va Tardos},
editor = {James R. Lee},
title = {Randomness and Fairness in Two-Sided Matching with Limited Interviews},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {74:1--74:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.74},
doi = {10.4230/LIPICS.ITCS.2021.74},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BeyhaghiT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BhatiaBDS21,
author = {Kush Bhatia and
Peter L. Bartlett and
Anca D. Dragan and
Jacob Steinhardt},
editor = {James R. Lee},
title = {Agnostic Learning with Unknown Utilities},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {55:1--55:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.55},
doi = {10.4230/LIPICS.ITCS.2021.55},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BhatiaBDS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BhattacharyaBMU21,
author = {Anup Bhattacharya and
Arijit Bishnu and
Gopinath Mishra and
Anannya Upasana},
editor = {James R. Lee},
title = {Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming!},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {15:1--15:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.15},
doi = {10.4230/LIPICS.ITCS.2021.15},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BhattacharyaBMU21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BlockiC21,
author = {Jeremiah Blocki and
Mike Cinkoske},
editor = {James R. Lee},
title = {A New Connection Between Node and Edge Depth Robust Graphs},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {64:1--64:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.64},
doi = {10.4230/LIPICS.ITCS.2021.64},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BlockiC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BorstDOS21,
author = {Sander Borst and
Daniel Dadush and
Neil Olver and
Makrand Sinha},
editor = {James R. Lee},
title = {Majorizing Measures for the Optimizer},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {73:1--73:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.73},
doi = {10.4230/LIPICS.ITCS.2021.73},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BorstDOS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BrandP0W21,
author = {Jan van den Brand and
Binghui Peng and
Zhao Song and
Omri Weinstein},
editor = {James R. Lee},
title = {Training (Overparametrized) Neural Networks in Near-Linear Time},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {63:1--63:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.63},
doi = {10.4230/LIPICS.ITCS.2021.63},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BrandP0W21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BravermanKM21,
author = {Mark Braverman and
Subhash Khot and
Dor Minzer},
editor = {James R. Lee},
title = {On Rich 2-to-1 Games},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {27:1--27:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.27},
doi = {10.4230/LIPICS.ITCS.2021.27},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BravermanKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BrietL21,
author = {Jop Bri{\"{e}}t and
Farrokh Labib},
editor = {James R. Lee},
title = {High-Entropy Dual Functions and Locally Decodable Codes (Extended
Abstract)},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {76:1--76:2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.76},
doi = {10.4230/LIPICS.ITCS.2021.76},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BrietL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BubeckBCS21,
author = {S{\'{e}}bastien Bubeck and
Niv Buchbinder and
Christian Coester and
Mark Sellke},
editor = {James R. Lee},
title = {Metrical Service Systems with Transformations},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {21:1--21:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.21},
doi = {10.4230/LIPICS.ITCS.2021.21},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BubeckBCS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BurrellS21,
author = {Noah Burrell and
Grant Schoenebeck},
editor = {James R. Lee},
title = {Relaxing Common Belief for Social Networks},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {45:1--45:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.45},
doi = {10.4230/LIPICS.ITCS.2021.45},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BurrellS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CharikarGGS21,
author = {Moses Charikar and
Shivam Garg and
Deborah M. Gordon and
Kirankumar Shiragur},
editor = {James R. Lee},
title = {A Model for Ant Trail Formation and its Convergence Properties (Extended
Abstract)},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {85:1--85:2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.85},
doi = {10.4230/LIPICS.ITCS.2021.85},
timestamp = {Fri, 24 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/CharikarGGS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ChenG0M21,
author = {Lijie Chen and
Badih Ghazi and
Ravi Kumar and
Pasin Manurangsi},
editor = {James R. Lee},
title = {On Distributed Differential Privacy and Counting Distinct Elements},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {56:1--56:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.56},
doi = {10.4230/LIPICS.ITCS.2021.56},
timestamp = {Fri, 05 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/ChenG0M21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CohenST21,
author = {Michael B. Cohen and
Aaron Sidford and
Kevin Tian},
editor = {James R. Lee},
title = {Relative Lipschitzness in Extragradient Methods and a Direct Recipe
for Acceleration},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {62:1--62:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.62},
doi = {10.4230/LIPICS.ITCS.2021.62},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/CohenST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CorreaDFSZ21,
author = {Jos{\'{e}} Correa and
Paul D{\"{u}}tting and
Felix A. Fischer and
Kevin Schewior and
Bruno Ziliotto},
editor = {James R. Lee},
title = {Unknown {I.I.D.} Prophets: Better Bounds, Streaming Algorithms, and
a New Impossibility (Extended Abstract)},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {86:1--86:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.86},
doi = {10.4230/LIPICS.ITCS.2021.86},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/CorreaDFSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CouteauFM21,
author = {Geoffroy Couteau and
Pooya Farshim and
Mohammad Mahmoody},
editor = {James R. Lee},
title = {Black-Box Uselessness: Composing Separations in Cryptography},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {47:1--47:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.47},
doi = {10.4230/LIPICS.ITCS.2021.47},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/CouteauFM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DafniFLLV21,
author = {Neta Dafni and
Yuval Filmus and
Noam Lifshitz and
Nathan Lindzey and
Marc Vinyals},
editor = {James R. Lee},
title = {Complexity Measures on the Symmetric Group and Beyond (Extended Abstract)},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {87:1--87:5},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.87},
doi = {10.4230/LIPICS.ITCS.2021.87},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/DafniFLLV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DaganFKM21,
author = {Yuval Dagan and
Yuval Filmus and
Daniel Kane and
Shay Moran},
editor = {James R. Lee},
title = {The Entropy of Lies: Playing Twenty Questions with a Liar},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {1:1--1:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.1},
doi = {10.4230/LIPICS.ITCS.2021.1},
timestamp = {Tue, 09 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/DaganFKM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DeNS21,
author = {Anindya De and
Shivam Nadimpalli and
Rocco A. Servedio},
editor = {James R. Lee},
title = {Quantitative Correlation Inequalities via Semigroup Interpolation},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {69:1--69:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.69},
doi = {10.4230/LIPICS.ITCS.2021.69},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/DeNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DingW21,
author = {Kimberly Ding and
S. Matthew Weinberg},
editor = {James R. Lee},
title = {Approximately Strategyproof Tournament Rules in the Probabilistic
Setting},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {14:1--14:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.14},
doi = {10.4230/LIPICS.ITCS.2021.14},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/DingW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DinurFHT21,
author = {Irit Dinur and
Yuval Filmus and
Prahladh Harsha and
Madhur Tulsiani},
editor = {James R. Lee},
title = {Explicit SoS Lower Bounds from High-Dimensional Expanders},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {38:1--38:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.38},
doi = {10.4230/LIPICS.ITCS.2021.38},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/DinurFHT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Dutta0T21,
author = {Pranjal Dutta and
Nitin Saxena and
Thomas Thierauf},
editor = {James R. Lee},
title = {A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {23:1--23:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.23},
doi = {10.4230/LIPICS.ITCS.2021.23},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Dutta0T21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/DziembowskiFF021,
author = {Stefan Dziembowski and
Grzegorz Fabianski and
Sebastian Faust and
Siavash Riahi},
editor = {James R. Lee},
title = {Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {72:1--72:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.72},
doi = {10.4230/LIPICS.ITCS.2021.72},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/DziembowskiFF021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/EfremenkoKPS21,
author = {Klim Efremenko and
Gillat Kol and
Dmitry Paramonov and
Raghuvansh R. Saxena},
editor = {James R. Lee},
title = {Computation over the Noisy Broadcast Channel with Malicious Parties},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {82:1--82:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.82},
doi = {10.4230/LIPICS.ITCS.2021.82},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/EfremenkoKPS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Eldar21,
author = {Lior Eldar},
editor = {James R. Lee},
title = {Robust Quantum Entanglement at (Nearly) Room Temperature},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {49:1--49:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.49},
doi = {10.4230/LIPICS.ITCS.2021.49},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Eldar21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/EmekKS21,
author = {Yuval Emek and
Shay Kutten and
Yangguang Shi},
editor = {James R. Lee},
title = {Online Paging with a Vanishing Regret},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {67:1--67:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.67},
doi = {10.4230/LIPICS.ITCS.2021.67},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/EmekKS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Feng0SY21,
author = {Weiming Feng and
Kun He and
Xiaoming Sun and
Yitong Yin},
editor = {James R. Lee},
title = {Dynamic Inference in Probabilistic Graphical Models},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {25:1--25:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.25},
doi = {10.4230/LIPICS.ITCS.2021.25},
timestamp = {Wed, 26 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Feng0SY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/FengN21,
author = {Yiding Feng and
Rad Niazadeh},
editor = {James R. Lee},
title = {Batching and Optimal Multi-Stage Bipartite Allocations (Extended Abstract)},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {88:1--88:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.88},
doi = {10.4230/LIPICS.ITCS.2021.88},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/FengN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/FilmusMT21,
author = {Yuval Filmus and
Or Meir and
Avishay Tal},
editor = {James R. Lee},
title = {Shrinkage Under Random Projections, and Cubic Formula Lower Bounds
for {AC0} (Extended Abstract)},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {89:1--89:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.89},
doi = {10.4230/LIPICS.ITCS.2021.89},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/FilmusMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/FraigniaudGNP21,
author = {Pierre Fraigniaud and
Fran{\c{c}}ois Le Gall and
Harumichi Nishimura and
Ami Paz},
editor = {James R. Lee},
title = {Distributed Quantum Proofs for Replicated Data},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {28:1--28:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.28},
doi = {10.4230/LIPICS.ITCS.2021.28},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/FraigniaudGNP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GargKNS21,
author = {Ankit Garg and
Robin Kothari and
Praneeth Netrapalli and
Suhail Sherif},
editor = {James R. Lee},
title = {No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {53:1--53:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.53},
doi = {10.4230/LIPICS.ITCS.2021.53},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GargKNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GirishRT21,
author = {Uma Girish and
Ran Raz and
Avishay Tal},
editor = {James R. Lee},
title = {Quantum Versus Randomized Communication Complexity, with Efficient
Players},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {54:1--54:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.54},
doi = {10.4230/LIPICS.ITCS.2021.54},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GirishRT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GoelKM021,
author = {Surbhi Goel and
Adam R. Klivans and
Pasin Manurangsi and
Daniel Reichman},
editor = {James R. Lee},
title = {Tight Hardness Results for Training Depth-2 ReLU Networks},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {22:1--22:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.22},
doi = {10.4230/LIPICS.ITCS.2021.22},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GoelKM021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GoldwasserRSY21,
author = {Shafi Goldwasser and
Guy N. Rothblum and
Jonathan Shafer and
Amir Yehudayoff},
editor = {James R. Lee},
title = {Interactive Proofs for Verifying Machine Learning},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {41:1--41:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.41},
doi = {10.4230/LIPICS.ITCS.2021.41},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GoldwasserRSY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GolovnevKW21,
author = {Alexander Golovnev and
Alexander S. Kulikov and
R. Ryan Williams},
editor = {James R. Lee},
title = {Circuit Depth Reductions},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {24:1--24:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.24},
doi = {10.4230/LIPICS.ITCS.2021.24},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GolovnevKW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GrochowQ21,
author = {Joshua A. Grochow and
Youming Qiao},
editor = {James R. Lee},
title = {On the Complexity of Isomorphism Problems for Tensors, Groups, and
Polynomials {I:} Tensor Isomorphism-Completeness},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {31:1--31:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.31},
doi = {10.4230/LIPICS.ITCS.2021.31},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GrochowQ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GrossmanH21,
author = {Ofer Grossman and
Justin Holmgren},
editor = {James R. Lee},
title = {Error Correcting Codes for Uncompressed Messages},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {43:1--43:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.43},
doi = {10.4230/LIPICS.ITCS.2021.43},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GrossmanH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiK21,
author = {Venkatesan Guruswami and
Vinayak Kumar},
editor = {James R. Lee},
title = {Pseudobinomiality of the Sticky Random Walk},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {48:1--48:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.48},
doi = {10.4230/LIPICS.ITCS.2021.48},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GuruswamiK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GuruswamiMRSW21,
author = {Venkatesan Guruswami and
Jonathan Mosheiff and
Nicolas Resch and
Shashwat Silas and
Mary Wootters},
editor = {James R. Lee},
title = {Sharp Threshold Rates for Random Codes},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {5:1--5:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.5},
doi = {10.4230/LIPICS.ITCS.2021.5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GuruswamiMRSW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Haviv21,
author = {Ishay Haviv},
editor = {James R. Lee},
title = {The Complexity of Finding Fair Independent Sets in Cycles},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {4:1--4:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.4},
doi = {10.4230/LIPICS.ITCS.2021.4},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Haviv21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HoeferMP21,
author = {Martin Hoefer and
Pasin Manurangsi and
Alexandros Psomas},
editor = {James R. Lee},
title = {Algorithmic Persuasion with Evidence},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {3:1--3:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.3},
doi = {10.4230/LIPICS.ITCS.2021.3},
timestamp = {Wed, 22 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/HoeferMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HolmgrenW21,
author = {Justin Holmgren and
Alexander S. Wein},
editor = {James R. Lee},
title = {Counterexamples to the Low-Degree Conjecture},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {75:1--75:9},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.75},
doi = {10.4230/LIPICS.ITCS.2021.75},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/HolmgrenW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/HozaPV21,
author = {William M. Hoza and
Edward Pyne and
Salil P. Vadhan},
editor = {James R. Lee},
title = {Pseudorandom Generators for Unbounded-Width Permutation Branching
Programs},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {7:1--7:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.7},
doi = {10.4230/LIPICS.ITCS.2021.7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/HozaPV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ImmorlicaKL21,
author = {Nicole Immorlica and
Ian A. Kash and
Brendan Lucier},
editor = {James R. Lee},
title = {Buying Data over Time: Approximately Optimal Strategies for Dynamic
Data-Driven Decisions},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {77:1--77:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.77},
doi = {10.4230/LIPICS.ITCS.2021.77},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/ImmorlicaKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ImpagliazzoM21,
author = {Russell Impagliazzo and
Sam McGuire},
editor = {James R. Lee},
title = {Comparing Computational Entropies Below Majority (Or: When Is the
Dense Model Theorem False?)},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {2:1--2:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.2},
doi = {10.4230/LIPICS.ITCS.2021.2},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ImpagliazzoM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/KelmanKKMS21,
author = {Esty Kelman and
Subhash Khot and
Guy Kindler and
Dor Minzer and
Muli Safra},
editor = {James R. Lee},
title = {Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and
Log-Sobolev Inequality},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {26:1--26:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.26},
doi = {10.4230/LIPICS.ITCS.2021.26},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/KelmanKKMS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/KleinbergKMP21,
author = {Robert Kleinberg and
Oliver Korten and
Daniel Mitropolsky and
Christos H. Papadimitriou},
editor = {James R. Lee},
title = {Total Functions in the Polynomial Hierarchy},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {44:1--44:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.44},
doi = {10.4230/LIPICS.ITCS.2021.44},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/KleinbergKMP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/KomargodskiS21,
author = {Ilan Komargodski and
Elaine Shi},
editor = {James R. Lee},
title = {Differentially Oblivious Turing Machines},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {68:1--68:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.68},
doi = {10.4230/LIPICS.ITCS.2021.68},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/KomargodskiS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Kretschmer21,
author = {William Kretschmer},
editor = {James R. Lee},
title = {The Quantum Supremacy Tsirelson Inequality},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {13:1--13:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.13},
doi = {10.4230/LIPICS.ITCS.2021.13},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Kretschmer21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/KuszmaulW21,
author = {William Kuszmaul and
Alek Westover},
editor = {James R. Lee},
title = {The Variable-Processor Cup Game},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {16:1--16:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.16},
doi = {10.4230/LIPICS.ITCS.2021.16},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/KuszmaulW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LauR21,
author = {Joshua Lau and
Angus Ritossa},
editor = {James R. Lee},
title = {Algorithms and Hardness for Multidimensional Range Updates and Queries},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {35:1--35:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.35},
doi = {10.4230/LIPICS.ITCS.2021.35},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/LauR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LeverrierLZ21,
author = {Anthony Leverrier and
Vivien Londe and
Gilles Z{\'{e}}mor},
editor = {James R. Lee},
title = {Towards Local Testability for Quantum Coding},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {65:1--65:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.65},
doi = {10.4230/LIPICS.ITCS.2021.65},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/LeverrierLZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/LeviPRV21,
author = {Amit Levi and
Ramesh Krishnan S. Pallavoor and
Sofya Raskhodnikova and
Nithin Varma},
editor = {James R. Lee},
title = {Erasure-Resilient Sublinear-Time Graph Algorithms},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {80:1--80:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.80},
doi = {10.4230/LIPICS.ITCS.2021.80},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/LeviPRV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Lin21,
author = {Jiabao Lin},
editor = {James R. Lee},
title = {On the Complexity of {\#}CSPd},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {40:1--40:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.40},
doi = {10.4230/LIPICS.ITCS.2021.40},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Lin21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/ManurangsiRS21,
author = {Pasin Manurangsi and
Aviad Rubinstein and
Tselil Schramm},
editor = {James R. Lee},
title = {The Strongish Planted Clique Hypothesis and Its Consequences},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {10:1--10:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.10},
doi = {10.4230/LIPICS.ITCS.2021.10},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/ManurangsiRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Mardia21,
author = {Jay Mardia},
editor = {James R. Lee},
title = {Is the Space Complexity of Planted Clique Recovery the Same as That
of Detection?},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {34:1--34:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.34},
doi = {10.4230/LIPICS.ITCS.2021.34},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Mardia21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Meir21,
author = {Uri Meir},
editor = {James R. Lee},
title = {Comparison Graphs: {A} Unified Method for Uniformity Testing},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {17:1--17:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.17},
doi = {10.4230/LIPICS.ITCS.2021.17},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Meir21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/MetgerV21,
author = {Tony Metger and
Thomas Vidick},
editor = {James R. Lee},
title = {Self-Testing of a Single Quantum Device Under Computational Assumptions},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {19:1--19:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.19},
doi = {10.4230/LIPICS.ITCS.2021.19},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/MetgerV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/MittalR21,
author = {Kunal Mittal and
Ran Raz},
editor = {James R. Lee},
title = {Block Rigidity: Strong Multiplayer Parallel Repetition Implies Super-Linear
Lower Bounds for Turing Machines},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {71:1--71:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.71},
doi = {10.4230/LIPICS.ITCS.2021.71},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/MittalR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/MudigondaW21,
author = {Abhijit Mudigonda and
R. Ryan Williams},
editor = {James R. Lee},
title = {Time-Space Lower Bounds for Simulating Proof Systems with Quantum
and Randomized Verifiers},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {50:1--50:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.50},
doi = {10.4230/LIPICS.ITCS.2021.50},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/MudigondaW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/MuscoMW21,
author = {Cameron Musco and
Christopher Musco and
David P. Woodruff},
editor = {James R. Lee},
title = {Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {6:1--6:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.6},
doi = {10.4230/LIPICS.ITCS.2021.6},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/MuscoMW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Nanashima21,
author = {Mikito Nanashima},
editor = {James R. Lee},
title = {On Basing Auxiliary-Input Cryptography on NP-Hardness via Nonadaptive
Black-Box Reductions},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {29:1--29:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.29},
doi = {10.4230/LIPICS.ITCS.2021.29},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Nanashima21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/NarayananR21,
author = {Shyam Narayanan and
Michael Ren},
editor = {James R. Lee},
title = {Circular Trace Reconstruction},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {18:1--18:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.18},
doi = {10.4230/LIPICS.ITCS.2021.18},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/NarayananR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/NenadovSS21,
author = {Rajko Nenadov and
Angelika Steger and
Pascal Su},
editor = {James R. Lee},
title = {An {O(N)} Time Algorithm for Finding Hamilton Cycles with High Probability},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {60:1--60:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.60},
doi = {10.4230/LIPICS.ITCS.2021.60},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/NenadovSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/PappW21,
author = {P{\'{a}}l Andr{\'{a}}s Papp and
Roger Wattenhofer},
editor = {James R. Lee},
title = {Sequential Defaulting in Financial Networks},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {52:1--52:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.52},
doi = {10.4230/LIPICS.ITCS.2021.52},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/PappW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Remscrim21,
author = {Zachary Remscrim},
editor = {James R. Lee},
title = {Lower Bounds on the Running Time of Two-Way Quantum Finite Automata
and Sublogarithmic-Space Quantum Turing Machines},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {39:1--39:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.39},
doi = {10.4230/LIPICS.ITCS.2021.39},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Remscrim21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Ron-ZewiSV21,
author = {Noga Ron{-}Zewi and
Ronen Shaltiel and
Nithin Varma},
editor = {James R. Lee},
title = {Query Complexity Lower Bounds for Local List-Decoding and Hard-Core
Predicates (Even for Small Rate and Huge Lists)},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {33:1--33:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.33},
doi = {10.4230/LIPICS.ITCS.2021.33},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Ron-ZewiSV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Rosenthal21,
author = {Gregory Rosenthal},
editor = {James R. Lee},
title = {Bounds on the {QAC0} Complexity of Approximating Parity},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {32:1--32:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.32},
doi = {10.4230/LIPICS.ITCS.2021.32},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Rosenthal21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Rossman21,
author = {Benjamin Rossman},
editor = {James R. Lee},
title = {Shrinkage of Decision Lists and {DNF} Formulas},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {70:1--70:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.70},
doi = {10.4230/LIPICS.ITCS.2021.70},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Rossman21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/SchoenebeckY21,
author = {Grant Schoenebeck and
Fang{-}Yi Yu},
editor = {James R. Lee},
title = {Learning and Strongly Truthful Multi-Task Peer Prediction: {A} Variational
Approach},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {78:1--78:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.78},
doi = {10.4230/LIPICS.ITCS.2021.78},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/SchoenebeckY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/SolomonS21,
author = {Noam Solomon and
Shay Solomon},
editor = {James R. Lee},
title = {A Generalized Matching Reconfiguration Problem},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {57:1--57:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.57},
doi = {10.4230/LIPICS.ITCS.2021.57},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/SolomonS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/VaziraniY21,
author = {Vijay V. Vazirani and
Mihalis Yannakakis},
editor = {James R. Lee},
title = {Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided
Matching Markets},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {59:1--59:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.59},
doi = {10.4230/LIPICS.ITCS.2021.59},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/VaziraniY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/X21,
editor = {James R. Lee},
title = {Front Matter, Table of Contents, Preface, Conference Organization},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {0:1--0:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.0},
doi = {10.4230/LIPICS.ITCS.2021.0},
timestamp = {Thu, 04 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/X21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/YoshidaZ21,
author = {Yuichi Yoshida and
Samson Zhou},
editor = {James R. Lee},
title = {Sensitivity Analysis of the Maximum Matching Problem},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {58:1--58:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.58},
doi = {10.4230/LIPICS.ITCS.2021.58},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/YoshidaZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Yu21,
author = {Nengkun Yu},
editor = {James R. Lee},
title = {Sample Efficient Identity Testing and Independence Testing of Quantum
States},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {11:1--11:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.11},
doi = {10.4230/LIPICS.ITCS.2021.11},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/Yu21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/innovations/2021,
editor = {James R. Lee},
title = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-177-1},
isbn = {978-3-95977-177-1},
timestamp = {Wed, 21 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/2021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-09-26 08:09 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:
