@Proceedings{chatzigiannakis_et_al:LIPIcs.ICALP.2017,
title = {{LIPIcs, Volume 80, ICALP'17, Complete Volume}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017},
URN = {urn:nbn:de:0030-drops-75107},
doi = {10.4230/LIPIcs.ICALP.2017},
annote = {Keywords: Theory of Computation}
}
@InProceedings{chatzigiannakis_et_al:LIPIcs.ICALP.2017.0,
author = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
title = {{Front Matter, Table of Contents, Preface, Organization, List of Authors}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {0:i--0:xlii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.0},
URN = {urn:nbn:de:0030-drops-73663},
doi = {10.4230/LIPIcs.ICALP.2017.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Organization, List of Authors}
}
@InProceedings{bojanczyk:LIPIcs.ICALP.2017.1,
author = {Bojanczyk, Mikolaj},
title = {{Orbit-Finite Sets and Their Algorithms}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {1:1--1:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.1},
URN = {urn:nbn:de:0030-drops-74295},
doi = {10.4230/LIPIcs.ICALP.2017.1},
annote = {Keywords: Orbit-finite sets, sets with atoms, data words, register automata}
}
@InProceedings{henzinger:LIPIcs.ICALP.2017.2,
author = {Henzinger, Monika},
title = {{Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.2},
URN = {urn:nbn:de:0030-drops-75054},
doi = {10.4230/LIPIcs.ICALP.2017.2},
annote = {Keywords: Computer-aided Verification, Game Theory, Markov Decision Process}
}
@InProceedings{rubinfeld:LIPIcs.ICALP.2017.3,
author = {Rubinfeld, Ronitt},
title = {{Local Computation Algorithms}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.3},
URN = {urn:nbn:de:0030-drops-75068},
doi = {10.4230/LIPIcs.ICALP.2017.3},
annote = {Keywords: Massive Data Sets, Approximate Solutions, Maximal Independent Set, Sparse Spanning Graphs}
}
@InProceedings{thorup:LIPIcs.ICALP.2017.4,
author = {Thorup, Mikkel},
title = {{Fast and Powerful Hashing Using Tabulation}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {4:1--4:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.4},
URN = {urn:nbn:de:0030-drops-75074},
doi = {10.4230/LIPIcs.ICALP.2017.4},
annote = {Keywords: Hashing, Randomized Algorithms}
}
@InProceedings{baleshzar_et_al:LIPIcs.ICALP.2017.5,
author = {Baleshzar, Roksana and Chakrabarty, Deeparnab and Pallavoor, Ramesh Krishnan S. and Raskhodnikova, Sofya and Seshadhri, C.},
title = {{Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.5},
URN = {urn:nbn:de:0030-drops-74844},
doi = {10.4230/LIPIcs.ICALP.2017.5},
annote = {Keywords: Property testing, unate and monotone functions}
}
@InProceedings{even_et_al:LIPIcs.ICALP.2017.6,
author = {Even, Guy and Levi, Reut and Medina, Moti and Ros\'{e}n, Adi},
title = {{Sublinear Random Access Generators for Preferential Attachment Graphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {6:1--6:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.6},
URN = {urn:nbn:de:0030-drops-74242},
doi = {10.4230/LIPIcs.ICALP.2017.6},
annote = {Keywords: local computation algorithms, preferential attachment graphs, random recursive trees, sublinear algorithms}
}
@InProceedings{eden_et_al:LIPIcs.ICALP.2017.7,
author = {Eden, Talya and Ron, Dana and Seshadhri, C.},
title = {{Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {7:1--7:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.7},
URN = {urn:nbn:de:0030-drops-73747},
doi = {10.4230/LIPIcs.ICALP.2017.7},
annote = {Keywords: Sublinear algorithms, Degree distribution, Graph moments}
}
@InProceedings{diakonikolas_et_al:LIPIcs.ICALP.2017.8,
author = {Diakonikolas, Ilias and Kane, Daniel M. and Nikishkin, Vladimir},
title = {{Near-Optimal Closeness Testing of Discrete Histogram Distributions}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {8:1--8:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.8},
URN = {urn:nbn:de:0030-drops-74937},
doi = {10.4230/LIPIcs.ICALP.2017.8},
annote = {Keywords: distribution testing, histograms, closeness testing}
}
@InProceedings{beneliezer_et_al:LIPIcs.ICALP.2017.9,
author = {Ben-Eliezer, Omri and Korman, Simon and Reichman, Daniel},
title = {{Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.9},
URN = {urn:nbn:de:0030-drops-74427},
doi = {10.4230/LIPIcs.ICALP.2017.9},
annote = {Keywords: Property testing, Sublinear algorithms, Pattern matching}
}
@InProceedings{albers_et_al:LIPIcs.ICALP.2017.10,
author = {Albers, Susanne and Kraft, Dennis},
title = {{On the Value of Penalties in Time-Inconsistent Planning}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {10:1--10:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.10},
URN = {urn:nbn:de:0030-drops-73876},
doi = {10.4230/LIPIcs.ICALP.2017.10},
annote = {Keywords: approximation algorithms, behavioral economics, commitment devices, computational complexity, time-inconsistent preferences}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2017.11,
author = {Chen, Jing and Li, Bo and Li, Yingkai},
title = {{Efficient Approximations for the Online Dispersion Problem}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.11},
URN = {urn:nbn:de:0030-drops-74002},
doi = {10.4230/LIPIcs.ICALP.2017.11},
annote = {Keywords: dispersion, online algorithms, geometric optimization, packing, competitive algorithms}
}
@InProceedings{nagarajan_et_al:LIPIcs.ICALP.2017.12,
author = {Nagarajan, Viswanath and Shen, Xiangkun},
title = {{Online Covering with Sum of \$ell\underlineq\$-Norm Objectives}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {12:1--12:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.12},
URN = {urn:nbn:de:0030-drops-73839},
doi = {10.4230/LIPIcs.ICALP.2017.12},
annote = {Keywords: online algorithm, covering/packing problem, convex, buy-at-bulk, throughput maximization}
}
@InProceedings{bienkowski_et_al:LIPIcs.ICALP.2017.13,
author = {Bienkowski, Marcin and Byrka, Jaroslaw and Mucha, Marcin},
title = {{Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {13:1--13:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.13},
URN = {urn:nbn:de:0030-drops-73942},
doi = {10.4230/LIPIcs.ICALP.2017.13},
annote = {Keywords: file migration, factor-revealing linear programs, online algorithms, competitive analysis}
}
@InProceedings{coester_et_al:LIPIcs.ICALP.2017.14,
author = {Coester, Christian and Koutsoupias, Elias and Lazos, Philip},
title = {{The Infinite Server Problem}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.14},
URN = {urn:nbn:de:0030-drops-74563},
doi = {10.4230/LIPIcs.ICALP.2017.14},
annote = {Keywords: Online Algorithms, k-Server, Resource Augmentation}
}
@InProceedings{kindler_et_al:LIPIcs.ICALP.2017.15,
author = {Kindler, Guy and O'Donnell, Ryan},
title = {{Quantum Automata Cannot Detect Biased Coins, Even in the Limit}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {15:1--15:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.15},
URN = {urn:nbn:de:0030-drops-73995},
doi = {10.4230/LIPIcs.ICALP.2017.15},
annote = {Keywords: quantum automata}
}
@InProceedings{backens:LIPIcs.ICALP.2017.16,
author = {Backens, Miriam},
title = {{A New Holant Dichotomy Inspired by Quantum Computation}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {16:1--16:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.16},
URN = {urn:nbn:de:0030-drops-74383},
doi = {10.4230/LIPIcs.ICALP.2017.16},
annote = {Keywords: computational complexity, counting complexity, Holant, dichotomy, entanglement}
}
@InProceedings{cleve_et_al:LIPIcs.ICALP.2017.17,
author = {Cleve, Richard and Wang, Chunhao},
title = {{Efficient Quantum Algorithms for Simulating Lindblad Evolution}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.17},
URN = {urn:nbn:de:0030-drops-74776},
doi = {10.4230/LIPIcs.ICALP.2017.17},
annote = {Keywords: quantum algorithms, open quantum systems, Lindblad simulation}
}
@InProceedings{dohotaru_et_al:LIPIcs.ICALP.2017.18,
author = {Dohotaru, Catalin and H{\o}yer, Peter},
title = {{Controlled Quantum Amplification}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {18:1--18:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.18},
URN = {urn:nbn:de:0030-drops-74893},
doi = {10.4230/LIPIcs.ICALP.2017.18},
annote = {Keywords: Quantum algorithms, quantum walks, random walks, quantum search}
}
@InProceedings{jayaram_et_al:LIPIcs.ICALP.2017.19,
author = {Jayaram, Rajesh and Saha, Barna},
title = {{Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {19:1--19:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.19},
URN = {urn:nbn:de:0030-drops-74548},
doi = {10.4230/LIPIcs.ICALP.2017.19},
annote = {Keywords: Approximation, Edit Distance, Dynamic Programming, Context Free Grammar, Hardness}
}
@InProceedings{krauthgamer_et_al:LIPIcs.ICALP.2017.20,
author = {Krauthgamer, Robert and Trabelsi, Ohad},
title = {{Conditional Lower Bounds for All-Pairs Max-Flow}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {20:1--20:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.20},
URN = {urn:nbn:de:0030-drops-74264},
doi = {10.4230/LIPIcs.ICALP.2017.20},
annote = {Keywords: Conditional lower bounds, Hardness in P, All-Pairs Maximum Flow, Strong Exponential Time Hypothesis}
}
@InProceedings{kunnemann_et_al:LIPIcs.ICALP.2017.21,
author = {K\"{u}nnemann, Marvin and Paturi, Ramamohan and Schneider, Stefan},
title = {{On the Fine-Grained Complexity of One-Dimensional Dynamic Programming}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.21},
URN = {urn:nbn:de:0030-drops-74688},
doi = {10.4230/LIPIcs.ICALP.2017.21},
annote = {Keywords: Least-Weight Subsequence, SETH, Fine-Grained Complexity, Knapsack, Subquadratic Algorithms}
}
@InProceedings{cygan_et_al:LIPIcs.ICALP.2017.22,
author = {Cygan, Marek and Mucha, Marcin and Wegrzycki, Karol and Wlodarczyk, Michal},
title = {{On Problems Equivalent to (min,+)-Convolution}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {22:1--22:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.22},
URN = {urn:nbn:de:0030-drops-74216},
doi = {10.4230/LIPIcs.ICALP.2017.22},
annote = {Keywords: fine-grained complexity, knapsack, conditional lower bounds, (min,+)-convolution, subquadratic equivalence}
}
@InProceedings{bury_et_al:LIPIcs.ICALP.2017.23,
author = {Bury, Marc and Schwiegelshohn, Chris},
title = {{On Finding the Jaccard Center}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {23:1--23:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.23},
URN = {urn:nbn:de:0030-drops-73769},
doi = {10.4230/LIPIcs.ICALP.2017.23},
annote = {Keywords: Clustering, 1-Center, Jaccard}
}
@InProceedings{almagor_et_al:LIPIcs.ICALP.2017.24,
author = {Almagor, Shaull and Ouaknine, Jo\"{e}l and Worrell, James},
title = {{The Polytope-Collision Problem}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {24:1--24:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.24},
URN = {urn:nbn:de:0030-drops-74521},
doi = {10.4230/LIPIcs.ICALP.2017.24},
annote = {Keywords: linear dynamical systems, orbit problem, algebraic algorithms}
}
@InProceedings{gold_et_al:LIPIcs.ICALP.2017.25,
author = {Gold, Omer and Sharir, Micha},
title = {{Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {25:1--25:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.25},
URN = {urn:nbn:de:0030-drops-73820},
doi = {10.4230/LIPIcs.ICALP.2017.25},
annote = {Keywords: Dynamic Time Warping, Geometric Edit Distance, Time Series, Points Matching, Geometric Matching}
}
@InProceedings{blelloch_et_al:LIPIcs.ICALP.2017.26,
author = {Blelloch, Guy E. and Gu, Yan and Sun, Yihan},
title = {{Efficient Construction of Probabilistic Tree Embeddings}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.26},
URN = {urn:nbn:de:0030-drops-75034},
doi = {10.4230/LIPIcs.ICALP.2017.26},
annote = {Keywords: Graph Algorithm, Metric Embeddings, Probabilistic Tree Embeddings, Single-source Shortest-paths}
}
@InProceedings{galanis_et_al:LIPIcs.ICALP.2017.27,
author = {Galanis, Andreas and Goldberg, Leslie Ann and Yang, Kuan},
title = {{Approximating Partition Functions of Bounded-Degree Boolean Counting Constraint Satisfaction Problems}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.27},
URN = {urn:nbn:de:0030-drops-74099},
doi = {10.4230/LIPIcs.ICALP.2017.27},
annote = {Keywords: Constraint Satisfaction, Approximate Counting}
}
@InProceedings{galanis_et_al:LIPIcs.ICALP.2017.28,
author = {Galanis, Andreas and Goldberg, Leslie Ann and Stefankovic, Daniel},
title = {{Inapproximability of the Independent Set Polynomial Below the Shearer Threshold}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {28:1--28:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.28},
URN = {urn:nbn:de:0030-drops-73962},
doi = {10.4230/LIPIcs.ICALP.2017.28},
annote = {Keywords: approximate counting, independent set polynomial, Shearer threshold}
}
@InProceedings{lin_et_al:LIPIcs.ICALP.2017.29,
author = {Lin, Jiabao and Wang, Hanpin},
title = {{The Complexity of Holant Problems over Boolean Domain with Non-Negative Weights}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {29:1--29:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.29},
URN = {urn:nbn:de:0030-drops-73846},
doi = {10.4230/LIPIcs.ICALP.2017.29},
annote = {Keywords: counting complexity, dichotomy, Holant, #CSP}
}
@InProceedings{galicki:LIPIcs.ICALP.2017.30,
author = {Galicki, Alex},
title = {{Polynomial-Time Rademacher Theorem, Porosity and Randomness}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {30:1--30:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.30},
URN = {urn:nbn:de:0030-drops-74033},
doi = {10.4230/LIPIcs.ICALP.2017.30},
annote = {Keywords: Rademacher, porosity, p-randomness, differentiability}
}
@InProceedings{antoniadis_et_al:LIPIcs.ICALP.2017.31,
author = {Antoniadis, Antonios and Hoeksma, Ruben and Mei{\ss}ner, Julie and Verschae, Jos\'{e} and Wiese, Andreas},
title = {{A QPTAS for the General Scheduling Problem with Identical Release Dates}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {31:1--31:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.31},
URN = {urn:nbn:de:0030-drops-74575},
doi = {10.4230/LIPIcs.ICALP.2017.31},
annote = {Keywords: Generalized Scheduling, QPTAS, Unsplittable Flows}
}
@InProceedings{linhares_et_al:LIPIcs.ICALP.2017.32,
author = {Linhares, Andr\'{e} and Swamy, Chaitanya},
title = {{Improved Algorithms for MST and Metric-TSP Interdiction}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.32},
URN = {urn:nbn:de:0030-drops-74552},
doi = {10.4230/LIPIcs.ICALP.2017.32},
annote = {Keywords: Approximation algorithms, interdiction problems, LP-rounding algorithms, iterative rounding, tree-knapsack problem, supermodular functions}
}
@InProceedings{kohler_et_al:LIPIcs.ICALP.2017.33,
author = {Kohler, Matthias and R\"{a}cke, Harald},
title = {{Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {33:1--33:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.33},
URN = {urn:nbn:de:0030-drops-73882},
doi = {10.4230/LIPIcs.ICALP.2017.33},
annote = {Keywords: Online algorithms, reordering buffer, metric spaces, scheduling}
}
@InProceedings{chen_et_al:LIPIcs.ICALP.2017.34,
author = {Chen, Shahar and Di Castro, Dotan and Karnin, Zohar and Lewin-Eytan, Liane and Naor, Joseph (Seffi) and Schwartz, Roy},
title = {{Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.34},
URN = {urn:nbn:de:0030-drops-74612},
doi = {10.4230/LIPIcs.ICALP.2017.34},
annote = {Keywords: approximation algorithms, randomized rounding, dependent rounding, metric labeling, classification}
}
@InProceedings{adamczyk_et_al:LIPIcs.ICALP.2017.35,
author = {Adamczyk, Marek and Grandoni, Fabrizio and Leonardi, Stefano and Wlodarczyk, Michal},
title = {{When the Optimum is also Blind: a New Perspective on Universal Optimization}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {35:1--35:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.35},
URN = {urn:nbn:de:0030-drops-74436},
doi = {10.4230/LIPIcs.ICALP.2017.35},
annote = {Keywords: approximation algorithms, stochastic optimization, submodularity}
}
@InProceedings{agrawal_et_al:LIPIcs.ICALP.2017.36,
author = {Agrawal, Shweta and Singh, Ishaan Preet},
title = {{Reusable Garbled Deterministic Finite Automata from Learning With Errors}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {36:1--36:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.36},
URN = {urn:nbn:de:0030-drops-75014},
doi = {10.4230/LIPIcs.ICALP.2017.36},
annote = {Keywords: Functional Encryption, Learning With Errors, Deterministic Finite Automata, Garbled DFA}
}
@InProceedings{cohen_et_al:LIPIcs.ICALP.2017.37,
author = {Cohen, Ran and Coretti, Sandro and Garay, Juan and Zikas, Vassilis},
title = {{Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {37:1--37:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.37},
URN = {urn:nbn:de:0030-drops-74124},
doi = {10.4230/LIPIcs.ICALP.2017.37},
annote = {Keywords: Cryptographic protocols, secure multi-party computation, broadcast.}
}
@InProceedings{apon_et_al:LIPIcs.ICALP.2017.38,
author = {Apon, Daniel and D\"{o}ttling, Nico and Garg, Sanjam and Mukherjee, Pratyay},
title = {{Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {38:1--38:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.38},
URN = {urn:nbn:de:0030-drops-73814},
doi = {10.4230/LIPIcs.ICALP.2017.38},
annote = {Keywords: Obfuscation, Multilinear Maps, Cryptanalysis.}
}
@InProceedings{pietrzak_et_al:LIPIcs.ICALP.2017.39,
author = {Pietrzak, Krzysztof and Skorski, Maciej},
title = {{Non-Uniform Attacks Against Pseudoentropy}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {39:1--39:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.39},
URN = {urn:nbn:de:0030-drops-74738},
doi = {10.4230/LIPIcs.ICALP.2017.39},
annote = {Keywords: pseudoentropy, non-uniform attacks}
}
@InProceedings{bensasson_et_al:LIPIcs.ICALP.2017.40,
author = {Ben-Sasson, Eli and Chiesa, Alessandro and Gabizon, Ariel and Riabzev, Michael and Spooner, Nicholas},
title = {{Interactive Oracle Proofs with Constant Rate and Query Complexity}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {40:1--40:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.40},
URN = {urn:nbn:de:0030-drops-74713},
doi = {10.4230/LIPIcs.ICALP.2017.40},
annote = {Keywords: probabilistically checkable proofs, interactive proofs, proof composition, sumcheck}
}
@InProceedings{alman_et_al:LIPIcs.ICALP.2017.41,
author = {Alman, Josh and Mnich, Matthias and Vassilevska Williams, Virginia},
title = {{Dynamic Parameterized Problems and Algorithms}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {41:1--41:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.41},
URN = {urn:nbn:de:0030-drops-74419},
doi = {10.4230/LIPIcs.ICALP.2017.41},
annote = {Keywords: Dynamic algorithms, fixed-parameter algorithms}
}
@InProceedings{georgiadis_et_al:LIPIcs.ICALP.2017.42,
author = {Georgiadis, Loukas and Dueholm Hansen, Thomas and Italiano, Giuseppe F. and Krinninger, Sebastian and Parotsidis, Nikos},
title = {{Decremental Data Structures for Connectivity and Dominators in Directed Graphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {42:1--42:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.42},
URN = {urn:nbn:de:0030-drops-74455},
doi = {10.4230/LIPIcs.ICALP.2017.42},
annote = {Keywords: dynamic graph algorithms, decremental algorithms, dominator tree, strong connectivity under failures}
}
@InProceedings{bernstein_et_al:LIPIcs.ICALP.2017.43,
author = {Bernstein, Aaron and Disser, Yann and Gro{\ss}, Martin},
title = {{General Bounds for Incremental Maximization}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {43:1--43:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.43},
URN = {urn:nbn:de:0030-drops-74650},
doi = {10.4230/LIPIcs.ICALP.2017.43},
annote = {Keywords: incremental optimization, maximization problems, greedy algorithm, competitive analysis, cardinality constraint}
}
@InProceedings{bernstein:LIPIcs.ICALP.2017.44,
author = {Bernstein, Aaron},
title = {{Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {44:1--44:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.44},
URN = {urn:nbn:de:0030-drops-74013},
doi = {10.4230/LIPIcs.ICALP.2017.44},
annote = {Keywords: Shortest Paths, Dynamic Algorithms, Deterministic, Weighted Graph}
}
@InProceedings{bodwin:LIPIcs.ICALP.2017.45,
author = {Bodwin, Greg},
title = {{Testing Core Membership in Public Goods Economies}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.45},
URN = {urn:nbn:de:0030-drops-74910},
doi = {10.4230/LIPIcs.ICALP.2017.45},
annote = {Keywords: Algorithmic Game Theory, Economics, Algorithms, Public Goods, Coalitional Stability}
}
@InProceedings{bohnlein_et_al:LIPIcs.ICALP.2017.46,
author = {B\"{o}hnlein, Toni and Kratsch, Stefan and Schaudt, Oliver},
title = {{Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {46:1--46:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.46},
URN = {urn:nbn:de:0030-drops-73771},
doi = {10.4230/LIPIcs.ICALP.2017.46},
annote = {Keywords: Algorithmic pricing, Stackelberg games, Approximation algorithms, Rev- enue maximization, Parameterized complexity}
}
@InProceedings{giannakopoulos_et_al:LIPIcs.ICALP.2017.47,
author = {Giannakopoulos, Yiannis and Koutsoupias, Elias and Lazos, Philip},
title = {{Online Market Intermediation}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {47:1--47:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.47},
URN = {urn:nbn:de:0030-drops-74815},
doi = {10.4230/LIPIcs.ICALP.2017.47},
annote = {Keywords: optimal auctions, bilateral trade, sequential auctions, online algorithms, competitive analysis}
}
@InProceedings{gravin_et_al:LIPIcs.ICALP.2017.48,
author = {Gravin, Nick and Peres, Yuval and Sivan, Balasubramanian},
title = {{Tight Lower Bounds for Multiplicative Weights Algorithmic Families}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {48:1--48:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.48},
URN = {urn:nbn:de:0030-drops-74997},
doi = {10.4230/LIPIcs.ICALP.2017.48},
annote = {Keywords: Multiplicative Weights, Lower Bounds, Adversarial Primitives}
}
@InProceedings{ghazi_et_al:LIPIcs.ICALP.2017.49,
author = {Ghazi, Badih and Sudan, Madhu},
title = {{The Power of Shared Randomness in Uncertain Communication}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {49:1--49:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.49},
URN = {urn:nbn:de:0030-drops-74871},
doi = {10.4230/LIPIcs.ICALP.2017.49},
annote = {Keywords: randomness, uncertainty, communication, imperfectly shared randomness, lower bounds}
}
@InProceedings{rossman_et_al:LIPIcs.ICALP.2017.50,
author = {Rossman, Benjamin and Srinivasan, Srikanth},
title = {{Separation of AC^0\lbrackoplus\rbrack Formulas and Circuits}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {50:1--50:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.50},
URN = {urn:nbn:de:0030-drops-73904},
doi = {10.4230/LIPIcs.ICALP.2017.50},
annote = {Keywords: circuit complexity, lower bounds, approximate majority, polynomial method}
}
@InProceedings{lin_et_al:LIPIcs.ICALP.2017.51,
author = {Lin, Chengyu and Zhang, Shengyu},
title = {{Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {51:1--51:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.51},
URN = {urn:nbn:de:0030-drops-74045},
doi = {10.4230/LIPIcs.ICALP.2017.51},
annote = {Keywords: Analysis of Boolean functions, Sensitivity Conjecture, Log-rank Conjecture, Alternating Number}
}
@InProceedings{goos_et_al:LIPIcs.ICALP.2017.52,
author = {G\"{o}\"{o}s, Mika and Jayram, T. S. and Pitassi, Toniann and Watson, Thomas},
title = {{Randomized Communication vs. Partition Number}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {52:1--52:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.52},
URN = {urn:nbn:de:0030-drops-74861},
doi = {10.4230/LIPIcs.ICALP.2017.52},
annote = {Keywords: communication complexity, partition number, information complexity}
}
@InProceedings{bogdanov_et_al:LIPIcs.ICALP.2017.53,
author = {Bogdanov, Andrej and Williamson, Christopher},
title = {{Approximate Bounded Indistinguishability}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {53:1--53:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.53},
URN = {urn:nbn:de:0030-drops-74671},
doi = {10.4230/LIPIcs.ICALP.2017.53},
annote = {Keywords: pseudorandomness, polynomial approximation, secret sharing}
}
@InProceedings{bezakova_et_al:LIPIcs.ICALP.2017.54,
author = {Bez\'{a}kov\'{a}, Ivona and Curticapean, Radu and Dell, Holger and Fomin, Fedor V.},
title = {{Finding Detours is Fixed-Parameter Tractable}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {54:1--54:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.54},
URN = {urn:nbn:de:0030-drops-74790},
doi = {10.4230/LIPIcs.ICALP.2017.54},
annote = {Keywords: longest path, fixed-parameter tractable algorithms, above-guarantee parameterization, graph minors}
}
@InProceedings{ahmadian_et_al:LIPIcs.ICALP.2017.55,
author = {Ahmadian, Sara and Friggstad, Zachary},
title = {{Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {55:1--55:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.55},
URN = {urn:nbn:de:0030-drops-74600},
doi = {10.4230/LIPIcs.ICALP.2017.55},
annote = {Keywords: Approximation Algorithms, Column-Restricted Packing, Demand Matching, Matroids, Planar Graphs}
}
@InProceedings{fomin_et_al:LIPIcs.ICALP.2017.56,
author = {Fomin, Fedor V. and Golovach, Petr A. and Lokshtanov, Daniel and Saurabh, Saket},
title = {{Covering Vectors by Spaces: Regular Matroids}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {56:1--56:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.56},
URN = {urn:nbn:de:0030-drops-73865},
doi = {10.4230/LIPIcs.ICALP.2017.56},
annote = {Keywords: regular matroids, spanning set, parameterized complexity}
}
@InProceedings{giannopoulou_et_al:LIPIcs.ICALP.2017.57,
author = {Giannopoulou, Archontia C. and Pilipczuk, Michal and Raymond, Jean-Florent and Thilikos, Dimitrios M. and Wrochna, Marcin},
title = {{Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {57:1--57:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.57},
URN = {urn:nbn:de:0030-drops-73891},
doi = {10.4230/LIPIcs.ICALP.2017.57},
annote = {Keywords: Kernelization, Approximation, Immersion, Protrusion, Tree-cut width}
}
@InProceedings{gutin_et_al:LIPIcs.ICALP.2017.58,
author = {Gutin, Gregory and Reidl, Felix and Wahlstr\"{o}m, Magnus},
title = {{k-Distinct In- and Out-Branchings in Digraphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {58:1--58:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.58},
URN = {urn:nbn:de:0030-drops-73788},
doi = {10.4230/LIPIcs.ICALP.2017.58},
annote = {Keywords: Digraphs, Branchings, Decompositions, FPT algorithms}
}
@InProceedings{price_et_al:LIPIcs.ICALP.2017.59,
author = {Price, Eric and Song, Zhao and Woodruff, David P.},
title = {{Fast Regression with an \$ell\underlineinfty\$ Guarantee}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {59:1--59:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.59},
URN = {urn:nbn:de:0030-drops-74488},
doi = {10.4230/LIPIcs.ICALP.2017.59},
annote = {Keywords: Linear regression, Count-Sketch, Gaussians, Leverage scores, ell\underlineinfty-guarantee}
}
@InProceedings{li_et_al:LIPIcs.ICALP.2017.60,
author = {Li, Yi and Woodruff, David P.},
title = {{Embeddings of Schatten Norms with Applications to Data Streams}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {60:1--60:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.60},
URN = {urn:nbn:de:0030-drops-73726},
doi = {10.4230/LIPIcs.ICALP.2017.60},
annote = {Keywords: data stream algorithms, embeddings, matrix norms, sketching}
}
@InProceedings{nakos:LIPIcs.ICALP.2017.61,
author = {Nakos, Vasileios},
title = {{On Fast Decoding of High-Dimensional Signals from One-Bit Measurements}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {61:1--61:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.61},
URN = {urn:nbn:de:0030-drops-74887},
doi = {10.4230/LIPIcs.ICALP.2017.61},
annote = {Keywords: one-bit compressed sensing, sparse recovery, heavy hitters, dyadic trick, combinatorial group testing}
}
@InProceedings{karkkainen_et_al:LIPIcs.ICALP.2017.62,
author = {K\"{a}rkk\"{a}inen, Juha and Piatkowski, Marcin and Puglisi, Simon J.},
title = {{String Inference from Longest-Common-Prefix Array}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {62:1--62:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.62},
URN = {urn:nbn:de:0030-drops-74989},
doi = {10.4230/LIPIcs.ICALP.2017.62},
annote = {Keywords: LCP array, string inference, BWT, suffix array, suffix tree, NP-hardness}
}
@InProceedings{eickmeyer_et_al:LIPIcs.ICALP.2017.63,
author = {Eickmeyer, Kord and Giannopoulou, Archontia C. and Kreutzer, Stephan and Kwon, O-joung and Pilipczuk, Michal and Rabinovich, Roman and Siebertz, Sebastian},
title = {{Neighborhood Complexity and Kernelization for Nowhere Dense Classes of Graphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {63:1--63:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.63},
URN = {urn:nbn:de:0030-drops-74288},
doi = {10.4230/LIPIcs.ICALP.2017.63},
annote = {Keywords: Graph Structure Theory, Nowhere Dense Graphs, Parameterized Complexity, Kernelization, Dominating Set}
}
@InProceedings{knudsen:LIPIcs.ICALP.2017.64,
author = {Knudsen, Mathias B{\ae}k Tejs},
title = {{Additive Spanners and Distance Oracles in Quadratic Time}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {64:1--64:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.64},
URN = {urn:nbn:de:0030-drops-73924},
doi = {10.4230/LIPIcs.ICALP.2017.64},
annote = {Keywords: graph algorithms, data structures, additive spanners, distance oracles}
}
@InProceedings{fomin_et_al:LIPIcs.ICALP.2017.65,
author = {Fomin, Fedor V. and Lokshtanov, Daniel and Panolan, Fahad and Saurabh, Saket and Zehavi, Meirav},
title = {{Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {65:1--65:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.65},
URN = {urn:nbn:de:0030-drops-73937},
doi = {10.4230/LIPIcs.ICALP.2017.65},
annote = {Keywords: Longest Cycle, Cycle Packing, Feedback Vertex Set, Unit Disk Graph, Parameterized Complexity}
}
@InProceedings{schweitzer:LIPIcs.ICALP.2017.66,
author = {Schweitzer, Pascal},
title = {{A Polynomial-Time Randomized Reduction from Tournament Isomorphism to Tournament Asymmetry}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {66:1--66:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.66},
URN = {urn:nbn:de:0030-drops-74928},
doi = {10.4230/LIPIcs.ICALP.2017.66},
annote = {Keywords: graph isomorphism, asymmetry, tournaments, randomized reductions}
}
@InProceedings{wiese:LIPIcs.ICALP.2017.67,
author = {Wiese, Andreas},
title = {{A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {67:1--67:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.67},
URN = {urn:nbn:de:0030-drops-74154},
doi = {10.4230/LIPIcs.ICALP.2017.67},
annote = {Keywords: Combinatorial optimization, Approximation algorithms, Fixed-parameter algorithms, Unsplittable Flow on a Path}
}
@InProceedings{iwata:LIPIcs.ICALP.2017.68,
author = {Iwata, Yoichi},
title = {{Linear-Time Kernelization for Feedback Vertex Set}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {68:1--68:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.68},
URN = {urn:nbn:de:0030-drops-74301},
doi = {10.4230/LIPIcs.ICALP.2017.68},
annote = {Keywords: FPT Algorithms, Kernelization, Path Packing, Half-integrality}
}
@InProceedings{gaspers_et_al:LIPIcs.ICALP.2017.69,
author = {Gaspers, Serge and Lee, Edward J.},
title = {{Exact Algorithms via Multivariate Subroutines}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {69:1--69:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.69},
URN = {urn:nbn:de:0030-drops-74251},
doi = {10.4230/LIPIcs.ICALP.2017.69},
annote = {Keywords: enumeration algorithms, exponential time algorithms, feedback vertex set, hitting set}
}
@InProceedings{barbero_et_al:LIPIcs.ICALP.2017.70,
author = {Barbero, Florian and Paul, Christophe and Pilipczuk, Michal},
title = {{Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {70:1--70:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.70},
URN = {urn:nbn:de:0030-drops-74537},
doi = {10.4230/LIPIcs.ICALP.2017.70},
annote = {Keywords: cutwidth, OLA, tournament, semi-complete digraph}
}
@InProceedings{lokshtanov_et_al:LIPIcs.ICALP.2017.71,
author = {Lokshtanov, Daniel and Mouawad, Amer E. and Saurabh, Saket and Zehavi, Meirav},
title = {{Packing Cycles Faster Than Erdos-Posa}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {71:1--71:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.71},
URN = {urn:nbn:de:0030-drops-73857},
doi = {10.4230/LIPIcs.ICALP.2017.71},
annote = {Keywords: Parameterized Complexity, Graph Algorithms, Cycle Packing, Erd\"{o}s-P\'{o}sa Theorem}
}
@InProceedings{baswana_et_al:LIPIcs.ICALP.2017.72,
author = {Baswana, Surender and Choudhary, Keerti and Roditty, Liam},
title = {{An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {72:1--72:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.72},
URN = {urn:nbn:de:0030-drops-74168},
doi = {10.4230/LIPIcs.ICALP.2017.72},
annote = {Keywords: Fault tolerant, Directed graph, Strongly connected components}
}
@InProceedings{bodwin_et_al:LIPIcs.ICALP.2017.73,
author = {Bodwin, Greg and Grandoni, Fabrizio and Parter, Merav and Vassilevska Williams, Virginia},
title = {{Preserving Distances in Very Faulty Graphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {73:1--73:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.73},
URN = {urn:nbn:de:0030-drops-74906},
doi = {10.4230/LIPIcs.ICALP.2017.73},
annote = {Keywords: Fault Tolerance, shortest paths, replacement paths}
}
@InProceedings{georgiadis_et_al:LIPIcs.ICALP.2017.74,
author = {Georgiadis, Loukas and Graf, Daniel and Italiano, Giuseppe F. and Parotsidis, Nikos and Uznanski, Przemyslaw},
title = {{All-Pairs 2-Reachability in O(n^w log n) Time}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {74:1--74:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.74},
URN = {urn:nbn:de:0030-drops-74510},
doi = {10.4230/LIPIcs.ICALP.2017.74},
annote = {Keywords: 2-reachability, All Dominator Trees, Directed Graphs, Boolean Matrix Multiplication}
}
@InProceedings{schlipf_et_al:LIPIcs.ICALP.2017.75,
author = {Schlipf, Lena and Schmidt, Jens M.},
title = {{Edge-Orders}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {75:1--75:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.75},
URN = {urn:nbn:de:0030-drops-74078},
doi = {10.4230/LIPIcs.ICALP.2017.75},
annote = {Keywords: edge-order, st-edge-order, canonical ordering, edge-independent spanning tree, Mondshein sequence, linear time}
}
@InProceedings{mancinska_et_al:LIPIcs.ICALP.2017.76,
author = {Mancinska, Laura and Roberson, David E. and Samal, Robert and Severini, Simone and Varvitsiotis, Antonios},
title = {{Relaxations of Graph Isomorphism}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {76:1--76:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.76},
URN = {urn:nbn:de:0030-drops-74697},
doi = {10.4230/LIPIcs.ICALP.2017.76},
annote = {Keywords: graph isomorphism, quantum information, semidefinite programming}
}
@InProceedings{rubinstein:LIPIcs.ICALP.2017.77,
author = {Rubinstein, Aviad},
title = {{Honest Signaling in Zero-Sum Games Is Hard, and Lying Is Even Harder}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {77:1--77:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.77},
URN = {urn:nbn:de:0030-drops-74057},
doi = {10.4230/LIPIcs.ICALP.2017.77},
annote = {Keywords: Signaling, Zero-sum Games, Algorithmic Game Theory, birthday repetition}
}
@InProceedings{manurangsi_et_al:LIPIcs.ICALP.2017.78,
author = {Manurangsi, Pasin and Raghavendra, Prasad},
title = {{A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {78:1--78:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.78},
URN = {urn:nbn:de:0030-drops-74638},
doi = {10.4230/LIPIcs.ICALP.2017.78},
annote = {Keywords: Birthday Repetition, Constraint Satisfaction Problems, Linear Program}
}
@InProceedings{manurangsi:LIPIcs.ICALP.2017.79,
author = {Manurangsi, Pasin},
title = {{Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {79:1--79:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.79},
URN = {urn:nbn:de:0030-drops-75004},
doi = {10.4230/LIPIcs.ICALP.2017.79},
annote = {Keywords: Hardness of Approximation, Small Set Expansion Hypothesis}
}
@InProceedings{raghavendra_et_al:LIPIcs.ICALP.2017.80,
author = {Raghavendra, Prasad and Weitz, Benjamin},
title = {{On the Bit Complexity of Sum-of-Squares Proofs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {80:1--80:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.80},
URN = {urn:nbn:de:0030-drops-73804},
doi = {10.4230/LIPIcs.ICALP.2017.80},
annote = {Keywords: Sum-of-Squares, Combinatorial Optimization, Proof Complexity}
}
@InProceedings{korman_et_al:LIPIcs.ICALP.2017.81,
author = {Korman, Amos and Rodeh, Yoav},
title = {{The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {81:1--81:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.81},
URN = {urn:nbn:de:0030-drops-73738},
doi = {10.4230/LIPIcs.ICALP.2017.81},
annote = {Keywords: No Feedback, Sequential Decisions, Probabilistic Environment, Exploration and Exploitation, Golden Ratio}
}
@InProceedings{brandt_et_al:LIPIcs.ICALP.2017.82,
author = {Brandt, Sebastian and Emek, Yuval and Uitto, Jara and Wattenhofer, Roger},
title = {{A Tight Lower Bound for the Capture Time of the Cops and Robbers Game}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {82:1--82:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.82},
URN = {urn:nbn:de:0030-drops-74134},
doi = {10.4230/LIPIcs.ICALP.2017.82},
annote = {Keywords: cops and robbers, capture time, lower bound}
}
@InProceedings{achlioptas_et_al:LIPIcs.ICALP.2017.83,
author = {Achlioptas, Dimitris and Iliopoulos, Fotis and Vlassis, Nikos},
title = {{Stochastic Control via Entropy Compression}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {83:1--83:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.83},
URN = {urn:nbn:de:0030-drops-74279},
doi = {10.4230/LIPIcs.ICALP.2017.83},
annote = {Keywords: Stochastic Control, Lovasz Local Lemma}
}
@InProceedings{dereniowski_et_al:LIPIcs.ICALP.2017.84,
author = {Dereniowski, Dariusz and Kosowski, Adrian and Uznanski, Przemyslaw and Zou, Mengchuan},
title = {{Approximation Strategies for Generalized Binary Search in Weighted Trees}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {84:1--84:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.84},
URN = {urn:nbn:de:0030-drops-74507},
doi = {10.4230/LIPIcs.ICALP.2017.84},
annote = {Keywords: Approximation Algorithm, Adaptive Algorithm, Graph Search, Binary Search, Vertex Ranking, Trees}
}
@InProceedings{pudlak_et_al:LIPIcs.ICALP.2017.85,
author = {Pudl\'{a}k, Pavel and Scheder, Dominik and Talebanfard, Navid},
title = {{Tighter Hard Instances for PPSZ}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {85:1--85:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.85},
URN = {urn:nbn:de:0030-drops-74144},
doi = {10.4230/LIPIcs.ICALP.2017.85},
annote = {Keywords: k-SAT, Strong Exponential Time Hypothesis, PPSZ, Resolution}
}
@InProceedings{guruswami_et_al:LIPIcs.ICALP.2017.86,
author = {Guruswami, Venkatesan and Xing, Chaoping and Yuan, Chen},
title = {{Subspace Designs Based on Algebraic Function Fields}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {86:1--86:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.86},
URN = {urn:nbn:de:0030-drops-73712},
doi = {10.4230/LIPIcs.ICALP.2017.86},
annote = {Keywords: Subspace Design, Dimension Expander, List Decoding}
}
@InProceedings{goldwasser_et_al:LIPIcs.ICALP.2017.87,
author = {Goldwasser, Shafi and Grossman, Ofer},
title = {{Bipartite Perfect Matching in Pseudo-Deterministic NC}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {87:1--87:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.87},
URN = {urn:nbn:de:0030-drops-74824},
doi = {10.4230/LIPIcs.ICALP.2017.87},
annote = {Keywords: Parallel Algorithms, Pseudo-determinism, RNC, Perfect Matching}
}
@InProceedings{raskin:LIPIcs.ICALP.2017.88,
author = {Raskin, Mikhail},
title = {{A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {88:1--88:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.88},
URN = {urn:nbn:de:0030-drops-74105},
doi = {10.4230/LIPIcs.ICALP.2017.88},
annote = {Keywords: binary counter, data structure, integer representation, bit-probe model, lower bound}
}
@InProceedings{matuschke_et_al:LIPIcs.ICALP.2017.89,
author = {Matuschke, Jannik and McCormick, S. Thomas and Oriolo, Gianpaolo},
title = {{Rerouting Flows When Links Fail}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {89:1--89:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.89},
URN = {urn:nbn:de:0030-drops-74466},
doi = {10.4230/LIPIcs.ICALP.2017.89},
annote = {Keywords: network flows, network interdiction, robust optimization}
}
@InProceedings{bonnet_et_al:LIPIcs.ICALP.2017.90,
author = {Bonnet, \'{E}douard and Gaspers, Serge and Lambilliotte, Antonin and R\"{u}mmele, Stefan and Saffidine, Abdallah},
title = {{The Parameterized Complexity of Positional Games}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {90:1--90:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.90},
URN = {urn:nbn:de:0030-drops-74941},
doi = {10.4230/LIPIcs.ICALP.2017.90},
annote = {Keywords: Hex, Maker-Maker games, Maker-Breaker games, Enforcer-Avoider games, parameterized complexity theory}
}
@InProceedings{bjorklund_et_al:LIPIcs.ICALP.2017.91,
author = {Bj\"{o}rklund, Andreas and Kaski, Petteri and Koutis, Ioannis},
title = {{Directed Hamiltonicity and Out-Branchings via Generalized Laplacians}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {91:1--91:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.91},
URN = {urn:nbn:de:0030-drops-74208},
doi = {10.4230/LIPIcs.ICALP.2017.91},
annote = {Keywords: counting, directed Hamiltonicity, graph Laplacian, independent set, k-internal out-branching}
}
@InProceedings{lee:LIPIcs.ICALP.2017.92,
author = {Lee, Euiwoong},
title = {{Improved Hardness for Cut, Interdiction, and Firefighter Problems}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {92:1--92:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.92},
URN = {urn:nbn:de:0030-drops-74854},
doi = {10.4230/LIPIcs.ICALP.2017.92},
annote = {Keywords: length bounded cut, shortest path interdiction, multicut; firefighter, unique games conjecture}
}
@InProceedings{rossman:LIPIcs.ICALP.2017.93,
author = {Rossman, Benjamin},
title = {{Subspace-Invariant AC^0 Formulas}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {93:1--93:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.93},
URN = {urn:nbn:de:0030-drops-74235},
doi = {10.4230/LIPIcs.ICALP.2017.93},
annote = {Keywords: lower bounds, size-depth tradeoff, parity, symmetry in computation}
}
@InProceedings{chistikov_et_al:LIPIcs.ICALP.2017.94,
author = {Chistikov, Dmitry and Haase, Christoph},
title = {{On the Complexity of Quantified Integer Programming}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {94:1--94:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.94},
URN = {urn:nbn:de:0030-drops-75024},
doi = {10.4230/LIPIcs.ICALP.2017.94},
annote = {Keywords: integer programming, semi-linear sets, Presburger arithmetic, quantifier elimination}
}
@InProceedings{jez:LIPIcs.ICALP.2017.95,
author = {Jez, Artur},
title = {{Word Equations in Nondeterministic Linear Space}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {95:1--95:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.95},
URN = {urn:nbn:de:0030-drops-74089},
doi = {10.4230/LIPIcs.ICALP.2017.95},
annote = {Keywords: Word equations, string unification, context-sensitive languages, space efficient computations, linear space}
}
@InProceedings{diekert_et_al:LIPIcs.ICALP.2017.96,
author = {Diekert, Volker and Elder, Murray},
title = {{Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {96:1--96:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.96},
URN = {urn:nbn:de:0030-drops-73976},
doi = {10.4230/LIPIcs.ICALP.2017.96},
annote = {Keywords: Twisted word equation, EDT0L, virtually free group, context-free group}
}
@InProceedings{asada_et_al:LIPIcs.ICALP.2017.97,
author = {Asada, Kazuyuki and Kobayashi, Naoki},
title = {{Pumping Lemma for Higher-order Languages}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {97:1--97:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.97},
URN = {urn:nbn:de:0030-drops-74323},
doi = {10.4230/LIPIcs.ICALP.2017.97},
annote = {Keywords: pumping lemma, higher-order grammars, Kruskal's tree theorem}
}
@InProceedings{datta_et_al:LIPIcs.ICALP.2017.98,
author = {Datta, Samir and Mukherjee, Anish and Schwentick, Thomas and Vortmeier, Nils and Zeume, Thomas},
title = {{A Strategy for Dynamic Programs: Start over and Muddle Through}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {98:1--98:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.98},
URN = {urn:nbn:de:0030-drops-74470},
doi = {10.4230/LIPIcs.ICALP.2017.98},
annote = {Keywords: dynamic complexity, treewidth, monadic second order logic}
}
@InProceedings{bacquey_et_al:LIPIcs.ICALP.2017.99,
author = {Bacquey, Nicolas and Grandjean, Etienne and Olive, Fr\'{e}d\'{e}ric},
title = {{Definability by Horn Formulas and Linear Time on Cellular Automata}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {99:1--99:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.99},
URN = {urn:nbn:de:0030-drops-74174},
doi = {10.4230/LIPIcs.ICALP.2017.99},
annote = {Keywords: picture languages, linear time, cellular automata of any dimension, local induction, descriptive complexity, second-order logic, horn formulas, logic}
}
@InProceedings{reiter:LIPIcs.ICALP.2017.100,
author = {Reiter, Fabian},
title = {{Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {100:1--100:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.100},
URN = {urn:nbn:de:0030-drops-73695},
doi = {10.4230/LIPIcs.ICALP.2017.100},
annote = {Keywords: finite automata, distributed computing, modal logic, mu-calculus}
}
@InProceedings{chalopin_et_al:LIPIcs.ICALP.2017.101,
author = {Chalopin, J\'{e}r\'{e}mie and Chepoi, Victor},
title = {{A Counterexample to Thiagarajan's Conjecture on Regular Event Structures}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {101:1--101:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.101},
URN = {urn:nbn:de:0030-drops-74192},
doi = {10.4230/LIPIcs.ICALP.2017.101},
annote = {Keywords: Discrete event structures, Trace automata, Median graphs and CAT(0) cube Complexes, Unfoldings and universal covers}
}
@InProceedings{barthe_et_al:LIPIcs.ICALP.2017.102,
author = {Barthe, Gilles and Espitau, Thomas and Hsu, Justin and Sato, Tetsuya and Strub, Pierre-Yves},
title = {{*-Liftings for Differential Privacy}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {102:1--102:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.102},
URN = {urn:nbn:de:0030-drops-74358},
doi = {10.4230/LIPIcs.ICALP.2017.102},
annote = {Keywords: Differential Privacy, Probabilistic Couplings, Formal Verification}
}
@InProceedings{balle_et_al:LIPIcs.ICALP.2017.103,
author = {Balle, Borja and Gourdeau, Pascale and Panangaden, Prakash},
title = {{Bisimulation Metrics for Weighted Automata}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {103:1--103:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.103},
URN = {urn:nbn:de:0030-drops-73959},
doi = {10.4230/LIPIcs.ICALP.2017.103},
annote = {Keywords: weighted automata, bisimulation, metrics, spectral theory, learning}
}
@InProceedings{bacci_et_al:LIPIcs.ICALP.2017.104,
author = {Bacci, Giovanni and Bacci, Giorgio and Larsen, Kim G. and Mardare, Radu},
title = {{On the Metric-Based Approximate Minimization of Markov Chains}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {104:1--104:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.104},
URN = {urn:nbn:de:0030-drops-73675},
doi = {10.4230/LIPIcs.ICALP.2017.104},
annote = {Keywords: Behavioral distances, Probabilistic Models, Automata Minimization}
}
@InProceedings{fijalkow_et_al:LIPIcs.ICALP.2017.105,
author = {Fijalkow, Nathana\"{e}l and Klin, Bartek and Panangaden, Prakash},
title = {{Expressiveness of Probabilistic Modal Logics, Revisited}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {105:1--105:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.105},
URN = {urn:nbn:de:0030-drops-73683},
doi = {10.4230/LIPIcs.ICALP.2017.105},
annote = {Keywords: probabilistic modal logic, probabilistic bisimulation, probabilistic simulation}
}
@InProceedings{bojanczyk_et_al:LIPIcs.ICALP.2017.106,
author = {Bojanczyk, Mikolaj and Gimbert, Hugo and Kelmendi, Edon},
title = {{Emptiness of Zero Automata Is Decidable}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {106:1--106:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.106},
URN = {urn:nbn:de:0030-drops-74745},
doi = {10.4230/LIPIcs.ICALP.2017.106},
annote = {Keywords: tree automata, probabilistic automata, monadic second-order logic}
}
@InProceedings{benedikt_et_al:LIPIcs.ICALP.2017.107,
author = {Benedikt, Michael and Bourhis, Pierre and Vanden Boom, Michael},
title = {{Characterizing Definability in Decidable Fixpoint Logics}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {107:1--107:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.107},
URN = {urn:nbn:de:0030-drops-74062},
doi = {10.4230/LIPIcs.ICALP.2017.107},
annote = {Keywords: Guarded logics, bisimulation, definability, automata}
}
@InProceedings{jung_et_al:LIPIcs.ICALP.2017.108,
author = {Jung, Jean Christoph and Lutz, Carsten and Martel, Mauricio and Schneider, Thomas and Wolter, Frank},
title = {{Conservative Extensions in Guarded and Two-Variable Fragments}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {108:1--108:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.108},
URN = {urn:nbn:de:0030-drops-74647},
doi = {10.4230/LIPIcs.ICALP.2017.108},
annote = {Keywords: Conservative Extensions, Decidable Fragments of First-Order Logic, Computational Complexity\}}
}
@InProceedings{dowek:LIPIcs.ICALP.2017.109,
author = {Dowek, Gilles},
title = {{Models and Termination of Proof Reduction in the lambda Pi-Calculus Modulo Theory}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {109:1--109:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.109},
URN = {urn:nbn:de:0030-drops-73919},
doi = {10.4230/LIPIcs.ICALP.2017.109},
annote = {Keywords: model, proof reduction, Simple type theory, Calculus of constructions}
}
@InProceedings{atserias_et_al:LIPIcs.ICALP.2017.110,
author = {Atserias, Albert and Ochremiak, Joanna},
title = {{Proof Complexity Meets Algebra}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {110:1--110:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.110},
URN = {urn:nbn:de:0030-drops-74956},
doi = {10.4230/LIPIcs.ICALP.2017.110},
annote = {Keywords: Constraint Satisfaction Problem, Proof Complexity, Reductions, Gap Theorems}
}
@InProceedings{amarilli_et_al:LIPIcs.ICALP.2017.111,
author = {Amarilli, Antoine and Bourhis, Pierre and Jachiet, Louis and Mengel, Stefan},
title = {{A Circuit-Based Approach to Efficient Enumeration}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {111:1--111:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.111},
URN = {urn:nbn:de:0030-drops-74626},
doi = {10.4230/LIPIcs.ICALP.2017.111},
annote = {Keywords: circuits, constant-delay, enumeration, d-DNNFs, MSO}
}
@InProceedings{alur_et_al:LIPIcs.ICALP.2017.112,
author = {Alur, Rajeev and Mamouras, Konstantinos and Stanford, Caleb},
title = {{Automata-Based Stream Processing}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {112:1--112:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.112},
URN = {urn:nbn:de:0030-drops-74720},
doi = {10.4230/LIPIcs.ICALP.2017.112},
annote = {Keywords: weighted automata, Quantitative Regular Expressions, stream processing}
}
@InProceedings{dartois_et_al:LIPIcs.ICALP.2017.113,
author = {Dartois, Luc and Fournier, Paulin and Jecker, Isma\"{e}l and Lhote, Nathan},
title = {{On Reversible Transducers}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {113:1--113:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.113},
URN = {urn:nbn:de:0030-drops-74491},
doi = {10.4230/LIPIcs.ICALP.2017.113},
annote = {Keywords: Transducers, reversibility, two-way, uniformization}
}
@InProceedings{bojanczyk_et_al:LIPIcs.ICALP.2017.114,
author = {Bojanczyk, Mikolaj and Daviaud, Laure and Guillon, Bruno and Penelle, Vincent},
title = {{Which Classes of Origin Graphs Are Generated by Transducers}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {114:1--114:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.114},
URN = {urn:nbn:de:0030-drops-73984},
doi = {10.4230/LIPIcs.ICALP.2017.114},
annote = {Keywords: Streaming String Transducers, Origin Semantics, String-to-String Transductions, MSO Definability}
}
@InProceedings{cadilhac_et_al:LIPIcs.ICALP.2017.115,
author = {Cadilhac, Micha\"{e}l and Carton, Olivier and Paperman, Charles},
title = {{Continuity and Rational Functions}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {115:1--115:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.115},
URN = {urn:nbn:de:0030-drops-74583},
doi = {10.4230/LIPIcs.ICALP.2017.115},
annote = {Keywords: Transducers, rational functions, language varieties, continuity}
}
@InProceedings{bournez_et_al:LIPIcs.ICALP.2017.116,
author = {Bournez, Olivier and Pouly, Amaury},
title = {{A Universal Ordinary Differential Equation}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {116:1--116:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.116},
URN = {urn:nbn:de:0030-drops-74335},
doi = {10.4230/LIPIcs.ICALP.2017.116},
annote = {Keywords: Ordinary Differential Equations, Universal Differential Equations, Analog Models of Computation, Continuous-Time Models of Computation, Computabilit}
}
@InProceedings{clemente_et_al:LIPIcs.ICALP.2017.117,
author = {Clemente, Lorenzo and Czerwinski, Wojciech and Lasota, Slawomir and Paperman, Charles},
title = {{Regular Separability of Parikh Automata}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {117:1--117:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.117},
URN = {urn:nbn:de:0030-drops-74971},
doi = {10.4230/LIPIcs.ICALP.2017.117},
annote = {Keywords: Regular separability problem, Parikh automata, integer vector addition systems, visible one counter automata, decidability, undecidability}
}
@InProceedings{boigelot_et_al:LIPIcs.ICALP.2017.118,
author = {Boigelot, Bernard and Mainz, Isabelle and Marsault, Victor and Rigo, Michel},
title = {{An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {118:1--118:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.118},
URN = {urn:nbn:de:0030-drops-74317},
doi = {10.4230/LIPIcs.ICALP.2017.118},
annote = {Keywords: integer-base systems, automata, recognisable sets, periodic sets}
}
@InProceedings{figueira_et_al:LIPIcs.ICALP.2017.119,
author = {Figueira, Diego and Lazic, Ranko and Leroux, J\'{e}r\^{o}me and Mazowiecki, Filip and Sutre, Gr\'{e}goire},
title = {{Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {119:1--119:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.119},
URN = {urn:nbn:de:0030-drops-74374},
doi = {10.4230/LIPIcs.ICALP.2017.119},
annote = {Keywords: branching vector addition systems, reachability problem}
}
@InProceedings{bozzelli_et_al:LIPIcs.ICALP.2017.120,
author = {Bozzelli, Laura and Molinari, Alberto and Montanari, Angelo and Peron, Adriano and Sala, Pietro},
title = {{Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {120:1--120:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.120},
URN = {urn:nbn:de:0030-drops-74703},
doi = {10.4230/LIPIcs.ICALP.2017.120},
annote = {Keywords: Interval Temporal Logic, Satisfiability, Model Checking, Decidability, Computational Complexity}
}
@InProceedings{berthon_et_al:LIPIcs.ICALP.2017.121,
author = {Berthon, Rapha\"{e}l and Randour, Mickael and Raskin, Jean-Fran\c{c}ois},
title = {{Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {121:1--121:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.121},
URN = {urn:nbn:de:0030-drops-74360},
doi = {10.4230/LIPIcs.ICALP.2017.121},
annote = {Keywords: Markov decision processes, parity objectives, beyond worst-case synthesis}
}
@InProceedings{finkel_et_al:LIPIcs.ICALP.2017.122,
author = {Finkel, Alain and Lozes, Etienne},
title = {{Synchronizability of Communicating Finite State Machines is not Decidable}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {122:1--122:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.122},
URN = {urn:nbn:de:0030-drops-74020},
doi = {10.4230/LIPIcs.ICALP.2017.122},
annote = {Keywords: verification, distributed system, asynchronous communications, choreographies}
}
@InProceedings{basset_et_al:LIPIcs.ICALP.2017.123,
author = {Basset, Nicolas and Geeraerts, Gilles and Raskin, Jean-Fran\c{c}ois and Sankur, Ocan},
title = {{Admissiblity in Concurrent Games}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {123:1--123:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.123},
URN = {urn:nbn:de:0030-drops-74765},
doi = {10.4230/LIPIcs.ICALP.2017.123},
annote = {Keywords: Multi-player games, admissibility, concurrent games, randomized strategies}
}
@InProceedings{bringmann_et_al:LIPIcs.ICALP.2017.124,
author = {Bringmann, Karl and Dueholm Hansen, Thomas and Krinninger, Sebastian},
title = {{Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {124:1--124:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.124},
URN = {urn:nbn:de:0030-drops-74398},
doi = {10.4230/LIPIcs.ICALP.2017.124},
annote = {Keywords: quantitative verification and synthesis, parametric search, shortest paths, negative cycle detection}
}
@InProceedings{bilo_et_al:LIPIcs.ICALP.2017.125,
author = {Bil\`{o}, Vittorio and Caragiannis, Ioannis and Fanelli, Angelo and Flammini, Michele and Monaco, Gianpiero},
title = {{Simple Greedy Algorithms for Fundamental Multidimensional Graph Problems}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {125:1--125:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.125},
URN = {urn:nbn:de:0030-drops-74669},
doi = {10.4230/LIPIcs.ICALP.2017.125},
annote = {Keywords: multidimensional graph problems, matroids, shortest paths, Steiner trees, arborescences}
}
@InProceedings{dehghani_et_al:LIPIcs.ICALP.2017.126,
author = {Dehghani, Sina and Ehsani, Soheil and Hajiaghayi, MohammadTaghi and Liaghat, Vahid and Seddighin, Saeed},
title = {{Stochastic k-Server: How Should Uber Work?}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {126:1--126:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.126},
URN = {urn:nbn:de:0030-drops-74806},
doi = {10.4230/LIPIcs.ICALP.2017.126},
annote = {Keywords: k-server, stochastic, competitive ratio, online algorithm, Uber}
}
@InProceedings{gupta_et_al:LIPIcs.ICALP.2017.127,
author = {Gupta, Manoj and Khan, Shahbaz},
title = {{Multiple Source Dual Fault Tolerant BFS Trees}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {127:1--127:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.127},
URN = {urn:nbn:de:0030-drops-74184},
doi = {10.4230/LIPIcs.ICALP.2017.127},
annote = {Keywords: BFS, fault-tolerant, graph, algorithms, data-structures}
}
@InProceedings{abrahamsen_et_al:LIPIcs.ICALP.2017.128,
author = {Abrahamsen, Mikkel and Alstrup, Stephen and Holm, Jacob and Knudsen, Mathias B{\ae}k Tejs and St\"{o}ckel, Morten},
title = {{Near-Optimal Induced Universal Graphs for Bounded Degree Graphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {128:1--128:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.128},
URN = {urn:nbn:de:0030-drops-74114},
doi = {10.4230/LIPIcs.ICALP.2017.128},
annote = {Keywords: Adjacency labeling schemes, Bounded degree graphs, Induced universal graphs, Distributed computing}
}
@InProceedings{asgeirsson_et_al:LIPIcs.ICALP.2017.129,
author = {\'{A}sgeirsson, Eyj\'{o}lfur I. and Halld\'{o}rsson, Magn\'{u}s M. and Tonoyan, Tigran},
title = {{Universal Framework for Wireless Scheduling Problems}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {129:1--129:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.129},
URN = {urn:nbn:de:0030-drops-74228},
doi = {10.4230/LIPIcs.ICALP.2017.129},
annote = {Keywords: Wireless, Scheduling, Physical Model, Approximation framework}
}
@InProceedings{boczkowski_et_al:LIPIcs.ICALP.2017.130,
author = {Boczkowski, Lucas and Kerenidis, Iordanis and Magniez, Fr\'{e}d\'{e}ric},
title = {{Streaming Communication Protocols}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {130:1--130:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.130},
URN = {urn:nbn:de:0030-drops-74404},
doi = {10.4230/LIPIcs.ICALP.2017.130},
annote = {Keywords: Networks, Communication Complexity, Streaming Algorithms}
}
@InProceedings{monemizadeh_et_al:LIPIcs.ICALP.2017.131,
author = {Monemizadeh, Morteza and Muthukrishnan, S. and Peng, Pan and Sohler, Christian},
title = {{Testable Bounded Degree Graph Properties Are Random Order Streamable}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {131:1--131:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.131},
URN = {urn:nbn:de:0030-drops-74782},
doi = {10.4230/LIPIcs.ICALP.2017.131},
annote = {Keywords: Graph streaming algorithms, graph property testing, constant-time approximation algorithms}
}
@InProceedings{gorain_et_al:LIPIcs.ICALP.2017.132,
author = {Gorain, Barun and Pelc, Andrzej},
title = {{Deterministic Graph Exploration with Advice}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {132:1--132:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.132},
URN = {urn:nbn:de:0030-drops-73701},
doi = {10.4230/LIPIcs.ICALP.2017.132},
annote = {Keywords: algorithm, graph, exploration, mobile agent, advice}
}
@InProceedings{hoefer_et_al:LIPIcs.ICALP.2017.133,
author = {Hoefer, Martin and Kodric, Bojana},
title = {{Combinatorial Secretary Problems with Ordinal Information}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {133:1--133:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.133},
URN = {urn:nbn:de:0030-drops-74594},
doi = {10.4230/LIPIcs.ICALP.2017.133},
annote = {Keywords: Secretary Problem, Matroid Secretary, Ordinal Information, Online Algorithms}
}
@InProceedings{babaioff_et_al:LIPIcs.ICALP.2017.134,
author = {Babaioff, Moshe and Blumrosen, Liad and Nisan, Noam},
title = {{Selling Complementary Goods: Dynamics, Efficiency and Revenue}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {134:1--134:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.134},
URN = {urn:nbn:de:0030-drops-74757},
doi = {10.4230/LIPIcs.ICALP.2017.134},
annote = {Keywords: Complements, Pricing, Networks, Game Theory, Price of Stability}
}
@InProceedings{choudhari_et_al:LIPIcs.ICALP.2017.135,
author = {Choudhari, Jayesh and Dasgupta, Anirban and Misra, Neeldhara and Ramanujan, M. S.},
title = {{Saving Critical Nodes with Firefighters is FPT}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {135:1--135:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.135},
URN = {urn:nbn:de:0030-drops-74968},
doi = {10.4230/LIPIcs.ICALP.2017.135},
annote = {Keywords: firefighting, cuts, FPT, kernelization}
}
@InProceedings{michail_et_al:LIPIcs.ICALP.2017.136,
author = {Michail, Othon and Skretas, George and Spirakis, Paul G.},
title = {{On the Transformation Capability of Feasible Mechanisms for Programmable Matter}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {136:1--136:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.136},
URN = {urn:nbn:de:0030-drops-74341},
doi = {10.4230/LIPIcs.ICALP.2017.136},
annote = {Keywords: programmable matter, transformation, reconfigurable robotics, shape formation, complexity, distributed algorithms}
}
@InProceedings{gmyr_et_al:LIPIcs.ICALP.2017.137,
author = {Gmyr, Robert and Hinnenthal, Kristian and Scheideler, Christian and Sohler, Christian},
title = {{Distributed Monitoring of Network Properties: The Power of Hybrid Networks}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {137:1--137:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.137},
URN = {urn:nbn:de:0030-drops-73750},
doi = {10.4230/LIPIcs.ICALP.2017.137},
annote = {Keywords: Network Monitoring, Hybrid Networks, Overlay Networks}
}
@InProceedings{doerr_et_al:LIPIcs.ICALP.2017.138,
author = {Doerr, Benjamin and Kostrygin, Anatolii},
title = {{Randomized Rumor Spreading Revisited}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {138:1--138:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.138},
URN = {urn:nbn:de:0030-drops-73798},
doi = {10.4230/LIPIcs.ICALP.2017.138},
annote = {Keywords: Epidemic algorithm, rumor spreading, dynamic graph}
}
@InProceedings{cai_et_al:LIPIcs.ICALP.2017.139,
author = {Cai, Leran and Sauerwald, Thomas},
title = {{Randomized Load Balancing on Networks with Stochastic Inputs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {139:1--139:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.139},
URN = {urn:nbn:de:0030-drops-74839},
doi = {10.4230/LIPIcs.ICALP.2017.139},
annote = {Keywords: random walks, randomized algorithms, parallel computing}
}
@InProceedings{mai_et_al:LIPIcs.ICALP.2017.140,
author = {Mai, Tung and Panageas, Ioannis and Vazirani, Vijay V.},
title = {{Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {140:1--140:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.140},
URN = {urn:nbn:de:0030-drops-74440},
doi = {10.4230/LIPIcs.ICALP.2017.140},
annote = {Keywords: Opinion Dynamics, Convergence, Jacobian, Center-stable Manifold}
}
@InProceedings{belleville_et_al:LIPIcs.ICALP.2017.141,
author = {Belleville, Amanda and Doty, David and Soloveichik, David},
title = {{Hardness of Computing and Approximating Predicates and Functions with Leaderless Population Protocols}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {141:1--141:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.141},
URN = {urn:nbn:de:0030-drops-75044},
doi = {10.4230/LIPIcs.ICALP.2017.141},
annote = {Keywords: population protocol, time lower bound, stable computation}
}
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