10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Proceedings{blum:LIPIcs.ITCS.2019, title = {{LIPIcs, Volume 124, ITCS'19, Complete Volume}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019}, URN = {urn:nbn:de:0030-drops-101704}, doi = {10.4230/LIPIcs.ITCS.2019}, annote = {Keywords: Theory of computation, Mathematics of computing} }
10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{blum:LIPIcs.ITCS.2019.0, author = {Blum, Avrim}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {0:i--0:xii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.0}, URN = {urn:nbn:de:0030-drops-100937}, doi = {10.4230/LIPIcs.ITCS.2019.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Shipra Agrawal, Mohammad Shadravan, and Cliff Stein. Submodular Secretary Problem with Shortlists. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 1:1-1:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{agrawal_et_al:LIPIcs.ITCS.2019.1, author = {Agrawal, Shipra and Shadravan, Mohammad and Stein, Cliff}, title = {{Submodular Secretary Problem with Shortlists}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {1:1--1:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.1}, URN = {urn:nbn:de:0030-drops-100949}, doi = {10.4230/LIPIcs.ITCS.2019.1}, annote = {Keywords: Submodular Optimization, Secretary Problem, Streaming Algorithms} }
Dorit Aharonov and Leo Zhou. Hamiltonian Sparsification and Gap-Simulation. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 2:1-2:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{aharonov_et_al:LIPIcs.ITCS.2019.2, author = {Aharonov, Dorit and Zhou, Leo}, title = {{Hamiltonian Sparsification and Gap-Simulation}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {2:1--2:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.2}, URN = {urn:nbn:de:0030-drops-100956}, doi = {10.4230/LIPIcs.ITCS.2019.2}, annote = {Keywords: quantum simulation, quantum Hamiltonian complexity, sparsification, quantum PCP} }
Alexandr Andoni, Robert Krauthgamer, and Yosef Pogrow. On Solving Linear Systems in Sublinear Time. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 3:1-3:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{andoni_et_al:LIPIcs.ITCS.2019.3, author = {Andoni, Alexandr and Krauthgamer, Robert and Pogrow, Yosef}, title = {{On Solving Linear Systems in Sublinear Time}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {3:1--3:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.3}, URN = {urn:nbn:de:0030-drops-100966}, doi = {10.4230/LIPIcs.ITCS.2019.3}, annote = {Keywords: Linear systems, Laplacian solver, Sublinear time, Randomized linear algebra} }
Benny Applebaum and Prashant Nalini Vasudevan. Placing Conditional Disclosure of Secrets in the Communication Complexity Universe. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 4:1-4:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{applebaum_et_al:LIPIcs.ITCS.2019.4, author = {Applebaum, Benny and Vasudevan, Prashant Nalini}, title = {{Placing Conditional Disclosure of Secrets in the Communication Complexity Universe}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {4:1--4:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.4}, URN = {urn:nbn:de:0030-drops-100976}, doi = {10.4230/LIPIcs.ITCS.2019.4}, annote = {Keywords: Conditional Disclosure of Secrets, Information-Theoretic Security} }
Nick Arnosti and S. Matthew Weinberg. Bitcoin: A Natural Oligopoly. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, p. 5:1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{arnosti_et_al:LIPIcs.ITCS.2019.5, author = {Arnosti, Nick and Weinberg, S. Matthew}, title = {{Bitcoin: A Natural Oligopoly}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {5:1--5:1}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.5}, URN = {urn:nbn:de:0030-drops-100989}, doi = {10.4230/LIPIcs.ITCS.2019.5}, annote = {Keywords: Bitcoin, Cryptocurrencies, Rent-Seeking Competition} }
Sepehr Assadi, Michael Kapralov, and Sanjeev Khanna. A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 6:1-6:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{assadi_et_al:LIPIcs.ITCS.2019.6, author = {Assadi, Sepehr and Kapralov, Michael and Khanna, Sanjeev}, title = {{A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {6:1--6:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.6}, URN = {urn:nbn:de:0030-drops-100996}, doi = {10.4230/LIPIcs.ITCS.2019.6}, annote = {Keywords: Sublinear-time algorithms, Subgraph counting, AGM bound} }
Per Austrin, Petteri Kaski, and Kaie Kubjas. Tensor Network Complexity of Multilinear Maps. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 7:1-7:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{austrin_et_al:LIPIcs.ITCS.2019.7, author = {Austrin, Per and Kaski, Petteri and Kubjas, Kaie}, title = {{Tensor Network Complexity of Multilinear Maps}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {7:1--7:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.7}, URN = {urn:nbn:de:0030-drops-101006}, doi = {10.4230/LIPIcs.ITCS.2019.7}, annote = {Keywords: arithmetic complexity, lower bound, multilinear map, tensor network} }
Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, and Srikanth Srinivasan. A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 8:1-8:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bajpai_et_al:LIPIcs.ITCS.2019.8, author = {Bajpai, Swapnam and Krishan, Vaibhav and Kush, Deepanshu and Limaye, Nutan and Srinivasan, Srikanth}, title = {{A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {8:1--8:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.8}, URN = {urn:nbn:de:0030-drops-101010}, doi = {10.4230/LIPIcs.ITCS.2019.8}, annote = {Keywords: SAT, Polynomial Threshold Functions, Constant-depth Boolean Circuits, Linear Decision Trees, Zero-error randomized algorithms} }
Boaz Barak, Pravesh K. Kothari, and David Steurer. Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 9:1-9:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{barak_et_al:LIPIcs.ITCS.2019.9, author = {Barak, Boaz and Kothari, Pravesh K. and Steurer, David}, title = {{Small-Set Expansion in Shortcode Graph and the 2-to-2 Conjecture}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {9:1--9:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.9}, URN = {urn:nbn:de:0030-drops-101022}, doi = {10.4230/LIPIcs.ITCS.2019.9}, annote = {Keywords: Unique Games Conjecture, Small-Set Expansion, Grassmann Graph, Shortcode} }
Adam Bene Watts, Aram W. Harrow, Gurtej Kanwar, and Anand Natarajan. Algorithms, Bounds, and Strategies for Entangled XOR Games. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 10:1-10:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{benewatts_et_al:LIPIcs.ITCS.2019.10, author = {Bene Watts, Adam and Harrow, Aram W. and Kanwar, Gurtej and Natarajan, Anand}, title = {{Algorithms, Bounds, and Strategies for Entangled XOR Games}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {10:1--10:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.10}, URN = {urn:nbn:de:0030-drops-101032}, doi = {10.4230/LIPIcs.ITCS.2019.10}, annote = {Keywords: Nonlocal games, XOR Games, Pseudotelepathy games, Multipartite entanglement} }
Omri Ben-Eliezer. Testing Local Properties of Arrays. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 11:1-11:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{beneliezer:LIPIcs.ITCS.2019.11, author = {Ben-Eliezer, Omri}, title = {{Testing Local Properties of Arrays}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {11:1--11:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.11}, URN = {urn:nbn:de:0030-drops-101041}, doi = {10.4230/LIPIcs.ITCS.2019.11}, annote = {Keywords: Property Testing, Local Properties, Monotonicity Testing, Hypergrid, Pattern Matching} }
Eli Ben-Sasson and Eden Saig. The Complexity of User Retention. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 12:1-12:30, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bensasson_et_al:LIPIcs.ITCS.2019.12, author = {Ben-Sasson, Eli and Saig, Eden}, title = {{The Complexity of User Retention}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {12:1--12:30}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.12}, URN = {urn:nbn:de:0030-drops-101053}, doi = {10.4230/LIPIcs.ITCS.2019.12}, annote = {Keywords: retentive learning, retention complexity, information elicitation, proper scoring rules} }
Abhishek Bhrushundi, Kaave Hosseini, Shachar Lovett, and Sankeerth Rao. Torus Polynomials: An Algebraic Approach to ACC Lower Bounds. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 13:1-13:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bhrushundi_et_al:LIPIcs.ITCS.2019.13, author = {Bhrushundi, Abhishek and Hosseini, Kaave and Lovett, Shachar and Rao, Sankeerth}, title = {{Torus Polynomials: An Algebraic Approach to ACC Lower Bounds}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {13:1--13:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.13}, URN = {urn:nbn:de:0030-drops-101066}, doi = {10.4230/LIPIcs.ITCS.2019.13}, annote = {Keywords: Circuit complexity, ACC, lower bounds, polynomials} }
Vittorio Bilò, Ioannis Caragiannis, Michele Flammini, Ayumi Igarashi, Gianpiero Monaco, Dominik Peters, Cosimo Vinci, and William S. Zwicker. Almost Envy-Free Allocations with Connected Bundles. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 14:1-14:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bilo_et_al:LIPIcs.ITCS.2019.14, author = {Bil\`{o}, Vittorio and Caragiannis, Ioannis and Flammini, Michele and Igarashi, Ayumi and Monaco, Gianpiero and Peters, Dominik and Vinci, Cosimo and Zwicker, William S.}, title = {{Almost Envy-Free Allocations with Connected Bundles}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {14:1--14:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.14}, URN = {urn:nbn:de:0030-drops-101078}, doi = {10.4230/LIPIcs.ITCS.2019.14}, annote = {Keywords: Envy-free Division, Cake-cutting, Resource Allocation, Algorithmic Game Theory} }
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani. "Quantum Supremacy" and the Complexity of Random Circuit Sampling. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 15:1-15:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bouland_et_al:LIPIcs.ITCS.2019.15, author = {Bouland, Adam and Fefferman, Bill and Nirkhe, Chinmay and Vazirani, Umesh}, title = {{"Quantum Supremacy" and the Complexity of Random Circuit Sampling}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {15:1--15:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.15}, URN = {urn:nbn:de:0030-drops-101084}, doi = {10.4230/LIPIcs.ITCS.2019.15}, annote = {Keywords: quantum supremacy, average-case hardness, verification} }
Elette Boyle, Rio LaVigne, and Vinod Vaikuntanathan. Adversarially Robust Property-Preserving Hash Functions. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 16:1-16:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{boyle_et_al:LIPIcs.ITCS.2019.16, author = {Boyle, Elette and LaVigne, Rio and Vaikuntanathan, Vinod}, title = {{Adversarially Robust Property-Preserving Hash Functions}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {16:1--16:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.16}, URN = {urn:nbn:de:0030-drops-101097}, doi = {10.4230/LIPIcs.ITCS.2019.16}, annote = {Keywords: Hash function, compression, property-preserving, one-way communication} }
Karthik C. S. and Pasin Manurangsi. On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{c.s._et_al:LIPIcs.ITCS.2019.17, author = {C. S., Karthik and Manurangsi, Pasin}, title = {{On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.17}, URN = {urn:nbn:de:0030-drops-101100}, doi = {10.4230/LIPIcs.ITCS.2019.17}, annote = {Keywords: Closest Pair, Bichromatic Closest Pair, Contact Dimension, Fine-Grained Complexity} }
Igor Carboni Oliveira, Rahul Santhanam, and Roei Tell. Expander-Based Cryptography Meets Natural Proofs. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{carbonioliveira_et_al:LIPIcs.ITCS.2019.18, author = {Carboni Oliveira, Igor and Santhanam, Rahul and Tell, Roei}, title = {{Expander-Based Cryptography Meets Natural Proofs}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.18}, URN = {urn:nbn:de:0030-drops-101112}, doi = {10.4230/LIPIcs.ITCS.2019.18}, annote = {Keywords: Pseudorandom Generators, One-Way Functions, Expanders, Circuit Complexity} }
André Chailloux. A Note on the Quantum Query Complexity of Permutation Symmetric Functions. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 19:1-19:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chailloux:LIPIcs.ITCS.2019.19, author = {Chailloux, Andr\'{e}}, title = {{A Note on the Quantum Query Complexity of Permutation Symmetric Functions}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {19:1--19:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.19}, URN = {urn:nbn:de:0030-drops-101126}, doi = {10.4230/LIPIcs.ITCS.2019.19}, annote = {Keywords: quantum query complexity, permutation symmetric functions} }
Deeparnab Chakrabarty and C. Seshadhri. Adaptive Boolean Monotonicity Testing in Total Influence Time. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 20:1-20:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chakrabarty_et_al:LIPIcs.ITCS.2019.20, author = {Chakrabarty, Deeparnab and Seshadhri, C.}, title = {{Adaptive Boolean Monotonicity Testing in Total Influence Time}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {20:1--20:7}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.20}, URN = {urn:nbn:de:0030-drops-101133}, doi = {10.4230/LIPIcs.ITCS.2019.20}, annote = {Keywords: Property Testing, Monotonicity Testing, Influence of Boolean Functions} }
Timothy M. Chan, Sariel Har-Peled, and Mitchell Jones. On Locality-Sensitive Orderings and Their Applications. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 21:1-21:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chan_et_al:LIPIcs.ITCS.2019.21, author = {Chan, Timothy M. and Har-Peled, Sariel and Jones, Mitchell}, title = {{On Locality-Sensitive Orderings and Their Applications}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {21:1--21:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.21}, URN = {urn:nbn:de:0030-drops-101140}, doi = {10.4230/LIPIcs.ITCS.2019.21}, annote = {Keywords: Approximation algorithms, Data structures, Computational geometry} }
Eshan Chattopadhyay, Pooya Hatami, Shachar Lovett, and Avishay Tal. Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 22:1-22:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chattopadhyay_et_al:LIPIcs.ITCS.2019.22, author = {Chattopadhyay, Eshan and Hatami, Pooya and Lovett, Shachar and Tal, Avishay}, title = {{Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {22:1--22:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.22}, URN = {urn:nbn:de:0030-drops-101150}, doi = {10.4230/LIPIcs.ITCS.2019.22}, annote = {Keywords: Derandomization, Pseudorandom generator, Explicit construction, Random walk, Small-depth circuits with parity gates} }
Lijie Chen and Ruosong Wang. Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 23:1-23:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chen_et_al:LIPIcs.ITCS.2019.23, author = {Chen, Lijie and Wang, Ruosong}, title = {{Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {23:1--23:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.23}, URN = {urn:nbn:de:0030-drops-101162}, doi = {10.4230/LIPIcs.ITCS.2019.23}, annote = {Keywords: Quantum communication protocols, Arthur-Merlin communication protocols, approximate counting, approximate rank} }
Wei Chen, Shang-Hua Teng, and Hanrui Zhang. Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 24:1-24:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chen_et_al:LIPIcs.ITCS.2019.24, author = {Chen, Wei and Teng, Shang-Hua and Zhang, Hanrui}, title = {{Capturing Complementarity in Set Functions by Going Beyond Submodularity/Subadditivity}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {24:1--24:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.24}, URN = {urn:nbn:de:0030-drops-101174}, doi = {10.4230/LIPIcs.ITCS.2019.24}, annote = {Keywords: set functions, measure of complementarity, submodularity, subadditivity, cardinality constrained maximization, welfare maximization, simple auctions, price of anarchy} }
Alessandro Chiesa, Peter Manohar, and Igor Shinkar. Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 25:1-25:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chiesa_et_al:LIPIcs.ITCS.2019.25, author = {Chiesa, Alessandro and Manohar, Peter and Shinkar, Igor}, title = {{Probabilistic Checking Against Non-Signaling Strategies from Linearity Testing}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {25:1--25:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.25}, URN = {urn:nbn:de:0030-drops-101188}, doi = {10.4230/LIPIcs.ITCS.2019.25}, annote = {Keywords: probabilistically checkable proofs, linearity testing, non-signaling strategies} }
Chi-Ning Chou, Kai-Min Chung, and Chi-Jen Lu. On the Algorithmic Power of Spiking Neural Networks. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 26:1-26:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chou_et_al:LIPIcs.ITCS.2019.26, author = {Chou, Chi-Ning and Chung, Kai-Min and Lu, Chi-Jen}, title = {{On the Algorithmic Power of Spiking Neural Networks}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {26:1--26:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.26}, URN = {urn:nbn:de:0030-drops-101191}, doi = {10.4230/LIPIcs.ITCS.2019.26}, annote = {Keywords: Spiking Neural Networks, Natural Algorithms, l\underline1 Minimization} }
Constantinos Daskalakis and Ioannis Panageas. Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 27:1-27:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{daskalakis_et_al:LIPIcs.ITCS.2019.27, author = {Daskalakis, Constantinos and Panageas, Ioannis}, title = {{Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {27:1--27:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.27}, URN = {urn:nbn:de:0030-drops-101204}, doi = {10.4230/LIPIcs.ITCS.2019.27}, annote = {Keywords: No regret learning, Zero-sum games, Convergence, Dynamical Systems, KL divergence} }
Anindya De, Philip M. Long, and Rocco A. Servedio. Density Estimation for Shift-Invariant Multidimensional Distributions. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 28:1-28:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{de_et_al:LIPIcs.ITCS.2019.28, author = {De, Anindya and Long, Philip M. and Servedio, Rocco A.}, title = {{Density Estimation for Shift-Invariant Multidimensional Distributions}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {28:1--28:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.28}, URN = {urn:nbn:de:0030-drops-101214}, doi = {10.4230/LIPIcs.ITCS.2019.28}, annote = {Keywords: Density estimation, unsupervised learning, log-concave distributions, non-parametrics} }
Irit Dinur, Prahladh Harsha, Tali Kaufman, and Noga Ron-Zewi. From Local to Robust Testing via Agreement Testing. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 29:1-29:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dinur_et_al:LIPIcs.ITCS.2019.29, author = {Dinur, Irit and Harsha, Prahladh and Kaufman, Tali and Ron-Zewi, Noga}, title = {{From Local to Robust Testing via Agreement Testing}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {29:1--29:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.29}, URN = {urn:nbn:de:0030-drops-101221}, doi = {10.4230/LIPIcs.ITCS.2019.29}, annote = {Keywords: Local testing, Robust testing, Agreement testing, Affine-invariant codes, Lifted codes} }
Irit Dinur, Oded Goldreich, and Tom Gur. Every Set in P Is Strongly Testable Under a Suitable Encoding. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 30:1-30:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dinur_et_al:LIPIcs.ITCS.2019.30, author = {Dinur, Irit and Goldreich, Oded and Gur, Tom}, title = {{Every Set in P Is Strongly Testable Under a Suitable Encoding}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {30:1--30:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.30}, URN = {urn:nbn:de:0030-drops-101234}, doi = {10.4230/LIPIcs.ITCS.2019.30}, annote = {Keywords: Probabilistically checkable proofs, property testing} }
Shaddin Dughmi, David Kempe, and Ruixin Qiang. Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 31:1-31:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dughmi_et_al:LIPIcs.ITCS.2019.31, author = {Dughmi, Shaddin and Kempe, David and Qiang, Ruixin}, title = {{Alea Iacta Est: Auctions, Persuasion, Interim Rules, and Dice}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {31:1--31:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.31}, URN = {urn:nbn:de:0030-drops-101248}, doi = {10.4230/LIPIcs.ITCS.2019.31}, annote = {Keywords: Interim rule, order sampling, virtual value function, Border's theorem} }
Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, and Avi Wigderson. Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 32:1-32:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dvir_et_al:LIPIcs.ITCS.2019.32, author = {Dvir, Zeev and Gopi, Sivakanth and Gu, Yuzhou and Wigderson, Avi}, title = {{Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {32:1--32:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.32}, URN = {urn:nbn:de:0030-drops-101258}, doi = {10.4230/LIPIcs.ITCS.2019.32}, annote = {Keywords: Locally correctable codes, spanoids, entropy, bootstrap percolation, gossip spreading, matroid, union-closed family} }
Cynthia Dwork and Christina Ilvento. Fairness Under Composition. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 33:1-33:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{dwork_et_al:LIPIcs.ITCS.2019.33, author = {Dwork, Cynthia and Ilvento, Christina}, title = {{Fairness Under Composition}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {33:1--33:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.33}, URN = {urn:nbn:de:0030-drops-101269}, doi = {10.4230/LIPIcs.ITCS.2019.33}, annote = {Keywords: algorithmic fairness, fairness, fairness under composition} }
Yuval Filmus, Ryan O'Donnell, and Xinyu Wu. A Log-Sobolev Inequality for the Multislice, with Applications. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 34:1-34:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{filmus_et_al:LIPIcs.ITCS.2019.34, author = {Filmus, Yuval and O'Donnell, Ryan and Wu, Xinyu}, title = {{A Log-Sobolev Inequality for the Multislice, with Applications}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {34:1--34:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.34}, URN = {urn:nbn:de:0030-drops-101279}, doi = {10.4230/LIPIcs.ITCS.2019.34}, annote = {Keywords: log-Sobolev inequality, small-set expansion, conductance, hypercontractivity, Fourier analysis, representation theory, Markov chains, combinatorics} }
Anna Gál, Avishay Tal, and Adrian Trejo Nuñez. Cubic Formula Size Lower Bounds Based on Compositions with Majority. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 35:1-35:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{gal_et_al:LIPIcs.ITCS.2019.35, author = {G\'{a}l, Anna and Tal, Avishay and Trejo Nu\~{n}ez, Adrian}, title = {{Cubic Formula Size Lower Bounds Based on Compositions with Majority}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {35:1--35:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.35}, URN = {urn:nbn:de:0030-drops-101283}, doi = {10.4230/LIPIcs.ITCS.2019.35}, annote = {Keywords: formula lower bounds, random restrictions, KRW conjecture, composition} }
Sumegha Garg and Jon Schneider. The Space Complexity of Mirror Games. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 36:1-36:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{garg_et_al:LIPIcs.ITCS.2019.36, author = {Garg, Sumegha and Schneider, Jon}, title = {{The Space Complexity of Mirror Games}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {36:1--36:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.36}, URN = {urn:nbn:de:0030-drops-101295}, doi = {10.4230/LIPIcs.ITCS.2019.36}, annote = {Keywords: Mirror Games, Space Complexity, Eventown-Oddtown} }
Oded Goldreich and Dana Ron. The Subgraph Testing Model. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 37:1-37:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{goldreich_et_al:LIPIcs.ITCS.2019.37, author = {Goldreich, Oded and Ron, Dana}, title = {{The Subgraph Testing Model}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {37:1--37:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.37}, URN = {urn:nbn:de:0030-drops-101308}, doi = {10.4230/LIPIcs.ITCS.2019.37}, annote = {Keywords: Property Testing, Graph Properties} }
Mika Göös, Pritish Kamath, Robert Robere, and Dmitry Sokolov. Adventures in Monotone Complexity and TFNP. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 38:1-38:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{goos_et_al:LIPIcs.ITCS.2019.38, author = {G\"{o}\"{o}s, Mika and Kamath, Pritish and Robere, Robert and Sokolov, Dmitry}, title = {{Adventures in Monotone Complexity and TFNP}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {38:1--38:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.38}, URN = {urn:nbn:de:0030-drops-101316}, doi = {10.4230/LIPIcs.ITCS.2019.38}, annote = {Keywords: TFNP, Monotone Complexity, Communication Complexity, Proof Complexity} }
Venkatesan Guruswami, Preetum Nakkiran, and Madhu Sudan. Algorithmic Polarization for Hidden Markov Models. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 39:1-39:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{guruswami_et_al:LIPIcs.ITCS.2019.39, author = {Guruswami, Venkatesan and Nakkiran, Preetum and Sudan, Madhu}, title = {{Algorithmic Polarization for Hidden Markov Models}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {39:1--39:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.39}, URN = {urn:nbn:de:0030-drops-101326}, doi = {10.4230/LIPIcs.ITCS.2019.39}, annote = {Keywords: polar codes, error-correcting codes, compression, hidden markov model} }
Iftach Haitner, Noam Mazor, Rotem Oshman, Omer Reingold, and Amir Yehudayoff. On the Communication Complexity of Key-Agreement Protocols. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 40:1-40:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{haitner_et_al:LIPIcs.ITCS.2019.40, author = {Haitner, Iftach and Mazor, Noam and Oshman, Rotem and Reingold, Omer and Yehudayoff, Amir}, title = {{On the Communication Complexity of Key-Agreement Protocols}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {40:1--40:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.40}, URN = {urn:nbn:de:0030-drops-101335}, doi = {10.4230/LIPIcs.ITCS.2019.40}, annote = {Keywords: key agreement, random oracle, communication complexity, Merkle's puzzles} }
Linus Hamilton and Ankur Moitra. The Paulsen Problem Made Simple. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 41:1-41:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{hamilton_et_al:LIPIcs.ITCS.2019.41, author = {Hamilton, Linus and Moitra, Ankur}, title = {{The Paulsen Problem Made Simple}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {41:1--41:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.41}, URN = {urn:nbn:de:0030-drops-101347}, doi = {10.4230/LIPIcs.ITCS.2019.41}, annote = {Keywords: radial isotropic position, operator scaling, Paulsen problem} }
Thibaut Horel, Sunoo Park, Silas Richelson, and Vinod Vaikuntanathan. How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 42:1-42:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{horel_et_al:LIPIcs.ITCS.2019.42, author = {Horel, Thibaut and Park, Sunoo and Richelson, Silas and Vaikuntanathan, Vinod}, title = {{How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {42:1--42:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.42}, URN = {urn:nbn:de:0030-drops-101355}, doi = {10.4230/LIPIcs.ITCS.2019.42}, annote = {Keywords: Backdoored Encryption, Steganography} }
Klaus Jansen and Lars Rohwedder. On Integer Programming and Convolution. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 43:1-43:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{jansen_et_al:LIPIcs.ITCS.2019.43, author = {Jansen, Klaus and Rohwedder, Lars}, title = {{On Integer Programming and Convolution}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {43:1--43:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.43}, URN = {urn:nbn:de:0030-drops-101365}, doi = {10.4230/LIPIcs.ITCS.2019.43}, annote = {Keywords: Integer programming, convolution, dynamic programming, SETH} }
Klaus Jansen, Kim-Manuel Klein, Marten Maack, and Malin Rau. Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 44:1-44:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{jansen_et_al:LIPIcs.ITCS.2019.44, author = {Jansen, Klaus and Klein, Kim-Manuel and Maack, Marten and Rau, Malin}, title = {{Empowering the Configuration-IP - New PTAS Results for Scheduling with Setups Times}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {44:1--44:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.44}, URN = {urn:nbn:de:0030-drops-101375}, doi = {10.4230/LIPIcs.ITCS.2019.44}, annote = {Keywords: Parallel Machines, Setup Time, EPTAS, n-fold integer programming} }
Yan Jin, Elchanan Mossel, and Govind Ramnarayan. Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 45:1-45:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{jin_et_al:LIPIcs.ITCS.2019.45, author = {Jin, Yan and Mossel, Elchanan and Ramnarayan, Govind}, title = {{Being Corrupt Requires Being Clever, But Detecting Corruption Doesn't}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {45:1--45:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.45}, URN = {urn:nbn:de:0030-drops-101388}, doi = {10.4230/LIPIcs.ITCS.2019.45}, annote = {Keywords: Corruption detection, PMC Model, Small Set Expansion, Hardness of Approximation} }
Ce Jin. Simulating Random Walks on Graphs in the Streaming Model. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 46:1-46:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{jin:LIPIcs.ITCS.2019.46, author = {Jin, Ce}, title = {{Simulating Random Walks on Graphs in the Streaming Model}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {46:1--46:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.46}, URN = {urn:nbn:de:0030-drops-101399}, doi = {10.4230/LIPIcs.ITCS.2019.46}, annote = {Keywords: streaming models, random walks, sampling} }
Markus Bläser and Gorav Jindal. On the Complexity of Symmetric Polynomials. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 47:1-47:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{blaser_et_al:LIPIcs.ITCS.2019.47, author = {Bl\"{a}ser, Markus and Jindal, Gorav}, title = {{On the Complexity of Symmetric Polynomials}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {47:1--47:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.47}, URN = {urn:nbn:de:0030-drops-101402}, doi = {10.4230/LIPIcs.ITCS.2019.47}, annote = {Keywords: Symmetric Polynomials, Arithmetic Circuits, Arithmetic Complexity, Power Series, Elementary Symmetric Polynomials, Newton's Iteration} }
Daniel M. Kane and Richard Ryan Williams. The Orthogonal Vectors Conjecture for Branching Programs and Formulas. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 48:1-48:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kane_et_al:LIPIcs.ITCS.2019.48, author = {Kane, Daniel M. and Williams, Richard Ryan}, title = {{The Orthogonal Vectors Conjecture for Branching Programs and Formulas}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {48:1--48:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.48}, URN = {urn:nbn:de:0030-drops-101418}, doi = {10.4230/LIPIcs.ITCS.2019.48}, annote = {Keywords: fine-grained complexity, orthogonal vectors, branching programs, symmetric functions, Boolean formulas} }
Pravesh K. Kothari, Ryan O'Donnell, and Tselil Schramm. SOS Lower Bounds with Hard Constraints: Think Global, Act Local. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 49:1-49:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kothari_et_al:LIPIcs.ITCS.2019.49, author = {Kothari, Pravesh K. and O'Donnell, Ryan and Schramm, Tselil}, title = {{SOS Lower Bounds with Hard Constraints: Think Global, Act Local}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {49:1--49:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.49}, URN = {urn:nbn:de:0030-drops-101420}, doi = {10.4230/LIPIcs.ITCS.2019.49}, annote = {Keywords: sum-of-squares hierarchy, random constraint satisfaction problems} }
Ravi Kumar, Manish Purohit, Aaron Schild, Zoya Svitkina, and Erik Vee. Semi-Online Bipartite Matching. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 50:1-50:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kumar_et_al:LIPIcs.ITCS.2019.50, author = {Kumar, Ravi and Purohit, Manish and Schild, Aaron and Svitkina, Zoya and Vee, Erik}, title = {{Semi-Online Bipartite Matching}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {50:1--50:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.50}, URN = {urn:nbn:de:0030-drops-101436}, doi = {10.4230/LIPIcs.ITCS.2019.50}, annote = {Keywords: Semi-Online Algorithms, Bipartite Matching} }
Troy Lee, Maharshi Ray, and Miklos Santha. Strategies for Quantum Races. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 51:1-51:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{lee_et_al:LIPIcs.ITCS.2019.51, author = {Lee, Troy and Ray, Maharshi and Santha, Miklos}, title = {{Strategies for Quantum Races}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {51:1--51:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.51}, URN = {urn:nbn:de:0030-drops-101446}, doi = {10.4230/LIPIcs.ITCS.2019.51}, annote = {Keywords: Game theory, Bitcoin mining, Quantum computing, Convex optimization} }
Amit Levi and Erik Waingarten. Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 52:1-52:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{levi_et_al:LIPIcs.ITCS.2019.52, author = {Levi, Amit and Waingarten, Erik}, title = {{Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {52:1--52:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.52}, URN = {urn:nbn:de:0030-drops-101452}, doi = {10.4230/LIPIcs.ITCS.2019.52}, annote = {Keywords: Property Testing, Juntas, Tolerant Testing, Boolean functions} }
Fuchun Lin, Mahdi Cheraghchi, Venkatesan Guruswami, Reihaneh Safavi-Naini, and Huaxiong Wang. Secret Sharing with Binary Shares. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 53:1-53:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{lin_et_al:LIPIcs.ITCS.2019.53, author = {Lin, Fuchun and Cheraghchi, Mahdi and Guruswami, Venkatesan and Safavi-Naini, Reihaneh and Wang, Huaxiong}, title = {{Secret Sharing with Binary Shares}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {53:1--53:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.53}, URN = {urn:nbn:de:0030-drops-101461}, doi = {10.4230/LIPIcs.ITCS.2019.53}, annote = {Keywords: Secret sharing scheme, Wiretap channel} }
Nati Linial, Toniann Pitassi, and Adi Shraibman. On the Communication Complexity of High-Dimensional Permutations. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 54:1-54:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{linial_et_al:LIPIcs.ITCS.2019.54, author = {Linial, Nati and Pitassi, Toniann and Shraibman, Adi}, title = {{On the Communication Complexity of High-Dimensional Permutations}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {54:1--54:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.54}, URN = {urn:nbn:de:0030-drops-101470}, doi = {10.4230/LIPIcs.ITCS.2019.54}, annote = {Keywords: High dimensional permutations, Number On the Forehead model, Additive combinatorics} }
Jingcheng Liu, Alistair Sinclair, and Piyush Srivastava. Fisher Zeros and Correlation Decay in the Ising Model. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 55:1-55:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{liu_et_al:LIPIcs.ITCS.2019.55, author = {Liu, Jingcheng and Sinclair, Alistair and Srivastava, Piyush}, title = {{Fisher Zeros and Correlation Decay in the Ising Model}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {55:1--55:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.55}, URN = {urn:nbn:de:0030-drops-101483}, doi = {10.4230/LIPIcs.ITCS.2019.55}, annote = {Keywords: Ising model, zeros of polynomials, partition functions, approximate counting, phase transitions} }
Dylan M. McKay and Richard Ryan Williams. Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 56:1-56:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{mckay_et_al:LIPIcs.ITCS.2019.56, author = {McKay, Dylan M. and Williams, Richard Ryan}, title = {{Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {56:1--56:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.56}, URN = {urn:nbn:de:0030-drops-101493}, doi = {10.4230/LIPIcs.ITCS.2019.56}, annote = {Keywords: branching programs, random oracles, time-space tradeoffs, lower bounds, SAT, counting complexity} }
Christos H. Papadimitriou and Santosh S. Vempala. Random Projection in the Brain and Computation with Assemblies of Neurons. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 57:1-57:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{papadimitriou_et_al:LIPIcs.ITCS.2019.57, author = {Papadimitriou, Christos H. and Vempala, Santosh S.}, title = {{Random Projection in the Brain and Computation with Assemblies of Neurons}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {57:1--57:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.57}, URN = {urn:nbn:de:0030-drops-101506}, doi = {10.4230/LIPIcs.ITCS.2019.57}, annote = {Keywords: Brain computation, random projection, assemblies, plasticity, memory, association} }
Merav Parter, Ronitt Rubinfeld, Ali Vakilian, and Anak Yodpinyanee. Local Computation Algorithms for Spanners. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 58:1-58:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{parter_et_al:LIPIcs.ITCS.2019.58, author = {Parter, Merav and Rubinfeld, Ronitt and Vakilian, Ali and Yodpinyanee, Anak}, title = {{Local Computation Algorithms for Spanners}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {58:1--58:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.58}, URN = {urn:nbn:de:0030-drops-101510}, doi = {10.4230/LIPIcs.ITCS.2019.58}, annote = {Keywords: Local Computation Algorithms, Sub-linear Algorithms, Graph Spanners} }
Krzysztof Pietrzak. Proofs of Catalytic Space. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 59:1-59:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{pietrzak:LIPIcs.ITCS.2019.59, author = {Pietrzak, Krzysztof}, title = {{Proofs of Catalytic Space}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {59:1--59:25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.59}, URN = {urn:nbn:de:0030-drops-101525}, doi = {10.4230/LIPIcs.ITCS.2019.59}, annote = {Keywords: Proofs of Space, Proofs of Replication, Blockchains} }
Krzysztof Pietrzak. Simple Verifiable Delay Functions. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 60:1-60:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{pietrzak:LIPIcs.ITCS.2019.60, author = {Pietrzak, Krzysztof}, title = {{Simple Verifiable Delay Functions}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {60:1--60:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.60}, URN = {urn:nbn:de:0030-drops-101537}, doi = {10.4230/LIPIcs.ITCS.2019.60}, annote = {Keywords: Verifiable delay functions, Time-lock puzzles} }
Aaron Potechin. Sum of Squares Lower Bounds from Symmetry and a Good Story. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 61:1-61:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{potechin:LIPIcs.ITCS.2019.61, author = {Potechin, Aaron}, title = {{Sum of Squares Lower Bounds from Symmetry and a Good Story}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {61:1--61:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.61}, URN = {urn:nbn:de:0030-drops-101545}, doi = {10.4230/LIPIcs.ITCS.2019.61}, annote = {Keywords: Sum of squares hierarchy, proof complexity, graph theory, lower bounds} }
Zachary Chase and Siddharth Prasad. Learning Time Dependent Choice. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 62:1-62:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chase_et_al:LIPIcs.ITCS.2019.62, author = {Chase, Zachary and Prasad, Siddharth}, title = {{Learning Time Dependent Choice}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {62:1--62:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.62}, URN = {urn:nbn:de:0030-drops-101550}, doi = {10.4230/LIPIcs.ITCS.2019.62}, annote = {Keywords: Intertemporal Choice, Discounted Utility, Preference Recovery, PAC Learning, Active Learning} }
Sofya Raskhodnikova, Noga Ron-Zewi, and Nithin Varma. Erasures vs. Errors in Local Decoding and Property Testing. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 63:1-63:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{raskhodnikova_et_al:LIPIcs.ITCS.2019.63, author = {Raskhodnikova, Sofya and Ron-Zewi, Noga and Varma, Nithin}, title = {{Erasures vs. Errors in Local Decoding and Property Testing}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {63:1--63:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.63}, URN = {urn:nbn:de:0030-drops-101568}, doi = {10.4230/LIPIcs.ITCS.2019.63}, annote = {Keywords: Error-correcting codes, probabilistically checkable proofs (PCPs) of proximity, Hadamard code, local list decoding, tolerant testing} }
Adi Rosén and Florent Urrutia. A New Approach to Multi-Party Peer-to-Peer Communication Complexity. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 64:1-64:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{rosen_et_al:LIPIcs.ITCS.2019.64, author = {Ros\'{e}n, Adi and Urrutia, Florent}, title = {{A New Approach to Multi-Party Peer-to-Peer Communication Complexity}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {64:1--64:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.64}, URN = {urn:nbn:de:0030-drops-101576}, doi = {10.4230/LIPIcs.ITCS.2019.64}, annote = {Keywords: communication complexity, multi-party communication complexity, peer-to-peer communication complexity, information complexity, private computation} }
Aaron Schild. A Schur Complement Cheeger Inequality. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 65:1-65:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{schild:LIPIcs.ITCS.2019.65, author = {Schild, Aaron}, title = {{A Schur Complement Cheeger Inequality}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {65:1--65:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.65}, URN = {urn:nbn:de:0030-drops-101588}, doi = {10.4230/LIPIcs.ITCS.2019.65}, annote = {Keywords: electrical networks, Cheeger's inequality, mixing time, conductance, Schur complements} }
Nguyen Kim Thang. Game Efficiency Through Linear Programming Duality. In 10th Innovations in Theoretical Computer Science Conference (ITCS 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 124, pp. 66:1-66:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kimthang:LIPIcs.ITCS.2019.66, author = {Kim Thang, Nguyen}, title = {{Game Efficiency Through Linear Programming Duality}}, booktitle = {10th Innovations in Theoretical Computer Science Conference (ITCS 2019)}, pages = {66:1--66:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-095-8}, ISSN = {1868-8969}, year = {2019}, volume = {124}, editor = {Blum, Avrim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.66}, URN = {urn:nbn:de:0030-drops-101597}, doi = {10.4230/LIPIcs.ITCS.2019.66}, annote = {Keywords: Price of Anarchy, Primal-Dual} }
Feedback for Dagstuhl Publishing