STACS A

60 papers

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