Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Chris Köcher |
Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 45:1-45:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Suryajith Chillara, Nutan Limaye, Srikanth Srinivasan 0001 |
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 21:1-21:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Rolf Niedermeier, Brigitte Vallée (eds.) |
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0 The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
1 | Gökalp Demirci, Henry Hoffmann, David H. K. Kim |
Approximation Algorithms for Scheduling with Resource and Precedence Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 25:1-25:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Serge Gaspers, Shenwei Huang, Daniël Paulusma |
Colouring Square-Free Graphs without Long Induced Paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 35:1-35:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Kosolobov |
Relations Between Greedy and Bit-Optimal LZ77 Encodings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 46:1-46:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
Small Resolution Proofs for QBF using Dependency Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 28:1-28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Patrick Gardy, Patricia Bouyer, Nicolas Markey |
Dependences in Strategy Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 34:1-34:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Marco Bressan 0002, Enoch Peserico, Luca Pretto |
On Approximating the Stationary Distribution of Time-reversible Markov Chains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 18:1-18:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Michael Luttenberger, Raphaela Palenta, Helmut Seidl |
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 48:1-48:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Gerhard J. Woeginger |
The Open Shop Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 4:1-4:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Robert Ganian, Fabian Klute, Sebastian Ordyniak |
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 33:1-33:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Roei Tell |
Lower Bounds on Black-Box Reductions of Hitting to Density Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 58:1-58:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | John M. Hitchcock, Hadi Shafei |
Nonuniform Reductions and NP-Completeness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 40:1-40:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Christoph Berkholz |
The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 11:1-11:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Raphaël Clifford, Allan Grønlund, Kasper Green Larsen, Tatiana Starikovskaya |
Upper and Lower Bounds for Dynamic Data Structures on Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 22:1-22:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Benoît Larose, Barnaby Martin, Daniël Paulusma |
Surjective H-Colouring over Reflexive Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 49:1-49:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Bruno Salvy |
Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 1:1-1:5, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Aayush Rajasekaran, Jeffrey O. Shallit, Tim Smith |
Sums of Palindromes: an Approach via Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 54:1-54:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | László Egri, Dániel Marx, Pawel Rzazewski |
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 27:1-27:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Debarati Das 0001, Michal Koucký 0001, Michael E. Saks |
Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 23:1-23:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Andris Ambainis, Martins Kokainis, Krisjanis Prusis, Jevgenijs Vihrovs |
All Classical Adversary Methods are Equivalent for Total Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 8:1-8:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Filip Mazowiecki, Cristian Riveros |
Pumping Lemmas for Weighted Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 50:1-50:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Sven Jäger 0001, Martin Skutella |
Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 43:1-43:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
1 | Stanislav Böhm, Stefan Göller, Simon Halfon, Piotr Hofman |
On Büchi One-Counter Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 14:1-14:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell 0001 |
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 29:1-29:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Akanksha Agrawal 0001, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi |
Split Contraction: The Untold Story. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 5:1-5:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Jack H. Lutz, Neil Lutz |
Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 53:1-53:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Chistikov 0001, Szabolcs Iván, Anna Lubiw, Jeffrey O. Shallit |
Fractional Coverings, Greedy Coverings, and Rectifier Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 23:1-23:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Suman K. Bera 0001, Amit Chakrabarti |
Towards Tighter Space Bounds for Counting Triangles and Other Substructures in Graph Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 11:1-11:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Dusan Knop, Martin Koutecký, Matthias Mnich |
Voting and Bribing in Single-Exponential Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 46:1-46:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | |
Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 0:i-0:xvi, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan 0001 |
On Polynomial Approximations Over Z/2^kZ*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 12:1-12:12, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Antoine Joux |
Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 3:1-3:1, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Marianne Akian, Stéphane Gaubert, Julien Grand-Clément, Jérémie Guillaud |
The Operator Approach to Entropy Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 6:1-6:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Andrej Ivaskovic, Adrian Kosowski, Dominik Pajak, Thomas Sauerwald |
Multiple Random Walks on Paths and Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 44:1-44:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Lorenzo Clemente, Wojciech Czerwinski, Slawomir Lasota 0001, Charles Paperman |
Separability of Reachability Sets of Vector Addition Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 24:1-24:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Aleksi Saarela |
Word Equations Where a Power Equals a Product of Powers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 55:1-55:9, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Mohit Garg 0003, Jaikumar Radhakrishnan |
Set Membership with Non-Adaptive Bit Probes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 38:1-38:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Stephan Kreutzer, Roman Rabinovich 0001, Sebastian Siebertz, Grischa Weberstädt |
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 48:1-48:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh 0001, Meirav Zehavi |
Matrix Rigidity from the Viewpoint of Parameterized Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 32:1-32:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán |
Parameterized Complexity of Small Weight Automorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 7:1-7:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Marius Zimand |
List Approximation for Increasing Kolmogorov Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 58:1-58:12, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Piotr Sankowski, Karol Wegrzycki |
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 56:1-56:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Stéphane Le Roux 0001, Arno Pauly, Jean-François Raskin |
Minkowski Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 50:1-50:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Qian Li 0012, Xiaoming Sun 0001 |
On the Sensitivity Complexity of k-Uniform Hypergraph Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 51:1-51:12, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Juha Kontinen |
Computational Aspects of Logics in Team Semantics (Tutorial). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 1:1-1:1, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Mikolaj Bojanczyk, Michal Pilipczuk |
Optimizing Tree Decompositions in MSO. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 15:1-15:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Heribert Vollmer, Brigitte Vallée (eds.) |
34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6 The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
1 | Benjamin A. Burton, Sergio Cabello, Stefan Kratsch, William Pettersson |
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 18:1-18:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Bernd Finkbeiner, Martin Zimmermann 0002 |
The First-Order Logic of Hyperproperties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 30:1-30:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Radu Curticapean, Holger Dell, Marc Roth |
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 25:1-25:15, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Alkida Balliu, Gianlorenzo D'Angelo, Pierre Fraigniaud, Dennis Olivetti |
What Can Be Verified Locally?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 8:1-8:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Maciej Skorski |
Lower Bounds on Key Derivation for Square-Friendly Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 57:1-57:12, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Till Tantau |
Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 4:1-4:4, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov 0001 |
On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 43:1-43:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Arkadev Chattopadhyay, Pavel Dvorák, Michal Koucký 0001, Bruno Loff, Sagnik Mukhopadhyay |
Lower Bounds for Elimination via Weak Regularity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 21:1-21:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Lin Chen 0009, Dániel Marx, Deshi Ye, Guochuan Zhang |
Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 22:1-22:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Dominik D. Freydenberger, Markus L. Schmid |
Deterministic Regular Expressions with Back-References. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 33:1-33:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Petr Gregor, Torsten Mütze |
Trimming and Gluing Gray Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 40:1-40:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Peter Høyer, Mojtaba Komeili |
Efficient Quantum Walk on the Grid with Multiple Marked Elements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 42:1-42:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Zdenek Dvorák 0001, Daniel Král, Bojan Mohar |
Graphic TSP in Cubic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 27:1-27:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Bärtschi, Jérémie Chalopin, Shantanu Das 0001, Yann Disser, Daniel Graf 0001, Jan Hackfeld, Paolo Penna |
Energy-Efficient Delivery by Heterogeneous Mobile Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 10:1-10:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Samuel Jacob van Gool, Benjamin Steinberg |
Pro-Aperiodic Monoids via Saturated Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 39:1-39:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Vasco Brattka, Rupert Hölzl 0001, Rutger Kuyper |
Monte Carlo Computability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 17:1-17:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Titouan Carette, Mathieu Laurière, Frédéric Magniez |
Extended Learning Graphs for Triangle Finding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 20:1-20:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Zdenek Dvorák 0001, Bernard Lidický |
Independent Sets near the Lower Bound in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 28:1-28:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Michael Kompatscher, Van Trung Pham |
A Complexity Dichotomy for Poset Constraint Satisfaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 47:1-47:12, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Artur Jez |
Recompression: New Approach to Word Equations and Context Unification (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 2:1-2:3, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Édouard Bonnet, Tillmann Miltzow, Pawel Rzazewski |
Complexity of Token Swapping and its Variants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 16:1-16:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Arnaud Carayol, Stefan Göller |
On Long Words Avoiding Zimin Patterns. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 19:1-19:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Gaétan Richard |
On the Synchronisation Problem over Cellular Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 54:1-54:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Bahareh Banyassady, Matias Korman, Wolfgang Mulzer, André van Renssen, Marcel Roeloffzen, Paul Seiferth, Yannik Stein |
Improved Time-Space Trade-Offs for Computing Voronoi Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 9:1-9:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Alexander S. Kulikov, Vladimir V. Podolskii |
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 49:1-49:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Ignacio García-Marco, Pascal Koiran, Timothée Pecatte, Stéphan Thomassé |
On the Complexity of Partial Derivatives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 37:1-37:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Vittorio Bilò, Marios Mavronicolas |
Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 13:1-13:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Paul Gallot, Anca Muscholl, Gabriele Puppis, Sylvain Salvati |
On the Decomposition of Finite-Valued Streaming String Transducers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 34:1-34:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Yann Disser, Stefan Kratsch |
Robust and Adaptive Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 26:1-26:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Eldar Fischer, Oded Lachish, Yadu Vasudev |
Improving and Extending the Testing of Distributions for Shape-Restricted Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 31:1-31:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Robert Ganian, M. S. Ramanujan 0001, Stefan Szeider |
Combining Treewidth and Backdoors for CSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 36:1-36:17, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Moses Ganardi, Danny Hucke, Daniel König, Markus Lohrey |
Circuit Evaluation for Finite Semirings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 35:1-35:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Shahrzad Haddadan, Peter Winkler 0001 |
Mixing of Permutations by Biased Transposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 41:1-41:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur |
On the Size of Lempel-Ziv and Lyndon Factorizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 45:1-45:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Markus Lohrey, Georg Zetzsche |
The Complexity of Knapsack in Graph Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, pp. 52:1-52:14, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-028-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
1 | Virginia Vassilevska Williams |
Fine-Grained Algorithms and Complexity (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 3:1-3:1, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Laure Daviaud, Denis Kuperberg, Jean-Éric Pin |
Varieties of Cost Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 30:1-30:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Christoph Haase, Piotr Hofman |
Tightening the Complexity of Equivalence Problems for Commutative Grammars. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 41:1-41:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | S. Akshay 0001, Blaise Genest, Bruno Karelovic, Nikhil Vyas 0001 |
On Regularity of Unary Probabilistic Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 8:1-8:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Vittorio Bilò, Marios Mavronicolas |
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 17:1-17:13, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Manuel Bodirsky, Peter Jonsson, Van Trung Pham |
The Complexity of Phylogeny Constraint Satisfaction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 20:1-20:13, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Sang Won Bae, Matias Korman, Joseph S. B. Mitchell, Yoshio Okamoto, Valentin Polishchuk, Haitao Wang 0001 |
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 14:1-14:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Gerth Stølting Brodal |
External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 23:1-23:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea |
Efficiently Finding All Maximal alpha-gapped Repeats. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 39:1-39:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Arnaud Mary, Yann Strozecki |
Efficient Enumeration of Solutions Produced by Closure Operations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 52:1-52:13, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Shiri Chechik, Haim Kaplan, Mikkel Thorup, Or Zamir, Uri Zwick |
Bottleneck Paths and Trees and Deterministic Graphical Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 27:1-27:13, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Édouard Bonnet, Michael Lampis, Vangelis Th. Paschos |
Time-Approximation Trade-offs for Inapproximable Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 22:1-22:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Achim Blumensath, Thomas Colcombet, Pawel Parys |
On a Fragment of AMSO and Tiling Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 19:1-19:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Michal Pilipczuk, Marcin Wrochna |
On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 57:1-57:15, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Timo Kötzing, Martin Schirneck |
Towards an Atlas of Computational Learning Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 47:1-47:13, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
1 | Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh 0001 |
Editing to Connected f-Degree Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France, pp. 36:1-36:14, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-001-9. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|