@Proceedings{guruswami:LIPIcs.ITCS.2024,
title = {{LIPIcs, Volume 287, ITCS 2024, Complete Volume}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {1--2170},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024},
URN = {urn:nbn:de:0030-drops-195274},
doi = {10.4230/LIPIcs.ITCS.2024},
annote = {Keywords: LIPIcs, Volume 287, ITCS 2024, Complete Volume}
}
@InProceedings{guruswami:LIPIcs.ITCS.2024.0,
author = {Guruswami, Venkatesan},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {0:i--0:xxiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.0},
URN = {urn:nbn:de:0030-drops-195283},
doi = {10.4230/LIPIcs.ITCS.2024.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{aaronson_et_al:LIPIcs.ITCS.2024.1,
author = {Aaronson, Scott and Buhrman, Harry and Kretschmer, William},
title = {{A Qubit, a Coin, and an Advice String Walk into a Relational Problem}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {1:1--1:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.1},
URN = {urn:nbn:de:0030-drops-195290},
doi = {10.4230/LIPIcs.ITCS.2024.1},
annote = {Keywords: Relational problems, quantum advice, randomized advice, FBQP, FBPP}
}
@InProceedings{aaronson_et_al:LIPIcs.ITCS.2024.2,
author = {Aaronson, Scott and Bouland, Adam and Fefferman, Bill and Ghosh, Soumik and Vazirani, Umesh and Zhang, Chenyi and Zhou, Zixin},
title = {{Quantum Pseudoentanglement}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {2:1--2:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.2},
URN = {urn:nbn:de:0030-drops-195300},
doi = {10.4230/LIPIcs.ITCS.2024.2},
annote = {Keywords: Quantum computing, Quantum complexity theory, entanglement}
}
@InProceedings{aliakbarpour_et_al:LIPIcs.ITCS.2024.3,
author = {Aliakbarpour, Maryam and Silver, Rose and Steinke, Thomas and Ullman, Jonathan},
title = {{Differentially Private Medians and Interior Points for Non-Pathological Data}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {3:1--3:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.3},
URN = {urn:nbn:de:0030-drops-195313},
doi = {10.4230/LIPIcs.ITCS.2024.3},
annote = {Keywords: Differential Privacy, Statistical Estimation, Approximate Medians, Interior Point Problem}
}
@InProceedings{alman_et_al:LIPIcs.ITCS.2024.4,
author = {Alman, Josh and Turok, Ethan and Yu, Hantao and Zhang, Hengzhi},
title = {{Tensor Ranks and the Fine-Grained Complexity of Dynamic Programming}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {4:1--4:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.4},
URN = {urn:nbn:de:0030-drops-195324},
doi = {10.4230/LIPIcs.ITCS.2024.4},
annote = {Keywords: Fine-grained complexity, Dynamic programming, Least-weight subsequence}
}
@InProceedings{anagnostides_et_al:LIPIcs.ITCS.2024.5,
author = {Anagnostides, Ioannis and Kalavasis, Alkis and Sandholm, Tuomas and Zampetakis, Manolis},
title = {{On the Complexity of Computing Sparse Equilibria and Lower Bounds for No-Regret Learning in Games}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {5:1--5:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.5},
URN = {urn:nbn:de:0030-drops-195334},
doi = {10.4230/LIPIcs.ITCS.2024.5},
annote = {Keywords: No-regret learning, extensive-form games, multiplicative weights update, optimism, lower bounds}
}
@InProceedings{ananth_et_al:LIPIcs.ITCS.2024.6,
author = {Ananth, Prabhanjan and Lin, Yao-Ting and Yuen, Henry},
title = {{Pseudorandom Strings from Pseudorandom Quantum States}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {6:1--6:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.6},
URN = {urn:nbn:de:0030-drops-195348},
doi = {10.4230/LIPIcs.ITCS.2024.6},
annote = {Keywords: Quantum Cryptography}
}
@InProceedings{bandyapadhyay_et_al:LIPIcs.ITCS.2024.7,
author = {Bandyapadhyay, Sayan and Maheshwari, Anil and Roy, Sasanka and Smid, Michiel and Varadarajan, Kasturi},
title = {{Geometric Covering via Extraction Theorem}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {7:1--7:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.7},
URN = {urn:nbn:de:0030-drops-195355},
doi = {10.4230/LIPIcs.ITCS.2024.7},
annote = {Keywords: Covering, Extraction theorem, Double-disks, Submodularity, Local search}
}
@InProceedings{barman_et_al:LIPIcs.ITCS.2024.8,
author = {Barman, Siddharth and Krishna, Anand and Kulkarni, Pooja and Narang, Shivika},
title = {{Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {8:1--8:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.8},
URN = {urn:nbn:de:0030-drops-195366},
doi = {10.4230/LIPIcs.ITCS.2024.8},
annote = {Keywords: Discrete Fair Division, Nash Social Welfare, XOS Valuations}
}
@InProceedings{bassirian_et_al:LIPIcs.ITCS.2024.9,
author = {Bassirian, Roozbeh and Fefferman, Bill and Marwaha, Kunal},
title = {{Quantum Merlin-Arthur and Proofs Without Relative Phase}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {9:1--9:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.9},
URN = {urn:nbn:de:0030-drops-195370},
doi = {10.4230/LIPIcs.ITCS.2024.9},
annote = {Keywords: quantum complexity, QMA(2), PCPs}
}
@InProceedings{bathie_et_al:LIPIcs.ITCS.2024.10,
author = {Bathie, Gabriel and Williams, R. Ryan},
title = {{Towards Stronger Depth Lower Bounds}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {10:1--10:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.10},
URN = {urn:nbn:de:0030-drops-195388},
doi = {10.4230/LIPIcs.ITCS.2024.10},
annote = {Keywords: DeMorgan formulas, depth complexity, circuit complexity, lower bounds, #SAT, NAND gates, SAT}
}
@InProceedings{beneliezer_et_al:LIPIcs.ITCS.2024.11,
author = {Ben-Eliezer, Omri and Kelman, Esty and Meir, Uri and Raskhodnikova, Sofya},
title = {{Property Testing with Online Adversaries}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {11:1--11:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.11},
URN = {urn:nbn:de:0030-drops-195395},
doi = {10.4230/LIPIcs.ITCS.2024.11},
annote = {Keywords: Linearity testing, low-degree testing, Reed-Muller codes, testing properties of sequences, erasure-resilience, corruption-resilience}
}
@InProceedings{bernstein_et_al:LIPIcs.ITCS.2024.12,
author = {Bernstein, Aaron and Bodwin, Greg and Wein, Nicole},
title = {{Are There Graphs Whose Shortest Path Structure Requires Large Edge Weights?}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {12:1--12:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.12},
URN = {urn:nbn:de:0030-drops-195405},
doi = {10.4230/LIPIcs.ITCS.2024.12},
annote = {Keywords: shortest paths, graph theory, weighted graphs}
}
@InProceedings{bhattacharjee_et_al:LIPIcs.ITCS.2024.13,
author = {Bhattacharjee, Rajarshi and Dexter, Gregory and Musco, Cameron and Ray, Archan and Sachdeva, Sushant and Woodruff, David P.},
title = {{Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {13:1--13:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.13},
URN = {urn:nbn:de:0030-drops-195415},
doi = {10.4230/LIPIcs.ITCS.2024.13},
annote = {Keywords: sublinear algorithms, randomized linear algebra, spectral sparsification, expanders}
}
@InProceedings{bhushan_et_al:LIPIcs.ITCS.2024.14,
author = {Bhushan, Kaartik and Koppula, Venkata and Prabhakaran, Manoj},
title = {{Homomorphic Indistinguishability Obfuscation and Its Applications}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {14:1--14:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.14},
URN = {urn:nbn:de:0030-drops-195429},
doi = {10.4230/LIPIcs.ITCS.2024.14},
annote = {Keywords: Program Obfuscation, Homomorphisms}
}
@InProceedings{black_et_al:LIPIcs.ITCS.2024.15,
author = {Black, Hadley and Blais, Eric and Harms, Nathaniel},
title = {{Testing and Learning Convex Sets in the Ternary Hypercube}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {15:1--15:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.15},
URN = {urn:nbn:de:0030-drops-195435},
doi = {10.4230/LIPIcs.ITCS.2024.15},
annote = {Keywords: Property testing, learning theory, convex sets, testing convexity, fluctuation}
}
@InProceedings{blackwell_et_al:LIPIcs.ITCS.2024.16,
author = {Blackwell, Keller and Wootters, Mary},
title = {{A Characterization of Optimal-Rate Linear Homomorphic Secret Sharing Schemes, and Applications}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {16:1--16:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.16},
URN = {urn:nbn:de:0030-drops-195447},
doi = {10.4230/LIPIcs.ITCS.2024.16},
annote = {Keywords: Error Correcting Codes, Homomorphic Secret Sharing}
}
@InProceedings{blasiok_et_al:LIPIcs.ITCS.2024.17,
author = {B{\l}asiok, Jaros{\l}aw and Gopalan, Parikshit and Hu, Lunjia and Kalai, Adam Tauman and Nakkiran, Preetum},
title = {{Loss Minimization Yields Multicalibration for Large Neural Networks}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {17:1--17:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.17},
URN = {urn:nbn:de:0030-drops-195452},
doi = {10.4230/LIPIcs.ITCS.2024.17},
annote = {Keywords: Multi-group fairness, loss minimization, neural networks}
}
@InProceedings{blum_et_al:LIPIcs.ITCS.2024.18,
author = {Blum, Avrim and Dutz, Melissa},
title = {{Winning Without Observing Payoffs: Exploiting Behavioral Biases to Win Nearly Every Round}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.18},
URN = {urn:nbn:de:0030-drops-195463},
doi = {10.4230/LIPIcs.ITCS.2024.18},
annote = {Keywords: Game theory, Behavioral bias}
}
@InProceedings{bodwin_et_al:LIPIcs.ITCS.2024.19,
author = {Bodwin, Greg and Fleischmann, Henry},
title = {{Spanning Adjacency Oracles in Sublinear Time}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {19:1--19:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.19},
URN = {urn:nbn:de:0030-drops-195475},
doi = {10.4230/LIPIcs.ITCS.2024.19},
annote = {Keywords: Graph algorithms, Sublinear algorithms, Data structures, Graph theory}
}
@InProceedings{briet_et_al:LIPIcs.ITCS.2024.20,
author = {Bri\"{e}t, Jop and Christandl, Matthias and Leigh, Itai and Shpilka, Amir and Zuiddam, Jeroen},
title = {{Discreteness of Asymptotic Tensor Ranks}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {20:1--20:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.20},
URN = {urn:nbn:de:0030-drops-195483},
doi = {10.4230/LIPIcs.ITCS.2024.20},
annote = {Keywords: Tensors, Asymptotic rank, Subrank, Slice rank, Restriction, Degeneration, Diagonalization, SLOCC}
}
@InProceedings{briet_et_al:LIPIcs.ITCS.2024.21,
author = {Bri\"{e}t, Jop and Buhrman, Harry and Castro-Silva, Davi and Neumann, Niels M. P.},
title = {{Noisy Decoding by Shallow Circuits with Parities: Classical and Quantum (Extended Abstract)}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {21:1--21:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.21},
URN = {urn:nbn:de:0030-drops-195490},
doi = {10.4230/LIPIcs.ITCS.2024.21},
annote = {Keywords: Coding theory, circuit complexity, quantum complexity theory, higher-order Fourier analysis, non-local games}
}
@InProceedings{bringmann_et_al:LIPIcs.ITCS.2024.22,
author = {Bringmann, Karl and Gr{\o}nlund, Allan and K\"{u}nnemann, Marvin and Larsen, Kasper Green},
title = {{The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {22:1--22:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.22},
URN = {urn:nbn:de:0030-drops-195500},
doi = {10.4230/LIPIcs.ITCS.2024.22},
annote = {Keywords: Fine-grained complexity theory, non-deterministic finite automata}
}
@InProceedings{canonne_et_al:LIPIcs.ITCS.2024.23,
author = {Canonne, Cl\'{e}ment L. and Sun, Yucheng},
title = {{Private Distribution Testing with Heterogeneous Constraints: Your Epsilon Might Not Be Mine}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {23:1--23:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.23},
URN = {urn:nbn:de:0030-drops-195518},
doi = {10.4230/LIPIcs.ITCS.2024.23},
annote = {Keywords: differential privacy, distribution testing, local privacy, shuffle privacy}
}
@InProceedings{caro_et_al:LIPIcs.ITCS.2024.24,
author = {Caro, Matthias C. and Hinsche, Marcel and Ioannou, Marios and Nietner, Alexander and Sweke, Ryan},
title = {{Classical Verification of Quantum Learning}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {24:1--24:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.24},
URN = {urn:nbn:de:0030-drops-195524},
doi = {10.4230/LIPIcs.ITCS.2024.24},
annote = {Keywords: computational learning theory, quantum learning theory, interactive proofs, quantum oracles, agnostic learning}
}
@InProceedings{chandra_et_al:LIPIcs.ITCS.2024.25,
author = {Chandra, Pritam and Garg, Ankit and Kayal, Neeraj and Mittal, Kunal and Sinha, Tanmay},
title = {{Learning Arithmetic Formulas in the Presence of Noise: A General Framework and Applications to Unsupervised Learning}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {25:1--25:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.25},
URN = {urn:nbn:de:0030-drops-195537},
doi = {10.4230/LIPIcs.ITCS.2024.25},
annote = {Keywords: Arithmetic Circuits, Robust Vector Space Decomposition, Subspace Clustering, Mixtures of Gaussians}
}
@InProceedings{chang:LIPIcs.ITCS.2024.26,
author = {Chang, Yi-Jun},
title = {{The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {26:1--26:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.26},
URN = {urn:nbn:de:0030-drops-195546},
doi = {10.4230/LIPIcs.ITCS.2024.26},
annote = {Keywords: Distributed graph algorithms, locality}
}
@InProceedings{chatterjee_et_al:LIPIcs.ITCS.2024.27,
author = {Chatterjee, Abhranil and Kumar, Mrinal and Volk, Ben Lee},
title = {{Determinants vs. Algebraic Branching Programs}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {27:1--27:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.27},
URN = {urn:nbn:de:0030-drops-195550},
doi = {10.4230/LIPIcs.ITCS.2024.27},
annote = {Keywords: Determinant, Algebraic Branching Program, Lower Bounds, Singular Variety}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.ITCS.2024.28,
author = {Chattopadhyay, Eshan and Goodman, Jesse and Gurumukhani, Mohit},
title = {{Extractors for Polynomial Sources over \mathbb{F}₂}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {28:1--28:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.28},
URN = {urn:nbn:de:0030-drops-195569},
doi = {10.4230/LIPIcs.ITCS.2024.28},
annote = {Keywords: Extractors, low-degree polynomials, varieties, sumset extractors}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.ITCS.2024.29,
author = {Chattopadhyay, Eshan and Liao, Jyun-Jie},
title = {{Recursive Error Reduction for Regular Branching Programs}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {29:1--29:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.29},
URN = {urn:nbn:de:0030-drops-195571},
doi = {10.4230/LIPIcs.ITCS.2024.29},
annote = {Keywords: read-once branching program, regular branching program, weighted pseudorandom generator, derandomization}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2024.30,
author = {Chen, Zongchen and Mossel, Elchanan},
title = {{Influence Maximization in Ising Models}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {30:1--30:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.30},
URN = {urn:nbn:de:0030-drops-195588},
doi = {10.4230/LIPIcs.ITCS.2024.30},
annote = {Keywords: Influence maximization, Ising model, phase transition, correlation decay}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2024.31,
author = {Chen, Zhili and Grochow, Joshua A. and Qiao, Youming and Tang, Gang and Zhang, Chuanqi},
title = {{On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials III: Actions by Classical Groups}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {31:1--31:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.31},
URN = {urn:nbn:de:0030-drops-195595},
doi = {10.4230/LIPIcs.ITCS.2024.31},
annote = {Keywords: complexity class, tensor isomorphism, polynomial isomorphism, group isomorphism, local operations and classical communication}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2024.32,
author = {Chen, Justin Y. and Indyk, Piotr and Woodruff, David P.},
title = {{Space-Optimal Profile Estimation in Data Streams with Applications to Symmetric Functions}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {32:1--32:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.32},
URN = {urn:nbn:de:0030-drops-195605},
doi = {10.4230/LIPIcs.ITCS.2024.32},
annote = {Keywords: Streaming and Sketching Algorithms, Sublinear Algorithms}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2024.33,
author = {Chen, Xi and De, Anindya and Li, Yuhao and Nadimpalli, Shivam and Servedio, Rocco A.},
title = {{Testing Intersecting and Union-Closed Families}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {33:1--33:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.33},
URN = {urn:nbn:de:0030-drops-195610},
doi = {10.4230/LIPIcs.ITCS.2024.33},
annote = {Keywords: Sublinear algorithms, property testing, computational complexity, monotonicity, intersecting families, union-closed families}
}
@InProceedings{chiesa_et_al:LIPIcs.ITCS.2024.34,
author = {Chiesa, Alessandro and Guan, Ziyi and Y{\i}ld{\i}z, Burcu},
title = {{On Parallel Repetition of PCPs}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {34:1--34:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.34},
URN = {urn:nbn:de:0030-drops-195629},
doi = {10.4230/LIPIcs.ITCS.2024.34},
annote = {Keywords: probabilistically checkable proofs, parallel repetition}
}
@InProceedings{cosson_et_al:LIPIcs.ITCS.2024.35,
author = {Cosson, Romain and Massouli\'{e}, Laurent},
title = {{Collective Tree Exploration via Potential Function Method}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {35:1--35:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.35},
URN = {urn:nbn:de:0030-drops-195638},
doi = {10.4230/LIPIcs.ITCS.2024.35},
annote = {Keywords: collective exploration, online algorithms, evolving tree, competitive analysis}
}
@InProceedings{dani_et_al:LIPIcs.ITCS.2024.36,
author = {Dani, Varsha and Hayes, Thomas P. and Pettie, Seth and Saia, Jared},
title = {{Fraud Detection for Random Walks}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {36:1--36:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.36},
URN = {urn:nbn:de:0030-drops-195645},
doi = {10.4230/LIPIcs.ITCS.2024.36},
annote = {Keywords: Fraud detection, random processes, Markov chains}
}
@InProceedings{daskalakis_et_al:LIPIcs.ITCS.2024.37,
author = {Daskalakis, Constantinos and Golowich, Noah and Haghtalab, Nika and Shetty, Abhishek},
title = {{Smooth Nash Equilibria: Algorithms and Complexity}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {37:1--37:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.37},
URN = {urn:nbn:de:0030-drops-195657},
doi = {10.4230/LIPIcs.ITCS.2024.37},
annote = {Keywords: Nash equilibrium, smoothed analysis, PPAD}
}
@InProceedings{demaine_et_al:LIPIcs.ITCS.2024.38,
author = {Demaine, Erik D. and Kirkpatrick, Yael and Lin, Rebecca},
title = {{Graph Threading}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {38:1--38:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.38},
URN = {urn:nbn:de:0030-drops-195665},
doi = {10.4230/LIPIcs.ITCS.2024.38},
annote = {Keywords: Shortest walk, Eulerian cycle, perfect matching, beading}
}
@InProceedings{dinev_et_al:LIPIcs.ITCS.2024.39,
author = {Dinev, Atanas and Weinberg, S. Matthew},
title = {{Simple and Optimal Online Contention Resolution Schemes for k-Uniform Matroids}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {39:1--39:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.39},
URN = {urn:nbn:de:0030-drops-195677},
doi = {10.4230/LIPIcs.ITCS.2024.39},
annote = {Keywords: online contention resolutions schemes, prophet inequalities, online algorithms, approximation algorithms}
}
@InProceedings{dottling_et_al:LIPIcs.ITCS.2024.40,
author = {D\"{o}ttling, Nico and Mour, Tamer},
title = {{On the Black-Box Complexity of Correlation Intractability}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {40:1--40:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.40},
URN = {urn:nbn:de:0030-drops-195683},
doi = {10.4230/LIPIcs.ITCS.2024.40},
annote = {Keywords: Correlation Intractability, Fiat-Shamir, Black-box Complexity, Black-box Separations}
}
@InProceedings{dufoulon_et_al:LIPIcs.ITCS.2024.41,
author = {Dufoulon, Fabien and Pai, Shreyas and Pandurangan, Gopal and Pemmaraju, Sriram V. and Robinson, Peter},
title = {{The Message Complexity of Distributed Graph Optimization}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {41:1--41:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.41},
URN = {urn:nbn:de:0030-drops-195690},
doi = {10.4230/LIPIcs.ITCS.2024.41},
annote = {Keywords: Distributed graph algorithm, message complexity, distributed approximation}
}
@InProceedings{dufoulon_et_al:LIPIcs.ITCS.2024.42,
author = {Dufoulon, Fabien and Moorman, Michael and Moses Jr., William K. and Pandurangan, Gopal},
title = {{Time- and Communication-Efficient Overlay Network Construction via Gossip}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {42:1--42:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.42},
URN = {urn:nbn:de:0030-drops-195700},
doi = {10.4230/LIPIcs.ITCS.2024.42},
annote = {Keywords: Peer-to-Peer Networks, Overlay Construction Protocol, Gossip, Expanders, Sublinear Bounds}
}
@InProceedings{dutta_et_al:LIPIcs.ITCS.2024.43,
author = {Dutta, Pranjal and Gesmundo, Fulvio and Ikenmeyer, Christian and Jindal, Gorav and Lysikov, Vladimir},
title = {{Homogeneous Algebraic Complexity Theory and Algebraic Formulas}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {43:1--43:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.43},
URN = {urn:nbn:de:0030-drops-195713},
doi = {10.4230/LIPIcs.ITCS.2024.43},
annote = {Keywords: Homogeneous polynomials, Waring rank, Arithmetic formulas, Border complexity, Geometric Complexity theory, Symmetric polynomials}
}
@InProceedings{ezra_et_al:LIPIcs.ITCS.2024.44,
author = {Ezra, Tomer and Feldman, Michal and Schlesinger, Maya},
title = {{On the (In)approximability of Combinatorial Contracts}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {44:1--44:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.44},
URN = {urn:nbn:de:0030-drops-195724},
doi = {10.4230/LIPIcs.ITCS.2024.44},
annote = {Keywords: algorithmic contract design, combinatorial contracts, moral hazard}
}
@InProceedings{fei_et_al:LIPIcs.ITCS.2024.45,
author = {Fei, Yumou and Goldberg, Leslie Ann and Lu, Pinyan},
title = {{Two-State Spin Systems with Negative Interactions}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {45:1--45:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.45},
URN = {urn:nbn:de:0030-drops-195739},
doi = {10.4230/LIPIcs.ITCS.2024.45},
annote = {Keywords: Approximate Counting, Spin Systems, #P-Hardness, Randomized Algorithms}
}
@InProceedings{fernando_et_al:LIPIcs.ITCS.2024.46,
author = {Fernando, Rex and Gelles, Yuval and Komargodski, Ilan},
title = {{Scalable Distributed Agreement from LWE: Byzantine Agreement, Broadcast, and Leader Election}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {46:1--46:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.46},
URN = {urn:nbn:de:0030-drops-195744},
doi = {10.4230/LIPIcs.ITCS.2024.46},
annote = {Keywords: Byzantine agreement, scalable, learning with errors}
}
@InProceedings{ferreirapintojr._et_al:LIPIcs.ITCS.2024.47,
author = {Ferreira Pinto Jr., Renato and Harms, Nathaniel},
title = {{Distribution Testing with a Confused Collector}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {47:1--47:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.47},
URN = {urn:nbn:de:0030-drops-195755},
doi = {10.4230/LIPIcs.ITCS.2024.47},
annote = {Keywords: Distribution testing, property testing, uniformity testing, identity testing, earth-mover distance, sublinear algorithms}
}
@InProceedings{filmus_et_al:LIPIcs.ITCS.2024.48,
author = {Filmus, Yuval and Hirsch, Edward A. and Riazanov, Artur and Smal, Alexander and Vinyals, Marc},
title = {{Proving Unsatisfiability with Hitting Formulas}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {48:1--48:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.48},
URN = {urn:nbn:de:0030-drops-195762},
doi = {10.4230/LIPIcs.ITCS.2024.48},
annote = {Keywords: hitting formulas, polynomial identity testing, query complexity}
}
@InProceedings{fischer_et_al:LIPIcs.ITCS.2024.49,
author = {Fischer, Nick and Kaliciak, Piotr and Polak, Adam},
title = {{Deterministic 3SUM-Hardness}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {49:1--49:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.49},
URN = {urn:nbn:de:0030-drops-195772},
doi = {10.4230/LIPIcs.ITCS.2024.49},
annote = {Keywords: 3SUM, derandomization, fine-grained complexity}
}
@InProceedings{folwarczny_et_al:LIPIcs.ITCS.2024.50,
author = {Folwarczn\'{y}, Luk\'{a}\v{s} and G\"{o}\"{o}s, Mika and Hub\'{a}\v{c}ek, Pavel and Maystre, Gilbert and Yuan, Weiqiang},
title = {{One-Way Functions vs. TFNP: Simpler and Improved}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {50:1--50:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.50},
URN = {urn:nbn:de:0030-drops-195788},
doi = {10.4230/LIPIcs.ITCS.2024.50},
annote = {Keywords: TFNP, One-Way Functions, Oracle, Separation, Black-Box}
}
@InProceedings{frongillo_et_al:LIPIcs.ITCS.2024.51,
author = {Frongillo, Rafael and Papireddygari, Maneesha and Waggoner, Bo},
title = {{An Axiomatic Characterization of CFMMs and Equivalence to Prediction Markets}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {51:1--51:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.51},
URN = {urn:nbn:de:0030-drops-195795},
doi = {10.4230/LIPIcs.ITCS.2024.51},
annote = {Keywords: Convex analysis, Equivalence result, Axiomatic characterization, Market Makers, Prediction markets, Scoring rules, Cost-functions}
}
@InProceedings{ge_et_al:LIPIcs.ITCS.2024.52,
author = {Ge, Haosen and Bastani, Hamsa and Bastani, Osbert},
title = {{Rethinking Fairness for Human-AI Collaboration}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {52:1--52:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.52},
URN = {urn:nbn:de:0030-drops-195805},
doi = {10.4230/LIPIcs.ITCS.2024.52},
annote = {Keywords: fairness, human-AI collaboration, selective compliance}
}
@InProceedings{ghosh_et_al:LIPIcs.ITCS.2024.53,
author = {Ghosh, Prantar and Shah, Vihan},
title = {{New Lower Bounds in Merlin-Arthur Communication and Graph Streaming Verification}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {53:1--53:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.53},
URN = {urn:nbn:de:0030-drops-195815},
doi = {10.4230/LIPIcs.ITCS.2024.53},
annote = {Keywords: Graph Algorithms, Streaming, Communication Complexity, Stream Verification, Merlin-Arthur Communication, Lower Bounds}
}
@InProceedings{golowich_et_al:LIPIcs.ITCS.2024.54,
author = {Golowich, Louis and Kaufman, Tali},
title = {{NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {54:1--54:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.54},
URN = {urn:nbn:de:0030-drops-195829},
doi = {10.4230/LIPIcs.ITCS.2024.54},
annote = {Keywords: NLTS Hamiltonian, Quantum PCP, Sum-of-squares lower bound, Quantum LDPC code}
}
@InProceedings{goranci_et_al:LIPIcs.ITCS.2024.55,
author = {Goranci, Gramoz and Henzinger, Monika and R\"{a}cke, Harald and Sachdeva, Sushant and Sricharan, A. R.},
title = {{Electrical Flows for Polylogarithmic Competitive Oblivious Routing}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {55:1--55:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.55},
URN = {urn:nbn:de:0030-drops-195830},
doi = {10.4230/LIPIcs.ITCS.2024.55},
annote = {Keywords: oblivious routing, electrical flows}
}
@InProceedings{goswami_et_al:LIPIcs.ITCS.2024.56,
author = {Goswami, Mayank and Jacob, Riko},
title = {{An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {56:1--56:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.56},
URN = {urn:nbn:de:0030-drops-195843},
doi = {10.4230/LIPIcs.ITCS.2024.56},
annote = {Keywords: Sorting, Priced Information, Nuts and Bolts}
}
@InProceedings{haghtalab_et_al:LIPIcs.ITCS.2024.57,
author = {Haghtalab, Nika and Immorlica, Nicole and Lucier, Brendan and Mobius, Markus and Mohan, Divyarthi},
title = {{Communicating with Anecdotes}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {57:1--57:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.57},
URN = {urn:nbn:de:0030-drops-195852},
doi = {10.4230/LIPIcs.ITCS.2024.57},
annote = {Keywords: Communication game, Equilibrium, Polarization, Signalling}
}
@InProceedings{hambardzumyan_et_al:LIPIcs.ITCS.2024.58,
author = {Hambardzumyan, Lianna and Pitassi, Toniann and Sherif, Suhail and Shirley, Morgan and Shraibman, Adi},
title = {{An Improved Protocol for ExactlyN with More Than 3 Players}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {58:1--58:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.58},
URN = {urn:nbn:de:0030-drops-195868},
doi = {10.4230/LIPIcs.ITCS.2024.58},
annote = {Keywords: Corner-free sets, number-on-forehead communication}
}
@InProceedings{hartline_et_al:LIPIcs.ITCS.2024.59,
author = {Hartline, Jason and Johnsen, Aleck},
title = {{Equivocal Blends: Prior Independent Lower Bounds}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {59:1--59:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.59},
URN = {urn:nbn:de:0030-drops-195878},
doi = {10.4230/LIPIcs.ITCS.2024.59},
annote = {Keywords: prior independent algorithms, lower bounds, correlated decompositions, minimax, equivocal blends, mechanism design, blackwell ordering}
}
@InProceedings{haviv:LIPIcs.ITCS.2024.60,
author = {Haviv, Ishay},
title = {{The Chromatic Number of Kneser Hypergraphs via Consensus Division}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {60:1--60:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.60},
URN = {urn:nbn:de:0030-drops-195883},
doi = {10.4230/LIPIcs.ITCS.2024.60},
annote = {Keywords: Kneser hypergraphs, consensus division, the complexity classes PPA-p}
}
@InProceedings{hellerstein_et_al:LIPIcs.ITCS.2024.61,
author = {Hellerstein, Lisa and Liu, Naifeng and Schewior, Kevin},
title = {{Quickly Determining Who Won an Election}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {61:1--61:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.61},
URN = {urn:nbn:de:0030-drops-195890},
doi = {10.4230/LIPIcs.ITCS.2024.61},
annote = {Keywords: stochastic function evaluation, voting, approximation algorithms}
}
@InProceedings{henzinger_et_al:LIPIcs.ITCS.2024.62,
author = {Henzinger, Monika and Saha, Barna and Seybold, Martin P. and Ye, Christopher},
title = {{On the Complexity of Algorithms with Predictions for Dynamic Graph Problems}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {62:1--62:25},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.62},
URN = {urn:nbn:de:0030-drops-195907},
doi = {10.4230/LIPIcs.ITCS.2024.62},
annote = {Keywords: Dynamic Graph Algorithms, Algorithms with Predictions}
}
@InProceedings{hubacek_et_al:LIPIcs.ITCS.2024.63,
author = {Hub\'{a}\v{c}ek, Pavel and Khaniki, Erfan and Thapen, Neil},
title = {{TFNP Intersections Through the Lens of Feasible Disjunction}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {63:1--63:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.63},
URN = {urn:nbn:de:0030-drops-195917},
doi = {10.4230/LIPIcs.ITCS.2024.63},
annote = {Keywords: TFNP, feasible disjunction, proof complexity, TFNP intersection classes}
}
@InProceedings{inamdar_et_al:LIPIcs.ITCS.2024.64,
author = {Inamdar, Tanmay and Kundu, Madhumita and Parviainen, Pekka and Ramanujan, M. S. and Saurabh, Saket},
title = {{Exponential-Time Approximation Schemes via Compression}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {64:1--64:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.64},
URN = {urn:nbn:de:0030-drops-195920},
doi = {10.4230/LIPIcs.ITCS.2024.64},
annote = {Keywords: Exponential-Time Algorithms, Approximation Algorithms, Graph Algorithms, Cut Problems}
}
@InProceedings{jaiswal_et_al:LIPIcs.ITCS.2024.65,
author = {Jaiswal, Ragesh and Kumar, Amit and Yadav, Jatin},
title = {{FPT Approximation for Capacitated Sum of Radii}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {65:1--65:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.65},
URN = {urn:nbn:de:0030-drops-195937},
doi = {10.4230/LIPIcs.ITCS.2024.65},
annote = {Keywords: Approximation algorithm, parameterized algorithm, clustering}
}
@InProceedings{jin_et_al:LIPIcs.ITCS.2024.66,
author = {Jin, Ce and Williams, R. Ryan and Young, Nathaniel},
title = {{A VLSI Circuit Model Accounting for Wire Delay}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {66:1--66:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.66},
URN = {urn:nbn:de:0030-drops-195949},
doi = {10.4230/LIPIcs.ITCS.2024.66},
annote = {Keywords: circuit complexity, systolic arrays, VLSI, wire delay}
}
@InProceedings{karam:LIPIcs.ITCS.2024.67,
author = {Karam, Thomas},
title = {{Small Sunflowers and the Structure of Slice Rank Decompositions}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {67:1--67:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.67},
URN = {urn:nbn:de:0030-drops-195953},
doi = {10.4230/LIPIcs.ITCS.2024.67},
annote = {Keywords: Slice rank, tensors, sunflowers, decompositions}
}
@InProceedings{karchmer:LIPIcs.ITCS.2024.68,
author = {Karchmer, Ari},
title = {{Distributional PAC-Learning from Nisan’s Natural Proofs}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {68:1--68:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.68},
URN = {urn:nbn:de:0030-drops-195964},
doi = {10.4230/LIPIcs.ITCS.2024.68},
annote = {Keywords: PAC-learning, average-case complexity, communication complexity, natural proofs}
}
@InProceedings{klein_et_al:LIPIcs.ITCS.2024.69,
author = {Klein, Ohad and Slote, Joseph and Volberg, Alexander and Zhang, Haonan},
title = {{Quantum and Classical Low-Degree Learning via a Dimension-Free Remez Inequality}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {69:1--69:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.69},
URN = {urn:nbn:de:0030-drops-195977},
doi = {10.4230/LIPIcs.ITCS.2024.69},
annote = {Keywords: Analysis of Boolean Functions, Remez Inequality, Bohnenblust-Hille Inequality, Statistical Learning Theory, Qudits}
}
@InProceedings{kong_et_al:LIPIcs.ITCS.2024.70,
author = {Kong, Weihao and Qiao, Mingda and Sen, Rajat},
title = {{A Combinatorial Approach to Robust PCA}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {70:1--70:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.70},
URN = {urn:nbn:de:0030-drops-195984},
doi = {10.4230/LIPIcs.ITCS.2024.70},
annote = {Keywords: Robust PCA, Sparse Recovery, Robust Statistics}
}
@InProceedings{lee_et_al:LIPIcs.ITCS.2024.71,
author = {Lee, Euiwoong and Manurangsi, Pasin},
title = {{Hardness of Approximating Bounded-Degree Max 2-CSP and Independent Set on k-Claw-Free Graphs}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {71:1--71:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.71},
URN = {urn:nbn:de:0030-drops-195996},
doi = {10.4230/LIPIcs.ITCS.2024.71},
annote = {Keywords: Hardness of Approximation, Bounded Degree, Constraint Satisfaction Problems, Independent Set}
}
@InProceedings{li_et_al:LIPIcs.ITCS.2024.72,
author = {Li, Xingjian and Liu, Qipeng and Pelecanos, Angelos and Yamakawa, Takashi},
title = {{Classical vs Quantum Advice and Proofs Under Classically-Accessible Oracle}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {72:1--72:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.72},
URN = {urn:nbn:de:0030-drops-196009},
doi = {10.4230/LIPIcs.ITCS.2024.72},
annote = {Keywords: quantum computation, computational complexity}
}
@InProceedings{li_et_al:LIPIcs.ITCS.2024.73,
author = {Li, Minming and Robinson, Peter and Zhu, Xianbin},
title = {{Dynamic Maximal Matching in Clique Networks}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {73:1--73:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.73},
URN = {urn:nbn:de:0030-drops-196017},
doi = {10.4230/LIPIcs.ITCS.2024.73},
annote = {Keywords: distributed graph algorithm, dynamic network, maximal matching, randomized algorithm, lower bound}
}
@InProceedings{li_et_al:LIPIcs.ITCS.2024.74,
author = {Li, Yuhao and Pires, William and Robere, Robert},
title = {{Intersection Classes in TFNP and Proof Complexity}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {74:1--74:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.74},
URN = {urn:nbn:de:0030-drops-196023},
doi = {10.4230/LIPIcs.ITCS.2024.74},
annote = {Keywords: TFNP, Proof Complexity, Intersection Classes}
}
@InProceedings{li:LIPIcs.ITCS.2024.75,
author = {Li, Jiawei},
title = {{Total NP Search Problems with Abundant Solutions}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {75:1--75:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.75},
URN = {urn:nbn:de:0030-drops-196031},
doi = {10.4230/LIPIcs.ITCS.2024.75},
annote = {Keywords: TFNP, Pigeonhole Principle}
}
@InProceedings{livni:LIPIcs.ITCS.2024.76,
author = {Livni, Roi},
title = {{Making Progress Based on False Discoveries}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {76:1--76:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.76},
URN = {urn:nbn:de:0030-drops-196040},
doi = {10.4230/LIPIcs.ITCS.2024.76},
annote = {Keywords: Adaptive Data Analysis, Stochastic Convex Optimization, Learning Theory}
}
@InProceedings{lokshtanov_et_al:LIPIcs.ITCS.2024.77,
author = {Lokshtanov, Daniel and Misra, Pranabendu and Saurabh, Saket and Zehavi, Meirav},
title = {{Kernelization of Counting Problems}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {77:1--77:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.77},
URN = {urn:nbn:de:0030-drops-196059},
doi = {10.4230/LIPIcs.ITCS.2024.77},
annote = {Keywords: Kernelization, Counting Problems}
}
@InProceedings{louf_et_al:LIPIcs.ITCS.2024.78,
author = {Louf, Baptiste and McDiarmid, Colin and Skerman, Fiona},
title = {{Modularity and Graph Expansion}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {78:1--78:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.78},
URN = {urn:nbn:de:0030-drops-196063},
doi = {10.4230/LIPIcs.ITCS.2024.78},
annote = {Keywords: edge expansion, modularity, community detection, resolution limit, conductance}
}
@InProceedings{mahankali_et_al:LIPIcs.ITCS.2024.79,
author = {Mahankali, Arvind V. and Woodruff, David P. and Zhang, Ziyu},
title = {{Near-Linear Time and Fixed-Parameter Tractable Algorithms for Tensor Decompositions}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {79:1--79:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.79},
URN = {urn:nbn:de:0030-drops-196078},
doi = {10.4230/LIPIcs.ITCS.2024.79},
annote = {Keywords: Low rank approximation, Sketching algorithms, Tensor decomposition}
}
@InProceedings{mazor_et_al:LIPIcs.ITCS.2024.80,
author = {Mazor, Noam and Pass, Rafael},
title = {{The Non-Uniform Perebor Conjecture for Time-Bounded Kolmogorov Complexity Is False}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {80:1--80:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.80},
URN = {urn:nbn:de:0030-drops-196088},
doi = {10.4230/LIPIcs.ITCS.2024.80},
annote = {Keywords: Kolmogorov complexity, perebor conjecture, function inversion}
}
@InProceedings{milionis_et_al:LIPIcs.ITCS.2024.81,
author = {Milionis, Jason and Moallemi, Ciamac C. and Roughgarden, Tim},
title = {{A Myersonian Framework for Optimal Liquidity Provision in Automated Market Makers}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {81:1--81:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.81},
URN = {urn:nbn:de:0030-drops-196094},
doi = {10.4230/LIPIcs.ITCS.2024.81},
annote = {Keywords: Posted-Price Mechanisms, Asset Exchange, Market Making, Automated Market Makers (AMMs), Blockchains, Decentralized Finance, Incentive Compatibility, Optimization}
}
@InProceedings{nehoran_et_al:LIPIcs.ITCS.2024.82,
author = {Nehoran, Barak and Zhandry, Mark},
title = {{A Computational Separation Between Quantum No-Cloning and No-Telegraphing}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {82:1--82:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.82},
URN = {urn:nbn:de:0030-drops-196104},
doi = {10.4230/LIPIcs.ITCS.2024.82},
annote = {Keywords: Cloning, telegraphing, no-cloning theorem, oracle separations}
}
@InProceedings{neiman_et_al:LIPIcs.ITCS.2024.83,
author = {Neiman, Ofer and Shabat, Idan},
title = {{On the Size Overhead of Pairwise Spanners}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {83:1--83:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.83},
URN = {urn:nbn:de:0030-drops-196110},
doi = {10.4230/LIPIcs.ITCS.2024.83},
annote = {Keywords: Graph Algorithms, Shortest Paths, Spanners}
}
@InProceedings{neogi_et_al:LIPIcs.ITCS.2024.84,
author = {Neogi, Rian and Pashkovich, Kanstantsin and Swamy, Chaitanya},
title = {{Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {84:1--84:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.84},
URN = {urn:nbn:de:0030-drops-196128},
doi = {10.4230/LIPIcs.ITCS.2024.84},
annote = {Keywords: Algorithmic mechanism design, Approximation algorithms, Budget-feasible mechanisms}
}
@InProceedings{nikolov_et_al:LIPIcs.ITCS.2024.85,
author = {Nikolov, Aleksandar and Tang, Haohua},
title = {{General Gaussian Noise Mechanisms and Their Optimality for Unbiased Mean Estimation}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {85:1--85:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.85},
URN = {urn:nbn:de:0030-drops-196133},
doi = {10.4230/LIPIcs.ITCS.2024.85},
annote = {Keywords: differential privacy, mean estimation, unbiased estimator, instance optimality}
}
@InProceedings{out_et_al:LIPIcs.ITCS.2024.86,
author = {Out, Charlotte and Rivera, Nicol\'{a}s and Sauerwald, Thomas and Sylvester, John},
title = {{Rumors with Changing Credibility}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {86:1--86:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.86},
URN = {urn:nbn:de:0030-drops-196149},
doi = {10.4230/LIPIcs.ITCS.2024.86},
annote = {Keywords: Rumor spreading, epidemic algorithms, "fake news"}
}
@InProceedings{peleg_et_al:LIPIcs.ITCS.2024.87,
author = {Peleg, Shir and Shpilka, Amir and Volk, Ben Lee},
title = {{Tensor Reconstruction Beyond Constant Rank}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {87:1--87:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.87},
URN = {urn:nbn:de:0030-drops-196157},
doi = {10.4230/LIPIcs.ITCS.2024.87},
annote = {Keywords: Algebraic circuits, reconstruction, tensor decomposition, tensor rank}
}
@InProceedings{petruschka_et_al:LIPIcs.ITCS.2024.88,
author = {Petruschka, Asaf and Sapir, Shay and Tzalik, Elad},
title = {{Color Fault-Tolerant Spanners}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {88:1--88:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.88},
URN = {urn:nbn:de:0030-drops-196160},
doi = {10.4230/LIPIcs.ITCS.2024.88},
annote = {Keywords: Fault tolerance, Graph spanners}
}
@InProceedings{pratt:LIPIcs.ITCS.2024.89,
author = {Pratt, Kevin},
title = {{On Generalized Corners and Matrix Multiplication}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {89:1--89:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.89},
URN = {urn:nbn:de:0030-drops-196174},
doi = {10.4230/LIPIcs.ITCS.2024.89},
annote = {Keywords: Algebraic computation, fast matrix multiplication, additive combinatorics}
}
@InProceedings{putterman_et_al:LIPIcs.ITCS.2024.90,
author = {Putterman, Aaron (Louie) and Pyne, Edward},
title = {{Pseudorandom Linear Codes Are List-Decodable to Capacity}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {90:1--90:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.90},
URN = {urn:nbn:de:0030-drops-196183},
doi = {10.4230/LIPIcs.ITCS.2024.90},
annote = {Keywords: Derandomization, error-correcting codes}
}
@InProceedings{ramya_et_al:LIPIcs.ITCS.2024.91,
author = {Ramya, C. and Shastri, Pratik},
title = {{Lower Bounds for Planar Arithmetic Circuits}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {91:1--91:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.91},
URN = {urn:nbn:de:0030-drops-196199},
doi = {10.4230/LIPIcs.ITCS.2024.91},
annote = {Keywords: Arithmetic circuit complexity, Planar circuits, Bilinear forms}
}
@InProceedings{slote:LIPIcs.ITCS.2024.92,
author = {Slote, Joseph},
title = {{Parity vs. AC0 with Simple Quantum Preprocessing}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {92:1--92:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.92},
URN = {urn:nbn:de:0030-drops-196209},
doi = {10.4230/LIPIcs.ITCS.2024.92},
annote = {Keywords: QNC0, AC0, Nonlocal games, k-wise indistinguishability, approximate degree, switching lemma, Fourier concentration}
}
@InProceedings{song_et_al:LIPIcs.ITCS.2024.93,
author = {Song, Zhao and Zhang, Lichen and Zhang, Ruizhe},
title = {{Training Multi-Layer Over-Parametrized Neural Network in Subquadratic Time}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {93:1--93:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.93},
URN = {urn:nbn:de:0030-drops-196212},
doi = {10.4230/LIPIcs.ITCS.2024.93},
annote = {Keywords: Deep learning theory, Nonconvex optimization}
}
@InProceedings{steiner:LIPIcs.ITCS.2024.94,
author = {Steiner, Teresa Anna},
title = {{Differentially Private Approximate Pattern Matching}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {94:1--94:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.94},
URN = {urn:nbn:de:0030-drops-196223},
doi = {10.4230/LIPIcs.ITCS.2024.94},
annote = {Keywords: Differential privacy, pattern matching}
}
@InProceedings{tzameret_et_al:LIPIcs.ITCS.2024.95,
author = {Tzameret, Iddo and Zhang, Lu-Ming},
title = {{Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {95:1--95:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.95},
URN = {urn:nbn:de:0030-drops-196234},
doi = {10.4230/LIPIcs.ITCS.2024.95},
annote = {Keywords: Pseudorandomness, Cryptography, Natural Proofs, Nondeterminism, Lower bounds}
}
@InProceedings{valiant:LIPIcs.ITCS.2024.96,
author = {Valiant, Gregory},
title = {{Matrix Multiplication in Quadratic Time and Energy? Towards a Fine-Grained Energy-Centric Church-Turing Thesis}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {96:1--96:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.96},
URN = {urn:nbn:de:0030-drops-196248},
doi = {10.4230/LIPIcs.ITCS.2024.96},
annote = {Keywords: Physics based computing, matrix multiplication, low-energy computing}
}
@InProceedings{watts_et_al:LIPIcs.ITCS.2024.97,
author = {Watts, Adam Bene and Bostanci, John},
title = {{Quantum Event Learning and Gentle Random Measurements}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {97:1--97:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.97},
URN = {urn:nbn:de:0030-drops-196254},
doi = {10.4230/LIPIcs.ITCS.2024.97},
annote = {Keywords: Event learning, gentle measurments, random measurements, quantum or, threshold search, shadow tomography}
}
@InProceedings{wu_et_al:LIPIcs.ITCS.2024.98,
author = {Wu, Ke and Shi, Elaine and Chung, Hao},
title = {{Maximizing Miner Revenue in Transaction Fee Mechanism Design}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {98:1--98:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.98},
URN = {urn:nbn:de:0030-drops-196266},
doi = {10.4230/LIPIcs.ITCS.2024.98},
annote = {Keywords: Blockchain, Mechanism Design, Transaction Fee}
}
@InProceedings{yu_et_al:LIPIcs.ITCS.2024.99,
author = {Yu, Huacheng and Zhan, Wei},
title = {{Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {99:1--99:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.99},
URN = {urn:nbn:de:0030-drops-196270},
doi = {10.4230/LIPIcs.ITCS.2024.99},
annote = {Keywords: Time-space tradeoffs, Randomness, Borodin-Cook method}
}
@InProceedings{yu_et_al:LIPIcs.ITCS.2024.100,
author = {Yu, Huacheng and Zhan, Wei},
title = {{Sampling, Flowers and Communication}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {100:1--100:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.100},
URN = {urn:nbn:de:0030-drops-196288},
doi = {10.4230/LIPIcs.ITCS.2024.100},
annote = {Keywords: Flower, Sampling, Cell probe, Communcation complexity}
}
@InProceedings{zhandry:LIPIcs.ITCS.2024.101,
author = {Zhandry, Mark},
title = {{Quantum Money from Abelian Group Actions}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {101:1--101:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.101},
URN = {urn:nbn:de:0030-drops-196294},
doi = {10.4230/LIPIcs.ITCS.2024.101},
annote = {Keywords: Quantum Money, Cryptographic Group Actions, Isogenies}
}
@InProceedings{zhandry:LIPIcs.ITCS.2024.102,
author = {Zhandry, Mark},
title = {{The Space-Time Cost of Purifying Quantum Computations}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {102:1--102:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.102},
URN = {urn:nbn:de:0030-drops-196304},
doi = {10.4230/LIPIcs.ITCS.2024.102},
annote = {Keywords: Quantum computation, intermediate measurements, time-space trade-offs}
}
@InProceedings{zhou_et_al:LIPIcs.ITCS.2024.103,
author = {Zhou, Mingxun and Zhao, Mengshi and Chan, T-H. Hubert and Shi, Elaine},
title = {{Advanced Composition Theorems for Differential Obliviousness}},
booktitle = {15th Innovations in Theoretical Computer Science Conference (ITCS 2024)},
pages = {103:1--103:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-309-6},
ISSN = {1868-8969},
year = {2024},
volume = {287},
editor = {Guruswami, Venkatesan},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.103},
URN = {urn:nbn:de:0030-drops-196315},
doi = {10.4230/LIPIcs.ITCS.2024.103},
annote = {Keywords: Differential Privacy, Oblivious Algorithms}
}
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