Abstract is missing.
- Automata and Program AnalysisThomas Colcombet, Laure Daviaud, Florian Zuleger. 3-10 [doi]
- What One Has to Know When Attacking P vs. NP (Extended Abstract)Juraj Hromkovic, Peter Rossmanith. 11-28 [doi]
- A Tour of Recent Results on Word TransducersAnca Muscholl. 29-33 [doi]
- Some Results of Zoltán Ésik on Regular LanguagesJean-Éric Pin. 34-37 [doi]
- Contextuality in Multipartite Pseudo-Telepathy Graph GamesAnurag Anshu, Peter Høyer, Mehdi Mhalla, Simon Perdrix. 41-55 [doi]
- Generalized Satisfiability Problems via Operator AssignmentsAlbert Atserias, Phokion G. Kolaitis, Simone Severini. 56-68 [doi]
- New Results on Routing via Matchings on GraphsIndranil Banerjee, Dana Richards. 69-81 [doi]
- Energy-Efficient Fast Delivery by Mobile AgentsAndreas Bärtschi, Thomas Tschager. 82-95 [doi]
- Parameterized Aspects of Triangle EnumerationMatthias Bentert, Till Fluschnik, André Nichterlein, Rolf Niedermeier. 96-110 [doi]
- Testing Polynomial Equivalence by Scaling MatricesMarkus Bläser, B. V. Raghavendra Rao, Jayalal Sarma. 111-122 [doi]
- Strong Duality in Horn MinimizationEndre Boros, Ondrej Cepek, Kazuhisa Makino. 123-135 [doi]
- Token Jumping in Minor-Closed ClassesNicolas Bousquet, Arnaud Mary, Aline Parreau. 136-149 [doi]
- Expressive Power of Evolving Neural Networks Working on Infinite Input StreamsJérémie Cabessa, Olivier Finkel. 150-163 [doi]
- Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern MatchingMaxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat. 164-176 [doi]
- Subquadratic Non-adaptive Threshold Group TestingGianluca De Marco, Tomasz Jurdzinski, Michal Rozanski, Grzegorz Stachowiak. 177-189 [doi]
- The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents)Dariusz Dereniowski, Andrzej Lingas, Mia Persson, Dorota Urbanska, Pawel Zylinski. 190-203 [doi]
- FO Model Checking on Map GraphsKord Eickmeyer, Ken-ichi Kawarabayashi. 204-216 [doi]
- Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining GrammarsJoost Engelfriet, Andreas Maletti. 217-229 [doi]
- On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom DegreeChristian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah. 230-242 [doi]
- Decidable Weighted Expressions with Presburger CombinatorsEmmanuel Filiot, Nicolas Mazzocchi, Jean-François Raskin. 243-256 [doi]
- The Complexity of Routing with Few CollisionsTill Fluschnik, Marco Morik, Manuel Sorge. 257-270 [doi]
- Parikh Image of Pushdown AutomataPierre Ganty, Elena Gutiérrez. 271-283 [doi]
- Tropical Combinatorial Nullstellensatz and Fewnomials TestingDima Grigoriev, Vladimir V. Podolskii. 284-297 [doi]
- On Weak-Space Complexity over Complex NumbersPushkar S. Joglekar, B. V. Raghavendra Rao, Siddharth S. Sivakumar. 298-311 [doi]
- Deterministic Oblivious Local Broadcast in the SINR ModelTomasz Jurdzinski, Michal Rozanski. 312-325 [doi]
- Undecidability of the Lambek Calculus with Subexponential and Bracket ModalitiesMax I. Kanovich, Stepan Kuznetsov, Andre Scedrov. 326-340 [doi]
- Decision Problems for Subclasses of Rational Relations over Finite and Infinite WordsChristof Löding, Christopher Spinrath. 341-354 [doi]
- Listing All Fixed-Length Simple Cycles in Sparse Graphs in Optimal TimeGeorge Manoussakis. 355-366 [doi]
- Reliable Communication via Semilattice Properties of Partial KnowledgeAris Pagourtzis, Giorgos Panagiotakos, Dimitris Sakavalas. 367-380 [doi]
- Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation GraphsCharis Papadopoulos, Spyridon Tzimas. 381-394 [doi]
- Determinism and Computational Power of Real Measurement-Based Quantum ComputationSimon Perdrix, Luc Sanselme. 395-408 [doi]
- Busy Beaver Scores and Alphabet SizeHolger Petersen. 409-417 [doi]
- Automatic Kolmogorov Complexity and Normality RevisitedAlexander Shen. 418-430 [doi]