@Proceedings{lee:LIPIcs.ITCS.2021,
title = {{LIPIcs, Volume 185, ITCS 2021, Complete Volume}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {1--1550},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021},
URN = {urn:nbn:de:0030-drops-135381},
doi = {10.4230/LIPIcs.ITCS.2021},
annote = {Keywords: LIPIcs, Volume 185, ITCS 2021, Complete Volume}
}
@InProceedings{lee:LIPIcs.ITCS.2021.0,
author = {Lee, James R.},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.0},
URN = {urn:nbn:de:0030-drops-135397},
doi = {10.4230/LIPIcs.ITCS.2021.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{dagan_et_al:LIPIcs.ITCS.2021.1,
author = {Dagan, Yuval and Filmus, Yuval and Kane, Daniel and Moran, Shay},
title = {{The Entropy of Lies: Playing Twenty Questions with a Liar}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {1:1--1:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.1},
URN = {urn:nbn:de:0030-drops-135400},
doi = {10.4230/LIPIcs.ITCS.2021.1},
annote = {Keywords: entropy, twenty questions, algorithms, sorting}
}
@InProceedings{impagliazzo_et_al:LIPIcs.ITCS.2021.2,
author = {Impagliazzo, Russell and McGuire, Sam},
title = {{Comparing Computational Entropies Below Majority (Or: When Is the Dense Model Theorem False?)}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {2:1--2:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.2},
URN = {urn:nbn:de:0030-drops-135417},
doi = {10.4230/LIPIcs.ITCS.2021.2},
annote = {Keywords: Computational entropy, dense model theorem, coin problem}
}
@InProceedings{hoefer_et_al:LIPIcs.ITCS.2021.3,
author = {Hoefer, Martin and Manurangsi, Pasin and Psomas, Alexandros},
title = {{Algorithmic Persuasion with Evidence}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {3:1--3:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.3},
URN = {urn:nbn:de:0030-drops-135420},
doi = {10.4230/LIPIcs.ITCS.2021.3},
annote = {Keywords: Bayesian Persuasion, Semidefinite Programming, Approximation Algorithms}
}
@InProceedings{haviv:LIPIcs.ITCS.2021.4,
author = {Haviv, Ishay},
title = {{The Complexity of Finding Fair Independent Sets in Cycles}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {4:1--4:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.4},
URN = {urn:nbn:de:0030-drops-135431},
doi = {10.4230/LIPIcs.ITCS.2021.4},
annote = {Keywords: Fair independent sets in cycles, the complexity class \{PPA\}, Schrijver graphs}
}
@InProceedings{guruswami_et_al:LIPIcs.ITCS.2021.5,
author = {Guruswami, Venkatesan and Mosheiff, Jonathan and Resch, Nicolas and Silas, Shashwat and Wootters, Mary},
title = {{Sharp Threshold Rates for Random Codes}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {5:1--5:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.5},
URN = {urn:nbn:de:0030-drops-135446},
doi = {10.4230/LIPIcs.ITCS.2021.5},
annote = {Keywords: Coding theory, Random codes, Sharp thresholds}
}
@InProceedings{musco_et_al:LIPIcs.ITCS.2021.6,
author = {Musco, Cameron and Musco, Christopher and Woodruff, David P.},
title = {{Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {6:1--6:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.6},
URN = {urn:nbn:de:0030-drops-135452},
doi = {10.4230/LIPIcs.ITCS.2021.6},
annote = {Keywords: low-rank approximation, communication complexity, weighted low-rank approximation, bicriteria approximation algorithms}
}
@InProceedings{hoza_et_al:LIPIcs.ITCS.2021.7,
author = {Hoza, William M. and Pyne, Edward and Vadhan, Salil},
title = {{Pseudorandom Generators for Unbounded-Width Permutation Branching Programs}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {7:1--7:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.7},
URN = {urn:nbn:de:0030-drops-135464},
doi = {10.4230/LIPIcs.ITCS.2021.7},
annote = {Keywords: Pseudorandom generators, permutation branching programs}
}
@InProceedings{arunachaleswaran_et_al:LIPIcs.ITCS.2021.8,
author = {Arunachaleswaran, Eshwar Ram and Kannan, Sampath and Roth, Aaron and Ziani, Juba},
title = {{Pipeline Interventions}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {8:1--8:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.8},
URN = {urn:nbn:de:0030-drops-135478},
doi = {10.4230/LIPIcs.ITCS.2021.8},
annote = {Keywords: Interventions for fairness, fairness in navigating life paths, social welfare, maximin welfare, budget-constrained optimization, hardness of approximation}
}
@InProceedings{kumar_et_al:LIPIcs.ITCS.2021.9,
author = {Kumar, Mrinal and Volk, Ben 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)},
pages = {9:1--9:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.9},
URN = {urn:nbn:de:0030-drops-135486},
doi = {10.4230/LIPIcs.ITCS.2021.9},
annote = {Keywords: Rigid Matrices, Linear Circuits, Degree Bounds, Circuit Lower Bounds}
}
@InProceedings{manurangsi_et_al:LIPIcs.ITCS.2021.10,
author = {Manurangsi, Pasin and Rubinstein, Aviad and Schramm, Tselil},
title = {{The Strongish Planted Clique Hypothesis and Its Consequences}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {10:1--10:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.10},
URN = {urn:nbn:de:0030-drops-135491},
doi = {10.4230/LIPIcs.ITCS.2021.10},
annote = {Keywords: Planted Clique, Densest k-Subgraph, Hardness of Approximation}
}
@InProceedings{yu:LIPIcs.ITCS.2021.11,
author = {Yu, Nengkun},
title = {{Sample Efficient Identity Testing and Independence Testing of Quantum States}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {11:1--11:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.11},
URN = {urn:nbn:de:0030-drops-135504},
doi = {10.4230/LIPIcs.ITCS.2021.11},
annote = {Keywords: Quantum property testing}
}
@InProceedings{beyersdorff_et_al:LIPIcs.ITCS.2021.12,
author = {Beyersdorff, Olaf and B\"{o}hm, Benjamin},
title = {{Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {12:1--12:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.12},
URN = {urn:nbn:de:0030-drops-135519},
doi = {10.4230/LIPIcs.ITCS.2021.12},
annote = {Keywords: CDCL, QBF, QCDCL, proof complexity, resolution, Q-resolution}
}
@InProceedings{kretschmer:LIPIcs.ITCS.2021.13,
author = {Kretschmer, William},
title = {{The Quantum Supremacy Tsirelson Inequality}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {13:1--13:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.13},
URN = {urn:nbn:de:0030-drops-135524},
doi = {10.4230/LIPIcs.ITCS.2021.13},
annote = {Keywords: quantum supremacy, quantum query complexity, random circuit sampling}
}
@InProceedings{ding_et_al:LIPIcs.ITCS.2021.14,
author = {Ding, Kimberly and Weinberg, S. Matthew},
title = {{Approximately Strategyproof Tournament Rules in the Probabilistic Setting}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {14:1--14:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.14},
URN = {urn:nbn:de:0030-drops-135532},
doi = {10.4230/LIPIcs.ITCS.2021.14},
annote = {Keywords: Tournaments, Incentive Compatibility, Recursive Analysis, Social Choice Theory}
}
@InProceedings{bhattacharya_et_al:LIPIcs.ITCS.2021.15,
author = {Bhattacharya, Anup and Bishnu, Arijit and Mishra, Gopinath and Upasana, Anannya},
title = {{Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming!}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {15:1--15:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.15},
URN = {urn:nbn:de:0030-drops-135544},
doi = {10.4230/LIPIcs.ITCS.2021.15},
annote = {Keywords: Streaming, random ordering, graph coloring, estimation, lower bounds}
}
@InProceedings{kuszmaul_et_al:LIPIcs.ITCS.2021.16,
author = {Kuszmaul, William and Westover, Alek},
title = {{The Variable-Processor Cup Game}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {16:1--16:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.16},
URN = {urn:nbn:de:0030-drops-135559},
doi = {10.4230/LIPIcs.ITCS.2021.16},
annote = {Keywords: scheduling, cup games, online algorithms, lower bounds}
}
@InProceedings{meir:LIPIcs.ITCS.2021.17,
author = {Meir, Uri},
title = {{Comparison Graphs: A Unified Method for Uniformity Testing}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {17:1--17:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.17},
URN = {urn:nbn:de:0030-drops-135560},
doi = {10.4230/LIPIcs.ITCS.2021.17},
annote = {Keywords: Distribution Testing, Uniformity Testing, Distributed Algorithms, Streaming Algorithms, Comparison Graphs}
}
@InProceedings{narayanan_et_al:LIPIcs.ITCS.2021.18,
author = {Narayanan, Shyam and Ren, Michael},
title = {{Circular Trace Reconstruction}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.18},
URN = {urn:nbn:de:0030-drops-135573},
doi = {10.4230/LIPIcs.ITCS.2021.18},
annote = {Keywords: Trace Reconstruction, Deletion Channel, Cyclotomic Integers}
}
@InProceedings{metger_et_al:LIPIcs.ITCS.2021.19,
author = {Metger, Tony and Vidick, Thomas},
title = {{Self-Testing of a Single Quantum Device Under Computational Assumptions}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {19:1--19:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.19},
URN = {urn:nbn:de:0030-drops-135581},
doi = {10.4230/LIPIcs.ITCS.2021.19},
annote = {Keywords: Quantum computing, quantum cryptography, device-independence, self-testing, post-quantum cryptography}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2021.20,
author = {Chen, Xi and De, Anindya and Lee, Chin Ho and Servedio, Rocco A. and Sinha, Sandip},
title = {{Polynomial-Time Trace Reconstruction in the Low Deletion Rate Regime}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {20:1--20:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.20},
URN = {urn:nbn:de:0030-drops-135595},
doi = {10.4230/LIPIcs.ITCS.2021.20},
annote = {Keywords: trace reconstruction}
}
@InProceedings{bubeck_et_al:LIPIcs.ITCS.2021.21,
author = {Bubeck, S\'{e}bastien and Buchbinder, Niv and Coester, Christian and Sellke, Mark},
title = {{Metrical Service Systems with Transformations}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {21:1--21:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.21},
URN = {urn:nbn:de:0030-drops-135608},
doi = {10.4230/LIPIcs.ITCS.2021.21},
annote = {Keywords: Online algorithms, competitive analysis, metrical task systems, k-taxi}
}
@InProceedings{goel_et_al:LIPIcs.ITCS.2021.22,
author = {Goel, Surbhi and Klivans, Adam and Manurangsi, Pasin and Reichman, Daniel},
title = {{Tight Hardness Results for Training Depth-2 ReLU Networks}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {22:1--22:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.22},
URN = {urn:nbn:de:0030-drops-135611},
doi = {10.4230/LIPIcs.ITCS.2021.22},
annote = {Keywords: ReLU, Learning Algorithm, Running Time Lower Bound}
}
@InProceedings{dutta_et_al:LIPIcs.ITCS.2021.23,
author = {Dutta, Pranjal and Saxena, Nitin and Thierauf, Thomas},
title = {{A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {23:1--23:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.23},
URN = {urn:nbn:de:0030-drops-135629},
doi = {10.4230/LIPIcs.ITCS.2021.23},
annote = {Keywords: VP, VNP, hitting set, circuit, polynomial, sparsity, SOS, SOC, PIT, lower bound}
}
@InProceedings{golovnev_et_al:LIPIcs.ITCS.2021.24,
author = {Golovnev, Alexander and Kulikov, Alexander S. and Williams, R. Ryan},
title = {{Circuit Depth Reductions}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {24:1--24:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.24},
URN = {urn:nbn:de:0030-drops-135633},
doi = {10.4230/LIPIcs.ITCS.2021.24},
annote = {Keywords: Circuit complexity, formula complexity, pseudorandomness, matrix rigidity}
}
@InProceedings{feng_et_al:LIPIcs.ITCS.2021.25,
author = {Feng, Weiming and He, Kun and Sun, Xiaoming and Yin, Yitong},
title = {{Dynamic Inference in Probabilistic Graphical Models}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {25:1--25:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.25},
URN = {urn:nbn:de:0030-drops-135643},
doi = {10.4230/LIPIcs.ITCS.2021.25},
annote = {Keywords: Dynamic inference, probabilistic graphical model, Gibbs sampling, Markov random filed}
}
@InProceedings{kelman_et_al:LIPIcs.ITCS.2021.26,
author = {Kelman, Esty and Khot, Subhash and Kindler, Guy and Minzer, Dor and Safra, Muli},
title = {{Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {26:1--26:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.26},
URN = {urn:nbn:de:0030-drops-135657},
doi = {10.4230/LIPIcs.ITCS.2021.26},
annote = {Keywords: Fourier Analysis, Hypercontractivity, Log-Sobolev Inequality}
}
@InProceedings{braverman_et_al:LIPIcs.ITCS.2021.27,
author = {Braverman, Mark and Khot, Subhash and Minzer, Dor},
title = {{On Rich 2-to-1 Games}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {27:1--27:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.27},
URN = {urn:nbn:de:0030-drops-135666},
doi = {10.4230/LIPIcs.ITCS.2021.27},
annote = {Keywords: PCP, Unique-Games, Perfect Completeness}
}
@InProceedings{fraigniaud_et_al:LIPIcs.ITCS.2021.28,
author = {Fraigniaud, Pierre and Le Gall, Fran\c{c}ois and Nishimura, Harumichi and Paz, Ami},
title = {{Distributed Quantum Proofs for Replicated Data}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {28:1--28:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.28},
URN = {urn:nbn:de:0030-drops-135679},
doi = {10.4230/LIPIcs.ITCS.2021.28},
annote = {Keywords: Quantum Computing, Distributed Network Computing, Algorithmic Aspects of Networks}
}
@InProceedings{nanashima:LIPIcs.ITCS.2021.29,
author = {Nanashima, Mikito},
title = {{On Basing Auxiliary-Input Cryptography on NP-Hardness via Nonadaptive Black-Box Reductions}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {29:1--29:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.29},
URN = {urn:nbn:de:0030-drops-135686},
doi = {10.4230/LIPIcs.ITCS.2021.29},
annote = {Keywords: Auxiliary-input cryptographic primitives, nonadaptive black-box reductions}
}
@InProceedings{barak_et_al:LIPIcs.ITCS.2021.30,
author = {Barak, Boaz and Chou, Chi-Ning and Gao, Xun},
title = {{Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {30:1--30:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.30},
URN = {urn:nbn:de:0030-drops-135699},
doi = {10.4230/LIPIcs.ITCS.2021.30},
annote = {Keywords: Quantum supremacy, Linear cross-entropy benchmark}
}
@InProceedings{grochow_et_al:LIPIcs.ITCS.2021.31,
author = {Grochow, Joshua A. and Qiao, Youming},
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)},
pages = {31:1--31:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.31},
URN = {urn:nbn:de:0030-drops-135702},
doi = {10.4230/LIPIcs.ITCS.2021.31},
annote = {Keywords: complexity class, tensor isomorphism, polynomial isomorphism, group isomorphism, stochastic local operations and classical communication}
}
@InProceedings{rosenthal:LIPIcs.ITCS.2021.32,
author = {Rosenthal, Gregory},
title = {{Bounds on the QAC^0 Complexity of Approximating Parity}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {32:1--32:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.32},
URN = {urn:nbn:de:0030-drops-135713},
doi = {10.4230/LIPIcs.ITCS.2021.32},
annote = {Keywords: quantum circuit complexity, QAC^0, fanout, parity, nekomata}
}
@InProceedings{ronzewi_et_al:LIPIcs.ITCS.2021.33,
author = {Ron-Zewi, Noga and Shaltiel, Ronen and Varma, Nithin},
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)},
pages = {33:1--33:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.33},
URN = {urn:nbn:de:0030-drops-135724},
doi = {10.4230/LIPIcs.ITCS.2021.33},
annote = {Keywords: Local list-decoding, Hard-core predicates, Black-box reduction, Hadamard code}
}
@InProceedings{mardia:LIPIcs.ITCS.2021.34,
author = {Mardia, Jay},
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)},
pages = {34:1--34:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.34},
URN = {urn:nbn:de:0030-drops-135734},
doi = {10.4230/LIPIcs.ITCS.2021.34},
annote = {Keywords: Statistical computational gaps, Planted clique, Space complexity, Average case computational complexity}
}
@InProceedings{lau_et_al:LIPIcs.ITCS.2021.35,
author = {Lau, Joshua and Ritossa, Angus},
title = {{Algorithms and Hardness for Multidimensional Range Updates and Queries}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {35:1--35:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.35},
URN = {urn:nbn:de:0030-drops-135742},
doi = {10.4230/LIPIcs.ITCS.2021.35},
annote = {Keywords: Orthogonal range, Range updates, Online and Dynamic Data Structures, Fine-grained complexity, Cycle counting}
}
@InProceedings{aharonov_et_al:LIPIcs.ITCS.2021.36,
author = {Aharonov, Dorit and Grilo, Alex B.},
title = {{Two Combinatorial MA-Complete Problems}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {36:1--36:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.36},
URN = {urn:nbn:de:0030-drops-135754},
doi = {10.4230/LIPIcs.ITCS.2021.36},
annote = {Keywords: Merlin-Arthur proof systems, Constraint sastifation problem, Random walks}
}
@InProceedings{bechtel_et_al:LIPIcs.ITCS.2021.37,
author = {Bechtel, Curtis and Dughmi, Shaddin},
title = {{Delegated Stochastic Probing}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {37:1--37:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.37},
URN = {urn:nbn:de:0030-drops-135763},
doi = {10.4230/LIPIcs.ITCS.2021.37},
annote = {Keywords: Delegation, Mechanism Design, Algorithmic Game Theory}
}
@InProceedings{dinur_et_al:LIPIcs.ITCS.2021.38,
author = {Dinur, Irit and Filmus, Yuval and Harsha, Prahladh and Tulsiani, Madhur},
title = {{Explicit SoS Lower Bounds from High-Dimensional Expanders}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {38:1--38:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.38},
URN = {urn:nbn:de:0030-drops-135774},
doi = {10.4230/LIPIcs.ITCS.2021.38},
annote = {Keywords: High-dimensional expanders, sum-of-squares, integrality gaps}
}
@InProceedings{remscrim:LIPIcs.ITCS.2021.39,
author = {Remscrim, Zachary},
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)},
pages = {39:1--39:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.39},
URN = {urn:nbn:de:0030-drops-135781},
doi = {10.4230/LIPIcs.ITCS.2021.39},
annote = {Keywords: Quantum computation, Lower bounds, Finite automata}
}
@InProceedings{lin:LIPIcs.ITCS.2021.40,
author = {Lin, Jiabao},
title = {{On the Complexity of #CSP^d}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {40:1--40:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.40},
URN = {urn:nbn:de:0030-drops-135793},
doi = {10.4230/LIPIcs.ITCS.2021.40},
annote = {Keywords: Constraint satisfaction problem, counting problems, Holant, complexity dichotomy}
}
@InProceedings{goldwasser_et_al:LIPIcs.ITCS.2021.41,
author = {Goldwasser, Shafi and Rothblum, Guy N. and Shafer, Jonathan and Yehudayoff, Amir},
title = {{Interactive Proofs for Verifying Machine Learning}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {41:1--41:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.41},
URN = {urn:nbn:de:0030-drops-135806},
doi = {10.4230/LIPIcs.ITCS.2021.41},
annote = {Keywords: PAC learning, Fourier analysis of boolean functions, Complexity gaps, Complexity lower bounds, Goldreich-Levin algorithm, Kushilevitz-Mansour algorithm, Distribution testing}
}
@InProceedings{beneliezer_et_al:LIPIcs.ITCS.2021.42,
author = {Ben-Eliezer, Omri and Fischer, Eldar and Levi, Amit and Yoshida, Yuichi},
title = {{Ordered Graph Limits and Their Applications}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {42:1--42:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.42},
URN = {urn:nbn:de:0030-drops-135815},
doi = {10.4230/LIPIcs.ITCS.2021.42},
annote = {Keywords: graph limits, ordered graph, graphon, cut distance, removal lemma}
}
@InProceedings{grossman_et_al:LIPIcs.ITCS.2021.43,
author = {Grossman, Ofer and Holmgren, Justin},
title = {{Error Correcting Codes for Uncompressed Messages}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {43:1--43:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.43},
URN = {urn:nbn:de:0030-drops-135828},
doi = {10.4230/LIPIcs.ITCS.2021.43},
annote = {Keywords: Coding Theory, List Decoding}
}
@InProceedings{kleinberg_et_al:LIPIcs.ITCS.2021.44,
author = {Kleinberg, Robert and Korten, Oliver and Mitropolsky, Daniel and Papadimitriou, Christos},
title = {{Total Functions in the Polynomial Hierarchy}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {44:1--44:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.44},
URN = {urn:nbn:de:0030-drops-135835},
doi = {10.4230/LIPIcs.ITCS.2021.44},
annote = {Keywords: total complexity, polynomial hierarchy, pigeonhole principle}
}
@InProceedings{burrell_et_al:LIPIcs.ITCS.2021.45,
author = {Burrell, Noah and Schoenebeck, Grant},
title = {{Relaxing Common Belief for Social Networks}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {45:1--45:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.45},
URN = {urn:nbn:de:0030-drops-135841},
doi = {10.4230/LIPIcs.ITCS.2021.45},
annote = {Keywords: Social networks, network revolt games, common belief}
}
@InProceedings{ashlagi_et_al:LIPIcs.ITCS.2021.46,
author = {Ashlagi, Itai and Braverman, Mark and Saberi, Amin and Thomas, Clayton and Zhao, Geng},
title = {{Tiered Random Matching Markets: Rank Is Proportional to Popularity}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {46:1--46:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.46},
URN = {urn:nbn:de:0030-drops-135851},
doi = {10.4230/LIPIcs.ITCS.2021.46},
annote = {Keywords: Stable matching, stable marriage problem, tiered random markets, deferred acceptance}
}
@InProceedings{couteau_et_al:LIPIcs.ITCS.2021.47,
author = {Couteau, Geoffroy and Farshim, Pooya and Mahmoody, Mohammad},
title = {{Black-Box Uselessness: Composing Separations in Cryptography}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {47:1--47:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.47},
URN = {urn:nbn:de:0030-drops-135869},
doi = {10.4230/LIPIcs.ITCS.2021.47},
annote = {Keywords: Black-Box Reductions, Separations, One-Way Functions, Key Agreement}
}
@InProceedings{guruswami_et_al:LIPIcs.ITCS.2021.48,
author = {Guruswami, Venkatesan and Kumar, Vinayak M.},
title = {{Pseudobinomiality of the Sticky Random Walk}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {48:1--48:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.48},
URN = {urn:nbn:de:0030-drops-135870},
doi = {10.4230/LIPIcs.ITCS.2021.48},
annote = {Keywords: Expander Graphs, Fourier analysis, Markov Chains, Pseudorandomness, Random Walks}
}
@InProceedings{eldar:LIPIcs.ITCS.2021.49,
author = {Eldar, Lior},
title = {{Robust Quantum Entanglement at (Nearly) Room Temperature}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {49:1--49:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.49},
URN = {urn:nbn:de:0030-drops-135886},
doi = {10.4230/LIPIcs.ITCS.2021.49},
annote = {Keywords: Quantum error-correcting codes, Quantum Entanglement, Quantum Locally-Testable Codes, Local Hamiltonians, quantum PCP, NLTS}
}
@InProceedings{mudigonda_et_al:LIPIcs.ITCS.2021.50,
author = {Mudigonda, Abhijit S. and Williams, R. Ryan},
title = {{Time-Space Lower Bounds for Simulating Proof Systems with Quantum and Randomized Verifiers}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {50:1--50:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.50},
URN = {urn:nbn:de:0030-drops-135897},
doi = {10.4230/LIPIcs.ITCS.2021.50},
annote = {Keywords: Time-space tradeoffs, lower bounds, QMA}
}
@InProceedings{angelopoulos:LIPIcs.ITCS.2021.51,
author = {Angelopoulos, Spyros},
title = {{Online Search with a Hint}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {51:1--51:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.51},
URN = {urn:nbn:de:0030-drops-135902},
doi = {10.4230/LIPIcs.ITCS.2021.51},
annote = {Keywords: Search problems, searching on the line, competitive analysis, predictions}
}
@InProceedings{papp_et_al:LIPIcs.ITCS.2021.52,
author = {Papp, P\'{a}l Andr\'{a}s and Wattenhofer, Roger},
title = {{Sequential Defaulting in Financial Networks}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {52:1--52:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.52},
URN = {urn:nbn:de:0030-drops-135919},
doi = {10.4230/LIPIcs.ITCS.2021.52},
annote = {Keywords: Financial Network, Sequential Defaulting, Credit Default Swap, Clearing Problem, Stabilization Time}
}
@InProceedings{garg_et_al:LIPIcs.ITCS.2021.53,
author = {Garg, Ankit and Kothari, Robin and Netrapalli, Praneeth and Sherif, Suhail},
title = {{No Quantum Speedup over Gradient Descent for Non-Smooth Convex Optimization}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {53:1--53:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.53},
URN = {urn:nbn:de:0030-drops-135921},
doi = {10.4230/LIPIcs.ITCS.2021.53},
annote = {Keywords: Quantum algorithms, Gradient descent, Convex optimization}
}
@InProceedings{girish_et_al:LIPIcs.ITCS.2021.54,
author = {Girish, Uma and Raz, Ran and Tal, Avishay},
title = {{Quantum Versus Randomized Communication Complexity, with Efficient Players}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {54:1--54:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.54},
URN = {urn:nbn:de:0030-drops-135932},
doi = {10.4230/LIPIcs.ITCS.2021.54},
annote = {Keywords: Exponential Separation, Quantum, Randomized, Communication, Complexity, Forrelation}
}
@InProceedings{bhatia_et_al:LIPIcs.ITCS.2021.55,
author = {Bhatia, Kush and Bartlett, Peter L. and Dragan, Anca D. and Steinhardt, Jacob},
title = {{Agnostic Learning with Unknown Utilities}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {55:1--55:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.55},
URN = {urn:nbn:de:0030-drops-135947},
doi = {10.4230/LIPIcs.ITCS.2021.55},
annote = {Keywords: agnostic learning, learning by comparisons, utility estimation, active learning}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2021.56,
author = {Chen, Lijie and Ghazi, Badih and Kumar, Ravi and Manurangsi, Pasin},
title = {{On Distributed Differential Privacy and Counting Distinct Elements}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {56:1--56:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.56},
URN = {urn:nbn:de:0030-drops-135953},
doi = {10.4230/LIPIcs.ITCS.2021.56},
annote = {Keywords: Differential Privacy, Shuffle Model}
}
@InProceedings{solomon_et_al:LIPIcs.ITCS.2021.57,
author = {Solomon, Noam and Solomon, Shay},
title = {{A Generalized Matching Reconfiguration Problem}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {57:1--57:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.57},
URN = {urn:nbn:de:0030-drops-135965},
doi = {10.4230/LIPIcs.ITCS.2021.57},
annote = {Keywords: Dynamic algorithms, graph matching, reconfiguration problem, recourse bound}
}
@InProceedings{yoshida_et_al:LIPIcs.ITCS.2021.58,
author = {Yoshida, Yuichi and Zhou, Samson},
title = {{Sensitivity Analysis of the Maximum Matching Problem}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {58:1--58:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.58},
URN = {urn:nbn:de:0030-drops-135979},
doi = {10.4230/LIPIcs.ITCS.2021.58},
annote = {Keywords: Sensitivity analysis, maximum matching, graph algorithms}
}
@InProceedings{vazirani_et_al:LIPIcs.ITCS.2021.59,
author = {Vazirani, Vijay V. and Yannakakis, Mihalis},
title = {{Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {59:1--59:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.59},
URN = {urn:nbn:de:0030-drops-135987},
doi = {10.4230/LIPIcs.ITCS.2021.59},
annote = {Keywords: Hyland-Zeckhauser scheme, one-sided matching markets, mechanism design, dichotomous utilities, PPAD, FIXP}
}
@InProceedings{nenadov_et_al:LIPIcs.ITCS.2021.60,
author = {Nenadov, Rajko and Steger, Angelika and Su, Pascal},
title = {{An O(N) Time Algorithm for Finding Hamilton Cycles with High Probability}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {60:1--60:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.60},
URN = {urn:nbn:de:0030-drops-135997},
doi = {10.4230/LIPIcs.ITCS.2021.60},
annote = {Keywords: Random Graphs, Hamilton Cycle, Perfect Matching, Linear Time, Sublinear Algorithm, Random Walk, Coupon Collector}
}
@InProceedings{arunachalam_et_al:LIPIcs.ITCS.2021.61,
author = {Arunachalam, Srinivasan and Podder, Supartha},
title = {{Communication Memento: Memoryless Communication Complexity}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {61:1--61:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.61},
URN = {urn:nbn:de:0030-drops-136007},
doi = {10.4230/LIPIcs.ITCS.2021.61},
annote = {Keywords: Communication complexity, space complexity, branching programs, garden-hose model, quantum computing}
}
@InProceedings{cohen_et_al:LIPIcs.ITCS.2021.62,
author = {Cohen, Michael B. and Sidford, Aaron and Tian, Kevin},
title = {{Relative Lipschitzness in Extragradient Methods and a Direct Recipe for Acceleration}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {62:1--62:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.62},
URN = {urn:nbn:de:0030-drops-136011},
doi = {10.4230/LIPIcs.ITCS.2021.62},
annote = {Keywords: Variational inequalities, minimax optimization, acceleration, 𝓁\underline∞ regression}
}
@InProceedings{vandenbrand_et_al:LIPIcs.ITCS.2021.63,
author = {van den Brand, Jan and Peng, Binghui and Song, Zhao and Weinstein, Omri},
title = {{Training (Overparametrized) Neural Networks in Near-Linear Time}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {63:1--63:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.63},
URN = {urn:nbn:de:0030-drops-136025},
doi = {10.4230/LIPIcs.ITCS.2021.63},
annote = {Keywords: Deep learning theory, Nonconvex optimization}
}
@InProceedings{blocki_et_al:LIPIcs.ITCS.2021.64,
author = {Blocki, Jeremiah and Cinkoske, Mike},
title = {{A New Connection Between Node and Edge Depth Robust Graphs}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {64:1--64:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.64},
URN = {urn:nbn:de:0030-drops-136038},
doi = {10.4230/LIPIcs.ITCS.2021.64},
annote = {Keywords: Depth robust graphs, memory hard functions}
}
@InProceedings{leverrier_et_al:LIPIcs.ITCS.2021.65,
author = {Leverrier, Anthony and Londe, Vivien and Z\'{e}mor, Gilles},
title = {{Towards Local Testability for Quantum Coding}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {65:1--65:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.65},
URN = {urn:nbn:de:0030-drops-136049},
doi = {10.4230/LIPIcs.ITCS.2021.65},
annote = {Keywords: Quantum error correcting code}
}
@InProceedings{dixon_et_al:LIPIcs.ITCS.2021.66,
author = {Dixon, Peter and Pavan, A. and Vinodchandran, N. V.},
title = {{Complete Problems for Multi-Pseudodeterministic Computations}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {66:1--66:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.66},
URN = {urn:nbn:de:0030-drops-136050},
doi = {10.4230/LIPIcs.ITCS.2021.66},
annote = {Keywords: Pseudodeterminism, Completeness, Collision Probability, Circuit Acceptance, Entropy Approximation}
}
@InProceedings{emek_et_al:LIPIcs.ITCS.2021.67,
author = {Emek, Yuval and Kutten, Shay and Shi, Yangguang},
title = {{Online Paging with a Vanishing Regret}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {67:1--67:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.67},
URN = {urn:nbn:de:0030-drops-136065},
doi = {10.4230/LIPIcs.ITCS.2021.67},
annote = {Keywords: online paging, inaccurate predictions, multiple predictors, vanishing regret, full information vs. bandit access}
}
@InProceedings{komargodski_et_al:LIPIcs.ITCS.2021.68,
author = {Komargodski, Ilan and Shi, Elaine},
title = {{Differentially Oblivious Turing Machines}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {68:1--68:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.68},
URN = {urn:nbn:de:0030-drops-136071},
doi = {10.4230/LIPIcs.ITCS.2021.68},
annote = {Keywords: Differential privacy, Turing machines, obliviousness}
}
@InProceedings{de_et_al:LIPIcs.ITCS.2021.69,
author = {De, Anindya and Nadimpalli, Shivam and Servedio, Rocco A.},
title = {{Quantitative Correlation Inequalities via Semigroup Interpolation}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {69:1--69:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.69},
URN = {urn:nbn:de:0030-drops-136081},
doi = {10.4230/LIPIcs.ITCS.2021.69},
annote = {Keywords: complex analysis, correlation inequality, FKG inequality, Gaussian correlation inequality, harmonic analysis, Markov semigroups}
}
@InProceedings{rossman:LIPIcs.ITCS.2021.70,
author = {Rossman, Benjamin},
title = {{Shrinkage of Decision Lists and DNF Formulas}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {70:1--70:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.70},
URN = {urn:nbn:de:0030-drops-136098},
doi = {10.4230/LIPIcs.ITCS.2021.70},
annote = {Keywords: shrinkage, decision lists, DNF formulas}
}
@InProceedings{mittal_et_al:LIPIcs.ITCS.2021.71,
author = {Mittal, Kunal and Raz, Ran},
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)},
pages = {71:1--71:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.71},
URN = {urn:nbn:de:0030-drops-136101},
doi = {10.4230/LIPIcs.ITCS.2021.71},
annote = {Keywords: Block-rigidity, Matrix Rigidity, Parallel Repetition, Size-depth tradeoffs, Turing Machines}
}
@InProceedings{dziembowski_et_al:LIPIcs.ITCS.2021.72,
author = {Dziembowski, Stefan and Fabia\'{n}ski, Grzegorz and Faust, Sebastian and Riahi, Siavash},
title = {{Lower Bounds for Off-Chain Protocols: Exploring the Limits of Plasma}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {72:1--72:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.72},
URN = {urn:nbn:de:0030-drops-136113},
doi = {10.4230/LIPIcs.ITCS.2021.72},
annote = {Keywords: blockchain, lower bounds, off-chain protocol, commit chain, plasma}
}
@InProceedings{borst_et_al:LIPIcs.ITCS.2021.73,
author = {Borst, Sander and Dadush, Daniel and Olver, Neil and Sinha, Makrand},
title = {{Majorizing Measures for the Optimizer}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {73:1--73:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.73},
URN = {urn:nbn:de:0030-drops-136120},
doi = {10.4230/LIPIcs.ITCS.2021.73},
annote = {Keywords: Majorizing measures, Generic chaining, Gaussian processes, Convex optimization, Dimensionality Reduction}
}
@InProceedings{beyhaghi_et_al:LIPIcs.ITCS.2021.74,
author = {Beyhaghi, Hedyeh and Tardos, \'{E}va},
title = {{Randomness and Fairness in Two-Sided Matching with Limited Interviews}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {74:1--74:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.74},
URN = {urn:nbn:de:0030-drops-136139},
doi = {10.4230/LIPIcs.ITCS.2021.74},
annote = {Keywords: Matching with Short Lists, Stable Matching, Balls in Bins Problem}
}
@InProceedings{holmgren_et_al:LIPIcs.ITCS.2021.75,
author = {Holmgren, Justin and Wein, Alexander S.},
title = {{Counterexamples to the Low-Degree Conjecture}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {75:1--75:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.75},
URN = {urn:nbn:de:0030-drops-136148},
doi = {10.4230/LIPIcs.ITCS.2021.75},
annote = {Keywords: Low-degree likelihood ratio, error-correcting codes}
}
@InProceedings{briet_et_al:LIPIcs.ITCS.2021.76,
author = {Bri\"{e}t, Jop and Labib, Farrokh},
title = {{High-Entropy Dual Functions and Locally Decodable Codes}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {76:1--76:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.76},
URN = {urn:nbn:de:0030-drops-136157},
doi = {10.4230/LIPIcs.ITCS.2021.76},
annote = {Keywords: Higher-order Fourier analysis, dual functions, finite fields, additive combinatorics, coding theory}
}
@InProceedings{immorlica_et_al:LIPIcs.ITCS.2021.77,
author = {Immorlica, Nicole and Kash, Ian A. and Lucier, Brendan},
title = {{Buying Data over Time: Approximately Optimal Strategies for Dynamic Data-Driven Decisions}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {77:1--77:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.77},
URN = {urn:nbn:de:0030-drops-136161},
doi = {10.4230/LIPIcs.ITCS.2021.77},
annote = {Keywords: Online Algorithms, Value of Data, Markov Processes}
}
@InProceedings{schoenebeck_et_al:LIPIcs.ITCS.2021.78,
author = {Schoenebeck, Grant and Yu, Fang-Yi},
title = {{Learning and Strongly Truthful Multi-Task Peer Prediction: A Variational Approach}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {78:1--78:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.78},
URN = {urn:nbn:de:0030-drops-136177},
doi = {10.4230/LIPIcs.ITCS.2021.78},
annote = {Keywords: Information elicitation without verification, crowdsourcing, machine learning}
}
@InProceedings{ahmadian_et_al:LIPIcs.ITCS.2021.79,
author = {Ahmadian, Sara and Liu, Allen and Peng, Binghui and Zadimoghaddam, Morteza},
title = {{Distributed Load Balancing: A New Framework and Improved Guarantees}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {79:1--79:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.79},
URN = {urn:nbn:de:0030-drops-136186},
doi = {10.4230/LIPIcs.ITCS.2021.79},
annote = {Keywords: Load balancing, Distributed algorithms}
}
@InProceedings{levi_et_al:LIPIcs.ITCS.2021.80,
author = {Levi, Amit and Pallavoor, Ramesh Krishnan S. and Raskhodnikova, Sofya and Varma, Nithin},
title = {{Erasure-Resilient Sublinear-Time Graph Algorithms}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {80:1--80:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.80},
URN = {urn:nbn:de:0030-drops-136192},
doi = {10.4230/LIPIcs.ITCS.2021.80},
annote = {Keywords: Graph property testing, Computing with incomplete information, Approximating graph parameters}
}
@InProceedings{cai_et_al:LIPIcs.ITCS.2021.81,
author = {Cai, Yang and Velegkas, Grigoris},
title = {{How to Sell Information Optimally: An Algorithmic Study}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {81:1--81:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.81},
URN = {urn:nbn:de:0030-drops-136205},
doi = {10.4230/LIPIcs.ITCS.2021.81},
annote = {Keywords: Mechanism Design, Algorithmic Game Theory, Information Design}
}
@InProceedings{efremenko_et_al:LIPIcs.ITCS.2021.82,
author = {Efremenko, Klim and Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R.},
title = {{Computation over the Noisy Broadcast Channel with Malicious Parties}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {82:1--82:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.82},
URN = {urn:nbn:de:0030-drops-136215},
doi = {10.4230/LIPIcs.ITCS.2021.82},
annote = {Keywords: Broadcast Network, Malicious Parties, Communication Complexity}
}
@InProceedings{anari_et_al:LIPIcs.ITCS.2021.83,
author = {Anari, Nima and Hu, Nathan and Saberi, Amin and Schild, Aaron},
title = {{Sampling Arborescences in Parallel}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {83:1--83:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.83},
URN = {urn:nbn:de:0030-drops-136225},
doi = {10.4230/LIPIcs.ITCS.2021.83},
annote = {Keywords: parallel algorithms, arborescences, spanning trees, random sampling}
}
@InProceedings{babaioff_et_al:LIPIcs.ITCS.2021.84,
author = {Babaioff, Moshe and Cole, Richard and Hartline, Jason and Immorlica, Nicole and Lucier, Brendan},
title = {{Non-Quasi-Linear Agents in Quasi-Linear Mechanisms}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {84:1--84:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.84},
URN = {urn:nbn:de:0030-drops-136230},
doi = {10.4230/LIPIcs.ITCS.2021.84},
annote = {Keywords: Return on investment, Non-quasi-linear agents, Transferable Welfare, Simultaneous Second-Price Auctions}
}
@InProceedings{charikar_et_al:LIPIcs.ITCS.2021.85,
author = {Charikar, Moses and Garg, Shivam and Gordon, Deborah M. and Shiragur, Kirankumar},
title = {{A Model for Ant Trail Formation and its Convergence Properties}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {85:1--85:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.85},
URN = {urn:nbn:de:0030-drops-136247},
doi = {10.4230/LIPIcs.ITCS.2021.85},
annote = {Keywords: Ant colonies, Reinforced random walks, Natural Algorithms, Graph Algorithms, Shortest Path, Distributed Algorithms}
}
@InProceedings{correa_et_al:LIPIcs.ITCS.2021.86,
author = {Correa, Jos\'{e} and D\"{u}tting, Paul and Fischer, Felix and Schewior, Kevin and Ziliotto, Bruno},
title = {{Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {86:1--86:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.86},
URN = {urn:nbn:de:0030-drops-136255},
doi = {10.4230/LIPIcs.ITCS.2021.86},
annote = {Keywords: Prophet Inequalities, Stopping Theory, Unknown Distributions}
}
@InProceedings{dafni_et_al:LIPIcs.ITCS.2021.87,
author = {Dafni, Neta and Filmus, Yuval and Lifshitz, Noam and Lindzey, Nathan and Vinyals, Marc},
title = {{Complexity Measures on the Symmetric Group and Beyond}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {87:1--87:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.87},
URN = {urn:nbn:de:0030-drops-136267},
doi = {10.4230/LIPIcs.ITCS.2021.87},
annote = {Keywords: Computational Complexity Theory, Analysis of Boolean Functions, Complexity Measures, Extremal Combinatorics}
}
@InProceedings{feng_et_al:LIPIcs.ITCS.2021.88,
author = {Feng, Yiding and Niazadeh, Rad},
title = {{Batching and Optimal Multi-Stage Bipartite Allocations}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {88:1--88:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.88},
URN = {urn:nbn:de:0030-drops-136272},
doi = {10.4230/LIPIcs.ITCS.2021.88},
annote = {Keywords: Online Bipartite Matching, Primal-Dual Analysis, Multi-stage Allocation, Batching}
}
@InProceedings{filmus_et_al:LIPIcs.ITCS.2021.89,
author = {Filmus, Yuval and Meir, Or and Tal, Avishay},
title = {{Shrinkage Under Random Projections, and Cubic Formula Lower Bounds for AC0}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {89:1--89:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {Lee, James R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.89},
URN = {urn:nbn:de:0030-drops-136281},
doi = {10.4230/LIPIcs.ITCS.2021.89},
annote = {Keywords: De Morgan formulas, KRW Conjecture, shrinkage, random restrictions, random projections, bounded depth circuits, constant depth circuits, formula complexity}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing