@Proceedings{braverman:LIPIcs.ITCS.2022,
title = {{LIPIcs, Volume 215, ITCS 2022, Complete Volume}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {1--2410},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022},
URN = {urn:nbn:de:0030-drops-155957},
doi = {10.4230/LIPIcs.ITCS.2022},
annote = {Keywords: LIPIcs, Volume 215, ITCS 2022, Complete Volume}
}
@InProceedings{braverman:LIPIcs.ITCS.2022.0,
author = {Braverman, Mark},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {0:i--0:xxiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.0},
URN = {urn:nbn:de:0030-drops-155967},
doi = {10.4230/LIPIcs.ITCS.2022.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{aggarwal_et_al:LIPIcs.ITCS.2022.1,
author = {Aggarwal, Gagan and Bhawalkar, Kshipra and Guruganesh, Guru and Perlroth, Andres},
title = {{Maximizing Revenue in the Presence of Intermediaries}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {1:1--1:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.1},
URN = {urn:nbn:de:0030-drops-155979},
doi = {10.4230/LIPIcs.ITCS.2022.1},
annote = {Keywords: Mechanism Design, Revenue Maximization, Posted Price Mechanisms}
}
@InProceedings{aggarwal_et_al:LIPIcs.ITCS.2022.2,
author = {Aggarwal, Divesh and D\"{o}ttling, Nico and Dujmovic, Jesko and Hajiabadi, Mohammad and Malavolta, Giulio and Obremski, Maciej},
title = {{Algebraic Restriction Codes and Their Applications}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {2:1--2:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.2},
URN = {urn:nbn:de:0030-drops-155987},
doi = {10.4230/LIPIcs.ITCS.2022.2},
annote = {Keywords: Algebraic Restriction Codes, Oblivious Transfer, Rate 1, Statistically Sender Private, OT, Diffie-Hellman, DDH}
}
@InProceedings{akmal_et_al:LIPIcs.ITCS.2022.3,
author = {Akmal, Shyan and Chen, Lijie and Jin, Ce and Raj, Malvika and Williams, Ryan},
title = {{Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {3:1--3:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.3},
URN = {urn:nbn:de:0030-drops-155991},
doi = {10.4230/LIPIcs.ITCS.2022.3},
annote = {Keywords: Fine-grained complexity, Merlin-Arthur proofs}
}
@InProceedings{ananth_et_al:LIPIcs.ITCS.2022.4,
author = {Ananth, Prabhanjan and Jain, Abhishek and Jin, Zhengzhong and Malavolta, Giulio},
title = {{Pre-Constrained Encryption}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {4:1--4:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.4},
URN = {urn:nbn:de:0030-drops-156001},
doi = {10.4230/LIPIcs.ITCS.2022.4},
annote = {Keywords: Advanced encryption systems}
}
@InProceedings{anari_et_al:LIPIcs.ITCS.2022.5,
author = {Anari, Nima and Derezi\'{n}ski, Micha{\l} and Vuong, Thuy-Duong and Yang, Elizabeth},
title = {{Domain Sparsification of Discrete Distributions Using Entropic Independence}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {5:1--5:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.5},
URN = {urn:nbn:de:0030-drops-156013},
doi = {10.4230/LIPIcs.ITCS.2022.5},
annote = {Keywords: Domain Sparsification, Markov Chains, Sampling, Entropic Independence}
}
@InProceedings{anshu_et_al:LIPIcs.ITCS.2022.6,
author = {Anshu, Anurag and Nirkhe, Chinmay},
title = {{Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {6:1--6:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.6},
URN = {urn:nbn:de:0030-drops-156023},
doi = {10.4230/LIPIcs.ITCS.2022.6},
annote = {Keywords: quantum pcps, local hamiltonians, error-correcting codes}
}
@InProceedings{antaki_et_al:LIPIcs.ITCS.2022.7,
author = {Antaki, Shiri and Liu, Quanquan C. and Solomon, Shay},
title = {{Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {7:1--7:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.7},
URN = {urn:nbn:de:0030-drops-156039},
doi = {10.4230/LIPIcs.ITCS.2022.7},
annote = {Keywords: dynamic graph algorithms, distributed algorithms, symmetry breaking problems, maximal independent set, matching, coloring}
}
@InProceedings{applebaum_et_al:LIPIcs.ITCS.2022.8,
author = {Applebaum, Benny and Beimel, Amos and Nir, Oded and Peter, Naty and Pitassi, Toniann},
title = {{Secret Sharing, Slice Formulas, and Monotone Real Circuits}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {8:1--8:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.8},
URN = {urn:nbn:de:0030-drops-156046},
doi = {10.4230/LIPIcs.ITCS.2022.8},
annote = {Keywords: Secret Sharing Schemes, Monotone Real Circuits}
}
@InProceedings{assadi_et_al:LIPIcs.ITCS.2022.9,
author = {Assadi, Sepehr and Shah, Vihan},
title = {{An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {9:1--9:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.9},
URN = {urn:nbn:de:0030-drops-156054},
doi = {10.4230/LIPIcs.ITCS.2022.9},
annote = {Keywords: Graph streaming algorithms, Sketching, Maximum matching}
}
@InProceedings{assadi_et_al:LIPIcs.ITCS.2022.10,
author = {Assadi, Sepehr and Wang, Chen},
title = {{Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {10:1--10:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.10},
URN = {urn:nbn:de:0030-drops-156067},
doi = {10.4230/LIPIcs.ITCS.2022.10},
annote = {Keywords: Correlation Clustering, Sublinear Algorithms, Semi-streaming Algorithms, Sublinear time Algorithms}
}
@InProceedings{babichenko_et_al:LIPIcs.ITCS.2022.11,
author = {Babichenko, Yakov and Talgam-Cohen, Inbal and Xu, Haifeng and Zabarnyi, Konstantin},
title = {{Multi-Channel Bayesian Persuasion}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {11:1--11:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.11},
URN = {urn:nbn:de:0030-drops-156072},
doi = {10.4230/LIPIcs.ITCS.2022.11},
annote = {Keywords: Algorithmic game theory, Bayesian persuasion, Private Bayesian persuasion, Public Bayesian persuasion, Secret sharing, Networks}
}
@InProceedings{ball_et_al:LIPIcs.ITCS.2022.12,
author = {Ball, Marshall and Goldreich, Oded and Malkin, Tal},
title = {{Randomness Extraction from Somewhat Dependent Sources}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.12},
URN = {urn:nbn:de:0030-drops-156081},
doi = {10.4230/LIPIcs.ITCS.2022.12},
annote = {Keywords: Randomness Extraction, min-entropy, mutual information, two-source extractors, two-source condenser}
}
@InProceedings{bansal_et_al:LIPIcs.ITCS.2022.13,
author = {Bansal, Nikhil and Jiang, Haotian and Meka, Raghu and Singla, Sahil and Sinha, Makrand},
title = {{Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {13:1--13:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.13},
URN = {urn:nbn:de:0030-drops-156092},
doi = {10.4230/LIPIcs.ITCS.2022.13},
annote = {Keywords: Prefix discrepancy, smoothed analysis, combinatorial vector balancing}
}
@InProceedings{barak_et_al:LIPIcs.ITCS.2022.14,
author = {Barak, Boaz and Marwaha, Kunal},
title = {{Classical Algorithms and Quantum Limitations for Maximum Cut on High-Girth Graphs}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {14:1--14:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.14},
URN = {urn:nbn:de:0030-drops-156105},
doi = {10.4230/LIPIcs.ITCS.2022.14},
annote = {Keywords: approximation algorithms, QAOA, maximum cut, local distributions}
}
@InProceedings{bartusek_et_al:LIPIcs.ITCS.2022.15,
author = {Bartusek, James and Malavolta, Giulio},
title = {{Indistinguishability Obfuscation of Null Quantum Circuits and Applications}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.15},
URN = {urn:nbn:de:0030-drops-156115},
doi = {10.4230/LIPIcs.ITCS.2022.15},
annote = {Keywords: Obfuscation, Witness Encryption, Classical Verification of Quantum Computation}
}
@InProceedings{baweja_et_al:LIPIcs.ITCS.2022.16,
author = {Baweja, Anubhav and Jia, Justin and Woodruff, David P.},
title = {{An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {16:1--16:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.16},
URN = {urn:nbn:de:0030-drops-156128},
doi = {10.4230/LIPIcs.ITCS.2022.16},
annote = {Keywords: Minimum Feedback Arc Set, Tournament Graphs, Approximation Algorithms, Semi-streaming Algorithms}
}
@InProceedings{behera_et_al:LIPIcs.ITCS.2022.17,
author = {Behera, Balaram and Husi\'{c}, Edin and Jain, Shweta and Roughgarden, Tim and Seshadhri, C.},
title = {{FPT Algorithms for Finding Near-Cliques in c-Closed Graphs}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {17:1--17:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.17},
URN = {urn:nbn:de:0030-drops-156130},
doi = {10.4230/LIPIcs.ITCS.2022.17},
annote = {Keywords: c-closed graph, dense subgraphs, FPT algorithm, enumeration algorithm, k-plex, Moon-Moser theorem}
}
@InProceedings{bender_et_al:LIPIcs.ITCS.2022.18,
author = {Bender, Michael A. and Farach-Colton, Mart{\'\i}n and Kuszmaul, William},
title = {{What Does Dynamic Optimality Mean in External Memory?}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {18:1--18:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.18},
URN = {urn:nbn:de:0030-drops-156145},
doi = {10.4230/LIPIcs.ITCS.2022.18},
annote = {Keywords: Dynamic optimality, external memory, buffer propagation, search trees}
}
@InProceedings{bennett_et_al:LIPIcs.ITCS.2022.19,
author = {Bennett, Huck and Peikert, Chris and Tang, Yi},
title = {{Improved Hardness of BDD and SVP Under Gap-(S)ETH}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {19:1--19:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.19},
URN = {urn:nbn:de:0030-drops-156151},
doi = {10.4230/LIPIcs.ITCS.2022.19},
annote = {Keywords: lattices, lattice-based cryptography, fine-grained complexity, Bounded Distance Decoding, Shortest Vector Problem}
}
@InProceedings{bhangale_et_al:LIPIcs.ITCS.2022.20,
author = {Bhangale, Amey and Harsha, Prahladh and Roy, Sourya},
title = {{Mixing of 3-Term Progressions in Quasirandom Groups}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {20:1--20:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.20},
URN = {urn:nbn:de:0030-drops-156163},
doi = {10.4230/LIPIcs.ITCS.2022.20},
annote = {Keywords: Quasirandom groups, 3-term arithmetic progressions}
}
@InProceedings{bhangale_et_al:LIPIcs.ITCS.2022.21,
author = {Bhangale, Amey and Stankovi\'{c}, Aleksa},
title = {{Max-3-Lin over Non-Abelian Groups with Universal Factor Graphs}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {21:1--21:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.21},
URN = {urn:nbn:de:0030-drops-156177},
doi = {10.4230/LIPIcs.ITCS.2022.21},
annote = {Keywords: Universal factor graphs, linear equations, non-abelian groups, hardness of approximation}
}
@InProceedings{bhattiprolu_et_al:LIPIcs.ITCS.2022.22,
author = {Bhattiprolu, Vijay and Lee, Euiwoong and Tulsiani, Madhur},
title = {{Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {22:1--22:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.22},
URN = {urn:nbn:de:0030-drops-156186},
doi = {10.4230/LIPIcs.ITCS.2022.22},
annote = {Keywords: Grothendieck’s Inequality, Hardness of Approximation, Semidefinite Programming, Optimization}
}
@InProceedings{bilo_et_al:LIPIcs.ITCS.2022.23,
author = {Bil\`{o}, Davide and Casel, Katrin and Choudhary, Keerti and Cohen, Sarel and Friedrich, Tobias and Lagodzinski, J.A. Gregor and Schirneck, Martin and Wietheger, Simon},
title = {{Fixed-Parameter Sensitivity Oracles}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {23:1--23:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.23},
URN = {urn:nbn:de:0030-drops-156196},
doi = {10.4230/LIPIcs.ITCS.2022.23},
annote = {Keywords: data structures, distance preservers, distance sensitivity oracles, fault tolerance, fixed-parameter tractability, k-path, vertex cover}
}
@InProceedings{biswas_et_al:LIPIcs.ITCS.2022.24,
author = {Biswas, Amartya Shankha and Pyne, Edward and Rubinfeld, Ronitt},
title = {{Local Access to Random Walks}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {24:1--24:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.24},
URN = {urn:nbn:de:0030-drops-156209},
doi = {10.4230/LIPIcs.ITCS.2022.24},
annote = {Keywords: sublinear time algorithms, random generation, local computation}
}
@InProceedings{bodwin_et_al:LIPIcs.ITCS.2022.25,
author = {Bodwin, Greg and Dinitz, Michael and Nazari, Yasamin},
title = {{Vertex Fault-Tolerant Emulators}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {25:1--25:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.25},
URN = {urn:nbn:de:0030-drops-156217},
doi = {10.4230/LIPIcs.ITCS.2022.25},
annote = {Keywords: Emulators, Fault Tolerance, Girth Conjecture}
}
@InProceedings{bogdanov_et_al:LIPIcs.ITCS.2022.26,
author = {Bogdanov, Andrej and Dinesh, Krishnamoorthy and Filmus, Yuval and Ishai, Yuval and Kaplan, Avi and Srinivasan, Akshayaram},
title = {{Bounded Indistinguishability for Simple Sources}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {26:1--26:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.26},
URN = {urn:nbn:de:0030-drops-156223},
doi = {10.4230/LIPIcs.ITCS.2022.26},
annote = {Keywords: Pseudorandomness, bounded indistinguishability, complexity of sampling, constant-depth circuits, secret sharing, leakage-resilient cryptography}
}
@InProceedings{boyle_et_al:LIPIcs.ITCS.2022.27,
author = {Boyle, Elette and Dinur, Itai and Gilboa, Niv and Ishai, Yuval and Keller, Nathan and Klein, Ohad},
title = {{Locality-Preserving Hashing for Shifts with Connections to Cryptography}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {27:1--27:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.27},
URN = {urn:nbn:de:0030-drops-156231},
doi = {10.4230/LIPIcs.ITCS.2022.27},
annote = {Keywords: Sublinear algorithms, metric embeddings, shift finding, discrete logarithm, homomorphic secret sharing}
}
@InProceedings{brakerski_et_al:LIPIcs.ITCS.2022.28,
author = {Brakerski, Zvika and Vaikuntanathan, Vinod},
title = {{Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {28:1--28:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.28},
URN = {urn:nbn:de:0030-drops-156243},
doi = {10.4230/LIPIcs.ITCS.2022.28},
annote = {Keywords: Theoretical Cryptography, Broadcast Encryption, Attribute-Based Encryption, Lattice-Based Cryptography}
}
@InProceedings{brandt_et_al:LIPIcs.ITCS.2022.29,
author = {Brandt, Sebastian and Chang, Yi-Jun and Greb{\'\i}k, Jan and Grunau, Christoph and Rozho\v{n}, V\'{a}clav and Vidny\'{a}nszky, Zolt\'{a}n},
title = {{Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {29:1--29:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.29},
URN = {urn:nbn:de:0030-drops-156259},
doi = {10.4230/LIPIcs.ITCS.2022.29},
annote = {Keywords: Distributed Algorithms, Descriptive Combinatorics}
}
@InProceedings{bronfman_et_al:LIPIcs.ITCS.2022.30,
author = {Bronfman, Liron and Rothblum, Ron D.},
title = {{PCPs and Instance Compression from a Cryptographic Lens}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {30:1--30:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.30},
URN = {urn:nbn:de:0030-drops-156269},
doi = {10.4230/LIPIcs.ITCS.2022.30},
annote = {Keywords: PCP, Succinct Arguments, Instance Compression}
}
@InProceedings{buhrman_et_al:LIPIcs.ITCS.2022.31,
author = {Buhrman, Harry and Loff, Bruno and Patro, Subhasree and Speelman, Florian},
title = {{Limits of Quantum Speed-Ups for Computational Geometry and Other Problems: Fine-Grained Complexity via Quantum Walks}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {31:1--31:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.31},
URN = {urn:nbn:de:0030-drops-156273},
doi = {10.4230/LIPIcs.ITCS.2022.31},
annote = {Keywords: complexity theory, fine-grained complexity, 3SUM, computational geometry problems, data structures, quantum walk}
}
@InProceedings{bund_et_al:LIPIcs.ITCS.2022.32,
author = {Bund, Johannes and Lenzen, Christoph and Medina, Moti},
title = {{Small Hazard-Free Transducers}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {32:1--32:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.32},
URN = {urn:nbn:de:0030-drops-156281},
doi = {10.4230/LIPIcs.ITCS.2022.32},
annote = {Keywords: Hazard-Freeness, Parallel Prefix Computation, Finite State Transducers}
}
@InProceedings{casacuberta_et_al:LIPIcs.ITCS.2022.33,
author = {Casacuberta, S{\'\i}lvia and Kyng, Rasmus},
title = {{Faster Sparse Matrix Inversion and Rank Computation in Finite Fields}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {33:1--33:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.33},
URN = {urn:nbn:de:0030-drops-156290},
doi = {10.4230/LIPIcs.ITCS.2022.33},
annote = {Keywords: Matrix inversion, rank computation, displacement operators, numerical linear algebra}
}
@InProceedings{cavalar_et_al:LIPIcs.ITCS.2022.34,
author = {Cavalar, Bruno P. and Lu, Zhenjian},
title = {{Algorithms and Lower Bounds for Comparator Circuits from Shrinkage}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {34:1--34:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.34},
URN = {urn:nbn:de:0030-drops-156303},
doi = {10.4230/LIPIcs.ITCS.2022.34},
annote = {Keywords: comparator circuits, average-case complexity, satisfiability algorithms, pseudorandom generators}
}
@InProceedings{censorhillel_et_al:LIPIcs.ITCS.2022.35,
author = {Censor-Hillel, Keren and Fischer, Orr and Le Gall, Fran\c{c}ois and Leitersdorf, Dean and Oshman, Rotem},
title = {{Quantum Distributed Algorithms for Detection of Cliques}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {35:1--35:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.35},
URN = {urn:nbn:de:0030-drops-156319},
doi = {10.4230/LIPIcs.ITCS.2022.35},
annote = {Keywords: distributed graph algorithms, quantum algorithms, cycles, cliques, Congested Clique, CONGEST}
}
@InProceedings{censorhillel_et_al:LIPIcs.ITCS.2022.36,
author = {Censor-Hillel, Keren and Maus, Yannic and Romem-Peled, Shahar and Tonoyan, Tigran},
title = {{Distributed Vertex Cover Reconfiguration}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {36:1--36:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.36},
URN = {urn:nbn:de:0030-drops-156327},
doi = {10.4230/LIPIcs.ITCS.2022.36},
annote = {Keywords: reconfiguration, vertex cover, network decomposition}
}
@InProceedings{chakrabarti_et_al:LIPIcs.ITCS.2022.37,
author = {Chakrabarti, Amit and Ghosh, Prantar and Stoeckl, Manuel},
title = {{Adversarially Robust Coloring for Graph Streams}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {37:1--37:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.37},
URN = {urn:nbn:de:0030-drops-156332},
doi = {10.4230/LIPIcs.ITCS.2022.37},
annote = {Keywords: Data streaming, graph algorithms, graph coloring, lower bounds, online algorithms}
}
@InProceedings{chapman_et_al:LIPIcs.ITCS.2022.38,
author = {Chapman, Brynmor and Williams, R. Ryan},
title = {{Smaller ACC0 Circuits for Symmetric Functions}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {38:1--38:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.38},
URN = {urn:nbn:de:0030-drops-156342},
doi = {10.4230/LIPIcs.ITCS.2022.38},
annote = {Keywords: ACC, CC, circuit complexity, symmetric functions, Chinese Remainder Theorem}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.ITCS.2022.39,
author = {Chattopadhyay, Arkadev and Datta, Rajit and Ghosal, Utsab and Mukhopadhyay, Partha},
title = {{Monotone Complexity of Spanning Tree Polynomial Re-Visited}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {39:1--39:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.39},
URN = {urn:nbn:de:0030-drops-156356},
doi = {10.4230/LIPIcs.ITCS.2022.39},
annote = {Keywords: Spanning Tree Polynomial, Monotone Computation, Lower Bounds, Communication Complexity}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.ITCS.2022.40,
author = {Chattopadhyay, Eshan and Goodman, Jesse and Zuckerman, David},
title = {{The Space Complexity of Sampling}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {40:1--40:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.40},
URN = {urn:nbn:de:0030-drops-156366},
doi = {10.4230/LIPIcs.ITCS.2022.40},
annote = {Keywords: Complexity of distributions, complexity of sampling, extractors, list decodable codes, lower bounds, read-once branching programs, small-space computation}
}
@InProceedings{chaudhury_et_al:LIPIcs.ITCS.2022.41,
author = {Chaudhury, Bhaskar Ray and Garg, Jugal and McGlaughlin, Peter and Mehta, Ruta},
title = {{On the Existence of Competitive Equilibrium with Chores}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {41:1--41:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.41},
URN = {urn:nbn:de:0030-drops-156378},
doi = {10.4230/LIPIcs.ITCS.2022.41},
annote = {Keywords: Fair Division, Competitive Equilibrium, Fixed Point Theorems}
}
@InProceedings{chawla_et_al:LIPIcs.ITCS.2022.42,
author = {Chawla, Shuchi and Jagadeesan, Meena},
title = {{Individual Fairness in Advertising Auctions Through Inverse Proportionality}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {42:1--42:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.42},
URN = {urn:nbn:de:0030-drops-156385},
doi = {10.4230/LIPIcs.ITCS.2022.42},
annote = {Keywords: Algorithmic fairness, advertising auctions}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2022.43,
author = {Chen, Xue and Cheng, Kuan and Li, Xin and Ouyang, Minghui},
title = {{Improved Decoding of Expander Codes}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {43:1--43:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.43},
URN = {urn:nbn:de:0030-drops-156394},
doi = {10.4230/LIPIcs.ITCS.2022.43},
annote = {Keywords: Expander Code, Decoding}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2022.44,
author = {Chen, Yiling and Eden, Alon and Wang, Juntao},
title = {{Cursed yet Satisfied Agents}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {44:1--44:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.44},
URN = {urn:nbn:de:0030-drops-156407},
doi = {10.4230/LIPIcs.ITCS.2022.44},
annote = {Keywords: Mechanism Design, Interdependent Valuation Auction, Bounded Rationality, Cursed Equilibrium, Winner’s curse}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2022.45,
author = {Chen, Lijie and Hirahara, Shuichi and Vafa, Neekon},
title = {{Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {45:1--45:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.45},
URN = {urn:nbn:de:0030-drops-156411},
doi = {10.4230/LIPIcs.ITCS.2022.45},
annote = {Keywords: Average-case complexity, worst-case to average-case reduction}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2022.46,
author = {Chen, Sitan and Song, Zhao and Tao, Runzhou and Zhang, Ruizhe},
title = {{Symmetric Sparse Boolean Matrix Factorization and Applications}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {46:1--46:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.46},
URN = {urn:nbn:de:0030-drops-156422},
doi = {10.4230/LIPIcs.ITCS.2022.46},
annote = {Keywords: Matrix factorization, tensors, random matrices, average-case complexity}
}
@InProceedings{chia_et_al:LIPIcs.ITCS.2022.47,
author = {Chia, Nai-Hui and Chou, Chi-Ning and Zhang, Jiayu and Zhang, Ruizhe},
title = {{Quantum Meets the Minimum Circuit Size Problem}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {47:1--47:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.47},
URN = {urn:nbn:de:0030-drops-156433},
doi = {10.4230/LIPIcs.ITCS.2022.47},
annote = {Keywords: Quantum Computation, Quantum Complexity, Minimum Circuit Size Problem}
}
@InProceedings{christandl_et_al:LIPIcs.ITCS.2022.48,
author = {Christandl, Matthias and Fawzi, Omar and Ta, Hoang and Zuiddam, Jeroen},
title = {{Larger Corner-Free Sets from Combinatorial Degenerations}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {48:1--48:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.48},
URN = {urn:nbn:de:0030-drops-156441},
doi = {10.4230/LIPIcs.ITCS.2022.48},
annote = {Keywords: Corner-free sets, communication complexity, number on the forehead, combinatorial degeneration, hypergraphs, Shannon capacity, eval problem}
}
@InProceedings{christodoulou_et_al:LIPIcs.ITCS.2022.49,
author = {Christodoulou, Giorgos and Gkatzelis, Vasilis and Schoepflin, Daniel},
title = {{Optimal Deterministic Clock Auctions and Beyond}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {49:1--49:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.49},
URN = {urn:nbn:de:0030-drops-156453},
doi = {10.4230/LIPIcs.ITCS.2022.49},
annote = {Keywords: Auctions, Obvious Strategyproofness, Mechanism Design}
}
@InProceedings{con_et_al:LIPIcs.ITCS.2022.50,
author = {Con, Roni and Tamo, Itzhak},
title = {{Nonlinear Repair Schemes of Reed-Solomon Codes.}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {50:1--50:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.50},
URN = {urn:nbn:de:0030-drops-156462},
doi = {10.4230/LIPIcs.ITCS.2022.50},
annote = {Keywords: Exact repair problem, Reed-Solomon codes, Cut-set bound, Regenerating codes}
}
@InProceedings{coregliano_et_al:LIPIcs.ITCS.2022.51,
author = {Coregliano, Leonardo Nagami and Jeronimo, Fernando Granha and Jones, Chris},
title = {{A Complete Linear Programming Hierarchy for Linear Codes}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {51:1--51:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.51},
URN = {urn:nbn:de:0030-drops-156474},
doi = {10.4230/LIPIcs.ITCS.2022.51},
annote = {Keywords: Coding theory, code bounds, convex programming, linear programming hierarchy}
}
@InProceedings{dawar_et_al:LIPIcs.ITCS.2022.52,
author = {Dawar, Anuj and Wilsenach, Gregory},
title = {{Lower Bounds for Symmetric Circuits for the Determinant}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {52:1--52:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.52},
URN = {urn:nbn:de:0030-drops-156480},
doi = {10.4230/LIPIcs.ITCS.2022.52},
annote = {Keywords: arithmetic circuits, symmetric arithmetic circuits, Boolean circuits, symmetric circuits, permanent, determinant, counting width, Weisfeiler-Leman dimension, Cai-F\"{u}rer-Immerman constructions}
}
@InProceedings{de_et_al:LIPIcs.ITCS.2022.53,
author = {De, Anindya and Nadimpalli, Shivam and Servedio, Rocco A.},
title = {{Convex Influences}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {53:1--53:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.53},
URN = {urn:nbn:de:0030-drops-156498},
doi = {10.4230/LIPIcs.ITCS.2022.53},
annote = {Keywords: Fourier analysis of Boolean functions, convex geometry, influences, threshold phenomena}
}
@InProceedings{deshpande_et_al:LIPIcs.ITCS.2022.54,
author = {Deshpande, Abhinav and Gorshkov, Alexey V. and Fefferman, Bill},
title = {{The Importance of the Spectral Gap in Estimating Ground-State Energies}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {54:1--54:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.54},
URN = {urn:nbn:de:0030-drops-156501},
doi = {10.4230/LIPIcs.ITCS.2022.54},
annote = {Keywords: Local Hamiltonian problem, PSPACE, PP, QMA}
}
@InProceedings{dobzinski_et_al:LIPIcs.ITCS.2022.55,
author = {Dobzinski, Shahar and Oren, Sigal},
title = {{Mechanism Design with Moral Bidders}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {55:1--55:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.55},
URN = {urn:nbn:de:0030-drops-156513},
doi = {10.4230/LIPIcs.ITCS.2022.55},
annote = {Keywords: Mechanism Design, Cognitive Biases, Revenue Maximization}
}
@InProceedings{dodis_et_al:LIPIcs.ITCS.2022.56,
author = {Dodis, Yevgeniy and Karthikeyan, Harish and Wichs, Daniel},
title = {{Small-Box Cryptography}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {56:1--56:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.56},
URN = {urn:nbn:de:0030-drops-156527},
doi = {10.4230/LIPIcs.ITCS.2022.56},
annote = {Keywords: Block Ciphers, S-Box, Cryptography}
}
@InProceedings{dottling_et_al:LIPIcs.ITCS.2022.57,
author = {D\"{o}ttling, Nico and Goyal, Vipul and Malavolta, Giulio and Raizes, Justin},
title = {{Interaction-Preserving Compilers for Secure Computation}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {57:1--57:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.57},
URN = {urn:nbn:de:0030-drops-156534},
doi = {10.4230/LIPIcs.ITCS.2022.57},
annote = {Keywords: Multiparty Computation, Communication Complexity, Fully Homomorphic Encryption}
}
@InProceedings{dughmi:LIPIcs.ITCS.2022.58,
author = {Dughmi, Shaddin},
title = {{Matroid Secretary Is Equivalent to Contention Resolution}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {58:1--58:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.58},
URN = {urn:nbn:de:0030-drops-156540},
doi = {10.4230/LIPIcs.ITCS.2022.58},
annote = {Keywords: Contention Resolution, Secretary Problems, Matroids}
}
@InProceedings{dutta_et_al:LIPIcs.ITCS.2022.59,
author = {Dutta, Kunal and Ghosh, Arijit and Moran, Shay},
title = {{Uniform Brackets, Containers, and Combinatorial Macbeath Regions}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {59:1--59:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.59},
URN = {urn:nbn:de:0030-drops-156551},
doi = {10.4230/LIPIcs.ITCS.2022.59},
annote = {Keywords: communication complexity, distributed learning, emperical process theory, online algorithms, discrete geometry, computational geometry}
}
@InProceedings{ebrahimnejad_et_al:LIPIcs.ITCS.2022.60,
author = {Ebrahimnejad, Farzam and Lee, James R.},
title = {{Multiscale Entropic Regularization for MTS on General Metric Spaces}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {60:1--60:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.60},
URN = {urn:nbn:de:0030-drops-156568},
doi = {10.4230/LIPIcs.ITCS.2022.60},
annote = {Keywords: Metrical task systems, online algorithms, metric embeddings, convex optimization}
}
@InProceedings{ebrahimnejad_et_al:LIPIcs.ITCS.2022.61,
author = {Ebrahimnejad, Farzam and Nagda, Ansh and Gharan, Shayan Oveis},
title = {{Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {61:1--61:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.61},
URN = {urn:nbn:de:0030-drops-156579},
doi = {10.4230/LIPIcs.ITCS.2022.61},
annote = {Keywords: perfect matchings, approximate sampling, approximate counting, expanders}
}
@InProceedings{eden_et_al:LIPIcs.ITCS.2022.62,
author = {Eden, Talya and Indyk, Piotr and Xu, Haike},
title = {{Embeddings and Labeling Schemes for A*}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {62:1--62:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.62},
URN = {urn:nbn:de:0030-drops-156585},
doi = {10.4230/LIPIcs.ITCS.2022.62},
annote = {Keywords: A* algorithm, path finding, graph search}
}
@InProceedings{eiben_et_al:LIPIcs.ITCS.2022.63,
author = {Eiben, Eduard and Ganian, Robert and Hamm, Thekla and Jaffke, Lars and Kwon, O-joung},
title = {{A Unifying Framework for Characterizing and Computing Width Measures}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {63:1--63:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.63},
URN = {urn:nbn:de:0030-drops-156592},
doi = {10.4230/LIPIcs.ITCS.2022.63},
annote = {Keywords: branchwidth, parameterized algorithms, mim-width, treewidth, clique-width}
}
@InProceedings{eldan_et_al:LIPIcs.ITCS.2022.64,
author = {Eldan, Ronen and Moshkovitz, Dana},
title = {{Reduction from Non-Unique Games to Boolean Unique Games}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {64:1--64:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.64},
URN = {urn:nbn:de:0030-drops-156605},
doi = {10.4230/LIPIcs.ITCS.2022.64},
annote = {Keywords: Unique Games Conjecture, hyperplane encoding, concentration of measure, low degree testing}
}
@InProceedings{elrazik_et_al:LIPIcs.ITCS.2022.65,
author = {Elrazik, Reyad Abed and Robere, Robert and Schuster, Assaf and Yehuda, Gal},
title = {{Pseudorandom Self-Reductions for NP-Complete Problems}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {65:1--65:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.65},
URN = {urn:nbn:de:0030-drops-156615},
doi = {10.4230/LIPIcs.ITCS.2022.65},
annote = {Keywords: computational complexity, pseudorandomness, worst-case to average-case, self reductions, planted clique, hereditary graph family}
}
@InProceedings{essaidi_et_al:LIPIcs.ITCS.2022.66,
author = {Essaidi, Meryem and Ferreira, Matheus V. X. and Weinberg, S. Matthew},
title = {{Credible, Strategyproof, Optimal, and Bounded Expected-Round Single-Item Auctions for All Distributions}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {66:1--66:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.66},
URN = {urn:nbn:de:0030-drops-156621},
doi = {10.4230/LIPIcs.ITCS.2022.66},
annote = {Keywords: Credible Auctions, Cryptographically Secure, Single-Item}
}
@InProceedings{ezra_et_al:LIPIcs.ITCS.2022.67,
author = {Ezra, Michael and Rothblum, Ron D.},
title = {{Small Circuits Imply Efficient Arthur-Merlin Protocols}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {67:1--67:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.67},
URN = {urn:nbn:de:0030-drops-156635},
doi = {10.4230/LIPIcs.ITCS.2022.67},
annote = {Keywords: Circuits Complexity, Circuit Lower Bounds, Communication Complexity, Data Streaming, Arthur-Merlin games, Interactive Proofs}
}
@InProceedings{fawzi_et_al:LIPIcs.ITCS.2022.68,
author = {Fawzi, Omar and M\"{u}ller-Hermes, Alexander and Shayeghi, Ala},
title = {{A Lower Bound on the Space Overhead of Fault-Tolerant Quantum Computation}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {68:1--68:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.68},
URN = {urn:nbn:de:0030-drops-156649},
doi = {10.4230/LIPIcs.ITCS.2022.68},
annote = {Keywords: Fault-tolerant quantum computation, quantum error correction}
}
@InProceedings{fleming_et_al:LIPIcs.ITCS.2022.69,
author = {Fleming, Noah and G\"{o}\"{o}s, Mika and Grosser, Stefan and Robere, Robert},
title = {{On Semi-Algebraic Proofs and Algorithms}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {69:1--69:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.69},
URN = {urn:nbn:de:0030-drops-156658},
doi = {10.4230/LIPIcs.ITCS.2022.69},
annote = {Keywords: Proof Complexity, Extended Formulations, Circuit Complexity, Sherali-Adams}
}
@InProceedings{fleming_et_al:LIPIcs.ITCS.2022.70,
author = {Fleming, Noah and Pitassi, Toniann and Robere, Robert},
title = {{Extremely Deep Proofs}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {70:1--70:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.70},
URN = {urn:nbn:de:0030-drops-156665},
doi = {10.4230/LIPIcs.ITCS.2022.70},
annote = {Keywords: Proof Complexity, Tradeoffs, Resolution, Cutting Planes}
}
@InProceedings{fosli_et_al:LIPIcs.ITCS.2022.71,
author = {Fosli, Ingerid and Ishai, Yuval and Kolobov, Victor I. and Wootters, Mary},
title = {{On the Download Rate of Homomorphic Secret Sharing}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {71:1--71:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.71},
URN = {urn:nbn:de:0030-drops-156675},
doi = {10.4230/LIPIcs.ITCS.2022.71},
annote = {Keywords: Information-theoretic cryptography, homomorphic secret sharing, private information retrieval, secure multiparty computation, regenerating codes}
}
@InProceedings{frankl_et_al:LIPIcs.ITCS.2022.72,
author = {Frankl, Peter and Gryaznov, Svyatoslav and Talebanfard, Navid},
title = {{A Variant of the VC-Dimension with Applications to Depth-3 Circuits}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {72:1--72:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.72},
URN = {urn:nbn:de:0030-drops-156680},
doi = {10.4230/LIPIcs.ITCS.2022.72},
annote = {Keywords: VC-dimension, Hypergraph, Clique, Affine Disperser, Circuit}
}
@InProceedings{galeana_et_al:LIPIcs.ITCS.2022.73,
author = {Galeana, Hugo Rincon and Rajsbaum, Sergio and Schmid, Ulrich},
title = {{Continuous Tasks and the Asynchronous Computability Theorem}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {73:1--73:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.73},
URN = {urn:nbn:de:0030-drops-156696},
doi = {10.4230/LIPIcs.ITCS.2022.73},
annote = {Keywords: Wait-free computability, topology, distributed computing, decision tasks, shared memory}
}
@InProceedings{ganassali_et_al:LIPIcs.ITCS.2022.74,
author = {Ganassali, Luca and Massouli\'{e}, Laurent and Lelarge, Marc},
title = {{Correlation Detection in Trees for Planted Graph Alignment}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {74:1--74:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.74},
URN = {urn:nbn:de:0030-drops-156709},
doi = {10.4230/LIPIcs.ITCS.2022.74},
annote = {Keywords: inference on graphs, hypothesis testing, Erd\H{o}s-R\'{e}nyi random graphs}
}
@InProceedings{gharibian_et_al:LIPIcs.ITCS.2022.75,
author = {Gharibian, Sevag and Rudolph, Dorian},
title = {{On Polynomially Many Queries to NP or QMA Oracles}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {75:1--75:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.75},
URN = {urn:nbn:de:0030-drops-156717},
doi = {10.4230/LIPIcs.ITCS.2022.75},
annote = {Keywords: admissible weighting function, oracle complexity class, quantum complexity theory, Quantum Merlin Arthur (QMA), simulation of local measurement}
}
@InProceedings{girish_et_al:LIPIcs.ITCS.2022.76,
author = {Girish, Uma and Raz, Ran},
title = {{Eliminating Intermediate Measurements Using Pseudorandom Generators}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {76:1--76:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.76},
URN = {urn:nbn:de:0030-drops-156726},
doi = {10.4230/LIPIcs.ITCS.2022.76},
annote = {Keywords: quantum algorithms, intermediate measurements, deferred measurement, pseudorandom generator, INW generator}
}
@InProceedings{goldberg_et_al:LIPIcs.ITCS.2022.77,
author = {Goldberg, Guy and N. Rothblum, Guy},
title = {{Sample-Based Proofs of Proximity}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {77:1--77:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.77},
URN = {urn:nbn:de:0030-drops-156736},
doi = {10.4230/LIPIcs.ITCS.2022.77},
annote = {Keywords: Interactive Proof Systems, Sample-Based Access, Proofs of Proximity}
}
@InProceedings{goldreich_et_al:LIPIcs.ITCS.2022.78,
author = {Goldreich, Oded and Ron, Dana},
title = {{Testing Distributions of Huge Objects}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {78:1--78:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.78},
URN = {urn:nbn:de:0030-drops-156747},
doi = {10.4230/LIPIcs.ITCS.2022.78},
annote = {Keywords: Property Testing, Distributions}
}
@InProceedings{gopalan_et_al:LIPIcs.ITCS.2022.79,
author = {Gopalan, Parikshit and Kalai, Adam Tauman and Reingold, Omer and Sharan, Vatsal and Wieder, Udi},
title = {{Omnipredictors}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {79:1--79:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.79},
URN = {urn:nbn:de:0030-drops-156755},
doi = {10.4230/LIPIcs.ITCS.2022.79},
annote = {Keywords: Loss-minimzation, multi-group fairness, agnostic learning, boosting}
}
@InProceedings{gowers_et_al:LIPIcs.ITCS.2022.80,
author = {Gowers, W. T. and Viola, Emanuele},
title = {{Mixing in Non-Quasirandom Groups}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {80:1--80:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.80},
URN = {urn:nbn:de:0030-drops-156761},
doi = {10.4230/LIPIcs.ITCS.2022.80},
annote = {Keywords: Groups, representation theory, mixing, communication complexity, quasi-random}
}
@InProceedings{goyal_et_al:LIPIcs.ITCS.2022.81,
author = {Goyal, Vipul and Raizes, Justin and Soni, Pratik},
title = {{Time-Traveling Simulators Using Blockchains and Their Applications}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {81:1--81:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.81},
URN = {urn:nbn:de:0030-drops-156770},
doi = {10.4230/LIPIcs.ITCS.2022.81},
annote = {Keywords: Cryptography, Zero Knowledge, Secure Two-Party Computation, Blockchain}
}
@InProceedings{gupta_et_al:LIPIcs.ITCS.2022.82,
author = {Gupta, Varun and Jung, Christopher and Noarov, Georgy and Pai, Mallesh M. and Roth, Aaron},
title = {{Online Multivalid Learning: Means, Moments, and Prediction Intervals}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {82:1--82:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.82},
URN = {urn:nbn:de:0030-drops-156785},
doi = {10.4230/LIPIcs.ITCS.2022.82},
annote = {Keywords: Uncertainty Estimation, Calibration, Online Learning}
}
@InProceedings{hajiaghayi_et_al:LIPIcs.ITCS.2022.83,
author = {Hajiaghayi, MohammadTaghi and Knittel, Marina and Saleh, Hamed and Su, Hsin-Hao},
title = {{Adaptive Massively Parallel Constant-Round Tree Contraction}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {83:1--83:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.83},
URN = {urn:nbn:de:0030-drops-156790},
doi = {10.4230/LIPIcs.ITCS.2022.83},
annote = {Keywords: Adaptive Massively Parallel Computation, Tree Contraction, Matching, Independent Set, Tree Isomorphism}
}
@InProceedings{hirahara_et_al:LIPIcs.ITCS.2022.84,
author = {Hirahara, Shuichi and Santhanam, Rahul},
title = {{Errorless Versus Error-Prone Average-Case Complexity}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {84:1--84:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.84},
URN = {urn:nbn:de:0030-drops-156803},
doi = {10.4230/LIPIcs.ITCS.2022.84},
annote = {Keywords: average-case complexity, instance checker, pseudorandomness}
}
@InProceedings{hirahara_et_al:LIPIcs.ITCS.2022.85,
author = {Hirahara, Shuichi and Santhanam, Rahul},
title = {{Excluding PH Pessiland}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {85:1--85:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.85},
URN = {urn:nbn:de:0030-drops-156819},
doi = {10.4230/LIPIcs.ITCS.2022.85},
annote = {Keywords: average-case complexity, pseudorandomness, meta-complexity}
}
@InProceedings{hosseini_et_al:LIPIcs.ITCS.2022.86,
author = {Hosseini, Mojtaba and Vazirani, Vijay V.},
title = {{Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {86:1--86:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.86},
URN = {urn:nbn:de:0030-drops-156821},
doi = {10.4230/LIPIcs.ITCS.2022.86},
annote = {Keywords: Matching-based market design, Nash bargaining, convex optimization, Frank-Wolfe algorithm, cutting planes, general equilibrium theory, one-sided markets, two-sided markets}
}
@InProceedings{ivanyos_et_al:LIPIcs.ITCS.2022.87,
author = {Ivanyos, G\'{a}bor and Mittal, Tushant and Qiao, Youming},
title = {{Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {87:1--87:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.87},
URN = {urn:nbn:de:0030-drops-156837},
doi = {10.4230/LIPIcs.ITCS.2022.87},
annote = {Keywords: derandomization, polynomial identity testing, symbolic determinant, non-commutative rank, Lie algebras}
}
@InProceedings{jeronimo_et_al:LIPIcs.ITCS.2022.88,
author = {Jeronimo, Fernando Granha and Mittal, Tushant and O'Donnell, Ryan and Paredes, Pedro and Tulsiani, Madhur},
title = {{Explicit Abelian Lifts and Quantum LDPC Codes}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {88:1--88:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.88},
URN = {urn:nbn:de:0030-drops-156846},
doi = {10.4230/LIPIcs.ITCS.2022.88},
annote = {Keywords: Graph lifts, expander graphs, quasi-cyclic LDPC codes, quantum LDPC codes}
}
@InProceedings{jones_et_al:LIPIcs.ITCS.2022.89,
author = {Jones, Chris and Potechin, Aaron},
title = {{Almost-Orthogonal Bases for Inner Product Polynomials}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {89:1--89:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.89},
URN = {urn:nbn:de:0030-drops-156853},
doi = {10.4230/LIPIcs.ITCS.2022.89},
annote = {Keywords: Orthogonal polynomials, Fourier analysis, combinatorics}
}
@InProceedings{kalemaj_et_al:LIPIcs.ITCS.2022.90,
author = {Kalemaj, Iden and Raskhodnikova, Sofya and Varma, Nithin},
title = {{Sublinear-Time Computation in the Presence of Online Erasures}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {90:1--90:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.90},
URN = {urn:nbn:de:0030-drops-156867},
doi = {10.4230/LIPIcs.ITCS.2022.90},
annote = {Keywords: Randomized algorithms, property testing, Fourier analysis, linear functions, quadratic functions, Lipschitz and monotone functions, sorted sequences}
}
@InProceedings{kapralov_et_al:LIPIcs.ITCS.2022.91,
author = {Kapralov, Michael and Musipatla, Amulya and Tardos, Jakab and Woodruff, David P. and Zhou, Samson},
title = {{Noisy Boolean Hidden Matching with Applications}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {91:1--91:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.91},
URN = {urn:nbn:de:0030-drops-156876},
doi = {10.4230/LIPIcs.ITCS.2022.91},
annote = {Keywords: Boolean Hidden Matching, Lower Bounds, Communication Complexity, Streaming Algorithms}
}
@InProceedings{karni_et_al:LIPIcs.ITCS.2022.92,
author = {Karni, Gili and Rothblum, Guy N. and Yona, Gal},
title = {{On Fairness and Stability in Two-Sided Matchings}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {92:1--92:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.92},
URN = {urn:nbn:de:0030-drops-156880},
doi = {10.4230/LIPIcs.ITCS.2022.92},
annote = {Keywords: algorithmic fairness}
}
@InProceedings{khanna_et_al:LIPIcs.ITCS.2022.93,
author = {Khanna, Sanjeev and Konrad, Christian},
title = {{Optimal Bounds for Dominating Set in Graph Streams}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {93:1--93:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.93},
URN = {urn:nbn:de:0030-drops-156894},
doi = {10.4230/LIPIcs.ITCS.2022.93},
annote = {Keywords: Streaming algorithms, communication complexity, information complexity, dominating set}
}
@InProceedings{kiss:LIPIcs.ITCS.2022.94,
author = {Kiss, Peter},
title = {{Deterministic Dynamic Matching in Worst-Case Update Time}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {94:1--94:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.94},
URN = {urn:nbn:de:0030-drops-156909},
doi = {10.4230/LIPIcs.ITCS.2022.94},
annote = {Keywords: Dynamic Algorithms, Matching, Approximate Matching, EDCS}
}
@InProceedings{kong:LIPIcs.ITCS.2022.95,
author = {Kong, Yuqing},
title = {{More Dominantly Truthful Multi-Task Peer Prediction with a Finite Number of Tasks}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {95:1--95:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.95},
URN = {urn:nbn:de:0030-drops-156912},
doi = {10.4230/LIPIcs.ITCS.2022.95},
annote = {Keywords: Information elicitation, information theory}
}
@InProceedings{le_et_al:LIPIcs.ITCS.2022.96,
author = {Le, Hung and Milenkovi\'{c}, Lazar and Solomon, Shay and Vassilevska Williams, Virginia},
title = {{Dynamic Matching Algorithms Under Vertex Updates}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {96:1--96:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.96},
URN = {urn:nbn:de:0030-drops-156923},
doi = {10.4230/LIPIcs.ITCS.2022.96},
annote = {Keywords: maximal matching, approximate matching, dynamic algorithm, vertex updates}
}
@InProceedings{legall_et_al:LIPIcs.ITCS.2022.97,
author = {Le Gall, Fran\c{c}ois and Seddighin, Saeed},
title = {{Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {97:1--97:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.97},
URN = {urn:nbn:de:0030-drops-156934},
doi = {10.4230/LIPIcs.ITCS.2022.97},
annote = {Keywords: Longest common substring, Longest palindrome substring, Quantum algorithms, Sublinear algorithms}
}
@InProceedings{lee_et_al:LIPIcs.ITCS.2022.98,
author = {Lee, Jasper C.H. and Valiant, Paul},
title = {{Optimal Sub-Gaussian Mean Estimation in Very High Dimensions}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {98:1--98:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.98},
URN = {urn:nbn:de:0030-drops-156942},
doi = {10.4230/LIPIcs.ITCS.2022.98},
annote = {Keywords: High-dimensional mean estimation}
}
@InProceedings{lindermayr_et_al:LIPIcs.ITCS.2022.99,
author = {Lindermayr, Alexander and Megow, Nicole and Simon, Bertrand},
title = {{Double Coverage with Machine-Learned Advice}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {99:1--99:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.99},
URN = {urn:nbn:de:0030-drops-156954},
doi = {10.4230/LIPIcs.ITCS.2022.99},
annote = {Keywords: online k-server problem, competitive analysis, learning-augmented algorithms, untrusted predictions, consistency, robustness}
}
@InProceedings{liu_et_al:LIPIcs.ITCS.2022.100,
author = {Liu, Jiahui and Liu, Qipeng and Qian, Luowen},
title = {{Beating Classical Impossibility of Position Verification}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {100:1--100:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.100},
URN = {urn:nbn:de:0030-drops-156963},
doi = {10.4230/LIPIcs.ITCS.2022.100},
annote = {Keywords: cryptographic protocol, position verification, quantum cryptography, proof of quantumness, non-locality}
}
@InProceedings{liu_et_al:LIPIcs.ITCS.2022.101,
author = {Liu, Yang P. and Sah, Ashwin and Sawhney, Mehtaab},
title = {{A Gaussian Fixed Point Random Walk}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {101:1--101:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.101},
URN = {urn:nbn:de:0030-drops-156975},
doi = {10.4230/LIPIcs.ITCS.2022.101},
annote = {Keywords: Discrepancy, Partial Coloring}
}
@InProceedings{lombardi_et_al:LIPIcs.ITCS.2022.102,
author = {Lombardi, Alex and Vaikuntanathan, Vinod},
title = {{Correlation-Intractable Hash Functions via Shift-Hiding}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {102:1--102:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.102},
URN = {urn:nbn:de:0030-drops-156981},
doi = {10.4230/LIPIcs.ITCS.2022.102},
annote = {Keywords: Cryptographic hash functions, correlation intractability}
}
@InProceedings{los_et_al:LIPIcs.ITCS.2022.103,
author = {Los, Dimitrios and Sauerwald, Thomas},
title = {{Balanced Allocations with Incomplete Information: The Power of Two Queries}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {103:1--103:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.103},
URN = {urn:nbn:de:0030-drops-156994},
doi = {10.4230/LIPIcs.ITCS.2022.103},
annote = {Keywords: power-of-two-choices, balanced allocations, potential functions, thinning}
}
@InProceedings{lovett_et_al:LIPIcs.ITCS.2022.104,
author = {Lovett, Shachar and Meka, Raghu and Mertz, Ian and Pitassi, Toniann and Zhang, Jiapeng},
title = {{Lifting with Sunflowers}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {104:1--104:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.104},
URN = {urn:nbn:de:0030-drops-157004},
doi = {10.4230/LIPIcs.ITCS.2022.104},
annote = {Keywords: Lifting theorems, communication complexity, combinatorics, sunflowers}
}
@InProceedings{mao_et_al:LIPIcs.ITCS.2022.105,
author = {Mao, Jieming and Paes Leme, Renato and Wang, Kangning},
title = {{Interactive Communication in Bilateral Trade}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {105:1--105:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.105},
URN = {urn:nbn:de:0030-drops-157014},
doi = {10.4230/LIPIcs.ITCS.2022.105},
annote = {Keywords: Bayesian persuasion, bilateral trade, information design}
}
@InProceedings{mazumdar_et_al:LIPIcs.ITCS.2022.106,
author = {Mazumdar, Arya and Pal, Soumyabrata},
title = {{Support Recovery in Universal One-Bit Compressed Sensing}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {106:1--106:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.106},
URN = {urn:nbn:de:0030-drops-157028},
doi = {10.4230/LIPIcs.ITCS.2022.106},
annote = {Keywords: Superset Recovery, Approximate Support Recovery, List union-free family, Descartes’ rule of signs}
}
@InProceedings{menuhin_et_al:LIPIcs.ITCS.2022.107,
author = {Menuhin, Boaz and Naor, Moni},
title = {{Keep That Card in Mind: Card Guessing with Limited Memory}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {107:1--107:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.107},
URN = {urn:nbn:de:0030-drops-157039},
doi = {10.4230/LIPIcs.ITCS.2022.107},
annote = {Keywords: Adaptivity vs Non-adaptivity, Adversarial Robustness, Card Guessing, Compression Argument, Information Theory, Streaming Algorithms, Two Player Game}
}
@InProceedings{narayanan_et_al:LIPIcs.ITCS.2022.108,
author = {Narayanan, Hariharan and Shah, Rikhav and Srivastava, Nikhil},
title = {{A Spectral Approach to Polytope Diameter}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {108:1--108:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.108},
URN = {urn:nbn:de:0030-drops-157044},
doi = {10.4230/LIPIcs.ITCS.2022.108},
annote = {Keywords: Polytope diameter, Markov Chain}
}
@InProceedings{oleskertaylor_et_al:LIPIcs.ITCS.2022.109,
author = {Olesker-Taylor, Sam and Zanetti, Luca},
title = {{Geometric Bounds on the Fastest Mixing Markov Chain}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {109:1--109:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.109},
URN = {urn:nbn:de:0030-drops-157051},
doi = {10.4230/LIPIcs.ITCS.2022.109},
annote = {Keywords: mixing time, random walks, conductance, fastest mixing Markov chain}
}
@InProceedings{peleg_et_al:LIPIcs.ITCS.2022.110,
author = {Peleg, Shir and Volk, Ben Lee and Shpilka, Amir},
title = {{Lower Bounds on Stabilizer Rank}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {110:1--110:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.110},
URN = {urn:nbn:de:0030-drops-157063},
doi = {10.4230/LIPIcs.ITCS.2022.110},
annote = {Keywords: Quantum Computation, Lower Bounds, Stabilizer rank, Simulation of Quantum computers}
}
@InProceedings{roghani_et_al:LIPIcs.ITCS.2022.111,
author = {Roghani, Mohammad and Saberi, Amin and Wajc, David},
title = {{Beating the Folklore Algorithm for Dynamic Matching}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {111:1--111:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.111},
URN = {urn:nbn:de:0030-drops-157077},
doi = {10.4230/LIPIcs.ITCS.2022.111},
annote = {Keywords: dynamic matching, dynamic graph algorithms, sublinear algorithms}
}
@InProceedings{rosenthal_et_al:LIPIcs.ITCS.2022.112,
author = {Rosenthal, Gregory and Yuen, Henry},
title = {{Interactive Proofs for Synthesizing Quantum States and Unitaries}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {112:1--112:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.112},
URN = {urn:nbn:de:0030-drops-157086},
doi = {10.4230/LIPIcs.ITCS.2022.112},
annote = {Keywords: interactive proofs, quantum state complexity, quantum unitary complexity}
}
@InProceedings{rubinstein_et_al:LIPIcs.ITCS.2022.113,
author = {Rubinstein, Aviad and Zhao, Junyao},
title = {{Budget-Smoothed Analysis for Submodular Maximization}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {113:1--113:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.113},
URN = {urn:nbn:de:0030-drops-157095},
doi = {10.4230/LIPIcs.ITCS.2022.113},
annote = {Keywords: Submodular optimization, Beyond worst-case analysis, Greedy algorithms, Hardness of approximation}
}
@InProceedings{scully_et_al:LIPIcs.ITCS.2022.114,
author = {Scully, Ziv and Grosof, Isaac and Mitzenmacher, Michael},
title = {{Uniform Bounds for Scheduling with Job Size Estimates}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {114:1--114:30},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.114},
URN = {urn:nbn:de:0030-drops-157108},
doi = {10.4230/LIPIcs.ITCS.2022.114},
annote = {Keywords: Scheduling, queueing systems, algorithms with predictions, shortest remaining processing time (SRPT), preemptive shortest job first (PSJF), M/G/1 queue}
}
@InProceedings{seddighin_et_al:LIPIcs.ITCS.2022.115,
author = {Seddighin, Masoud and Seddighin, Saeed},
title = {{3+\epsilon Approximation of Tree Edit Distance in Truly Subquadratic Time}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {115:1--115:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.115},
URN = {urn:nbn:de:0030-drops-157116},
doi = {10.4230/LIPIcs.ITCS.2022.115},
annote = {Keywords: tree edit distance, approximation, subquadratic, edit distance}
}
@InProceedings{shaltiel_et_al:LIPIcs.ITCS.2022.116,
author = {Shaltiel, Ronen and Viola, Emanuele},
title = {{On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {116:1--116:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.116},
URN = {urn:nbn:de:0030-drops-157122},
doi = {10.4230/LIPIcs.ITCS.2022.116},
annote = {Keywords: Complexity Theory, Derandomization, Pseudorandom generators, Black-box proofs}
}
@InProceedings{shutty_et_al:LIPIcs.ITCS.2022.117,
author = {Shutty, Noah and Wootters, Mary},
title = {{Low-Bandwidth Recovery of Linear Functions of Reed-Solomon-Encoded Data}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {117:1--117:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.117},
URN = {urn:nbn:de:0030-drops-157130},
doi = {10.4230/LIPIcs.ITCS.2022.117},
annote = {Keywords: Reed-Solomon Codes, Regenerating Codes, Coded Computation}
}
@InProceedings{sinha:LIPIcs.ITCS.2022.118,
author = {Sinha, Gaurav},
title = {{Efficient Reconstruction of Depth Three Arithmetic Circuits with Top Fan-In Two}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {118:1--118:33},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.118},
URN = {urn:nbn:de:0030-drops-157143},
doi = {10.4230/LIPIcs.ITCS.2022.118},
annote = {Keywords: Arithmetic Circuits, Circuit Reconstruction}
}
@InProceedings{vanmelkebeek_et_al:LIPIcs.ITCS.2022.119,
author = {van Melkebeek, Dieter and Morgan, Andrew},
title = {{Polynomial Identity Testing via Evaluation of Rational Functions}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {119:1--119:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.119},
URN = {urn:nbn:de:0030-drops-157158},
doi = {10.4230/LIPIcs.ITCS.2022.119},
annote = {Keywords: Derandomization, Gr\"{o}bner Basis, Lower Bounds, Polynomial Identity Testing}
}
@InProceedings{wang_et_al:LIPIcs.ITCS.2022.120,
author = {Wang, Weina and Gupta, Anupam and Williams, Jalani K.},
title = {{Probing to Minimize}},
booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)},
pages = {120:1--120:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-217-4},
ISSN = {1868-8969},
year = {2022},
volume = {215},
editor = {Braverman, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.120},
URN = {urn:nbn:de:0030-drops-157169},
doi = {10.4230/LIPIcs.ITCS.2022.120},
annote = {Keywords: approximation algorithms, stochastic probing, minimization}
}
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