Algorithms for Energy Management (Invited Talk) / Susanne Albers |
Sofic and Almost of Finite Type Tree-Shifts / Nathalie Aubrun ; Marie-Pierre Béal |
Proof-Based Design of Security Protocols / Nazim Benaissa ; Dominique Méry |
Approximating the Minimum Length of Synchronizing Words is Hard / Mikhail V. Berlinkov |
Realizability of Dynamic MSC Languages / Benedikt Bollig ; Loïc Hélouët |
The Max Quasi-Independent Set Problem / N. Bourgeois ; A. Giannakos ; G. Lucarelli ; I. Milis ; V. Th. Paschos ; O. Pottié |
Equilibria in Quantitative Reachability Games / Thomas Brihaye ; Véronique Bruyère ; Julie De Pril |
Quotient Complexity of Closed Languages / Janusz Brzozowski ; Galina Jirásková ; Chenglong Zou |
Right-Sequential Functions on Infinite Words / Olivier Carton |
Kernelization (Invited Talk) / Fedor V. Fomin |
Zigzags in Turing Machines / Anahà Gajardo ; Pierre Guillon |
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems / James Gate ; Iain A. Stewart |
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online / Pawet Gawrychowski ; Artur Jez ; Lukasz Jez |
Identical Relations in Symmetric Groups and Separating Words with Reversible Automata / R.A. Gimadeev ; M.N. Vyalyi |
Time Optimal d-List Colouring of a Graph / Nick Gravin |
The Cantor Space as a Generic Model of Topologically Presented Knowledge / Bernhard Heinemann |
Algorithmics - Is There Hope for a Unified Theory? (Invited Talk) / Juraj Hromkovic |
Classifying Rankwidth k-DH-Graphs / Ling-Ju Hung ; Ton Kloks |
Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms / Dmitry Itsykson |
A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem / Gerold Jäger ; Weixiong Zhang |
Balancing Bounded Treewidth Circuits / Maurice Jansen ; Jayalal Sarma M.N. |
Obtaining Online Ecological Colourings by Generalizing First-Fit / Matthew Johnson ; Viresh Patel ; Daniël Paulusma ; Théophile Trunck |
Classical Simulation and Complexity of Quantum Computations (Invited Talk) / Richard Jozsa |
Prefix-Free and Prefix-Correct Complexities with Compound Conditions / Elena Kalinina |
Monotone Complexity of a Pair / Pavel karpovich |
Symbolic Models for Single-Conclusion Proof Logics / Vladimir N. Krupski |
Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA / P.V. Martyugin |
Advancing Matrix Computations with Randomized Preprocessing / Victor Y. Pan ; Guoliang Qian ; Ai-Long Zheng |
Transfinite Sequences of Constructive Predicate Logics / Valery Plisko |
The Quantitative Analysis of User Behavior Online - Data, Models and Algorithms (Abstract of Invited Talk) / Prabhakar Raghavan |
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem / Daniel Binkele-Raible ; Henning Fernau |
Complexity of Propositional Proofs (Invited Talk) / Alexander Razborov |
Quantization of Random Walks: Search Algorithms and Hitting Time (Extended Abstract of Invited Talk) / Miklos Santha |
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems (Invited Talk) / Uwe Schöning |
Growth of Power-Free Languages over Large Alphabets / Arseny M. Shur |
A Partially Synchronizing Coloring / Avraham N. Trahtman |
An Encoding Invariant Version of Polynomial Time Computable Distributions / Nikolay Vereshchagin |
Prehistoric Phenomena and Self-referentiality / Junhua Yu |
Author Index |
Algorithms for Energy Management (Invited Talk) / Susanne Albers |
Sofic and Almost of Finite Type Tree-Shifts / Nathalie Aubrun ; Marie-Pierre Béal |
Proof-Based Design of Security Protocols / Nazim Benaissa ; Dominique Méry |