@Proceedings{vollmer_et_al:LIPIcs.STACS.2017,
title = {{LIPIcs, Volume 66, STACS'17, Complete Volume}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017},
URN = {urn:nbn:de:0030-drops-70366},
doi = {10.4230/LIPIcs.STACS.2017},
annote = {Keywords: Models of Computation, Nonnumerical Algorithms and Problems, Mathematical Logic, Formal Languages, Combinatorics, Graph Theory}
}
@InProceedings{vollmer_et_al:LIPIcs.STACS.2017.0,
author = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
title = {{Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.0},
URN = {urn:nbn:de:0030-drops-70327},
doi = {10.4230/LIPIcs.STACS.2017.0},
annote = {Keywords: Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers}
}
@InProceedings{kontinen:LIPIcs.STACS.2017.1,
author = {Kontinen, Juha},
title = {{Computational Aspects of Logics in Team Semantics}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.1},
URN = {urn:nbn:de:0030-drops-70333},
doi = {10.4230/LIPIcs.STACS.2017.1},
annote = {Keywords: team semantics, dependence logic, model checking, satisfiability problem, team bisimulation}
}
@InProceedings{jez:LIPIcs.STACS.2017.2,
author = {Jez, Artur},
title = {{Recompression: New Approach to Word Equations and Context Unification}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {2:1--2:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.2},
URN = {urn:nbn:de:0030-drops-70280},
doi = {10.4230/LIPIcs.STACS.2017.2},
annote = {Keywords: Word equations, exponent of periodicity, semantic unification, string unification, context unification, compression}
}
@InProceedings{joux:LIPIcs.STACS.2017.3,
author = {Joux, Antoine},
title = {{Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {3:1--3:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.3},
URN = {urn:nbn:de:0030-drops-70313},
doi = {10.4230/LIPIcs.STACS.2017.3},
annote = {Keywords: Cryptography, Discrete logarithms, Finite fields}
}
@InProceedings{tantau:LIPIcs.STACS.2017.4,
author = {Tantau, Till},
title = {{Applications of Algorithmic Metatheorems to Space Complexity and Parallelism}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {4:1--4:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.4},
URN = {urn:nbn:de:0030-drops-70303},
doi = {10.4230/LIPIcs.STACS.2017.4},
annote = {Keywords: Algorithmic metatheorems, Courcelle’s Theorem, tree width, monadic second-order logic, logarithmic space, parallel computations}
}
@InProceedings{agrawal_et_al:LIPIcs.STACS.2017.5,
author = {Agrawal, Akanksha and Lokshtanov, Daniel and Saurabh, Saket and Zehavi, Meirav},
title = {{Split Contraction: The Untold Story}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.5},
URN = {urn:nbn:de:0030-drops-70297},
doi = {10.4230/LIPIcs.STACS.2017.5},
annote = {Keywords: Split Graph, Parameterized Complexity, Edge Contraction}
}
@InProceedings{akian_et_al:LIPIcs.STACS.2017.6,
author = {Akian, Marianne and Gaubert, St\'{e}phane and Grand-Cl\'{e}ment, Julien and Guillaud, J\'{e}r\'{e}mie},
title = {{The Operator Approach to Entropy Games}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {6:1--6:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.6},
URN = {urn:nbn:de:0030-drops-70260},
doi = {10.4230/LIPIcs.STACS.2017.6},
annote = {Keywords: Stochastic games, Shapley operators, policy iteration, Perron eigenvalues, Risk sensitive control}
}
@InProceedings{arvind_et_al:LIPIcs.STACS.2017.7,
author = {Arvind, Vikraman and K\"{o}bler, Johannes and Kuhnert, Sebastian and Tor\'{a}n, Jacobo},
title = {{Parameterized Complexity of Small Weight Automorphisms}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {7:1--7:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.7},
URN = {urn:nbn:de:0030-drops-70278},
doi = {10.4230/LIPIcs.STACS.2017.7},
annote = {Keywords: Parameterized algorithms, hypergraph isomorphism.}
}
@InProceedings{balliu_et_al:LIPIcs.STACS.2017.8,
author = {Balliu, Alkida and D'Angelo, Gianlorenzo and Fraigniaud, Pierre and Olivetti, Dennis},
title = {{What Can Be Verified Locally?}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {8:1--8:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.8},
URN = {urn:nbn:de:0030-drops-70253},
doi = {10.4230/LIPIcs.STACS.2017.8},
annote = {Keywords: Distributed Network Computing, Distributed Algorithm, Distributed Decision, Locality}
}
@InProceedings{banyassady_et_al:LIPIcs.STACS.2017.9,
author = {Banyassady, Bahareh and Korman, Matias and Mulzer, Wolfgang and van Renssen, Andr\'{e} and Roeloffzen, Marcel and Seiferth, Paul and Stein, Yannik},
title = {{Improved Time-Space Trade-Offs for Computing Voronoi Diagrams}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.9},
URN = {urn:nbn:de:0030-drops-70249},
doi = {10.4230/LIPIcs.STACS.2017.9},
annote = {Keywords: memory-constrained model, Voronoi diagram, time-space trade-off}
}
@InProceedings{bartschi_et_al:LIPIcs.STACS.2017.10,
author = {B\"{a}rtschi, Andreas and Chalopin, J\'{e}r\'{e}mie and Das, Shantanu and Disser, Yann and Graf, Daniel and Hackfeld, Jan and Penna, Paolo},
title = {{Energy-Efficient Delivery by Heterogeneous Mobile Agents}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {10:1--10:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.10},
URN = {urn:nbn:de:0030-drops-70233},
doi = {10.4230/LIPIcs.STACS.2017.10},
annote = {Keywords: message delivery, mobile agents, energy optimization, approximation algorithms}
}
@InProceedings{bera_et_al:LIPIcs.STACS.2017.11,
author = {Bera, Suman K. and Chakrabarti, Amit},
title = {{Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {11:1--11:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.11},
URN = {urn:nbn:de:0030-drops-70222},
doi = {10.4230/LIPIcs.STACS.2017.11},
annote = {Keywords: data streaming, graph algorithms, triangles, subgraph counting, lower bounds}
}
@InProceedings{bhrushundi_et_al:LIPIcs.STACS.2017.12,
author = {Bhrushundi, Abhishek and Harsha, Prahladh and Srinivasan, Srikanth},
title = {{On Polynomial Approximations Over Z/2^kZ*}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {12:1--12:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.12},
URN = {urn:nbn:de:0030-drops-70212},
doi = {10.4230/LIPIcs.STACS.2017.12},
annote = {Keywords: Polynomials over rings, Approximation by polynomials, Boolean functions, Non-classical polynomials}
}
@InProceedings{bilo_et_al:LIPIcs.STACS.2017.13,
author = {Bil\`{o}, Vittorio and Mavronicolas, Marios},
title = {{Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {13:1--13:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.13},
URN = {urn:nbn:de:0030-drops-70200},
doi = {10.4230/LIPIcs.STACS.2017.13},
annote = {Keywords: Nash equilibrium, complexity of equilibria, ExistentialR-completeness}
}
@InProceedings{bohm_et_al:LIPIcs.STACS.2017.14,
author = {B\"{o}hm, Stanislav and G\"{o}ller, Stefan and Halfon, Simon and Hofman, Piotr},
title = {{On B\"{u}chi One-Counter Automata}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {14:1--14:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.14},
URN = {urn:nbn:de:0030-drops-70194},
doi = {10.4230/LIPIcs.STACS.2017.14},
annote = {Keywords: infinite words, deterministic pushdown automata}
}
@InProceedings{bojanczyk_et_al:LIPIcs.STACS.2017.15,
author = {Bojanczyk, Mikolaj and Pilipczuk, Michal},
title = {{Optimizing Tree Decompositions in MSO}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.15},
URN = {urn:nbn:de:0030-drops-70173},
doi = {10.4230/LIPIcs.STACS.2017.15},
annote = {Keywords: tree decomposition, treewidth, transduction, monadic second-order logic}
}
@InProceedings{bonnet_et_al:LIPIcs.STACS.2017.16,
author = {Bonnet, \'{E}douard and Miltzow, Tillmann and Rzazewski, Pawel},
title = {{Complexity of Token Swapping and its Variants}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {16:1--16:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.16},
URN = {urn:nbn:de:0030-drops-70185},
doi = {10.4230/LIPIcs.STACS.2017.16},
annote = {Keywords: token swapping, parameterized complexity, NP-hardness, W\lbrack1\rbrack-hardness}
}
@InProceedings{brattka_et_al:LIPIcs.STACS.2017.17,
author = {Brattka, Vasco and H\"{o}lzl, Rupert and Kuyper, Rutger},
title = {{Monte Carlo Computability}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.17},
URN = {urn:nbn:de:0030-drops-70164},
doi = {10.4230/LIPIcs.STACS.2017.17},
annote = {Keywords: Weihrauch degrees, Weak Weak Konig's Lemma, Monte Carlo computability, algorithmic randomness, sorting}
}
@InProceedings{burton_et_al:LIPIcs.STACS.2017.18,
author = {Burton, Benjamin and Cabello, Sergio and Kratsch, Stefan and Pettersson, William},
title = {{The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {18:1--18:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.18},
URN = {urn:nbn:de:0030-drops-70156},
doi = {10.4230/LIPIcs.STACS.2017.18},
annote = {Keywords: computational topology, parameterized complexity, simplicial complex}
}
@InProceedings{carayol_et_al:LIPIcs.STACS.2017.19,
author = {Carayol, Arnaud and G\"{o}ller, Stefan},
title = {{On Long Words Avoiding Zimin Patterns}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {19:1--19:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.19},
URN = {urn:nbn:de:0030-drops-70140},
doi = {10.4230/LIPIcs.STACS.2017.19},
annote = {Keywords: Unavoidable patterns, combinatorics on words, lower bounds}
}
@InProceedings{carette_et_al:LIPIcs.STACS.2017.20,
author = {Carette, Titouan and Lauri\`{e}re, Mathieu and Magniez, Fr\'{e}d\'{e}ric},
title = {{Extended Learning Graphs for Triangle Finding}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {20:1--20:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.20},
URN = {urn:nbn:de:0030-drops-70132},
doi = {10.4230/LIPIcs.STACS.2017.20},
annote = {Keywords: Quantum query complexity, learning graphs, triangle finding}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.STACS.2017.21,
author = {Chattopadhyay, Arkadev and Dvor\'{a}k, Pavel and Kouck\'{y}, Michal and Loff, Bruno and Mukhopadhyay, Sagnik},
title = {{Lower Bounds for Elimination via Weak Regularity}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {21:1--21:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.21},
URN = {urn:nbn:de:0030-drops-70128},
doi = {10.4230/LIPIcs.STACS.2017.21},
annote = {Keywords: communication complexity, elimination, discrepancy, regularity, greater-than}
}
@InProceedings{chen_et_al:LIPIcs.STACS.2017.22,
author = {Chen, Lin and Marx, D\'{a}niel and Ye, Deshi and Zhang, Guochuan},
title = {{Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {22:1--22:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.22},
URN = {urn:nbn:de:0030-drops-70110},
doi = {10.4230/LIPIcs.STACS.2017.22},
annote = {Keywords: APX-hardness, Parameterized algorithm, Scheduling, Exponential Time Hypothesis}
}
@InProceedings{chistikov_et_al:LIPIcs.STACS.2017.23,
author = {Chistikov, Dmitry and Iv\'{a}n, Szabolcs and Lubiw, Anna and Shallit, Jeffrey},
title = {{Fractional Coverings, Greedy Coverings, and Rectifier Networks}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {23:1--23:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.23},
URN = {urn:nbn:de:0030-drops-70107},
doi = {10.4230/LIPIcs.STACS.2017.23},
annote = {Keywords: rectifier network, OR-circuit, biclique covering, fractional covering, greedy covering}
}
@InProceedings{clemente_et_al:LIPIcs.STACS.2017.24,
author = {Clemente, Lorenzo and Czerwinski, Wojciech and Lasota, Slawomir and Paperman, Charles},
title = {{Separability of Reachability Sets of Vector Addition Systems}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {24:1--24:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.24},
URN = {urn:nbn:de:0030-drops-70091},
doi = {10.4230/LIPIcs.STACS.2017.24},
annote = {Keywords: separability, Petri nets, modular sets, unary sets, decidability}
}
@InProceedings{curticapean_et_al:LIPIcs.STACS.2017.25,
author = {Curticapean, Radu and Dell, Holger and Roth, Marc},
title = {{Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {25:1--25:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.25},
URN = {urn:nbn:de:0030-drops-70080},
doi = {10.4230/LIPIcs.STACS.2017.25},
annote = {Keywords: matchings, homomorphisms, line graphs, counting complexity, parameterized complexity}
}
@InProceedings{disser_et_al:LIPIcs.STACS.2017.26,
author = {Disser, Yann and Kratsch, Stefan},
title = {{Robust and Adaptive Search}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.26},
URN = {urn:nbn:de:0030-drops-70077},
doi = {10.4230/LIPIcs.STACS.2017.26},
annote = {Keywords: searching, robustness, adaptive algorithms, memory faults, array disorder}
}
@InProceedings{dvorak_et_al:LIPIcs.STACS.2017.27,
author = {Dvor\'{a}k, Zdenek and Kr\'{a}l, Daniel and Mohar, Bojan},
title = {{Graphic TSP in Cubic Graphs}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {27:1--27:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.27},
URN = {urn:nbn:de:0030-drops-70068},
doi = {10.4230/LIPIcs.STACS.2017.27},
annote = {Keywords: Graphic TSP, approximation algorithms, cubic graphs}
}
@InProceedings{dvorak_et_al:LIPIcs.STACS.2017.28,
author = {Dvor\'{a}k, Zdenek and Lidick\'{y}, Bernard},
title = {{Independent Sets near the Lower Bound in Bounded Degree Graphs}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {28:1--28:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.28},
URN = {urn:nbn:de:0030-drops-70042},
doi = {10.4230/LIPIcs.STACS.2017.28},
annote = {Keywords: independent set, bounded degree, Delta-colorable, fixed parameter tractability}
}
@InProceedings{fijalkow_et_al:LIPIcs.STACS.2017.29,
author = {Fijalkow, Nathana\"{e}l and Ohlmann, Pierre and Ouaknine, Jo\"{e}l and Pouly, Amaury and Worrell, James},
title = {{Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {29:1--29:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.29},
URN = {urn:nbn:de:0030-drops-70059},
doi = {10.4230/LIPIcs.STACS.2017.29},
annote = {Keywords: Verification,algebraic computation,Skolem Problem,Orbit Problem,invariants}
}
@InProceedings{finkbeiner_et_al:LIPIcs.STACS.2017.30,
author = {Finkbeiner, Bernd and Zimmermann, Martin},
title = {{The First-Order Logic of Hyperproperties}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {30:1--30:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.30},
URN = {urn:nbn:de:0030-drops-70031},
doi = {10.4230/LIPIcs.STACS.2017.30},
annote = {Keywords: Hyperproperties, Linear Temporal Logic, First-order Logic}
}
@InProceedings{fischer_et_al:LIPIcs.STACS.2017.31,
author = {Fischer, Eldar and Lachish, Oded and Vasudev, Yadu},
title = {{Improving and Extending the Testing of Distributions for Shape-Restricted Properties}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {31:1--31:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.31},
URN = {urn:nbn:de:0030-drops-70024},
doi = {10.4230/LIPIcs.STACS.2017.31},
annote = {Keywords: conditional sampling, distribution testing, property testing, statistics}
}
@InProceedings{fomin_et_al:LIPIcs.STACS.2017.32,
author = {Fomin, Fedor V. and Lokshtanov, Daniel and Meesum, S. M. and Saurabh, Saket and Zehavi, Meirav},
title = {{Matrix Rigidity from the Viewpoint of Parameterized Complexity}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.32},
URN = {urn:nbn:de:0030-drops-70019},
doi = {10.4230/LIPIcs.STACS.2017.32},
annote = {Keywords: Matrix Rigidity, Parameterized Complexity, Linear Algebra}
}
@InProceedings{freydenberger_et_al:LIPIcs.STACS.2017.33,
author = {Freydenberger, Dominik D. and Schmid, Markus L.},
title = {{Deterministic Regular Expressions with Back-References}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {33:1--33:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.33},
URN = {urn:nbn:de:0030-drops-70004},
doi = {10.4230/LIPIcs.STACS.2017.33},
annote = {Keywords: Deterministic Regular Expression, Regex, Glushkov Automaton}
}
@InProceedings{gallot_et_al:LIPIcs.STACS.2017.34,
author = {Gallot, Paul and Muscholl, Anca and Puppis, Gabriele and Salvati, Sylvain},
title = {{On the Decomposition of Finite-Valued Streaming String Transducers}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {34:1--34:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.34},
URN = {urn:nbn:de:0030-drops-69997},
doi = {10.4230/LIPIcs.STACS.2017.34},
annote = {Keywords: Streaming Transducers, finite valuedness, equivalence}
}
@InProceedings{ganardi_et_al:LIPIcs.STACS.2017.35,
author = {Ganardi, Moses and Hucke, Danny and K\"{o}nig, Daniel and Lohrey, Markus},
title = {{Circuit Evaluation for Finite Semirings}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {35:1--35:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.35},
URN = {urn:nbn:de:0030-drops-69978},
doi = {10.4230/LIPIcs.STACS.2017.35},
annote = {Keywords: circuit value problem, finite semirings, circuit complexity}
}
@InProceedings{ganian_et_al:LIPIcs.STACS.2017.36,
author = {Ganian, Robert and Ramanujan, M. S. and Szeider, Stefan},
title = {{Combining Treewidth and Backdoors for CSP}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {36:1--36:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.36},
URN = {urn:nbn:de:0030-drops-69986},
doi = {10.4230/LIPIcs.STACS.2017.36},
annote = {Keywords: Algorithms and data structures, Fixed Parameter Tractability, Constraint Satisfaction}
}
@InProceedings{garciamarco_et_al:LIPIcs.STACS.2017.37,
author = {Garcia-Marco, Ignacio and Koiran, Pascal and Pecatte, Timoth\'{e}e and Thomass\'{e}, St\'{e}phan},
title = {{On the Complexity of Partial Derivatives}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {37:1--37:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.37},
URN = {urn:nbn:de:0030-drops-69964},
doi = {10.4230/LIPIcs.STACS.2017.37},
annote = {Keywords: counting complexity, simplicial complex, lower bounds, arithmetic circuits}
}
@InProceedings{garg_et_al:LIPIcs.STACS.2017.38,
author = {Garg, Mohit and Radhakrishnan, Jaikumar},
title = {{Set Membership with Non-Adaptive Bit Probes}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {38:1--38:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.38},
URN = {urn:nbn:de:0030-drops-69952},
doi = {10.4230/LIPIcs.STACS.2017.38},
annote = {Keywords: Data Structures, Bit-probe model, Compression, Bloom filters, Expansion}
}
@InProceedings{vangool_et_al:LIPIcs.STACS.2017.39,
author = {van Gool, Samuel J. and Steinberg, Benjamin},
title = {{Pro-Aperiodic Monoids via Saturated Models}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {39:1--39:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.39},
URN = {urn:nbn:de:0030-drops-69945},
doi = {10.4230/LIPIcs.STACS.2017.39},
annote = {Keywords: aperiodic monoids, profinite monoids, Stone duality, saturated models}
}
@InProceedings{gregor_et_al:LIPIcs.STACS.2017.40,
author = {Gregor, Petr and M\"{u}tze, Torsten},
title = {{Trimming and Gluing Gray Codes}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {40:1--40:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.40},
URN = {urn:nbn:de:0030-drops-69930},
doi = {10.4230/LIPIcs.STACS.2017.40},
annote = {Keywords: Gray code, subset, combination, loopless algorithm}
}
@InProceedings{haddadan_et_al:LIPIcs.STACS.2017.41,
author = {Haddadan, Shahrzad and Winkler, Peter},
title = {{Mixing of Permutations by Biased Transposition}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {41:1--41:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.41},
URN = {urn:nbn:de:0030-drops-69928},
doi = {10.4230/LIPIcs.STACS.2017.41},
annote = {Keywords: Markov chains, permutations, self organizing lists, mixing time}
}
@InProceedings{hoyer_et_al:LIPIcs.STACS.2017.42,
author = {Hoyer, Peter and Komeili, Mojtaba},
title = {{Efficient Quantum Walk on the Grid with Multiple Marked Elements}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {42:1--42:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.42},
URN = {urn:nbn:de:0030-drops-69902},
doi = {10.4230/LIPIcs.STACS.2017.42},
annote = {Keywords: Quantum walks, random walks, query complexity, spatial search}
}
@InProceedings{itsykson_et_al:LIPIcs.STACS.2017.43,
author = {Itsykson, Dmitry and Knop, Alexander and Romashchenko, Andrey and Sokolov, Dmitry},
title = {{On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {43:1--43:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.43},
URN = {urn:nbn:de:0030-drops-69914},
doi = {10.4230/LIPIcs.STACS.2017.43},
annote = {Keywords: Proof complexity, OBDD, error-correcting codes, Tseitin formulas, expanders}
}
@InProceedings{ivaskovic_et_al:LIPIcs.STACS.2017.44,
author = {Ivaskovic, Andrej and Kosowski, Adrian and Pajak, Dominik and Sauerwald, Thomas},
title = {{Multiple Random Walks on Paths and Grids}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {44:1--44:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.44},
URN = {urn:nbn:de:0030-drops-69897},
doi = {10.4230/LIPIcs.STACS.2017.44},
annote = {Keywords: random walks, randomized algorithms, parallel computing}
}
@InProceedings{karkkainen_et_al:LIPIcs.STACS.2017.45,
author = {K\"{a}rkk\"{a}inen, Juha and Kempa, Dominik and Nakashima, Yuto and Puglisi, Simon J. and Shur, Arseny M.},
title = {{On the Size of Lempel-Ziv and Lyndon Factorizations}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {45:1--45:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.45},
URN = {urn:nbn:de:0030-drops-69878},
doi = {10.4230/LIPIcs.STACS.2017.45},
annote = {Keywords: Lempel-Ziv factorization, Lempel-Ziv parsing, LZ, Lyndon word, Lyndon factorization, Standard factorization}
}
@InProceedings{knop_et_al:LIPIcs.STACS.2017.46,
author = {Knop, Dusan and Kouteck\'{y}, Martin and Mnich, Matthias},
title = {{Voting and Bribing in Single-Exponential Time}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {46:1--46:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.46},
URN = {urn:nbn:de:0030-drops-69885},
doi = {10.4230/LIPIcs.STACS.2017.46},
annote = {Keywords: Parameterized algorithm, swap bribery, n-fold integer programming}
}
@InProceedings{kompatscher_et_al:LIPIcs.STACS.2017.47,
author = {Kompatscher, Michael and Pham, Trung Van},
title = {{A Complexity Dichotomy for Poset Constraint Satisfaction}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {47:1--47:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.47},
URN = {urn:nbn:de:0030-drops-69850},
doi = {10.4230/LIPIcs.STACS.2017.47},
annote = {Keywords: Constraint Satisfaction, Random Partial Order, Computational Complexity, Universal Algebra, Ramsey Theory}
}
@InProceedings{kreutzer_et_al:LIPIcs.STACS.2017.48,
author = {Kreutzer, Stephan and Rabinovich, Roman and Siebertz, Sebastian and Weberst\"{a}dt, Grischa},
title = {{Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {48:1--48:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.48},
URN = {urn:nbn:de:0030-drops-69868},
doi = {10.4230/LIPIcs.STACS.2017.48},
annote = {Keywords: Directed Graph Structure Theory, Bounded Expansion, Generalised Colouring Numbers, Splitter Game, Approximation Algorithms, Dominating Set}
}
@InProceedings{kulikov_et_al:LIPIcs.STACS.2017.49,
author = {Kulikov, Alexander S. and Podolskii, Vladimir V.},
title = {{Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {49:1--49:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.49},
URN = {urn:nbn:de:0030-drops-69832},
doi = {10.4230/LIPIcs.STACS.2017.49},
annote = {Keywords: circuit complexity, computational complexity, threshold, majority, lower bound, upper bound}
}
@InProceedings{leroux_et_al:LIPIcs.STACS.2017.50,
author = {Le Roux, St\'{e}phane and Pauly, Arno and Raskin, Jean-Fran\c{c}ois},
title = {{Minkowski Games}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {50:1--50:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.50},
URN = {urn:nbn:de:0030-drops-69849},
doi = {10.4230/LIPIcs.STACS.2017.50},
annote = {Keywords: Control in R^d, determinacy, polytopic/arbitrary, coNP-complete, undecidable}
}
@InProceedings{li_et_al:LIPIcs.STACS.2017.51,
author = {Li, Qian and Sun, Xiaoming},
title = {{On the Sensitivity Complexity of k-Uniform Hypergraph Properties}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {51:1--51:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.51},
URN = {urn:nbn:de:0030-drops-69825},
doi = {10.4230/LIPIcs.STACS.2017.51},
annote = {Keywords: Sensitivity Complexity, k-uniform Hypergraph Properties, Boolean Function, Turan's question}
}
@InProceedings{lohrey_et_al:LIPIcs.STACS.2017.52,
author = {Lohrey, Markus and Zetzsche, Georg},
title = {{The Complexity of Knapsack in Graph Groups}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {52:1--52:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.52},
URN = {urn:nbn:de:0030-drops-69810},
doi = {10.4230/LIPIcs.STACS.2017.52},
annote = {Keywords: knapsack, subset sum, graph groups, decision problems in group theory}
}
@InProceedings{lutz_et_al:LIPIcs.STACS.2017.53,
author = {Lutz, Jack H. and Lutz, Neil},
title = {{Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {53:1--53:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.53},
URN = {urn:nbn:de:0030-drops-69806},
doi = {10.4230/LIPIcs.STACS.2017.53},
annote = {Keywords: algorithmic randomness, conditional dimension, geometric measure theory, Kakeya sets, Kolmogorov complexity}
}
@InProceedings{richard:LIPIcs.STACS.2017.54,
author = {Richard, Ga\'{e}tan},
title = {{On the Synchronisation Problem over Cellular Automata}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {54:1--54:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.54},
URN = {urn:nbn:de:0030-drops-69780},
doi = {10.4230/LIPIcs.STACS.2017.54},
annote = {Keywords: cellular automata, dynamical systems, aperiodic tiling, synchronisation}
}
@InProceedings{saarela:LIPIcs.STACS.2017.55,
author = {Saarela, Aleksi},
title = {{Word Equations Where a Power Equals a Product of Powers}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {55:1--55:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.55},
URN = {urn:nbn:de:0030-drops-69793},
doi = {10.4230/LIPIcs.STACS.2017.55},
annote = {Keywords: Combinatorics on words, Word equations}
}
@InProceedings{sankowski_et_al:LIPIcs.STACS.2017.56,
author = {Sankowski, Piotr and Wegrzycki, Karol},
title = {{Improved Distance Queries and Cycle Counting by Frobenius Normal Form}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {56:1--56:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.56},
URN = {urn:nbn:de:0030-drops-69773},
doi = {10.4230/LIPIcs.STACS.2017.56},
annote = {Keywords: Frobenius Normal Form, Graph Algorithms, All Nodes Shortest Cycles}
}
@InProceedings{skorski:LIPIcs.STACS.2017.57,
author = {Skorski, Maciej},
title = {{Lower Bounds on Key Derivation for Square-Friendly Applications}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {57:1--57:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.57},
URN = {urn:nbn:de:0030-drops-69761},
doi = {10.4230/LIPIcs.STACS.2017.57},
annote = {Keywords: key derivation, square-friendly applications, lower bounds}
}
@InProceedings{zimand:LIPIcs.STACS.2017.58,
author = {Zimand, Marius},
title = {{List Approximation for Increasing Kolmogorov Complexity}},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
pages = {58:1--58:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-028-6},
ISSN = {1868-8969},
year = {2017},
volume = {66},
editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.58},
URN = {urn:nbn:de:0030-drops-70347},
doi = {10.4230/LIPIcs.STACS.2017.58},
annote = {Keywords: Kolmogorov complexity, list approximation, randomness extractor}
}
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