Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID34th STACS 2017: Hannover, Germany
- Heribert Vollmer, Brigitte Vallée:
34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany. LIPIcs 66, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-028-6
- Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers. 0:i-0:xvi
- Juha Kontinen
:
Computational Aspects of Logics in Team Semantics (Tutorial). 1:1-1:1 - Artur Jez:
Recompression: New Approach to Word Equations and Context Unification (Invited Talk). 2:1-2:3 - Antoine Joux:
Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk). 3:1-3:1 - Till Tantau:
Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk). 4:1-4:4 - Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
Split Contraction: The Untold Story. 5:1-5:14 - Marianne Akian, Stéphane Gaubert, Julien Grand-Clément, Jérémie Guillaud:
The Operator Approach to Entropy Games. 6:1-6:14 - Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Parameterized Complexity of Small Weight Automorphisms. 7:1-7:13 - Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti:
What Can Be Verified Locally?. 8:1-8:13 - Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein:
Improved Time-Space Trade-Offs for Computing Voronoi Diagrams. 9:1-9:14 - Andreas Bärtschi, Jérémie Chalopin, Shantanu Das, Yann Disser, Daniel Graf, Jan Hackfeld, Paolo Penna:
Energy-Efficient Delivery by Heterogeneous Mobile Agents. 10:1-10:14 - Suman K. Bera, Amit Chakrabarti:
Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. 11:1-11:14 - Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan:
On Polynomial Approximations Over Z/2^kZ*. 12:1-12:12 - Vittorio Bilò, Marios Mavronicolas:
Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games. 13:1-13:14 - Stanislav Böhm, Stefan Göller, Simon Halfon, Piotr Hofman:
On Büchi One-Counter Automata. 14:1-14:13 - Mikolaj Bojanczyk, Michal Pilipczuk:
Optimizing Tree Decompositions in MSO. 15:1-15:13 - Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski:
Complexity of Token Swapping and its Variants. 16:1-16:14 - Vasco Brattka, Rupert Hölzl, Rutger Kuyper:
Monte Carlo Computability. 17:1-17:14 - Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson:
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. 18:1-18:14 - Arnaud Carayol, Stefan Göller:
On Long Words Avoiding Zimin Patterns. 19:1-19:13 - Titouan Carette, Mathieu Laurière, Frédéric Magniez:
Extended Learning Graphs for Triangle Finding. 20:1-20:14 - Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký, Bruno Loff, Sagnik Mukhopadhyay:
Lower Bounds for Elimination via Weak Regularity. 21:1-21:14 - Lin Chen, Dániel Marx, Deshi Ye, Guochuan Zhang:
Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix. 22:1-22:14 - Dmitry Chistikov, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit:
Fractional Coverings, Greedy Coverings, and Rectifier Networks. 23:1-23:14 - Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota, Charles Paperman:
Separability of Reachability Sets of Vector Addition Systems. 24:1-24:14 - Radu Curticapean, Holger Dell, Marc Roth:
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. 25:1-25:15 - Yann Disser, Stefan Kratsch:
Robust and Adaptive Search. 26:1-26:14 - Zdenek Dvorák, Daniel Král, Bojan Mohar:
Graphic TSP in Cubic Graphs. 27:1-27:13 - Zdenek Dvorák, Bernard Lidický:
Independent Sets near the Lower Bound in Bounded Degree Graphs. 28:1-28:13 - Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. 29:1-29:13 - Bernd Finkbeiner, Martin Zimmermann:
The First-Order Logic of Hyperproperties. 30:1-30:14 - Eldar Fischer, Oded Lachish, Yadu Vasudev:
Improving and Extending the Testing of Distributions for Shape-Restricted Properties. 31:1-31:14 - Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi:
Matrix Rigidity from the Viewpoint of Parameterized Complexity. 32:1-32:14 - Dominik D. Freydenberger, Markus L. Schmid:
Deterministic Regular Expressions with Back-References. 33:1-33:14 - Paul Gallot, Anca Muscholl, Gabriele Puppis, Sylvain Salvati:
On the Decomposition of Finite-Valued Streaming String Transducers. 34:1-34:14 - Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey:
Circuit Evaluation for Finite Semirings. 35:1-35:14 - Robert Ganian, M. S. Ramanujan, Stefan Szeider:
Combining Treewidth and Backdoors for CSP. 36:1-36:17 - Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé:
On the Complexity of Partial Derivatives. 37:1-37:13 - Mohit Garg, Jaikumar Radhakrishnan:
Set Membership with Non-Adaptive Bit Probes. 38:1-38:13 - Samuel Jacob van Gool, Benjamin Steinberg:
Pro-Aperiodic Monoids via Saturated Models. 39:1-39:14 - Petr Gregor, Torsten Mütze:
Trimming and Gluing Gray Codes. 40:1-40:14 - Shahrzad Haddadan, Peter Winkler:
Mixing of Permutations by Biased Transposition. 41:1-41:13 - Peter Høyer, Mojtaba Komeili:
Efficient Quantum Walk on the Grid with Multiple Marked Elements. 42:1-42:14 - Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. 43:1-43:14 - Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald:
Multiple Random Walks on Paths and Grids. 44:1-44:14 - Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur:
On the Size of Lempel-Ziv and Lyndon Factorizations. 45:1-45:13 - Dusan Knop, Martin Koutecký, Matthias Mnich:
Voting and Bribing in Single-Exponential Time. 46:1-46:14 - Michael Kompatscher, Van Trung Pham:
A Complexity Dichotomy for Poset Constraint Satisfaction. 47:1-47:12 - Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, Grischa Weberstädt:
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs. 48:1-48:15 - Alexander S. Kulikov, Vladimir V. Podolskii:
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates. 49:1-49:14 - Stéphane Le Roux, Arno Pauly, Jean-François Raskin:
Minkowski Games. 50:1-50:13 - Qian Li, Xiaoming Sun:
On the Sensitivity Complexity of k-Uniform Hypergraph Properties. 51:1-51:12 - Markus Lohrey, Georg Zetzsche:
The Complexity of Knapsack in Graph Groups. 52:1-52:14 - Jack H. Lutz, Neil Lutz:
Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension. 53:1-53:13 - Gaétan Richard:
On the Synchronisation Problem over Cellular Automata. 54:1-54:13 - Aleksi Saarela:
Word Equations Where a Power Equals a Product of Powers. 55:1-55:9 - Piotr Sankowski, Karol Wegrzycki:
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. 56:1-56:14 - Maciej Skorski:
Lower Bounds on Key Derivation for Square-Friendly Applications. 57:1-57:12 - Marius Zimand:
List Approximation for Increasing Kolmogorov Complexity. 58:1-58:12
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-11-29 20:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
