LIPIcs, Volume 66, STACS 2017

Heribert Vollmer and Brigitte Vallée LIPIcs, Volume 66, STACS'17, Complete Volume 10.4230/LIPIcs.STACS.2017
Heribert Vollmer and Brigitte Vallée Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers 10.4230/LIPIcs.STACS.2017.0
Juha Kontinen Computational Aspects of Logics in Team Semantics (Tutorial) 10.4230/LIPIcs.STACS.2017.1
Artur Jez Recompression: New Approach to Word Equations and Context Unification (Invited Talk) 10.4230/LIPIcs.STACS.2017.2
Antoine Joux Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk) 10.4230/LIPIcs.STACS.2017.3
Till Tantau Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk) 10.4230/LIPIcs.STACS.2017.4
Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi Split Contraction: The Untold Story 10.4230/LIPIcs.STACS.2017.5
Marianne Akian, Stéphane Gaubert, Julien Grand-Clément, and Jérémie Guillaud The Operator Approach to Entropy Games 10.4230/LIPIcs.STACS.2017.6
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, and Jacobo Torán Parameterized Complexity of Small Weight Automorphisms 10.4230/LIPIcs.STACS.2017.7
Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, and Dennis Olivetti What Can Be Verified Locally? 10.4230/LIPIcs.STACS.2017.8
Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, and Yannik Stein Improved Time-Space Trade-Offs for Computing Voronoi Diagrams 10.4230/LIPIcs.STACS.2017.9
Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, and Paolo Penna Energy-Efficient Delivery by Heterogeneous Mobile Agents 10.4230/LIPIcs.STACS.2017.10
Suman K. Bera and Amit Chakrabarti Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams 10.4230/LIPIcs.STACS.2017.11
Abhishek Bhrushundi, Prahladh Harsha, and Srikanth Srinivasan On Polynomial Approximations Over Z/2^kZ* 10.4230/LIPIcs.STACS.2017.12
Vittorio Bilò and Marios Mavronicolas Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games 10.4230/LIPIcs.STACS.2017.13
Stanislav Böhm, Stefan Göller, Simon Halfon, and Piotr Hofman On Büchi One-Counter Automata 10.4230/LIPIcs.STACS.2017.14
Mikolaj Bojanczyk and Michal Pilipczuk Optimizing Tree Decompositions in MSO 10.4230/LIPIcs.STACS.2017.15
Édouard Bonnet, Tillmann Miltzow, and Pawel Rzazewski Complexity of Token Swapping and its Variants 10.4230/LIPIcs.STACS.2017.16
Vasco Brattka, Rupert Hölzl, and Rutger Kuyper Monte Carlo Computability 10.4230/LIPIcs.STACS.2017.17
Benjamin Burton, Sergio Cabello, Stefan Kratsch, and William Pettersson The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex 10.4230/LIPIcs.STACS.2017.18
Arnaud Carayol and Stefan Göller On Long Words Avoiding Zimin Patterns 10.4230/LIPIcs.STACS.2017.19
Titouan Carette, Mathieu Laurière, and Frédéric Magniez Extended Learning Graphs for Triangle Finding 10.4230/LIPIcs.STACS.2017.20
Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, and Sagnik Mukhopadhyay Lower Bounds for Elimination via Weak Regularity 10.4230/LIPIcs.STACS.2017.21
Lin Chen, Dániel Marx, Deshi Ye, and Guochuan Zhang Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix 10.4230/LIPIcs.STACS.2017.22
Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, and Jeffrey Shallit Fractional Coverings, Greedy Coverings, and Rectifier Networks 10.4230/LIPIcs.STACS.2017.23
Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, and Charles Paperman Separability of Reachability Sets of Vector Addition Systems 10.4230/LIPIcs.STACS.2017.24
Radu Curticapean, Holger Dell, and Marc Roth Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes 10.4230/LIPIcs.STACS.2017.25
Yann Disser and Stefan Kratsch Robust and Adaptive Search 10.4230/LIPIcs.STACS.2017.26
Zdenek Dvorák, Daniel Král, and Bojan Mohar Graphic TSP in Cubic Graphs 10.4230/LIPIcs.STACS.2017.27
Zdenek Dvorák and Bernard Lidický Independent Sets near the Lower Bound in Bounded Degree Graphs 10.4230/LIPIcs.STACS.2017.28
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, and James Worrell Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem 10.4230/LIPIcs.STACS.2017.29
Bernd Finkbeiner and Martin Zimmermann The First-Order Logic of Hyperproperties 10.4230/LIPIcs.STACS.2017.30
Eldar Fischer, Oded Lachish, and Yadu Vasudev Improving and Extending the Testing of Distributions for Shape-Restricted Properties 10.4230/LIPIcs.STACS.2017.31
Fedor V. Fomin, Daniel Lokshtanov, S. M. Meesum, Saket Saurabh, and Meirav Zehavi Matrix Rigidity from the Viewpoint of Parameterized Complexity 10.4230/LIPIcs.STACS.2017.32
Dominik D. Freydenberger and Markus L. Schmid Deterministic Regular Expressions with Back-References 10.4230/LIPIcs.STACS.2017.33
Paul Gallot, Anca Muscholl, Gabriele Puppis, and Sylvain Salvati On the Decomposition of Finite-Valued Streaming String Transducers 10.4230/LIPIcs.STACS.2017.34
Moses Ganardi, Danny Hucke, Daniel König, and Markus Lohrey Circuit Evaluation for Finite Semirings 10.4230/LIPIcs.STACS.2017.35
Robert Ganian, M. S. Ramanujan, and Stefan Szeider Combining Treewidth and Backdoors for CSP 10.4230/LIPIcs.STACS.2017.36
Ignacio Garcia-Marco, Pascal Koiran, Timothée Pecatte, and Stéphan Thomassé On the Complexity of Partial Derivatives 10.4230/LIPIcs.STACS.2017.37
Mohit Garg and Jaikumar Radhakrishnan Set Membership with Non-Adaptive Bit Probes 10.4230/LIPIcs.STACS.2017.38
Samuel J. van Gool and Benjamin Steinberg Pro-Aperiodic Monoids via Saturated Models 10.4230/LIPIcs.STACS.2017.39
Petr Gregor and Torsten Mütze Trimming and Gluing Gray Codes 10.4230/LIPIcs.STACS.2017.40
Shahrzad Haddadan and Peter Winkler Mixing of Permutations by Biased Transposition 10.4230/LIPIcs.STACS.2017.41
Peter Hoyer and Mojtaba Komeili Efficient Quantum Walk on the Grid with Multiple Marked Elements 10.4230/LIPIcs.STACS.2017.42
Dmitry Itsykson, Alexander Knop, Andrey Romashchenko, and Dmitry Sokolov On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables 10.4230/LIPIcs.STACS.2017.43
Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, and Thomas Sauerwald Multiple Random Walks on Paths and Grids 10.4230/LIPIcs.STACS.2017.44
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, and Arseny M. Shur On the Size of Lempel-Ziv and Lyndon Factorizations 10.4230/LIPIcs.STACS.2017.45
Dusan Knop, Martin Koutecký, and Matthias Mnich Voting and Bribing in Single-Exponential Time 10.4230/LIPIcs.STACS.2017.46
Michael Kompatscher and Trung Van Pham A Complexity Dichotomy for Poset Constraint Satisfaction 10.4230/LIPIcs.STACS.2017.47
Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, and Grischa Weberstädt Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs 10.4230/LIPIcs.STACS.2017.48
Alexander S. Kulikov and Vladimir V. Podolskii Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates 10.4230/LIPIcs.STACS.2017.49
Stéphane Le Roux, Arno Pauly, and Jean-François Raskin Minkowski Games 10.4230/LIPIcs.STACS.2017.50
Qian Li and Xiaoming Sun On the Sensitivity Complexity of k-Uniform Hypergraph Properties 10.4230/LIPIcs.STACS.2017.51
Markus Lohrey and Georg Zetzsche The Complexity of Knapsack in Graph Groups 10.4230/LIPIcs.STACS.2017.52
Jack H. Lutz and Neil Lutz Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension 10.4230/LIPIcs.STACS.2017.53
Gaétan Richard On the Synchronisation Problem over Cellular Automata 10.4230/LIPIcs.STACS.2017.54
Aleksi Saarela Word Equations Where a Power Equals a Product of Powers 10.4230/LIPIcs.STACS.2017.55
Piotr Sankowski and Karol Wegrzycki Improved Distance Queries and Cycle Counting by Frobenius Normal Form 10.4230/LIPIcs.STACS.2017.56
Maciej Skorski Lower Bounds on Key Derivation for Square-Friendly Applications 10.4230/LIPIcs.STACS.2017.57
Marius Zimand List Approximation for Increasing Kolmogorov Complexity 10.4230/LIPIcs.STACS.2017.58