@Proceedings{taumankalai:LIPIcs.ITCS.2023,
title = {{LIPIcs, Volume 251, ITCS 2023, Complete Volume}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {1--2102},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023},
URN = {urn:nbn:de:0030-drops-175027},
doi = {10.4230/LIPIcs.ITCS.2023},
annote = {Keywords: LIPIcs, Volume 251, ITCS 2023, Complete Volume}
}
@InProceedings{taumankalai:LIPIcs.ITCS.2023.0,
author = {Tauman Kalai, Yael},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {0:i--0:xxii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.0},
URN = {urn:nbn:de:0030-drops-175039},
doi = {10.4230/LIPIcs.ITCS.2023.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{abboud_et_al:LIPIcs.ITCS.2023.1,
author = {Abboud, Amir and Wallheimer, Nathan},
title = {{Worst-Case to Expander-Case Reductions}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {1:1--1:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.1},
URN = {urn:nbn:de:0030-drops-175044},
doi = {10.4230/LIPIcs.ITCS.2023.1},
annote = {Keywords: Fine-Grained Complexity, Expander Decomposition, Reductions, Exact and Parameterized Complexity, Expander Graphs, Triangle, Maximum Matching, Clique, 4-Cycle, Vertex Cover, Dominating Set}
}
@InProceedings{abdolazimi_et_al:LIPIcs.ITCS.2023.2,
author = {Abdolazimi, Dorna and Karlin, Anna R. and Klein, Nathan and Oveis Gharan, Shayan},
title = {{Matroid Partition Property and the Secretary Problem}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {2:1--2:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.2},
URN = {urn:nbn:de:0030-drops-175051},
doi = {10.4230/LIPIcs.ITCS.2023.2},
annote = {Keywords: Online algorithms, Matroids, Matroid secretary problem}
}
@InProceedings{allender_et_al:LIPIcs.ITCS.2023.3,
author = {Allender, Eric and Hirahara, Shuichi and Tirumala, Harsha},
title = {{Kolmogorov Complexity Characterizes Statistical Zero Knowledge}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {3:1--3:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.3},
URN = {urn:nbn:de:0030-drops-175063},
doi = {10.4230/LIPIcs.ITCS.2023.3},
annote = {Keywords: Kolmogorov Complexity, Interactive Proofs}
}
@InProceedings{andoni_et_al:LIPIcs.ITCS.2023.4,
author = {Andoni, Alexandr and B{\l}asiok, Jaros{\l}aw and Filtser, Arnold},
title = {{Communication Complexity of Inner Product in Symmetric Normed Spaces}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {4:1--4:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.4},
URN = {urn:nbn:de:0030-drops-175077},
doi = {10.4230/LIPIcs.ITCS.2023.4},
annote = {Keywords: communication complexity, symmetric norms}
}
@InProceedings{anshu_et_al:LIPIcs.ITCS.2023.5,
author = {Anshu, Anurag and Metger, Tony},
title = {{Concentration Bounds for Quantum States and Limitations on the QAOA from Polynomial Approximations}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {5:1--5:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.5},
URN = {urn:nbn:de:0030-drops-175085},
doi = {10.4230/LIPIcs.ITCS.2023.5},
annote = {Keywords: quantum computing, polynomial approximation, quantum optimization algorithm, QAOA, overlap gap property}
}
@InProceedings{arvind_et_al:LIPIcs.ITCS.2023.6,
author = {Arvind, V. and Chatterjee, Abhranil and Ghosal, Utsab and Mukhopadhyay, Partha and Ramya, C.},
title = {{On Identity Testing and Noncommutative Rank Computation over the Free Skew Field}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {6:1--6:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.6},
URN = {urn:nbn:de:0030-drops-175093},
doi = {10.4230/LIPIcs.ITCS.2023.6},
annote = {Keywords: Algebraic Complexity, Identity Testing, Non-commutative rank}
}
@InProceedings{assadi_et_al:LIPIcs.ITCS.2023.7,
author = {Assadi, Sepehr and Bernstein, Aaron and Langley, Zachary},
title = {{All-Norm Load Balancing in Graph Streams via the Multiplicative Weights Update Method}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {7:1--7:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.7},
URN = {urn:nbn:de:0030-drops-175106},
doi = {10.4230/LIPIcs.ITCS.2023.7},
annote = {Keywords: Load Balancing, Semi-Streaming Algorithms, Semi-Matching}
}
@InProceedings{attias_et_al:LIPIcs.ITCS.2023.8,
author = {Attias, Idan and Cohen, Edith and Shechner, Moshe and Stemmer, Uri},
title = {{A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.8},
URN = {urn:nbn:de:0030-drops-175115},
doi = {10.4230/LIPIcs.ITCS.2023.8},
annote = {Keywords: Streaming, adversarial robustness, differential privacy}
}
@InProceedings{babaioff_et_al:LIPIcs.ITCS.2023.9,
author = {Babaioff, Moshe and Immorlica, Nicole and Li, Yingkai and Lucier, Brendan},
title = {{Making Auctions Robust to Aftermarkets}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {9:1--9:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.9},
URN = {urn:nbn:de:0030-drops-175122},
doi = {10.4230/LIPIcs.ITCS.2023.9},
annote = {Keywords: carbon markets, aftermarkets, price of anarchy, multi-unit auctions, posted prices}
}
@InProceedings{baig_et_al:LIPIcs.ITCS.2023.10,
author = {Baig, Mirza Ahad and Chakraborty, Suvradip and Dziembowski, Stefan and Ga{\l}\k{a}zka, Ma{\l}gorzata and Lizurej, Tomasz and Pietrzak, Krzysztof},
title = {{Efficiently Testable Circuits}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {10:1--10:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.10},
URN = {urn:nbn:de:0030-drops-175130},
doi = {10.4230/LIPIcs.ITCS.2023.10},
annote = {Keywords: circuit compilers, circuit integrity, circuit testing}
}
@InProceedings{balkanski_et_al:LIPIcs.ITCS.2023.11,
author = {Balkanski, Eric and Gkatzelis, Vasilis and Tan, Xizhi},
title = {{Strategyproof Scheduling with Predictions}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {11:1--11:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.11},
URN = {urn:nbn:de:0030-drops-175143},
doi = {10.4230/LIPIcs.ITCS.2023.11},
annote = {Keywords: Mechanism Design with Predictions, Strategyproof Scheduling}
}
@InProceedings{banerjee_et_al:LIPIcs.ITCS.2023.12,
author = {Banerjee, Siddhartha and Cohen-Addad, Vincent and Gupta, Anupam and Li, Zhouzi},
title = {{Graph Searching with Predictions}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {12:1--12:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.12},
URN = {urn:nbn:de:0030-drops-175158},
doi = {10.4230/LIPIcs.ITCS.2023.12},
annote = {Keywords: Algorithms with predictions, network algorithms, graph search}
}
@InProceedings{bauer_et_al:LIPIcs.ITCS.2023.13,
author = {Bauer, Ulrich and Rathod, Abhishek and Zehavi, Meirav},
title = {{On Computing Homological Hitting Sets}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {13:1--13:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.13},
URN = {urn:nbn:de:0030-drops-175169},
doi = {10.4230/LIPIcs.ITCS.2023.13},
annote = {Keywords: Algorithmic topology, Cut problems, Surfaces, Parameterized complexity}
}
@InProceedings{beame_et_al:LIPIcs.ITCS.2023.14,
author = {Beame, Paul and Koroth, Sajin},
title = {{On Disperser/Lifting Properties of the Index and Inner-Product Functions}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {14:1--14:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.14},
URN = {urn:nbn:de:0030-drops-175172},
doi = {10.4230/LIPIcs.ITCS.2023.14},
annote = {Keywords: Decision trees, communication complexity, lifting theorems, proof complexity}
}
@InProceedings{beneliezer_et_al:LIPIcs.ITCS.2023.15,
author = {Ben-Eliezer, Omri and Mikulincer, Dan and Mossel, Elchanan and Sudan, Madhu},
title = {{Is This Correct? Let’s Check!}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {15:1--15:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.15},
URN = {urn:nbn:de:0030-drops-175180},
doi = {10.4230/LIPIcs.ITCS.2023.15},
annote = {Keywords: Error Propagation, Preferential Attachment}
}
@InProceedings{bhaskara_et_al:LIPIcs.ITCS.2023.16,
author = {Bhaskara, Aditya and Gollapudi, Sreenivas and Im, Sungjin and Kollias, Kostas and Munagala, Kamesh},
title = {{Online Learning and Bandits with Queried Hints}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {16:1--16:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.16},
URN = {urn:nbn:de:0030-drops-175197},
doi = {10.4230/LIPIcs.ITCS.2023.16},
annote = {Keywords: Online learning, multi-armed bandits, regret}
}
@InProceedings{bitansky_et_al:LIPIcs.ITCS.2023.17,
author = {Bitansky, Nir and Solomon, Tomer},
title = {{Bootstrapping Homomorphic Encryption via Functional Encryption}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {17:1--17:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.17},
URN = {urn:nbn:de:0030-drops-175200},
doi = {10.4230/LIPIcs.ITCS.2023.17},
annote = {Keywords: Fully Homomorphic Encryption, Polynomial Assumptions, Cryptographic Puzzles}
}
@InProceedings{blanc_et_al:LIPIcs.ITCS.2023.18,
author = {Blanc, Guy and Koch, Caleb and Lange, Jane and Strassle, Carmen and Tan, Li-Yang},
title = {{Certification with an NP Oracle}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {18:1--18:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.18},
URN = {urn:nbn:de:0030-drops-175217},
doi = {10.4230/LIPIcs.ITCS.2023.18},
annote = {Keywords: Certificate complexity, Boolean functions, polynomial hierarchy, hardness of approximation}
}
@InProceedings{blasiak_et_al:LIPIcs.ITCS.2023.19,
author = {Blasiak, Jonah and Cohn, Henry and Grochow, Joshua A. and Pratt, Kevin and Umans, Chris},
title = {{Matrix Multiplication via Matrix Groups}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {19:1--19:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.19},
URN = {urn:nbn:de:0030-drops-175226},
doi = {10.4230/LIPIcs.ITCS.2023.19},
annote = {Keywords: Fast matrix multiplication, representation theory, matrix groups}
}
@InProceedings{bodwin_et_al:LIPIcs.ITCS.2023.20,
author = {Bodwin, Greg and Dinitz, Michael and Nazari, Yasamin},
title = {{Epic Fail: Emulators Can Tolerate Polynomially Many Edge Faults for Free}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {20:1--20:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.20},
URN = {urn:nbn:de:0030-drops-175231},
doi = {10.4230/LIPIcs.ITCS.2023.20},
annote = {Keywords: Emulators, Fault Tolerance, Girth Conjecture}
}
@InProceedings{bodwin_et_al:LIPIcs.ITCS.2023.21,
author = {Bodwin, Greg and Zhang, Forest},
title = {{Opponent Indifference in Rating Systems: A Theoretical Case for Sonas}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {21:1--21:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.21},
URN = {urn:nbn:de:0030-drops-175242},
doi = {10.4230/LIPIcs.ITCS.2023.21},
annote = {Keywords: Rating systems, opponent indifference, incentive compatibility, mechanism design, game theory}
}
@InProceedings{bourneuf_et_al:LIPIcs.ITCS.2023.22,
author = {Bourneuf, Romain and Folwarczn\'{y}, Luk\'{a}\v{s} and Hub\'{a}\v{c}ek, Pavel and Rosen, Alon and Schwartzbach, Nikolaj I.},
title = {{PPP-Completeness and Extremal Combinatorics}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {22:1--22:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.22},
URN = {urn:nbn:de:0030-drops-175255},
doi = {10.4230/LIPIcs.ITCS.2023.22},
annote = {Keywords: total search problems, extremal combinatorics, PPP-completeness}
}
@InProceedings{boyle_et_al:LIPIcs.ITCS.2023.23,
author = {Boyle, Elette and Ishai, Yuval and Meyer, Pierre and Robere, Robert and Yehuda, Gal},
title = {{On Low-End Obfuscation and Learning}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {23:1--23:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.23},
URN = {urn:nbn:de:0030-drops-175265},
doi = {10.4230/LIPIcs.ITCS.2023.23},
annote = {Keywords: Indistinguishability obfuscation, cryptography, learning}
}
@InProceedings{brakerski_et_al:LIPIcs.ITCS.2023.24,
author = {Brakerski, Zvika and Canetti, Ran and Qian, Luowen},
title = {{On the Computational Hardness Needed for Quantum Cryptography}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {24:1--24:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.24},
URN = {urn:nbn:de:0030-drops-175278},
doi = {10.4230/LIPIcs.ITCS.2023.24},
annote = {Keywords: quantum cryptography, efi, commitment scheme, oblivious transfer, zero knowledge, secure multiparty computation}
}
@InProceedings{braverman_et_al:LIPIcs.ITCS.2023.25,
author = {Braverman, Mark and Khot, Subhash and Kindler, Guy and Minzer, Dor},
title = {{Improved Monotonicity Testers via Hypercube Embeddings}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {25:1--25:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.25},
URN = {urn:nbn:de:0030-drops-175285},
doi = {10.4230/LIPIcs.ITCS.2023.25},
annote = {Keywords: Property Testing, Monotonicity Testing, Isoperimetric Inequalities}
}
@InProceedings{braverman_et_al:LIPIcs.ITCS.2023.26,
author = {Braverman, Mark and Minzer, Dor},
title = {{Rounding via Low Dimensional Embeddings}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {26:1--26:30},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.26},
URN = {urn:nbn:de:0030-drops-175291},
doi = {10.4230/LIPIcs.ITCS.2023.26},
annote = {Keywords: Parallel Repetition, Small Set Expanders, Semi-Definite Programs}
}
@InProceedings{bressan_et_al:LIPIcs.ITCS.2023.27,
author = {Bressan, Marco and Goldberg, Leslie Ann and Meeks, Kitty and Roth, Marc},
title = {{Counting Subgraphs in Somewhere Dense Graphs}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.27},
URN = {urn:nbn:de:0030-drops-175304},
doi = {10.4230/LIPIcs.ITCS.2023.27},
annote = {Keywords: counting problems, somewhere dense graphs, parameterised complexity theory}
}
@InProceedings{broadbent_et_al:LIPIcs.ITCS.2023.28,
author = {Broadbent, Anne and Culf, Eric},
title = {{Rigidity for Monogamy-Of-Entanglement Games}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {28:1--28:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.28},
URN = {urn:nbn:de:0030-drops-175319},
doi = {10.4230/LIPIcs.ITCS.2023.28},
annote = {Keywords: Rigidity, Self-Testing Monogamy-of-Entanglement Games, Bit Commitment, Randomness Expansion}
}
@InProceedings{buhrman_et_al:LIPIcs.ITCS.2023.29,
author = {Buhrman, Harry and Linden, Noah and Man\v{c}inska, Laura and Montanaro, Ashley and Ozols, Maris},
title = {{Quantum Majority Vote}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {29:1--29:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.29},
URN = {urn:nbn:de:0030-drops-175321},
doi = {10.4230/LIPIcs.ITCS.2023.29},
annote = {Keywords: quantum algorithms, quantum majority vote, Schur-Weyl duality}
}
@InProceedings{buss_et_al:LIPIcs.ITCS.2023.30,
author = {Buss, Sam and Fleming, Noah and Impagliazzo, Russell},
title = {{TFNP Characterizations of Proof Systems and Monotone Circuits}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {30:1--30:40},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.30},
URN = {urn:nbn:de:0030-drops-175332},
doi = {10.4230/LIPIcs.ITCS.2023.30},
annote = {Keywords: Proof Complexity, Circuit Complexity, TFNP}
}
@InProceedings{chakraborty_et_al:LIPIcs.ITCS.2023.31,
author = {Chakraborty, Diptarka and Das, Debarati and Krauthgamer, Robert},
title = {{Clustering Permutations: New Techniques with Streaming Applications}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {31:1--31:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.31},
URN = {urn:nbn:de:0030-drops-175340},
doi = {10.4230/LIPIcs.ITCS.2023.31},
annote = {Keywords: Clustering, Approximation Algorithms, Ulam Distance, Rank Aggregation, Streaming}
}
@InProceedings{chakraborty_et_al:LIPIcs.ITCS.2023.32,
author = {Chakraborty, Sourav and G\'{a}l, Anna and Laplante, Sophie and Mittal, Rajat and Sunny, Anupa},
title = {{Certificate Games}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {32:1--32:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.32},
URN = {urn:nbn:de:0030-drops-175353},
doi = {10.4230/LIPIcs.ITCS.2023.32},
annote = {Keywords: block sensitivity, boolean function complexity, certificate complexity, query complexity, sensitivity, zero-communication two-player games}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.ITCS.2023.33,
author = {Chattopadhyay, Arkadev and Mande, Nikhil S. and Sanyal, Swagato and Sherif, Suhail},
title = {{Lifting to Parity Decision Trees via Stifling}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {33:1--33:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.33},
URN = {urn:nbn:de:0030-drops-175362},
doi = {10.4230/LIPIcs.ITCS.2023.33},
annote = {Keywords: Decision trees, parity decision trees, lifting theorems}
}
@InProceedings{chen:LIPIcs.ITCS.2023.34,
author = {Chen, Lijie},
title = {{New Lower Bounds and Derandomization for ACC, and a Derandomization-Centric View on the Algorithmic Method}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.34},
URN = {urn:nbn:de:0030-drops-175373},
doi = {10.4230/LIPIcs.ITCS.2023.34},
annote = {Keywords: Circuit Lower Bounds, Derandomization, Algorithmic Method, ACC}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2023.35,
author = {Chen, Lijie and Williams, Ryan and Yang, Tianqi},
title = {{Black-Box Constructive Proofs Are Unavoidable}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {35:1--35:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.35},
URN = {urn:nbn:de:0030-drops-175380},
doi = {10.4230/LIPIcs.ITCS.2023.35},
annote = {Keywords: Circuit lower bounds, natural proofs, probabilistic checkable proofs}
}
@InProceedings{cheu_et_al:LIPIcs.ITCS.2023.36,
author = {Cheu, Albert and Yan, Chao},
title = {{Necessary Conditions in Multi-Server Differential Privacy}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {36:1--36:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.36},
URN = {urn:nbn:de:0030-drops-175395},
doi = {10.4230/LIPIcs.ITCS.2023.36},
annote = {Keywords: Differential Privacy, Parity Learning, Multi-server}
}
@InProceedings{childs_et_al:LIPIcs.ITCS.2023.37,
author = {Childs, Andrew M. and Coudron, Matthew and Gilani, Amin Shiraz},
title = {{Quantum Algorithms and the Power of Forgetting}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {37:1--37:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.37},
URN = {urn:nbn:de:0030-drops-175408},
doi = {10.4230/LIPIcs.ITCS.2023.37},
annote = {Keywords: Quantum algorithms, quantum query complexity}
}
@InProceedings{chuzhoy_et_al:LIPIcs.ITCS.2023.38,
author = {Chuzhoy, Julia and Dalirrooyfard, Mina and Grinberg, Vadim and Tan, Zihan},
title = {{A New Conjecture on Hardness of 2-CSP’s with Implications to Hardness of Densest k-Subgraph and Other Problems}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {38:1--38:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.38},
URN = {urn:nbn:de:0030-drops-175411},
doi = {10.4230/LIPIcs.ITCS.2023.38},
annote = {Keywords: Hardness of Approximation, Densest k-Subgraph}
}
@InProceedings{cohen_et_al:LIPIcs.ITCS.2023.39,
author = {Cohen, Edith and Lyu, Xin and Nelson, Jelani and Sarl\'{o}s, Tam\'{a}s and Stemmer, Uri},
title = {{Generalized Private Selection and Testing with High Confidence}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {39:1--39:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.39},
URN = {urn:nbn:de:0030-drops-175426},
doi = {10.4230/LIPIcs.ITCS.2023.39},
annote = {Keywords: differential privacy, sparse vector technique, adaptive data analysis}
}
@InProceedings{coregliano_et_al:LIPIcs.ITCS.2023.40,
author = {Coregliano, Leonardo Nagami and Jeronimo, Fernando Granha and Jones, Chris},
title = {{Exact Completeness of LP Hierarchies for Linear Codes}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {40:1--40:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.40},
URN = {urn:nbn:de:0030-drops-175433},
doi = {10.4230/LIPIcs.ITCS.2023.40},
annote = {Keywords: LP bound, linear codes, Delsarte’s LP, combinatorial polytopes, pseudoexpectation}
}
@InProceedings{deng_et_al:LIPIcs.ITCS.2023.41,
author = {Deng, Zhun and Dwork, Cynthia and Zhang, Linjun},
title = {{HappyMap : A Generalized Multicalibration Method}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {41:1--41:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.41},
URN = {urn:nbn:de:0030-drops-175449},
doi = {10.4230/LIPIcs.ITCS.2023.41},
annote = {Keywords: algorithmic fairness, target-independent learning, transfer learning}
}
@InProceedings{dey_et_al:LIPIcs.ITCS.2023.42,
author = {Dey, Papri and Kannan, Ravi and Ryder, Nick and Srivastava, Nikhil},
title = {{Bit Complexity of Jordan Normal Form and Polynomial Spectral Factorization}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {42:1--42:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.42},
URN = {urn:nbn:de:0030-drops-175450},
doi = {10.4230/LIPIcs.ITCS.2023.42},
annote = {Keywords: Symbolic algorithms, numerical algorithms, linear algebra}
}
@InProceedings{dobrokhotovamaikova_et_al:LIPIcs.ITCS.2023.43,
author = {Dobrokhotova-Maikova, Natalia and Kozachinskiy, Alexander and Podolskii, Vladimir},
title = {{Constant-Depth Sorting Networks}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {43:1--43:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.43},
URN = {urn:nbn:de:0030-drops-175468},
doi = {10.4230/LIPIcs.ITCS.2023.43},
annote = {Keywords: Sorting networks, constant depth, lower bounds, threshold circuits}
}
@InProceedings{dobzinski_et_al:LIPIcs.ITCS.2023.44,
author = {Dobzinski, Shahar and Shaulker, Ariel},
title = {{Rigidity in Mechanism Design and Its Applications}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {44:1--44:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.44},
URN = {urn:nbn:de:0030-drops-175479},
doi = {10.4230/LIPIcs.ITCS.2023.44},
annote = {Keywords: Revenue Maximization, Auctions}
}
@InProceedings{dufoulon_et_al:LIPIcs.ITCS.2023.45,
author = {Dufoulon, Fabien and Emek, Yuval and Gelles, Ran},
title = {{Beeping Shortest Paths via Hypergraph Bipartite Decomposition}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {45:1--45:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.45},
URN = {urn:nbn:de:0030-drops-175485},
doi = {10.4230/LIPIcs.ITCS.2023.45},
annote = {Keywords: Beeping Networks, Shortest Paths, Hypergraph Bipartite Decomposition}
}
@InProceedings{efremenko_et_al:LIPIcs.ITCS.2023.46,
author = {Efremenko, Klim and Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R.},
title = {{Noisy Radio Network Lower Bounds via Noiseless Beeping Lower Bounds}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {46:1--46:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.46},
URN = {urn:nbn:de:0030-drops-175499},
doi = {10.4230/LIPIcs.ITCS.2023.46},
annote = {Keywords: Beeping Model, Radio Networks}
}
@InProceedings{elhayek_et_al:LIPIcs.ITCS.2023.47,
author = {El-Hayek, Antoine and Henzinger, Monika and Schmid, Stefan},
title = {{Asymptotically Tight Bounds on the Time Complexity of Broadcast and Its Variants in Dynamic Networks}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {47:1--47:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.47},
URN = {urn:nbn:de:0030-drops-175502},
doi = {10.4230/LIPIcs.ITCS.2023.47},
annote = {Keywords: broadcast, cover, k-broadcast, dynamic radius, dynamic graphs, oblivious message adversary, time complexity}
}
@InProceedings{epasto_et_al:LIPIcs.ITCS.2023.48,
author = {Epasto, Alessandro and Mao, Jieming and Medina, Andres Munoz and Mirrokni, Vahab and Vassilvitskii, Sergei and Zhong, Peilin},
title = {{Differentially Private Continual Releases of Streaming Frequency Moment Estimations}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {48:1--48:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.48},
URN = {urn:nbn:de:0030-drops-175513},
doi = {10.4230/LIPIcs.ITCS.2023.48},
annote = {Keywords: Differential Privacy, Continual Release, Sliding Window, Streaming Algorithms, Distinct Elements, Frequency Moment Estimation}
}
@InProceedings{fawzi_et_al:LIPIcs.ITCS.2023.49,
author = {Fawzi, Hamza and Fawzi, Omar and Scalet, Samuel O.},
title = {{A Subpolynomial-Time Algorithm for the Free Energy of One-Dimensional Quantum Systems in the Thermodynamic Limit}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {49:1--49:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.49},
URN = {urn:nbn:de:0030-drops-175520},
doi = {10.4230/LIPIcs.ITCS.2023.49},
annote = {Keywords: One-dimensional quantum systems, Free energy}
}
@InProceedings{filtser_et_al:LIPIcs.ITCS.2023.50,
author = {Filtser, Arnold and Kapralov, Michael and Makarov, Mikhail},
title = {{Expander Decomposition in Dynamic Streams}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {50:1--50:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.50},
URN = {urn:nbn:de:0030-drops-175534},
doi = {10.4230/LIPIcs.ITCS.2023.50},
annote = {Keywords: Streaming, expander decomposition, graph sparsifiers}
}
@InProceedings{filtser_et_al:LIPIcs.ITCS.2023.51,
author = {Filtser, Omrit and Goswami, Mayank and Mitchell, Joseph S. B. and Polishchuk, Valentin},
title = {{On Flipping the Fr\'{e}chet Distance}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {51:1--51:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.51},
URN = {urn:nbn:de:0030-drops-175548},
doi = {10.4230/LIPIcs.ITCS.2023.51},
annote = {Keywords: curves, polygons, distancing measure}
}
@InProceedings{gaitonde_et_al:LIPIcs.ITCS.2023.52,
author = {Gaitonde, Jason and Li, Yingkai and Light, Bar and Lucier, Brendan and Slivkins, Aleksandrs},
title = {{Budget Pacing in Repeated Auctions: Regret and Efficiency Without Convergence}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {52:1--52:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.52},
URN = {urn:nbn:de:0030-drops-175557},
doi = {10.4230/LIPIcs.ITCS.2023.52},
annote = {Keywords: repeated auctions with budgets, pacing, learning in auctions}
}
@InProceedings{gharibian_et_al:LIPIcs.ITCS.2023.53,
author = {Gharibian, Sevag and Rudolph, Dorian},
title = {{Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover Interactive Proofs into Unentanglement}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {53:1--53:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.53},
URN = {urn:nbn:de:0030-drops-175564},
doi = {10.4230/LIPIcs.ITCS.2023.53},
annote = {Keywords: quantum complexity theory, Quantum Merlin Arthur (QMA), QMA(2), ground state connectivity (GSCON), quantum error correction}
}
@InProceedings{ghazi_et_al:LIPIcs.ITCS.2023.54,
author = {Ghazi, Badih and Kumar, Ravi and Manurangsi, Pasin and Steinke, Thomas},
title = {{Algorithms with More Granular Differential Privacy Guarantees}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {54:1--54:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.54},
URN = {urn:nbn:de:0030-drops-175574},
doi = {10.4230/LIPIcs.ITCS.2023.54},
annote = {Keywords: Differential Privacy, Algorithms, Per-Attribute Privacy}
}
@InProceedings{ghazi_et_al:LIPIcs.ITCS.2023.55,
author = {Ghazi, Badih and Kumar, Ravi and Nelson, Jelani and Manurangsi, Pasin},
title = {{Private Counting of Distinct and k-Occurring Items in Time Windows}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {55:1--55:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.55},
URN = {urn:nbn:de:0030-drops-175580},
doi = {10.4230/LIPIcs.ITCS.2023.55},
annote = {Keywords: Differential Privacy, Algorithms, Distinct Elements, Time Windows}
}
@InProceedings{girish_et_al:LIPIcs.ITCS.2023.56,
author = {Girish, Uma and Raz, Ran and Zhan, Wei},
title = {{Is Untrusted Randomness Helpful?}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {56:1--56:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.56},
URN = {urn:nbn:de:0030-drops-175593},
doi = {10.4230/LIPIcs.ITCS.2023.56},
annote = {Keywords: Untrusted, Randomness, Verifiable, ZPL, BPL, ZPP, BPP}
}
@InProceedings{goldberg_et_al:LIPIcs.ITCS.2023.57,
author = {Goldberg, Paul and Li, Jiawei},
title = {{Consensus Division in an Arbitrary Ratio}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {57:1--57:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.57},
URN = {urn:nbn:de:0030-drops-175606},
doi = {10.4230/LIPIcs.ITCS.2023.57},
annote = {Keywords: Consensus Halving, TFNP, PPA-k, Necklace Splitting}
}
@InProceedings{goldenberg_et_al:LIPIcs.ITCS.2023.58,
author = {Goldenberg, Elazar and Kociumaka, Tomasz and Krauthgamer, Robert and Saha, Barna},
title = {{An Algorithmic Bridge Between Hamming and Levenshtein Distances}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {58:1--58:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.58},
URN = {urn:nbn:de:0030-drops-175615},
doi = {10.4230/LIPIcs.ITCS.2023.58},
annote = {Keywords: edit distance, Hamming distance, Longest Common Extension queries}
}
@InProceedings{goldreich_et_al:LIPIcs.ITCS.2023.59,
author = {Goldreich, Oded and Rothblum, Guy N. and Skverer, Tal},
title = {{On Interactive Proofs of Proximity with Proof-Oblivious Queries}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {59:1--59:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.59},
URN = {urn:nbn:de:0030-drops-175625},
doi = {10.4230/LIPIcs.ITCS.2023.59},
annote = {Keywords: Complexity Theory, Property Testing, Interactive Proofs, Interactive Proofs of Proximity, Proof-Oblivious Queries}
}
@InProceedings{gopalan_et_al:LIPIcs.ITCS.2023.60,
author = {Gopalan, Parikshit and Hu, Lunjia and Kim, Michael P. and Reingold, Omer and Wieder, Udi},
title = {{Loss Minimization Through the Lens Of Outcome Indistinguishability}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {60:1--60:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.60},
URN = {urn:nbn:de:0030-drops-175635},
doi = {10.4230/LIPIcs.ITCS.2023.60},
annote = {Keywords: Loss Minimization, Indistinguishability}
}
@InProceedings{gotlib_et_al:LIPIcs.ITCS.2023.61,
author = {Gotlib, Roy and Kaufman, Tali},
title = {{List Agreement Expansion from Coboundary Expansion}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {61:1--61:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.61},
URN = {urn:nbn:de:0030-drops-175647},
doi = {10.4230/LIPIcs.ITCS.2023.61},
annote = {Keywords: High dimensional Expanders, Property Testing, Agreement Testing}
}
@InProceedings{goyal_et_al:LIPIcs.ITCS.2023.62,
author = {Goyal, Vipul and Liu-Zhang, Chen-Da and Raizes, Justin and Ribeiro, Jo\~{a}o},
title = {{Asynchronous Multi-Party Quantum Computation}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {62:1--62:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.62},
URN = {urn:nbn:de:0030-drops-175655},
doi = {10.4230/LIPIcs.ITCS.2023.62},
annote = {Keywords: Quantum Cryptography, Multiparty Computation, Asynchronous}
}
@InProceedings{grandoni_et_al:LIPIcs.ITCS.2023.63,
author = {Grandoni, Fabrizio and Mathieu, Claire and Zhou, Hang},
title = {{Unsplittable Euclidean Capacitated Vehicle Routing: A (2+\epsilon)-Approximation Algorithm}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {63:1--63:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.63},
URN = {urn:nbn:de:0030-drops-175660},
doi = {10.4230/LIPIcs.ITCS.2023.63},
annote = {Keywords: capacitated vehicle routing, approximation algorithms, Euclidean plane}
}
@InProceedings{grewal_et_al:LIPIcs.ITCS.2023.64,
author = {Grewal, Sabee and Iyer, Vishnu and Kretschmer, William and Liang, Daniel},
title = {{Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {64:1--64:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.64},
URN = {urn:nbn:de:0030-drops-175670},
doi = {10.4230/LIPIcs.ITCS.2023.64},
annote = {Keywords: Pseudorandom quantum states, Clifford + T, Haar random, Bell sampling, stabilizer formalism, stabilizer extent, stabilizer fidelity, learning theory, complexity theory}
}
@InProceedings{gupta_et_al:LIPIcs.ITCS.2023.65,
author = {Gupta, Varun and Krishnaswamy, Ravishankar and Sandeep, Sai and Sundaresan, Janani},
title = {{Look Before, Before You Leap: Online Vector Load Balancing with Few Reassignments}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {65:1--65:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.65},
URN = {urn:nbn:de:0030-drops-175685},
doi = {10.4230/LIPIcs.ITCS.2023.65},
annote = {Keywords: Vector Scheduling, Vector Load Balancing}
}
@InProceedings{haitner_et_al:LIPIcs.ITCS.2023.66,
author = {Haitner, Iftach and Mazor, Noam and Silbak, Jad},
title = {{Incompressiblity and Next-Block Pseudoentropy}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {66:1--66:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.66},
URN = {urn:nbn:de:0030-drops-175697},
doi = {10.4230/LIPIcs.ITCS.2023.66},
annote = {Keywords: incompressibility, next-block pseudoentropy, sparse languages}
}
@InProceedings{harsha_et_al:LIPIcs.ITCS.2023.67,
author = {Harsha, Prahladh and Mitropolsky, Daniel and Rosen, Alon},
title = {{Downward Self-Reducibility in TFNP}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {67:1--67:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.67},
URN = {urn:nbn:de:0030-drops-175700},
doi = {10.4230/LIPIcs.ITCS.2023.67},
annote = {Keywords: downward self-reducibility, TFNP, TFUP, factoring, PLS, CLS}
}
@InProceedings{he_et_al:LIPIcs.ITCS.2023.68,
author = {He, William and Rossman, Benjamin},
title = {{Symmetric Formulas for Products of Permutations}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {68:1--68:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.68},
URN = {urn:nbn:de:0030-drops-175717},
doi = {10.4230/LIPIcs.ITCS.2023.68},
annote = {Keywords: circuit complexity, group-invariant formulas}
}
@InProceedings{henzinger_et_al:LIPIcs.ITCS.2023.69,
author = {Henzinger, Monika and Jin, Billy and Peng, Richard and Williamson, David P.},
title = {{A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {69:1--69:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.69},
URN = {urn:nbn:de:0030-drops-175720},
doi = {10.4230/LIPIcs.ITCS.2023.69},
annote = {Keywords: Laplacian solver, electrical flow, data structure}
}
@InProceedings{hirahara_et_al:LIPIcs.ITCS.2023.70,
author = {Hirahara, Shuichi and Nanashima, Mikito},
title = {{Learning Versus Pseudorandom Generators in Constant Parallel Time}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {70:1--70:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.70},
URN = {urn:nbn:de:0030-drops-175736},
doi = {10.4230/LIPIcs.ITCS.2023.70},
annote = {Keywords: Parallel cryptography, polynomial-stretch pseudorandom generators in NC⁰, PAC learning, average-case complexity, fixed-parameter tractability}
}
@InProceedings{hitron_et_al:LIPIcs.ITCS.2023.71,
author = {Hitron, Yael and Parter, Merav and Yogev, Eylon},
title = {{Secure Distributed Network Optimization Against Eavesdroppers}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {71:1--71:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.71},
URN = {urn:nbn:de:0030-drops-175746},
doi = {10.4230/LIPIcs.ITCS.2023.71},
annote = {Keywords: congest, secure computation, network optimization}
}
@InProceedings{hu_et_al:LIPIcs.ITCS.2023.72,
author = {Hu, Lunjia and Peale, Charlotte},
title = {{Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {72:1--72:30},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.72},
URN = {urn:nbn:de:0030-drops-175752},
doi = {10.4230/LIPIcs.ITCS.2023.72},
annote = {Keywords: Comparative learning, mutual VC dimension, realizable multiaccuracy and multicalibration, sample complexity}
}
@InProceedings{hu_et_al:LIPIcs.ITCS.2023.73,
author = {Hu, Zhuangfei and Li, Xinda and Woodruff, David P. and Zhang, Hongyang and Zhang, Shufan},
title = {{Recovery from Non-Decomposable Distance Oracles}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {73:1--73:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.73},
URN = {urn:nbn:de:0030-drops-175767},
doi = {10.4230/LIPIcs.ITCS.2023.73},
annote = {Keywords: Sequence Recovery, Edit Distance, DTW Distance, Fr\'{e}chet Distance}
}
@InProceedings{ikenmeyer_et_al:LIPIcs.ITCS.2023.74,
author = {Ikenmeyer, Christian and Komarath, Balagopal and Saurabh, Nitin},
title = {{Karchmer-Wigderson Games for Hazard-Free Computation}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {74:1--74:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.74},
URN = {urn:nbn:de:0030-drops-175775},
doi = {10.4230/LIPIcs.ITCS.2023.74},
annote = {Keywords: Hazard-free computation, monotone computation, Karchmer-Wigderson games, communication complexity, lower bounds}
}
@InProceedings{jin_et_al:LIPIcs.ITCS.2023.75,
author = {Jin, Yaonan and Lu, Pinyan and Xiao, Tao},
title = {{Learning Reserve Prices in Second-Price Auctions}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {75:1--75:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.75},
URN = {urn:nbn:de:0030-drops-175780},
doi = {10.4230/LIPIcs.ITCS.2023.75},
annote = {Keywords: Revenue Maximization, Sample Complexity, Anonymous Reserve}
}
@InProceedings{jin_et_al:LIPIcs.ITCS.2023.76,
author = {Jin, Yujia and Muthukumar, Vidya and Sidford, Aaron},
title = {{The Complexity of Infinite-Horizon General-Sum Stochastic Games}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {76:1--76:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.76},
URN = {urn:nbn:de:0030-drops-175791},
doi = {10.4230/LIPIcs.ITCS.2023.76},
annote = {Keywords: complexity, stochastic games, general-sum games, Nash equilibrium}
}
@InProceedings{jones_et_al:LIPIcs.ITCS.2023.77,
author = {Jones, Chris and Marwaha, Kunal and Sandhu, Juspreet Singh and Shi, Jonathan},
title = {{Random Max-CSPs Inherit Algorithmic Hardness from Spin Glasses}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {77:1--77:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.77},
URN = {urn:nbn:de:0030-drops-175804},
doi = {10.4230/LIPIcs.ITCS.2023.77},
annote = {Keywords: spin glass, overlap gap property, constraint satisfaction problem, Guerra-Toninelli interpolation}
}
@InProceedings{kaufman_et_al:LIPIcs.ITCS.2023.78,
author = {Kaufman, Tali and Tessler, Ran J.},
title = {{Garland’s Technique for Posets and High Dimensional Grassmannian Expanders}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {78:1--78:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.78},
URN = {urn:nbn:de:0030-drops-175819},
doi = {10.4230/LIPIcs.ITCS.2023.78},
annote = {Keywords: High dimensional Expanders, Posets, Grassmannian, Garland Method}
}
@InProceedings{kim_et_al:LIPIcs.ITCS.2023.79,
author = {Kim, Michael P. and Perdomo, Juan C.},
title = {{Making Decisions Under Outcome Performativity}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {79:1--79:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.79},
URN = {urn:nbn:de:0030-drops-175824},
doi = {10.4230/LIPIcs.ITCS.2023.79},
annote = {Keywords: performative prediction, outcome indistinguishability}
}
@InProceedings{kol_et_al:LIPIcs.ITCS.2023.80,
author = {Kol, Gillat and Paramonov, Dmitry and Saxena, Raghuvansh R. and Yu, Huacheng},
title = {{Characterizing the Multi-Pass Streaming Complexity for Solving Boolean CSPs Exactly}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {80:1--80:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.80},
URN = {urn:nbn:de:0030-drops-175837},
doi = {10.4230/LIPIcs.ITCS.2023.80},
annote = {Keywords: Streaming algorithms, Constraint Satisfaction Problems}
}
@InProceedings{kong_et_al:LIPIcs.ITCS.2023.81,
author = {Kong, Yuqing and Schoenebeck, Grant},
title = {{False Consensus, Information Theory, and Prediction Markets}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {81:1--81:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.81},
URN = {urn:nbn:de:0030-drops-175844},
doi = {10.4230/LIPIcs.ITCS.2023.81},
annote = {Keywords: Agreeing to disagree, false consensus, information theory, prediction market}
}
@InProceedings{liu:LIPIcs.ITCS.2023.82,
author = {Liu, Qipeng},
title = {{Depth-Bounded Quantum Cryptography with Applications to One-Time Memory and More}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {82:1--82:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.82},
URN = {urn:nbn:de:0030-drops-175859},
doi = {10.4230/LIPIcs.ITCS.2023.82},
annote = {Keywords: cryptographic protocol, one-time memory, quantum cryptography}
}
@InProceedings{liu:LIPIcs.ITCS.2023.83,
author = {Liu, Yang P.},
title = {{Vertex Sparsification for Edge Connectivity in Polynomial Time}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {83:1--83:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.83},
URN = {urn:nbn:de:0030-drops-175863},
doi = {10.4230/LIPIcs.ITCS.2023.83},
annote = {Keywords: Vertex-sparsification, edge-connectivity, Gammoids}
}
@InProceedings{lovett_et_al:LIPIcs.ITCS.2023.84,
author = {Lovett, Shachar and Zhang, Jiapeng},
title = {{Fractional Certificates for Bounded Functions}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {84:1--84:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.84},
URN = {urn:nbn:de:0030-drops-175871},
doi = {10.4230/LIPIcs.ITCS.2023.84},
annote = {Keywords: Aaronson-Ambainis conjecture, fractional block sensitivity, Talagrand inequality}
}
@InProceedings{manurangsi:LIPIcs.ITCS.2023.85,
author = {Manurangsi, Pasin},
title = {{Improved Inapproximability of VC Dimension and Littlestone’s Dimension via (Unbalanced) Biclique}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {85:1--85:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.85},
URN = {urn:nbn:de:0030-drops-175884},
doi = {10.4230/LIPIcs.ITCS.2023.85},
annote = {Keywords: VC Dimension, Littlestone’s Dimension, Maximum Biclique, Hardness of Approximation, Fine-Grained Complexity}
}
@InProceedings{meir_et_al:LIPIcs.ITCS.2023.86,
author = {Meir, Uri and Oshman, Rotem and Shayevitz, Ofer and Volkov, Yuval},
title = {{Resilience of 3-Majority Dynamics to Non-Uniform Schedulers}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {86:1--86:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.86},
URN = {urn:nbn:de:0030-drops-175895},
doi = {10.4230/LIPIcs.ITCS.2023.86},
annote = {Keywords: chemical reaction networks, population protocols, randomized scheduler}
}
@InProceedings{morimae_et_al:LIPIcs.ITCS.2023.87,
author = {Morimae, Tomoyuki and Yamakawa, Takashi},
title = {{Proofs of Quantumness from Trapdoor Permutations}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {87:1--87:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.87},
URN = {urn:nbn:de:0030-drops-175900},
doi = {10.4230/LIPIcs.ITCS.2023.87},
annote = {Keywords: Quantum cryptography, Proofs of quantumness, Trapdoor permutations}
}
@InProceedings{pasarkar_et_al:LIPIcs.ITCS.2023.88,
author = {Pasarkar, Amol and Papadimitriou, Christos and Yannakakis, Mihalis},
title = {{Extremal Combinatorics, Iterated Pigeonhole Arguments and Generalizations of PPP}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {88:1--88:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.88},
URN = {urn:nbn:de:0030-drops-175913},
doi = {10.4230/LIPIcs.ITCS.2023.88},
annote = {Keywords: Total Complexity, Extremal Combinatorics, Pigeonhole Principle}
}
@InProceedings{pitassi_et_al:LIPIcs.ITCS.2023.89,
author = {Pitassi, Toniann and Shirley, Morgan and Shraibman, Adi},
title = {{The Strength of Equality Oracles in Communication}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {89:1--89:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.89},
URN = {urn:nbn:de:0030-drops-175927},
doi = {10.4230/LIPIcs.ITCS.2023.89},
annote = {Keywords: Factorization norm, blocky rank, Merlin-Arthur}
}
@InProceedings{poremba:LIPIcs.ITCS.2023.90,
author = {Poremba, Alexander},
title = {{Quantum Proofs of Deletion for Learning with Errors}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {90:1--90:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.90},
URN = {urn:nbn:de:0030-drops-175934},
doi = {10.4230/LIPIcs.ITCS.2023.90},
annote = {Keywords: Learning with errors, certified deletion, fully homomorphic encryption}
}
@InProceedings{qiao_et_al:LIPIcs.ITCS.2023.91,
author = {Qiao, Mingda and Valiant, Gregory},
title = {{Online Pen Testing}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {91:1--91:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.91},
URN = {urn:nbn:de:0030-drops-175940},
doi = {10.4230/LIPIcs.ITCS.2023.91},
annote = {Keywords: Optimal stopping, online algorithm}
}
@InProceedings{rothblum_et_al:LIPIcs.ITCS.2023.92,
author = {Rothblum, Guy N. and Yona, Gal},
title = {{Decision-Making Under Miscalibration}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {92:1--92:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.92},
URN = {urn:nbn:de:0030-drops-175951},
doi = {10.4230/LIPIcs.ITCS.2023.92},
annote = {Keywords: risk prediction, calibration, algorithmic fairness, multi-group fairness}
}
@InProceedings{rubinstein_et_al:LIPIcs.ITCS.2023.93,
author = {Rubinstein, Aviad and Zhao, Junyao},
title = {{Beyond Worst-Case Budget-Feasible Mechanism Design}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {93:1--93:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.93},
URN = {urn:nbn:de:0030-drops-175969},
doi = {10.4230/LIPIcs.ITCS.2023.93},
annote = {Keywords: Procurement auctions, Mechanism design, Beyond worst-case analysis}
}
@InProceedings{rush_et_al:LIPIcs.ITCS.2023.94,
author = {Rush, Cynthia and Skerman, Fiona and Wein, Alexander S. and Yang, Dana},
title = {{Is It Easier to Count Communities Than Find Them?}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {94:1--94:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.94},
URN = {urn:nbn:de:0030-drops-175970},
doi = {10.4230/LIPIcs.ITCS.2023.94},
annote = {Keywords: Community detection, Hypothesis testing, Low-degree polynomials}
}
@InProceedings{saxena_et_al:LIPIcs.ITCS.2023.95,
author = {Saxena, Raghuvansh R. and Velusamy, Santhoshini and Weinberg, S. Matthew},
title = {{An Improved Lower Bound for Matroid Intersection Prophet Inequalities}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {95:1--95:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.95},
URN = {urn:nbn:de:0030-drops-175986},
doi = {10.4230/LIPIcs.ITCS.2023.95},
annote = {Keywords: Prophet Inequalities, Intersection of Matroids}
}
@InProceedings{she_et_al:LIPIcs.ITCS.2023.96,
author = {She, Adrian and Yuen, Henry},
title = {{Unitary Property Testing Lower Bounds by Polynomials}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {96:1--96:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.96},
URN = {urn:nbn:de:0030-drops-175995},
doi = {10.4230/LIPIcs.ITCS.2023.96},
annote = {Keywords: Quantum query complexity, polynomial method, unitary property testing, quantum proofs, invariant theory, quantum recurrence time, entanglement entropy, BQP, QMA, QMA(2)}
}
@InProceedings{shi_et_al:LIPIcs.ITCS.2023.97,
author = {Shi, Elaine and Chung, Hao and Wu, Ke},
title = {{What Can Cryptography Do for Decentralized Mechanism Design?}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {97:1--97:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.97},
URN = {urn:nbn:de:0030-drops-176005},
doi = {10.4230/LIPIcs.ITCS.2023.97},
annote = {Keywords: Transaction Fee Mechanism Design}
}
@InProceedings{venkat:LIPIcs.ITCS.2023.98,
author = {Venkat, Prayaag},
title = {{Efficient Algorithms for Certifying Lower Bounds on the Discrepancy of Random Matrices}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {98:1--98:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.98},
URN = {urn:nbn:de:0030-drops-176015},
doi = {10.4230/LIPIcs.ITCS.2023.98},
annote = {Keywords: Average-case discrepancy theory, lattices, shortest vector problem}
}
@InProceedings{vyas_et_al:LIPIcs.ITCS.2023.99,
author = {Vyas, Nikhil and Williams, Ryan},
title = {{On Oracles and Algorithmic Methods for Proving Lower Bounds}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {99:1--99:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.99},
URN = {urn:nbn:de:0030-drops-176021},
doi = {10.4230/LIPIcs.ITCS.2023.99},
annote = {Keywords: oracles, relativization, circuit complexity, missing string, exponential hierarchy}
}
@InProceedings{winkler_et_al:LIPIcs.ITCS.2023.100,
author = {Winkler, Kyrill and Paz, Ami and Rincon Galeana, Hugo and Schmid, Stefan and Schmid, Ulrich},
title = {{The Time Complexity of Consensus Under Oblivious Message Adversaries}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {100:1--100:28},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.100},
URN = {urn:nbn:de:0030-drops-176030},
doi = {10.4230/LIPIcs.ITCS.2023.100},
annote = {Keywords: dynamic networks, oblivious message adversaries, consensus, time complexity}
}
@InProceedings{yolcu_et_al:LIPIcs.ITCS.2023.101,
author = {Yolcu, Emre and Heule, Marijn J. H.},
title = {{Exponential Separations Using Guarded Extension Variables}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {101:1--101:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.101},
URN = {urn:nbn:de:0030-drops-176043},
doi = {10.4230/LIPIcs.ITCS.2023.101},
annote = {Keywords: proof complexity, separations, resolution, extended resolution, blocked clauses}
}
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