default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st STACS 2014: Lyon, France
- Ernst W. Mayr, Natacha Portier:
31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014, Lyon, France, March 5-8, 2014. LIPIcs 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-65-1 - Frontmatter, Table of Contents, Preface, Conference Organization.
- Javier Esparza
:
Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk). 1-10 - Peter Bro Miltersen:
Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk). 11-12 - Luc Segoufin:
A glimpse on constant delay enumeration (Invited Talk). 13-27 - Neeraj Kayal:
Arithmetic Circuit Complexity (Tutorial). 28-28 - Marek Adamczyk, Maxim Sviridenko, Justin Ward:
Submodular Stochastic Probing on Matroids. 29-40 - Matthew Anderson, Anuj Dawar:
On Symmetric Circuits and Fixed-Point Logics. 41-52 - Eric Angel, Evripidis Bampis, Vincent Chau:
Throughput Maximization in the Speed-Scaling Setting. 53-62 - Antonios Antoniadis, Neal Barcelo, Mario E. Consuegra, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato:
Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules. 63-74 - Júlio Araújo, Nicolas Nisse, Stéphane Pérennes:
Weighted Coloring in Trees. 75-86 - Yossi Azar, Matthias Englert, Iftah Gamzu, Eytan Kidron:
Generalized Reordering Buffer Management. 87-98 - Haris Aziz, Bart de Keijzer:
Shapley meets Shapley. 99-111 - Nicolas Bacquey:
Complexity classes on spatially periodic Cellular Automata. 112-124 - Bruno Bauwens:
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits. 125-136 - Michael A. Bekos, Martin Gronemann, Chrysanthi N. Raftopoulou:
Two-Page Book Embeddings of 4-Planar Graphs. 137-148 - Petra Berenbrink, Funda Ergün, Frederik Mallmann-Trenn, Erfan Sadeqi Azer:
Palindrome Recognition In The Streaming Model. 149-161 - Francine Blanchet-Sadri, Michelle Bodnar, Benjamin De Winkle:
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings. 162-173 - Joan Boyar, Shahin Kamali, Kim S. Larsen, Alejandro López-Ortiz:
Online Bin Packing with Advice. 174-186 - Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: cover time and maximum load. 187-198 - Véronique Bruyère, Emmanuel Filiot, Mickael Randour, Jean-François Raskin:
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. 199-213 - Yixin Cao, Dániel Marx:
Chordal Editing is Fixed-Parameter Tractable. 214-225 - Jian-Jia Chen, Mong-Jen Kao, D. T. Lee, Ignaz Rutter, Dorothea Wagner:
Online Dynamic Power Management with Hard Real-Time Guarantees. 226-238 - Suryajith Chillara, Partha Mukhopadhyay:
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. 239-250 - Marek Cygan, Tomasz Kociumaka:
Constant Factor Approximation for Capacitated k-Center with Outliers. 251-262 - Dariusz Dereniowski, Adrian Kosowski, Dominik Pajak, Przemyslaw Uznanski:
Bounds on the Cover Time of Parallel Rotor Walks. 263-275 - Yann Disser, Max Klimm, Nicole Megow, Sebastian Stiller:
Packing a Knapsack of Unknown Capacity. 276-287 - Pål Grønås Drange, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger:
Exploring Subexponential Parameterized Complexity of Completion Problems. 288-299 - Yuval Filmus, Massimo Lauria, Mladen Miksa, Jakob Nordström, Marc Vinyals:
From Small Space to Small Width in Resolution. 300-311 - Valentin Garnero, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos:
Explicit Linear Kernels via Dynamic Programming. 312-324 - Dmitry Gavinsky, Pavel Pudlák:
Partition Expanders. 325-336 - Pawel Gawrychowski, Florin Manea, Dirk Nowotka:
Testing Generalised Freeness of Words. 337-349 - Andreas Göbel, Leslie Ann Goldberg, David Richerby:
Counting Homomorphisms to Cactus Graphs Modulo 2. 350-361 - Mathieu Hoyrup:
Irreversible computable functions. 362-373 - Martin Huschenbett, Manfred Kufleitner:
Ehrenfeucht-Fraïssé Games on Omega-Terms. 374-385 - Tomohiro I, Juha Kärkkäinen, Dominik Kempa:
Faster Sparse Suffix Sorting. 386-396 - Gábor Ivanyos, Marek Karpinski, Youming Qiao, Miklos Santha:
Generalized Wong sequences and their applications to Edmonds' problems. 397-408 - Kazuo Iwama, Atsuki Nagao:
Read-Once Branching Programs for Tree Evaluation Problems. 409-420 - Emmanuel Jeandel:
Computability of the entropy of one-tape Turing machines. 421-432 - Tomas Jelinek, Marcus Klaas, Guido Schäfer:
Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players. 433-444 - Artur Jez, Markus Lohrey:
Approximation of smallest linear tree grammar. 445-457 - Ken-ichi Kawarabayashi, Mikkel Thorup:
Coloring 3-colorable graphs with o(n^{1/5}) colors. 458-469 - Dennis Komm, Rastislav Královic, Richard Královic, Tobias Mömke:
Randomized Online Algorithms with High Probability Guarantees. 470-481 - Robin Kothari:
An optimal quantum algorithm for the oracle identification problem. 482-493 - Timo Kötzing:
A Solution to Wiehagen's Thesis. 494-505 - Moshe Lewenstein, Yakov Nekrich, Jeffrey Scott Vitter:
Space-Efficient String Indexing for Wildcard Pattern Matching. 506-517 - Diego Figueira, Leonid Libkin:
Synchronizing Relations on Words. 518-529 - Markus Lohrey, Georg Zetzsche:
On Boolean closed full trios and rational Kripke frames. 530-541 - Dániel Marx, Michal Pilipczuk:
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask). 542-553 - John C. Mitchell, Joe Zimmerman:
Data-Oblivious Data Structures. 554-565 - Benoit Monin:
Higher randomness and forcing with closed sets. 566-577 - Nabil H. Mustafa, Saurabh Ray:
Near-Optimal Generalisations of a Theorem of Macbeath. 578-589 - Dung T. Nguyen, Alan L. Selman:
Non-autoreducible Sets for NEXP. 590-601 - André Nies:
Differentiability of polynomial time computable functions. 602-613 - Adeline Pierrot, Dominique Rossin:
2-Stack Sorting is polynomial. 614-626 - Michele Scquizzato, Francesco Silvestri:
Communication Lower Bounds for Distributed-Memory Computations. 627-638 - Martin Skutella, Maxim Sviridenko, Marc Uetz:
Stochastic Scheduling on Unrelated Machines. 639-650 - Hannes Uppman:
Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains. 651-662 - Thomas Watson:
The Complexity of Deciding Statistical Properties of Samplable Distributions. 663-674 - Jun-ichi Yamamoto, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Faster Compact On-Line Lempel-Ziv Factorization. 675-686
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 2026-01-27 00:42 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:
