@Proceedings{papadimitriou:LIPIcs.ITCS.2017,
title = {{LIPIcs, Volume 67, ITCS'17, Complete Volume}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017},
URN = {urn:nbn:de:0030-drops-82066},
doi = {10.4230/LIPIcs.ITCS.2017},
annote = {Keywords: Theory of Computation, Mathematics of Computing}
}
@InProceedings{papadimitriou:LIPIcs.ITCS.2017.0,
author = {Papadimitriou, Christos H.},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {0:i--0:x},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.0},
URN = {urn:nbn:de:0030-drops-82025},
doi = {10.4230/LIPIcs.ITCS.2017.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{lee:LIPIcs.ITCS.2017.1,
author = {Lee, James R.},
title = {{Separators in Region Intersection Graphs}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {1:1--1:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.1},
URN = {urn:nbn:de:0030-drops-81970},
doi = {10.4230/LIPIcs.ITCS.2017.1},
annote = {Keywords: Graph separators, planar graphs, spectral partitioning}
}
@InProceedings{panageas_et_al:LIPIcs.ITCS.2017.2,
author = {Panageas, Ioannis and Piliouras, Georgios},
title = {{Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {2:1--2:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.2},
URN = {urn:nbn:de:0030-drops-81640},
doi = {10.4230/LIPIcs.ITCS.2017.2},
annote = {Keywords: Gradient Descent, Center-stable manifold, Saddle points, Hessian}
}
@InProceedings{allenzhu_et_al:LIPIcs.ITCS.2017.3,
author = {Allen-Zhu, Zeyuan and Orecchia, Lorenzo},
title = {{Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {3:1--3:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.3},
URN = {urn:nbn:de:0030-drops-81850},
doi = {10.4230/LIPIcs.ITCS.2017.3},
annote = {Keywords: linear coupling, gradient descent, mirror descent, acceleration}
}
@InProceedings{kaufman_et_al:LIPIcs.ITCS.2017.4,
author = {Kaufman, Tali and Mass, David},
title = {{High Dimensional Random Walks and Colorful Expansion}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {4:1--4:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.4},
URN = {urn:nbn:de:0030-drops-81838},
doi = {10.4230/LIPIcs.ITCS.2017.4},
annote = {Keywords: High dimensional expanders, expander graphs, random walks}
}
@InProceedings{raghavendra_et_al:LIPIcs.ITCS.2017.5,
author = {Raghavendra, Prasad and Ryder, Nick and Srivastava, Nikhil},
title = {{Real Stability Testing}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {5:1--5:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.5},
URN = {urn:nbn:de:0030-drops-81965},
doi = {10.4230/LIPIcs.ITCS.2017.5},
annote = {Keywords: real stable polynomials, hyperbolic polynomials, real rootedness, moment matrix, sturm sequence}
}
@InProceedings{micali:LIPIcs.ITCS.2017.6,
author = {Micali, Silvio},
title = {{Very Simple and Efficient Byzantine Agreement}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {6:1--6:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.6},
URN = {urn:nbn:de:0030-drops-82011},
doi = {10.4230/LIPIcs.ITCS.2017.6},
annote = {Keywords: Byzantine Agreement}
}
@InProceedings{applebaum_et_al:LIPIcs.ITCS.2017.7,
author = {Applebaum, Benny and Haramaty-Krasne, Naama and Ishai, Yuval and Kushilevitz, Eyal and Vaikuntanathan, Vinod},
title = {{Low-Complexity Cryptographic Hash Functions}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {7:1--7:31},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.7},
URN = {urn:nbn:de:0030-drops-81901},
doi = {10.4230/LIPIcs.ITCS.2017.7},
annote = {Keywords: Cryptography, hash functions, complexity theory, coding theory}
}
@InProceedings{brakerski_et_al:LIPIcs.ITCS.2017.8,
author = {Brakerski, Zvika and Chandran, Nishanth and Goyal, Vipul and Jain, Aayush and Sahai, Amit and Segev, Gil},
title = {{Hierarchical Functional Encryption}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {8:1--8:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.8},
URN = {urn:nbn:de:0030-drops-81992},
doi = {10.4230/LIPIcs.ITCS.2017.8},
annote = {Keywords: Functional Encryption, Delegatable Encryption, Cryptography}
}
@InProceedings{ghosh_et_al:LIPIcs.ITCS.2017.9,
author = {Ghosh, Arpita and Kleinberg, Robert},
title = {{Inferential Privacy Guarantees for Differentially Private Mechanisms}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {9:1--9:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.9},
URN = {urn:nbn:de:0030-drops-81451},
doi = {10.4230/LIPIcs.ITCS.2017.9},
annote = {Keywords: differential privacy, statistical inference, statistical mechanics}
}
@InProceedings{blocki_et_al:LIPIcs.ITCS.2017.10,
author = {Blocki, Jeremiah and Blum, Manuel and Datta, Anupam and Vempala, Santosh},
title = {{Towards Human Computable Passwords}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {10:1--10:47},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.10},
URN = {urn:nbn:de:0030-drops-81847},
doi = {10.4230/LIPIcs.ITCS.2017.10},
annote = {Keywords: Passwords, Cognitive Authentication, Human Computation, Planted Constraint Satisfaction Problem, Statistical Dimension}
}
@InProceedings{abboud_et_al:LIPIcs.ITCS.2017.11,
author = {Abboud, Amir and Backurs, Arturs},
title = {{Towards Hardness of Approximation for Polynomial Time Problems}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {11:1--11:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.11},
URN = {urn:nbn:de:0030-drops-81443},
doi = {10.4230/LIPIcs.ITCS.2017.11},
annote = {Keywords: LCS, Edit Distance, Hardness in P}
}
@InProceedings{pallavoor_et_al:LIPIcs.ITCS.2017.12,
author = {Pallavoor, Ramesh Krishnan S. and Raskhodnikova, Sofya and Varma, Nithin},
title = {{Parameterized Property Testing of Functions}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.12},
URN = {urn:nbn:de:0030-drops-81479},
doi = {10.4230/LIPIcs.ITCS.2017.12},
annote = {Keywords: Sublinear algorithms, property testing, parameterization, monotonicity, convexity}
}
@InProceedings{goldwasser_et_al:LIPIcs.ITCS.2017.13,
author = {Goldwasser, Shafi and Holden, Dhiraj},
title = {{The Complexity of Problems in P Given Correlated Instances}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {13:1--13:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.13},
URN = {urn:nbn:de:0030-drops-81753},
doi = {10.4230/LIPIcs.ITCS.2017.13},
annote = {Keywords: Correlated instances, Longest Common Subsequence, Fine-grained complexity}
}
@InProceedings{furer:LIPIcs.ITCS.2017.14,
author = {F\"{u}rer, Martin},
title = {{Multi-Clique-Width}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {14:1--14:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.14},
URN = {urn:nbn:de:0030-drops-81775},
doi = {10.4230/LIPIcs.ITCS.2017.14},
annote = {Keywords: clique-width, parameterized complexity, tree-width, independent set polynomial, graph coloring}
}
@InProceedings{lynch_et_al:LIPIcs.ITCS.2017.15,
author = {Lynch, Nancy and Musco, Cameron and Parter, Merav},
title = {{Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {15:1--15:44},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.15},
URN = {urn:nbn:de:0030-drops-81952},
doi = {10.4230/LIPIcs.ITCS.2017.15},
annote = {Keywords: biological distributed algorithms, neural networks, distributed lower bounds, winner-take-all networks}
}
@InProceedings{mehta_et_al:LIPIcs.ITCS.2017.16,
author = {Mehta, Ruta and Panageas, Ioannis and Piliouras, Georgios and Tetali, Prasad and Vazirani, Vijay V.},
title = {{Mutation, Sexual Reproduction and Survival in Dynamic Environments}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {16:1--16:29},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.16},
URN = {urn:nbn:de:0030-drops-81655},
doi = {10.4230/LIPIcs.ITCS.2017.16},
annote = {Keywords: Evolution, Non-linear dynamics, Mutation}
}
@InProceedings{chazelle_et_al:LIPIcs.ITCS.2017.17,
author = {Chazelle, Bernard and Wang, Chu},
title = {{Self-Sustaining Iterated Learning}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {17:1--17:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.17},
URN = {urn:nbn:de:0030-drops-81711},
doi = {10.4230/LIPIcs.ITCS.2017.17},
annote = {Keywords: Iterated learning, language evolution, iterated Bayesian linear regression, non-equilibrium dynamics}
}
@InProceedings{braverman_et_al:LIPIcs.ITCS.2017.18,
author = {Braverman, Mark and Garg, Sumegha and Schvartzman, Ariel},
title = {{Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {18:1--18:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.18},
URN = {urn:nbn:de:0030-drops-81599},
doi = {10.4230/LIPIcs.ITCS.2017.18},
annote = {Keywords: Network coding, Gap Amplification, Multicommodity flows}
}
@InProceedings{ghazi_et_al:LIPIcs.ITCS.2017.19,
author = {Ghazi, Badih and Haramaty, Elad and Kamath, Pritish and Sudan, Madhu},
title = {{Compression in a Distributed Setting}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {19:1--19:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.19},
URN = {urn:nbn:de:0030-drops-81763},
doi = {10.4230/LIPIcs.ITCS.2017.19},
annote = {Keywords: Distributed Compression, Communication, Language Evolution, Isolating Hash Families}
}
@InProceedings{briet_et_al:LIPIcs.ITCS.2017.20,
author = {Bri\"{e}t, Jop and Dvir, Zeev and Gopi, Sivakanth},
title = {{Outlaw Distributions and Locally Decodable Codes}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {20:1--20:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.20},
URN = {urn:nbn:de:0030-drops-81888},
doi = {10.4230/LIPIcs.ITCS.2017.20},
annote = {Keywords: Locally Decodable Code, VC-dimension, Incidence Geometry, Cayley Hypergraphs}
}
@InProceedings{gelles_et_al:LIPIcs.ITCS.2017.21,
author = {Gelles, Ran and T. Kalai, Yael},
title = {{Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {21:1--21:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.21},
URN = {urn:nbn:de:0030-drops-81523},
doi = {10.4230/LIPIcs.ITCS.2017.21},
annote = {Keywords: Interactive Communication, Coding, Stochastic Noise, Communication Complexity}
}
@InProceedings{bavarian_et_al:LIPIcs.ITCS.2017.22,
author = {Bavarian, Mohammad and Vidick, Thomas and Yuen, Henry},
title = {{Parallel Repetition via Fortification: Analytic View and the Quantum Case}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {22:1--22:33},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.22},
URN = {urn:nbn:de:0030-drops-81670},
doi = {10.4230/LIPIcs.ITCS.2017.22},
annote = {Keywords: Parallel repetition, quantum entanglement, non-local games}
}
@InProceedings{aaronson_et_al:LIPIcs.ITCS.2017.23,
author = {Aaronson, Scott and Grier, Daniel and Schaeffer, Luke},
title = {{The Classification of Reversible Bit Operations}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {23:1--23:34},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.23},
URN = {urn:nbn:de:0030-drops-81737},
doi = {10.4230/LIPIcs.ITCS.2017.23},
annote = {Keywords: Reversible computation, Reversible gates, Circuit synthesis, Gate classification, Boolean logic, Post’s lattice}
}
@InProceedings{buhrman_et_al:LIPIcs.ITCS.2017.24,
author = {Buhrman, Harry and Christandl, Matthias and Zuiddam, Jeroen},
title = {{Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {24:1--24:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.24},
URN = {urn:nbn:de:0030-drops-81812},
doi = {10.4230/LIPIcs.ITCS.2017.24},
annote = {Keywords: quantum communication complexity, broadcast channel, number-in-hand, matrix multiplication, support rank}
}
@InProceedings{hastings:LIPIcs.ITCS.2017.25,
author = {Hastings, Matthew B.},
title = {{Quantum Codes from High-Dimensional Manifolds}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {25:1--25:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.25},
URN = {urn:nbn:de:0030-drops-81708},
doi = {10.4230/LIPIcs.ITCS.2017.25},
annote = {Keywords: quantum codes, random lattices, Rankin invariants}
}
@InProceedings{henzinger_et_al:LIPIcs.ITCS.2017.26,
author = {Henzinger, Monika and Lincoln, Andrea and Neumann, Stefan and Vassilevska Williams, Virginia},
title = {{Conditional Hardness for Sensitivity Problems}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {26:1--26:31},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.26},
URN = {urn:nbn:de:0030-drops-81783},
doi = {10.4230/LIPIcs.ITCS.2017.26},
annote = {Keywords: sensitivity, conditional lower bounds, data structures, dynamic graph algorithms}
}
@InProceedings{rossman:LIPIcs.ITCS.2017.27,
author = {Rossman, Benjamin},
title = {{An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {27:1--27:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.27},
URN = {urn:nbn:de:0030-drops-81435},
doi = {10.4230/LIPIcs.ITCS.2017.27},
annote = {Keywords: circuit complexity, finite model theory}
}
@InProceedings{bendavid_et_al:LIPIcs.ITCS.2017.28,
author = {Ben-David, Shalev and Hatami, Pooya and Tal, Avishay},
title = {{Low-Sensitivity Functions from Unambiguous Certificates}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {28:1--28:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.28},
URN = {urn:nbn:de:0030-drops-81869},
doi = {10.4230/LIPIcs.ITCS.2017.28},
annote = {Keywords: Boolean functions, decision tree complexity, query complexity, sensitivity conjecture}
}
@InProceedings{canonne_et_al:LIPIcs.ITCS.2017.29,
author = {Canonne, Cl\'{e}ment L. and Grigorescu, Elena and Guo, Siyao and Kumar, Akash and Wimmer, Karl},
title = {{Testing k-Monotonicity}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {29:1--29:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.29},
URN = {urn:nbn:de:0030-drops-81583},
doi = {10.4230/LIPIcs.ITCS.2017.29},
annote = {Keywords: Boolean Functions, Learning, Monotonicity, Property Testing}
}
@InProceedings{servedio_et_al:LIPIcs.ITCS.2017.30,
author = {Servedio, Rocco A. and Tan, Li-Yang},
title = {{What Circuit Classes Can Be Learned with Non-Trivial Savings?}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {30:1--30:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.30},
URN = {urn:nbn:de:0030-drops-81722},
doi = {10.4230/LIPIcs.ITCS.2017.30},
annote = {Keywords: computational learning theory, circuit complexity, non-trivial savings}
}
@InProceedings{buss_et_al:LIPIcs.ITCS.2017.31,
author = {Buss, Sam and Kabanets, Valentine and Kolokolova, Antonina and Koucky, Michal},
title = {{Expander Construction in VNC1}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {31:1--31:26},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.31},
URN = {urn:nbn:de:0030-drops-81871},
doi = {10.4230/LIPIcs.ITCS.2017.31},
annote = {Keywords: expander graphs, bounded arithmetic, alternating log time, sequent calculus, monotone propositional logic}
}
@InProceedings{schuldenzucker_et_al:LIPIcs.ITCS.2017.32,
author = {Schuldenzucker, Steffen and Seuken, Sven and Battiston, Stefano},
title = {{Finding Clearing Payments in Financial Networks with Credit Default Swaps is PPAD-complete}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {32:1--32:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.32},
URN = {urn:nbn:de:0030-drops-81558},
doi = {10.4230/LIPIcs.ITCS.2017.32},
annote = {Keywords: Financial Networks, Credit Default Swaps, Clearing Systems, Arithmetic Circuits, PPAD}
}
@InProceedings{blais_et_al:LIPIcs.ITCS.2017.33,
author = {Blais, Eric and Bommireddi, Abhinav},
title = {{Testing Submodularity and Other Properties of Valuation Functions}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {33:1--33:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.33},
URN = {urn:nbn:de:0030-drops-81619},
doi = {10.4230/LIPIcs.ITCS.2017.33},
annote = {Keywords: Property testing, Testing by implicit learning, Self-bounding functions}
}
@InProceedings{babichenko_et_al:LIPIcs.ITCS.2017.34,
author = {Babichenko, Yakov and Barman, Siddharth},
title = {{Algorithmic Aspects of Private Bayesian Persuasion}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {34:1--34:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.34},
URN = {urn:nbn:de:0030-drops-81502},
doi = {10.4230/LIPIcs.ITCS.2017.34},
annote = {Keywords: Economics of Information, Bayesian Persuasion, Signaling, Concave Closure}
}
@InProceedings{schneider_et_al:LIPIcs.ITCS.2017.35,
author = {Schneider, Jon and Schvartzman, Ariel and Weinberg, S. Matthew},
title = {{Condorcet-Consistent and Approximately Strategyproof Tournament Rules}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {35:1--35:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.35},
URN = {urn:nbn:de:0030-drops-81605},
doi = {10.4230/LIPIcs.ITCS.2017.35},
annote = {Keywords: Tournament design, Non-manipulability, Condorcet-consistent, Strategyproofness}
}
@InProceedings{anari_et_al:LIPIcs.ITCS.2017.36,
author = {Anari, Nima and Oveis Gharan, Shayan and Saberi, Amin and Singh, Mohit},
title = {{Nash Social Welfare, Matrix Permanent, and Stable Polynomials}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {36:1--36:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.36},
URN = {urn:nbn:de:0030-drops-81489},
doi = {10.4230/LIPIcs.ITCS.2017.36},
annote = {Keywords: Nash Welfare, Permanent, Matching, Stable Polynomial, Randomized Algorithm, Saddle Point}
}
@InProceedings{dinur_et_al:LIPIcs.ITCS.2017.37,
author = {Dinur, Irit and Harsha, Prahladh and Venkat, Rakesh and Yuen, Henry},
title = {{Multiplayer Parallel Repetition for Expanding Games}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {37:1--37:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.37},
URN = {urn:nbn:de:0030-drops-81575},
doi = {10.4230/LIPIcs.ITCS.2017.37},
annote = {Keywords: Parallel Repetition, Multi-player, Expander}
}
@InProceedings{alwen_et_al:LIPIcs.ITCS.2017.38,
author = {Alwen, Jo\"{e}l and de Rezende, Susanna F. and Nordstr\"{o}m, Jakob and Vinyals, Marc},
title = {{Cumulative Space in Black-White Pebbling and Resolution}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {38:1--38:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.38},
URN = {urn:nbn:de:0030-drops-81918},
doi = {10.4230/LIPIcs.ITCS.2017.38},
annote = {Keywords: pebble game, pebbling, proof complexity, space, cumulative space, clause space, resolution, parallel resolution}
}
@InProceedings{gur_et_al:LIPIcs.ITCS.2017.39,
author = {Gur, Tom and Rothblum, Ron D.},
title = {{A Hierarchy Theorem for Interactive Proofs of Proximity}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {39:1--39:43},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.39},
URN = {urn:nbn:de:0030-drops-81536},
doi = {10.4230/LIPIcs.ITCS.2017.39},
annote = {Keywords: Complexity Theory, Property Testing, Interactive Proofs}
}
@InProceedings{bhangale_et_al:LIPIcs.ITCS.2017.40,
author = {Bhangale, Amey and Dinur, Irit and Livni Navon, Inbal},
title = {{Cube vs. Cube Low Degree Test}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {40:1--40:31},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.40},
URN = {urn:nbn:de:0030-drops-81748},
doi = {10.4230/LIPIcs.ITCS.2017.40},
annote = {Keywords: Low Degree Test, Probabilistically Checkable Proofs, Locally Testable Codes}
}
@InProceedings{feldman_et_al:LIPIcs.ITCS.2017.41,
author = {Feldman, Vitaly and Ghazi, Badih},
title = {{On the Power of Learning from k-Wise Queries}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {41:1--41:32},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.41},
URN = {urn:nbn:de:0030-drops-81801},
doi = {10.4230/LIPIcs.ITCS.2017.41},
annote = {Keywords: Statistical Queries, PAC Learning, Differential Privacy, Lower bounds, Communication Complexity}
}
@InProceedings{rubinstein:LIPIcs.ITCS.2017.42,
author = {Rubinstein, Aviad},
title = {{Detecting communities is Hard (And Counting Them is Even Harder)}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {42:1--42:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.42},
URN = {urn:nbn:de:0030-drops-81496},
doi = {10.4230/LIPIcs.ITCS.2017.42},
annote = {Keywords: Community detection, stable communities, quasipolynomial time}
}
@InProceedings{kleinberg_et_al:LIPIcs.ITCS.2017.43,
author = {Kleinberg, Jon and Mullainathan, Sendhil and Raghavan, Manish},
title = {{Inherent Trade-Offs in the Fair Determination of Risk Scores}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {43:1--43:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.43},
URN = {urn:nbn:de:0030-drops-81560},
doi = {10.4230/LIPIcs.ITCS.2017.43},
annote = {Keywords: algorithmic fairness, risk tools, calibration}
}
@InProceedings{gulikers_et_al:LIPIcs.ITCS.2017.44,
author = {Gulikers, Lennart and Lelarge, Marc and Massouli\'{e}, Laurent},
title = {{Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {44:1--44:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.44},
URN = {urn:nbn:de:0030-drops-81795},
doi = {10.4230/LIPIcs.ITCS.2017.44},
annote = {Keywords: Degree-Corrected Stochastic Block Model, Non-backtracking Matrix, Machine Learning, Social Networks}
}
@InProceedings{juba:LIPIcs.ITCS.2017.45,
author = {Juba, Brendan},
title = {{Conditional Sparse Linear Regression}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.45},
URN = {urn:nbn:de:0030-drops-81518},
doi = {10.4230/LIPIcs.ITCS.2017.45},
annote = {Keywords: linear regression, conditional regression, conditional distribution search}
}
@InProceedings{arad_et_al:LIPIcs.ITCS.2017.46,
author = {Arad, Itai and Landau, Zeph and Vazirani, Umesh V. and Vidick, Thomas},
title = {{Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {46:1--46:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.46},
URN = {urn:nbn:de:0030-drops-81920},
doi = {10.4230/LIPIcs.ITCS.2017.46},
annote = {Keywords: Hamiltonian complexity, area law, gapped ground states, algorithm}
}
@InProceedings{lauriere_et_al:LIPIcs.ITCS.2017.47,
author = {Lauri\`{e}re, Mathieu and Touchette, Dave},
title = {{The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {47:1--47:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.47},
URN = {urn:nbn:de:0030-drops-81898},
doi = {10.4230/LIPIcs.ITCS.2017.47},
annote = {Keywords: Communication Complexity, Information Complexity, Quantum Computation and Information}
}
@InProceedings{chao_et_al:LIPIcs.ITCS.2017.48,
author = {Chao, Rui and Reichardt, Ben W. and Sutherland, Chris and Vidick, Thomas},
title = {{Overlapping Qubits}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {48:1--48:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.48},
URN = {urn:nbn:de:0030-drops-81826},
doi = {10.4230/LIPIcs.ITCS.2017.48},
annote = {Keywords: Quantum computing, Qubits, Dimension test}
}
@InProceedings{kerenidis_et_al:LIPIcs.ITCS.2017.49,
author = {Kerenidis, Iordanis and Prakash, Anupam},
title = {{Quantum Recommendation Systems}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {49:1--49:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.49},
URN = {urn:nbn:de:0030-drops-81541},
doi = {10.4230/LIPIcs.ITCS.2017.49},
annote = {Keywords: Recommendation systems, quantum machine learning, singular value estimation, matrix sampling, quantum algorithms.}
}
@InProceedings{peres_et_al:LIPIcs.ITCS.2017.50,
author = {Peres, Yuval and Singh, Mohit and Vishnoi, Nisheeth K.},
title = {{Random Walks in Polytopes and Negative Dependence}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {50:1--50:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.50},
URN = {urn:nbn:de:0030-drops-81464},
doi = {10.4230/LIPIcs.ITCS.2017.50},
annote = {Keywords: Random walks, Matroid, Polytope, Brownian motion, Negative dependence}
}
@InProceedings{bernstein_et_al:LIPIcs.ITCS.2017.51,
author = {Bernstein, Aaron and Kopelowitz, Tsvi and Pettie, Seth and Porat, Ely and Stein, Clifford},
title = {{Simultaneously Load Balancing for Every p-norm, With Reassignments}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {51:1--51:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.51},
URN = {urn:nbn:de:0030-drops-82009},
doi = {10.4230/LIPIcs.ITCS.2017.51},
annote = {Keywords: Online Matching, Graph Orientation, Minmizing the p-norm}
}
@InProceedings{dinitz_et_al:LIPIcs.ITCS.2017.52,
author = {Dinitz, Michael and Zhang, Zeyu},
title = {{Approximating Approximate Distance Oracles}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {52:1--52:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.52},
URN = {urn:nbn:de:0030-drops-81692},
doi = {10.4230/LIPIcs.ITCS.2017.52},
annote = {Keywords: distance oracles, approximation algorithms}
}
@InProceedings{kennedy_et_al:LIPIcs.ITCS.2017.53,
author = {Kennedy, Christopher and Ward, Rachel},
title = {{Fast Cross-Polytope Locality-Sensitive Hashing}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {53:1--53:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.53},
URN = {urn:nbn:de:0030-drops-81936},
doi = {10.4230/LIPIcs.ITCS.2017.53},
annote = {Keywords: Locality-sensitive hashing, Dimension reduction, Johnson-Lindenstrauss lemma}
}
@InProceedings{chierichetti_et_al:LIPIcs.ITCS.2017.54,
author = {Chierichetti, Flavio and Kumar, Ravi and Panconesi, Alessandro and Terolli, Erisa},
title = {{The Distortion of Locality Sensitive Hashing}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {54:1--54:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.54},
URN = {urn:nbn:de:0030-drops-81688},
doi = {10.4230/LIPIcs.ITCS.2017.54},
annote = {Keywords: locality sensitive hashing, distortion, similarity}
}
@InProceedings{ivanyos_et_al:LIPIcs.ITCS.2017.55,
author = {Ivanyos, G\'{a}bor and Qiao, Youming and Subrahmanyam, K Venkata},
title = {{Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {55:1--55:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.55},
URN = {urn:nbn:de:0030-drops-81667},
doi = {10.4230/LIPIcs.ITCS.2017.55},
annote = {Keywords: invariant theory, non-commutative rank, null cone, symbolic determinant identity testing, semi-invariants of quivers}
}
@InProceedings{schulman_et_al:LIPIcs.ITCS.2017.56,
author = {Schulman, Leonard and Vazirani, Umesh V.},
title = {{The Duality Gap for Two-Team Zero-Sum Games}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {56:1--56:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.56},
URN = {urn:nbn:de:0030-drops-81429},
doi = {10.4230/LIPIcs.ITCS.2017.56},
annote = {Keywords: multi-player games, duality gap, zero-sum games, evolution}
}
@InProceedings{chen_et_al:LIPIcs.ITCS.2017.57,
author = {Chen, Xi and Cheng, Yu and Tang, Bo},
title = {{Well-Supported vs. Approximate Nash Equilibria: Query Complexity of Large Games}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {57:1--57:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.57},
URN = {urn:nbn:de:0030-drops-81636},
doi = {10.4230/LIPIcs.ITCS.2017.57},
annote = {Keywords: Equilibrium Computation, Query Complexity, Large Games}
}
@InProceedings{stubbs_et_al:LIPIcs.ITCS.2017.58,
author = {Stubbs, Daniel and Vassilevska Williams, Virginia},
title = {{Metatheorems for Dynamic Weighted Matching}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {58:1--58:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.58},
URN = {urn:nbn:de:0030-drops-81944},
doi = {10.4230/LIPIcs.ITCS.2017.58},
annote = {Keywords: dynamic algorithms, maximum matching, maximum weight matching}
}
@InProceedings{odonnell:LIPIcs.ITCS.2017.59,
author = {O'Donnell, Ryan},
title = {{SOS Is Not Obviously Automatizable, Even Approximately}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {59:1--59:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.59},
URN = {urn:nbn:de:0030-drops-81980},
doi = {10.4230/LIPIcs.ITCS.2017.59},
annote = {Keywords: Sum-of-Squares, semidefinite programming}
}
@InProceedings{hubacek_et_al:LIPIcs.ITCS.2017.60,
author = {Hub\'{a}cek, Pavel and Naor, Moni and Yogev, Eylon},
title = {{The Journey from NP to TFNP Hardness}},
booktitle = {8th Innovations in Theoretical Computer Science Conference (ITCS 2017)},
pages = {60:1--60:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-029-3},
ISSN = {1868-8969},
year = {2017},
volume = {67},
editor = {Papadimitriou, Christos H.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2017.60},
URN = {urn:nbn:de:0030-drops-81627},
doi = {10.4230/LIPIcs.ITCS.2017.60},
annote = {Keywords: TFNP, derandomization, one-way functions, average-case hardness}
}
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