@Proceedings{karlin:LIPIcs.ITCS.2018,
title = {{LIPIcs, Volume 94, ITCS'18, Complete Volume}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018},
URN = {urn:nbn:de:0030-drops-84419},
doi = {10.4230/LIPIcs.ITCS.2018},
annote = {Keywords: Theory of Computation, Mathematics of Computing}
}
@InProceedings{karlin:LIPIcs.ITCS.2018.0,
author = {Karlin, Anna R.},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {0:i--0:xii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.0},
URN = {urn:nbn:de:0030-drops-83104},
doi = {10.4230/LIPIcs.ITCS.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{efremenko_et_al:LIPIcs.ITCS.2018.1,
author = {Efremenko, Klim and Garg, Ankit and Oliveira, Rafael and Wigderson, Avi},
title = {{Barriers for Rank Methods in Arithmetic Complexity}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {1:1--1:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.1},
URN = {urn:nbn:de:0030-drops-83506},
doi = {10.4230/LIPIcs.ITCS.2018.1},
annote = {Keywords: Lower Bounds, Barriers, Partial Derivatives, Flattenings, Algebraic Complexity}
}
@InProceedings{cai_et_al:LIPIcs.ITCS.2018.2,
author = {Cai, Jin-Yi and Fu, Zhiguo and Girstmair, Kurt and Kowalczyk, Michael},
title = {{A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {2:1--2:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.2},
URN = {urn:nbn:de:0030-drops-83251},
doi = {10.4230/LIPIcs.ITCS.2018.2},
annote = {Keywords: Spin Systems, Holant Problems, Number Theory, Characters, Cyclotomic Fields}
}
@InProceedings{arunachalam_et_al:LIPIcs.ITCS.2018.3,
author = {Arunachalam, Srinivasan and Bri\"{e}t, Jop and Palazuelos, Carlos},
title = {{Quantum Query Algorithms are Completely Bounded Forms}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {3:1--3:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.3},
URN = {urn:nbn:de:0030-drops-83383},
doi = {10.4230/LIPIcs.ITCS.2018.3},
annote = {Keywords: Quantum query algorithms, operator space theory, polynomial method, approximate degree.}
}
@InProceedings{fefferman_et_al:LIPIcs.ITCS.2018.4,
author = {Fefferman, Bill and Lin, Cedric Yen-Yu},
title = {{A Complete Characterization of Unitary Quantum Space}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {4:1--4:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.4},
URN = {urn:nbn:de:0030-drops-83242},
doi = {10.4230/LIPIcs.ITCS.2018.4},
annote = {Keywords: Quantum complexity, space complexity, complete problems, QMA}
}
@InProceedings{balcan_et_al:LIPIcs.ITCS.2018.5,
author = {Balcan, Maria-Florina and Liang, Yingyu and Woodruff, David P. and Zhang, Hongyang},
title = {{Matrix Completion and Related Problems via Strong Duality}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {5:1--5:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.5},
URN = {urn:nbn:de:0030-drops-83583},
doi = {10.4230/LIPIcs.ITCS.2018.5},
annote = {Keywords: Non-Convex Optimization, Strong Duality, Matrix Completion, Robust PCA, Sample Complexity}
}
@InProceedings{benor_et_al:LIPIcs.ITCS.2018.6,
author = {Ben-Or, Michael and Eldar, Lior},
title = {{A Quasi-Random Approach to Matrix Spectral Analysis}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {6:1--6:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.6},
URN = {urn:nbn:de:0030-drops-83288},
doi = {10.4230/LIPIcs.ITCS.2018.6},
annote = {Keywords: linear algebra, eigenvalues, eigenvectors, low-discrepancy sequence}
}
@InProceedings{bhaskara_et_al:LIPIcs.ITCS.2018.7,
author = {Bhaskara, Aditya and Lattanzi, Silvio},
title = {{Non-Negative Sparse Regression and Column Subset Selection with L1 Error}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.7},
URN = {urn:nbn:de:0030-drops-83548},
doi = {10.4230/LIPIcs.ITCS.2018.7},
annote = {Keywords: Sparse regression, L1 error optimization, Column subset selection}
}
@InProceedings{musco_et_al:LIPIcs.ITCS.2018.8,
author = {Musco, Cameron and Netrapalli, Praneeth and Sidford, Aaron and Ubaru, Shashanka and Woodruff, David P.},
title = {{Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {8:1--8:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.8},
URN = {urn:nbn:de:0030-drops-83397},
doi = {10.4230/LIPIcs.ITCS.2018.8},
annote = {Keywords: spectrum approximation, matrix norm computation, fine-grained complexity, linear algebra}
}
@InProceedings{beyersdorff_et_al:LIPIcs.ITCS.2018.9,
author = {Beyersdorff, Olaf and Blinkhorn, Joshua and Hinde, Luke},
title = {{Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {9:1--9:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.9},
URN = {urn:nbn:de:0030-drops-83228},
doi = {10.4230/LIPIcs.ITCS.2018.9},
annote = {Keywords: quantified Boolean formulas, proof complexity, lower bounds}
}
@InProceedings{beame_et_al:LIPIcs.ITCS.2018.10,
author = {Beame, Paul and Fleming, Noah and Impagliazzo, Russell and Kolokolova, Antonina and Pankratov, Denis and Pitassi, Toniann and Robere, Robert},
title = {{Stabbing Planes}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {10:1--10:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.10},
URN = {urn:nbn:de:0030-drops-83418},
doi = {10.4230/LIPIcs.ITCS.2018.10},
annote = {Keywords: Complexity Theory, Proof Complexity, Communication Complexity, Cutting Planes, Semi-Algebraic Proof Systems, Pseudo Boolean Solvers, SAT solvers, Inte}
}
@InProceedings{braverman_et_al:LIPIcs.ITCS.2018.11,
author = {Braverman, Mark and Ganor, Anat and Kol, Gillat and Raz, Ran},
title = {{A Candidate for a Strong Separation of Information and Communication}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {11:1--11:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.11},
URN = {urn:nbn:de:0030-drops-83322},
doi = {10.4230/LIPIcs.ITCS.2018.11},
annote = {Keywords: communication complexity, amortized communication complexity, communication compression, direct sum, information complexity}
}
@InProceedings{braverman_et_al:LIPIcs.ITCS.2018.12,
author = {Braverman, Mark and Ko, Young Kun},
title = {{Information Value of Two-Prover Games}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.12},
URN = {urn:nbn:de:0030-drops-83466},
doi = {10.4230/LIPIcs.ITCS.2018.12},
annote = {Keywords: Two Prover Game, Parallel Repetition, Odd-Cycle Game, Amortized Value of the Game}
}
@InProceedings{kong_et_al:LIPIcs.ITCS.2018.13,
author = {Kong, Yuqing and Schoenebeck, Grant},
title = {{Equilibrium Selection in Information Elicitation without Verification via Information Monotonicity}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {13:1--13:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.13},
URN = {urn:nbn:de:0030-drops-83174},
doi = {10.4230/LIPIcs.ITCS.2018.13},
annote = {Keywords: peer prediction, equilibrium selection, information theory}
}
@InProceedings{kong_et_al:LIPIcs.ITCS.2018.14,
author = {Kong, Yuqing and Schoenebeck, Grant},
title = {{Optimizing Bayesian Information Revelation Strategy in Prediction Markets: the Alice Bob Alice Case}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {14:1--14:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.14},
URN = {urn:nbn:de:0030-drops-83191},
doi = {10.4230/LIPIcs.ITCS.2018.14},
annote = {Keywords: prediction market, information revelation, optimization}
}
@InProceedings{frongillo_et_al:LIPIcs.ITCS.2018.15,
author = {Frongillo, Rafael and Waggoner, Bo},
title = {{An Axiomatic Study of Scoring Rule Markets}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {15:1--15:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.15},
URN = {urn:nbn:de:0030-drops-83611},
doi = {10.4230/LIPIcs.ITCS.2018.15},
annote = {Keywords: prediction markets, information elicitation, scoring rules}
}
@InProceedings{blum_et_al:LIPIcs.ITCS.2018.16,
author = {Blum, Avrim and Mansour, Yishay},
title = {{On Price versus Quality}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {16:1--16:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.16},
URN = {urn:nbn:de:0030-drops-83264},
doi = {10.4230/LIPIcs.ITCS.2018.16},
annote = {Keywords: Algorithmic game theory, pricing, Cobb-Douglas valuations}
}
@InProceedings{goldwasser_et_al:LIPIcs.ITCS.2018.17,
author = {Goldwasser, Shafi and Grossman, Ofer and Holden, Dhiraj},
title = {{Pseudo-Deterministic Proofs}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {17:1--17:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.17},
URN = {urn:nbn:de:0030-drops-83669},
doi = {10.4230/LIPIcs.ITCS.2018.17},
annote = {Keywords: Pseudo-Deterministic, Interactive Proofs}
}
@InProceedings{goldreich_et_al:LIPIcs.ITCS.2018.18,
author = {Goldreich, Oded and Rothblum, Guy N.},
title = {{Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {18:1--18:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.18},
URN = {urn:nbn:de:0030-drops-83279},
doi = {10.4230/LIPIcs.ITCS.2018.18},
annote = {Keywords: Interactive proofs}
}
@InProceedings{berman_et_al:LIPIcs.ITCS.2018.19,
author = {Berman, Itay and Rothblum, Ron D. and Vaikuntanathan, Vinod},
title = {{Zero-Knowledge Proofs of Proximity}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {19:1--19:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.19},
URN = {urn:nbn:de:0030-drops-83575},
doi = {10.4230/LIPIcs.ITCS.2018.19},
annote = {Keywords: Property Testing, Interactive Proofs, Zero-Knowledge}
}
@InProceedings{allender_et_al:LIPIcs.ITCS.2018.20,
author = {Allender, Eric and Grochow, Joshua A. and van Melkebeek, Dieter and Moore, Cristopher and Morgan, Andrew},
title = {{Minimum Circuit Size, Graph Isomorphism, and Related Problems}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {20:1--20:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.20},
URN = {urn:nbn:de:0030-drops-83455},
doi = {10.4230/LIPIcs.ITCS.2018.20},
annote = {Keywords: Reductions between NP-intermediate problems, Graph Isomorphism, Minimum Circuit Size Problem, time-bounded Kolmogorov complexity}
}
@InProceedings{boyle_et_al:LIPIcs.ITCS.2018.21,
author = {Boyle, Elette and Gilboa, Niv and Ishai, Yuval and Lin, Huijia and Tessaro, Stefano},
title = {{Foundations of Homomorphic Secret Sharing}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {21:1--21:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.21},
URN = {urn:nbn:de:0030-drops-83659},
doi = {10.4230/LIPIcs.ITCS.2018.21},
annote = {Keywords: Cryptography, homomorphic secret sharing, secure computation, communication complexity, worst-case to average case reductions.}
}
@InProceedings{panigrahy_et_al:LIPIcs.ITCS.2018.22,
author = {Panigrahy, Rina and Rahimi, Ali and Sachdeva, Sushant and Zhang, Qiuyi},
title = {{Convergence Results for Neural Networks via Electrodynamics}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {22:1--22:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.22},
URN = {urn:nbn:de:0030-drops-83521},
doi = {10.4230/LIPIcs.ITCS.2018.22},
annote = {Keywords: Deep Learning, Learning Theory, Non-convex Optimization}
}
@InProceedings{diakonikolas_et_al:LIPIcs.ITCS.2018.23,
author = {Diakonikolas, Jelena and Orecchia, Lorenzo},
title = {{Accelerated Extra-Gradient Descent: A Novel Accelerated First-Order Method}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {23:1--23:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.23},
URN = {urn:nbn:de:0030-drops-83562},
doi = {10.4230/LIPIcs.ITCS.2018.23},
annote = {Keywords: Acceleration, dynamical systems, discretization, first-order methods}
}
@InProceedings{burgisser_et_al:LIPIcs.ITCS.2018.24,
author = {B\"{u}rgisser, Peter and Garg, Ankit and Oliveira, Rafael and Walter, Michael and Wigderson, Avi},
title = {{Alternating Minimization, Scaling Algorithms, and the Null-Cone Problem from Invariant Theory}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {24:1--24:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.24},
URN = {urn:nbn:de:0030-drops-83510},
doi = {10.4230/LIPIcs.ITCS.2018.24},
annote = {Keywords: alternating minimization, tensors, scaling, quantum marginal problem, null cone, invariant theory, geometric complexity theory}
}
@InProceedings{alman_et_al:LIPIcs.ITCS.2018.25,
author = {Alman, Josh and Vassilevska Williams, Virginia},
title = {{Further Limitations of the Known Approaches for Matrix Multiplication}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {25:1--25:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.25},
URN = {urn:nbn:de:0030-drops-83609},
doi = {10.4230/LIPIcs.ITCS.2018.25},
annote = {Keywords: matrix multiplication, lower bound, monomial degeneration, structural tensor of addition mod p}
}
@InProceedings{srinivasan_et_al:LIPIcs.ITCS.2018.26,
author = {Srinivasan, Srikanth and Sudan, Madhu},
title = {{Local Decoding and Testing of Polynomials over Grids}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.26},
URN = {urn:nbn:de:0030-drops-83294},
doi = {10.4230/LIPIcs.ITCS.2018.26},
annote = {Keywords: Property testing, Coding theory, Low-degree testing, Local decoding, Local testing}
}
@InProceedings{gur_et_al:LIPIcs.ITCS.2018.27,
author = {Gur, Tom and Ramnarayan, Govind and Rothblum, Ron D.},
title = {{Relaxed Locally Correctable Codes}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {27:1--27:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.27},
URN = {urn:nbn:de:0030-drops-83154},
doi = {10.4230/LIPIcs.ITCS.2018.27},
annote = {Keywords: Keywords and phrases Coding Theory, Locally Correctable Codes, Probabilistically Checkable Proofs}
}
@InProceedings{moshkovitz_et_al:LIPIcs.ITCS.2018.28,
author = {Moshkovitz, Dana and Moshkovitz, Michal},
title = {{Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {28:1--28:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.28},
URN = {urn:nbn:de:0030-drops-83374},
doi = {10.4230/LIPIcs.ITCS.2018.28},
annote = {Keywords: learning, space bound, mixing, certainty, entropy sampler}
}
@InProceedings{hatami_et_al:LIPIcs.ITCS.2018.29,
author = {Hatami, Pooya and Tal, Avishay},
title = {{Pseudorandom Generators for Low Sensitivity Functions}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {29:1--29:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.29},
URN = {urn:nbn:de:0030-drops-83300},
doi = {10.4230/LIPIcs.ITCS.2018.29},
annote = {Keywords: Pseudorandom Generators, Sensitivity, Sensitivity Conjecture}
}
@InProceedings{durr_et_al:LIPIcs.ITCS.2018.30,
author = {D\"{u}rr, Christoph and Erlebach, Thomas and Megow, Nicole and Mei{\ss}ner, Julie},
title = {{Scheduling with Explorable Uncertainty}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {30:1--30:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.30},
URN = {urn:nbn:de:0030-drops-83360},
doi = {10.4230/LIPIcs.ITCS.2018.30},
annote = {Keywords: online scheduling, explorable uncertainty, competitive ratio, makespan, sum of completion times}
}
@InProceedings{gro_et_al:LIPIcs.ITCS.2018.31,
author = {Gro{\ss}, Martin and Gupta, Anupam and Kumar, Amit and Matuschke, Jannik and Schmidt, Daniel R. and Schmidt, Melanie and Verschae, Jos\'{e}},
title = {{A Local-Search Algorithm for Steiner Forest}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {31:1--31:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.31},
URN = {urn:nbn:de:0030-drops-83134},
doi = {10.4230/LIPIcs.ITCS.2018.31},
annote = {Keywords: Local Search, Steiner Forest, Approximation Algorithms, Network Design}
}
@InProceedings{lokshtanov_et_al:LIPIcs.ITCS.2018.32,
author = {Lokshtanov, Daniel and Misra, Pranabendu and Panolan, Fahad and Saurabh, Saket and Zehavi, Meirav},
title = {{Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {32:1--32:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.32},
URN = {urn:nbn:de:0030-drops-83144},
doi = {10.4230/LIPIcs.ITCS.2018.32},
annote = {Keywords: travserval matroid, matroid representation, union representation, representative set}
}
@InProceedings{kleinberg_et_al:LIPIcs.ITCS.2018.33,
author = {Kleinberg, Jon and Raghavan, Manish},
title = {{Selection Problems in the Presence of Implicit Bias}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {33:1--33:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.33},
URN = {urn:nbn:de:0030-drops-83234},
doi = {10.4230/LIPIcs.ITCS.2018.33},
annote = {Keywords: algorithmic fairness, power laws, order statistics, implicit bias, Rooney Rule}
}
@InProceedings{demaine_et_al:LIPIcs.ITCS.2018.34,
author = {Demaine, Erik D. and Lincoln, Andrea and Liu, Quanquan C. and Lynch, Jayson and Vassilevska Williams, Virginia},
title = {{Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {34:1--34:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.34},
URN = {urn:nbn:de:0030-drops-83335},
doi = {10.4230/LIPIcs.ITCS.2018.34},
annote = {Keywords: IO model, Fine-grained Complexity, Algorithms}
}
@InProceedings{abboud_et_al:LIPIcs.ITCS.2018.35,
author = {Abboud, Amir and Rubinstein, Aviad},
title = {{Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {35:1--35:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.35},
URN = {urn:nbn:de:0030-drops-83490},
doi = {10.4230/LIPIcs.ITCS.2018.35},
annote = {Keywords: Distributed PCP, Longest Common Subsequence, Fine-grained Complexity, Strong Exponential Time Hypothesis}
}
@InProceedings{dinur_et_al:LIPIcs.ITCS.2018.36,
author = {Dinur, Irit and Manurangsi, Pasin},
title = {{ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {36:1--36:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.36},
URN = {urn:nbn:de:0030-drops-83670},
doi = {10.4230/LIPIcs.ITCS.2018.36},
annote = {Keywords: Hardness of Approximation, Constraint Satisfaction Problems, Directed Steiner Network, Parameterized Complexity}
}
@InProceedings{goldberg_et_al:LIPIcs.ITCS.2018.37,
author = {Goldberg, Paul W. and Papadimitriou, Christos H.},
title = {{Towards a Unified Complexity Theory of Total Functions}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {37:1--37:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.37},
URN = {urn:nbn:de:0030-drops-83403},
doi = {10.4230/LIPIcs.ITCS.2018.37},
annote = {Keywords: Computational complexity, first-order logic, proof system, NP search functions, TFNP}
}
@InProceedings{beame_et_al:LIPIcs.ITCS.2018.38,
author = {Beame, Paul and Har-Peled, Sariel and Natarajan Ramamoorthy, Sivaramakrishnan and Rashtchian, Cyrus and Sinha, Makrand},
title = {{Edge Estimation with Independent Set Oracles}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {38:1--38:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.38},
URN = {urn:nbn:de:0030-drops-83552},
doi = {10.4230/LIPIcs.ITCS.2018.38},
annote = {Keywords: Approximate Counting, Independent Set Queries, Sparsification, Importance Sampling}
}
@InProceedings{rubinstein_et_al:LIPIcs.ITCS.2018.39,
author = {Rubinstein, Aviad and Schramm, Tselil and Weinberg, S. Matthew},
title = {{Computing Exact Minimum Cuts Without Knowing the Graph}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {39:1--39:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.39},
URN = {urn:nbn:de:0030-drops-83168},
doi = {10.4230/LIPIcs.ITCS.2018.39},
annote = {Keywords: query complexity, minimum cut}
}
@InProceedings{ailon_et_al:LIPIcs.ITCS.2018.40,
author = {Ailon, Nir and Bhattacharya, Anup and Jaiswal, Ragesh and Kumar, Amit},
title = {{Approximate Clustering with Same-Cluster Queries}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {40:1--40:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.40},
URN = {urn:nbn:de:0030-drops-83358},
doi = {10.4230/LIPIcs.ITCS.2018.40},
annote = {Keywords: k-means, semi-supervised learning, query bounds}
}
@InProceedings{alev_et_al:LIPIcs.ITCS.2018.41,
author = {Alev, Vedat Levi and Anari, Nima and Lau, Lap Chi and Oveis Gharan, Shayan},
title = {{Graph Clustering using Effective Resistance}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {41:1--41:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.41},
URN = {urn:nbn:de:0030-drops-83696},
doi = {10.4230/LIPIcs.ITCS.2018.41},
annote = {Keywords: Electrical Flows, Effective Resistance, Conductance, Graph Partitioning}
}
@InProceedings{chandrasekaran_et_al:LIPIcs.ITCS.2018.42,
author = {Chandrasekaran, Karthekeyan and Dadush, Daniel and Gandikota, Venkata and Grigorescu, Elena},
title = {{Lattice-based Locality Sensitive Hashing is Optimal}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {42:1--42:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.42},
URN = {urn:nbn:de:0030-drops-83470},
doi = {10.4230/LIPIcs.ITCS.2018.42},
annote = {Keywords: Locality Sensitive Hashing, Approximate Nearest Neighbor Search, Random Lattices}
}
@InProceedings{balcer_et_al:LIPIcs.ITCS.2018.43,
author = {Balcer, Victor and Vadhan, Salil},
title = {{Differential Privacy on Finite Computers}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {43:1--43:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.43},
URN = {urn:nbn:de:0030-drops-83537},
doi = {10.4230/LIPIcs.ITCS.2018.43},
annote = {Keywords: Algorithms, Differential Privacy, Discrete Computation, Histograms}
}
@InProceedings{karwa_et_al:LIPIcs.ITCS.2018.44,
author = {Karwa, Vishesh and Vadhan, Salil},
title = {{Finite Sample Differentially Private Confidence Intervals}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {44:1--44:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.44},
URN = {urn:nbn:de:0030-drops-83449},
doi = {10.4230/LIPIcs.ITCS.2018.44},
annote = {Keywords: Differential Privacy, Confidence Intervals, Lower bounds, Finite Sample}
}
@InProceedings{steinhardt_et_al:LIPIcs.ITCS.2018.45,
author = {Steinhardt, Jacob and Charikar, Moses and Valiant, Gregory},
title = {{Resilience: A Criterion for Learning in the Presence of Arbitrary Outliers}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {45:1--45:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.45},
URN = {urn:nbn:de:0030-drops-83687},
doi = {10.4230/LIPIcs.ITCS.2018.45},
annote = {Keywords: robust learning, outliers, stochastic block models, p-norm estimation}
}
@InProceedings{huang_et_al:LIPIcs.ITCS.2018.46,
author = {Huang, Qingqing and Kakade, Sham M. and Kong, Weihao and Valiant, Gregory},
title = {{Recovering Structured Probability Matrices}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {46:1--46:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.46},
URN = {urn:nbn:de:0030-drops-83625},
doi = {10.4230/LIPIcs.ITCS.2018.46},
annote = {Keywords: Random matrices, matrix recovery, stochastic block model, Hidden Markov Models}
}
@InProceedings{qiao_et_al:LIPIcs.ITCS.2018.47,
author = {Qiao, Mingda and Valiant, Gregory},
title = {{Learning Discrete Distributions from Untrusted Batches}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {47:1--47:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.47},
URN = {urn:nbn:de:0030-drops-83215},
doi = {10.4230/LIPIcs.ITCS.2018.47},
annote = {Keywords: robust statistics, information-theoretic optimality}
}
@InProceedings{mansour_et_al:LIPIcs.ITCS.2018.48,
author = {Mansour, Yishay and Slivkins, Aleksandrs and Wu, Zhiwei Steven},
title = {{Competing Bandits: Learning Under Competition}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {48:1--48:27},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.48},
URN = {urn:nbn:de:0030-drops-83341},
doi = {10.4230/LIPIcs.ITCS.2018.48},
annote = {Keywords: machine learning, game theory, competition, exploration, rationality}
}
@InProceedings{boczkowski_et_al:LIPIcs.ITCS.2018.49,
author = {Boczkowski, Lucas and Feinerman, Ofer and Korman, Amos and Natale, Emanuele},
title = {{Limits for Rumor Spreading in Stochastic Populations}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {49:1--49:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.49},
URN = {urn:nbn:de:0030-drops-83207},
doi = {10.4230/LIPIcs.ITCS.2018.49},
annote = {Keywords: Noisy communication, Passive communication, Ant recruitment, Hypothesis testing}
}
@InProceedings{censorhillel_et_al:LIPIcs.ITCS.2018.50,
author = {Censor-Hillel, Keren and Gelles, Ran and Haeupler, Bernhard},
title = {{Making Asynchronous Distributed Computations Robust to Channel Noise}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {50:1--50:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.50},
URN = {urn:nbn:de:0030-drops-83184},
doi = {10.4230/LIPIcs.ITCS.2018.50},
annote = {Keywords: Distributed Computation, Coding for Interactive Communication, Noise- Resilient Computation, Coding Theory}
}
@InProceedings{bernstein_et_al:LIPIcs.ITCS.2018.51,
author = {Bernstein, Aaron and D\"{a}ubel, Karl and Disser, Yann and Klimm, Max and M\"{u}tze, Torsten and Smolny, Frieder},
title = {{Distance-Preserving Graph Contractions}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {51:1--51:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.51},
URN = {urn:nbn:de:0030-drops-83427},
doi = {10.4230/LIPIcs.ITCS.2018.51},
annote = {Keywords: distance oracle, contraction, spanner}
}
@InProceedings{solomon:LIPIcs.ITCS.2018.52,
author = {Solomon, Shay},
title = {{Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {52:1--52:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.52},
URN = {urn:nbn:de:0030-drops-83647},
doi = {10.4230/LIPIcs.ITCS.2018.52},
annote = {Keywords: arboricity, bounded degree, local algorithm, sparsifier}
}
@InProceedings{chiesa_et_al:LIPIcs.ITCS.2018.53,
author = {Chiesa, Alessandro and Gur, Tom},
title = {{Proofs of Proximity for Distribution Testing}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {53:1--53:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.53},
URN = {urn:nbn:de:0030-drops-83114},
doi = {10.4230/LIPIcs.ITCS.2018.53},
annote = {Keywords: distribution testing, proofs of proximity, property testing}
}
@InProceedings{gishboliner_et_al:LIPIcs.ITCS.2018.54,
author = {Gishboliner, Lior and Shapira, Asaf},
title = {{Efficient Testing without Efficient Regularity}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {54:1--54:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.54},
URN = {urn:nbn:de:0030-drops-83124},
doi = {10.4230/LIPIcs.ITCS.2018.54},
annote = {Keywords: Property testing, Induced C\underline4-freeness}
}
@InProceedings{kothari_et_al:LIPIcs.ITCS.2018.55,
author = {Kothari, Pravesh K. and Livni, Roi},
title = {{Improper Learning by Refuting}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {55:1--55:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.55},
URN = {urn:nbn:de:0030-drops-83488},
doi = {10.4230/LIPIcs.ITCS.2018.55},
annote = {Keywords: learning thoery, computation learning}
}
@InProceedings{yang:LIPIcs.ITCS.2018.56,
author = {Yang, Greg},
title = {{A Homological Theory of Functions: Nonuniform Boolean Complexity Separation and VC Dimension Bound Via Algebraic Topology, and a Homological Farkas Lemma}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {56:1--56:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.56},
URN = {urn:nbn:de:0030-drops-83436},
doi = {10.4230/LIPIcs.ITCS.2018.56},
annote = {Keywords: Homology, Stanley-Reisner, Cellular resolution, VC dimension, Homological Farkas}
}
@InProceedings{legenstein_et_al:LIPIcs.ITCS.2018.57,
author = {Legenstein, Robert and Maass, Wolfgang and Papadimitriou, Christos H. and Vempala, Santosh S.},
title = {{Long Term Memory and the Densest K-Subgraph Problem}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {57:1--57:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.57},
URN = {urn:nbn:de:0030-drops-83593},
doi = {10.4230/LIPIcs.ITCS.2018.57},
annote = {Keywords: Brain computation, long term memory, assemblies, association}
}
@InProceedings{chazelle:LIPIcs.ITCS.2018.58,
author = {Chazelle, Bernard},
title = {{Toward a Theory of Markov Influence Systems and their Renormalization}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {58:1--58:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.58},
URN = {urn:nbn:de:0030-drops-83317},
doi = {10.4230/LIPIcs.ITCS.2018.58},
annote = {Keywords: Markov influence systems, nonlinear Markov chains, dynamical systems, renormalization, graph sequence parsing}
}
@InProceedings{piliouras_et_al:LIPIcs.ITCS.2018.59,
author = {Piliouras, Georgios and Schulman, Leonard J.},
title = {{Learning Dynamics and the Co-Evolution of Competing Sexual Species}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {59:1--59:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.59},
URN = {urn:nbn:de:0030-drops-83637},
doi = {10.4230/LIPIcs.ITCS.2018.59},
annote = {Keywords: Dynamical Systems, Potential Game, Team Zero-Sum Game, Boolean Functions, Replicator Dynamics}
}
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