Abstract is missing.
- Algorithms for Energy ManagementSusanne Albers. 1-11 [doi]
- Sofic and Almost of Finite Type Tree-ShiftsNathalie Aubrun, Marie-Pierre Béal. 12-24 [doi]
- Proof-Based Design of Security ProtocolsNazim Benaïssa, Dominique Méry. 25-36 [doi]
- Approximating the Minimum Length of Synchronizing Words Is HardMikhail V. Berlinkov. 37-47 [doi]
- Realizability of Dynamic MSC LanguagesBenedikt Bollig, Loïc Hélouët. 48-59 [doi]
- The max quasi-independent set ProblemNicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th. Paschos, O. Pottié. 60-71 [doi]
- Equilibria in Quantitative Reachability GamesThomas Brihaye, Véronique Bruyère, Julie De Pril. 72-83 [doi]
- Quotient Complexity of Closed LanguagesJanusz A. Brzozowski, Galina Jirásková, Chenglong Zou. 84-95 [doi]
- Right-Sequential Functions on Infinite WordsOlivier Carton. 96-106 [doi]
- Zigzags in Turing MachinesAnahí Gajardo, Pierre Guillon. 109-119 [doi]
- Frameworks for Logically Classifying Polynomial-Time Optimisation ProblemsJames Gate, Iain A. Stewart. 120-131 [doi]
- Validating the Knuth-Morris-Pratt Failure Function, Fast and OnlinePawel Gawrychowski, Artur Jez, Lukasz Jez. 132-143 [doi]
- Identical Relations in Symmetric Groups and Separating Words with Reversible AutomataR. A. Gimadeev, Mikhail N. Vyalyi. 144-155 [doi]
- Time Optimal ::::d::::-List Colouring of a GraphNick Gravin. 156-168 [doi]
- The Cantor Space as a Generic Model of Topologically Presented KnowledgeBernhard Heinemann. 169-180 [doi]
- Algorithmics - Is There Hope for a Unified Theory?Juraj Hromkovic. 181-194 [doi]
- Classifying Rankwidth k-DH-GraphsLing-Ju Hung, Ton Kloks. 195-203 [doi]
- Lower Bound on Average-Case Complexity of Inversion of Goldreich s Function by Drunken Backtracking AlgorithmsDmitry Itsykson. 204-215 [doi]
- A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle ProblemGerold Jäger, Weixiong Zhang. 216-227 [doi]
- Balancing Bounded Treewidth CircuitsMaurice Jansen, Jayalal M. N. Sarma. 228-239 [doi]
- Obtaining Online Ecological Colourings by Generalizing First-FitMatthew Johnson 0002, Viresh Patel, Daniël Paulusma, Théophile Trunck. 240-251 [doi]
- Classical Simulation and Complexity of Quantum ComputationsRichard Jozsa. 252-258 [doi]
- Prefix-Free and Prefix-Correct Complexities with Compound ConditionsElena Kalinina. 259-265 [doi]
- Monotone Complexity of a PairPavel Karpovich. 266-275 [doi]
- Symbolic Models for Single-Conclusion Proof LogicsVladimir N. Krupski. 276-287 [doi]
- Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFAPavel V. Martyugin. 288-302 [doi]
- Advancing Matrix Computations with Randomized PreprocessingVictor Y. Pan, Guoliang Qian, Ailong Zheng. 303-314 [doi]
- Transfinite Sequences of Constructive Predicate LogicsValery Plisko. 315-326 [doi]
- The Quantitative Analysis of User Behavior Online - Data, Models and AlgorithmsPrabhakar Raghavan. 327 [doi]
- A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree ProblemDaniel Binkele-Raible, Henning Fernau. 328-339 [doi]
- Complexity of Propositional ProofsAlexander A. Razborov. 340-342 [doi]
- Quantization of Random Walks: Search Algorithms and Hitting TimeMiklos Santha. 343 [doi]
- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction ProblemsUwe Schöning. 344-349 [doi]
- Growth of Power-Free Languages over Large AlphabetsArseny M. Shur. 350-361 [doi]
- A Partially Synchronizing ColoringAvraham Trakhtman. 362-370 [doi]
- An Encoding Invariant Version of Polynomial Time Computable DistributionsNikolay K. Vereshchagin. 371-383 [doi]
- Prehistoric Phenomena and Self-referentialityJunhua Yu. 384-396 [doi]