Table of Contents

• Well-Founded and Partial Stable Semantics Logical AspectsPedro Cabalar, Sergei P. Odintsov, David Pearce. 1-11 [doi]
• The Reachability Problem over Infinite GraphsWolfgang Thomas. 12-18 [doi]
• Kolmogorov Complexity and Model SelectionNikolay K. Vereshchagin. 19-24 [doi]
• Automatic Verification of Heap-Manipulating Programs Using Separation LogicHongseok Yang. 25 [doi]
• Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinismArnon Avron, Agata Ciabattoni, Anna Zamansky. 26-37 [doi]
• Integrality Property in Preemptive Parallel Machine SchedulingPhilippe Baptiste, Jacques Carlier, Alexander Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko. 38-46 [doi]
• Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise ClassesOlaf Beyersdorff, Zenon Sadowski. 47-58 [doi]
• ::::k::::-SAT Is No Harder Than Decision-Unique-::::k::::-SATChris Calabro, Ramamohan Paturi. 59-70 [doi]
• Unique Decipherability in the Monoid of Languages: An Application of Rational RelationsChristian Choffrut, Juhani Karhumäki. 71-79 [doi]
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key ModelYi Deng, Giovanni Di Crescenzo, Dongdai Lin, Dengguo Feng. 80-91 [doi]
• Approximability Distance in the Space of ::::H::::-Colourability ProblemsTommy Färnqvist, Peter Jonsson, Johan Thapper. 92-104 [doi]
• On Random Ordering ConstraintsAndreas Goerdt. 105-116 [doi]
• Depth Reduction for Circuits with a Single Layer of Modular Counting GatesKristoffer Arnsfelt Hansen. 117-128 [doi]
• A Feebly Secure Trapdoor FunctionEdward A. Hirsch, Sergey I. Nikolenko. 129-142 [doi]
• Partitioning Graphs into Connected PartsPim van t Hof, Daniël Paulusma, Gerhard J. Woeginger. 143-154 [doi]
• Structural Complexity of AvgBPPDmitry Itsykson. 155-166 [doi]
• Lower Bounds for the Determinantal Complexity of Explicit Low Degree PolynomialsMaurice J. Jansen. 167-178 [doi]
• Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic MultilinearityMaurice J. Jansen, B. V. Raghavendra Rao. 179-190 [doi]
• One-Nonterminal Conjunctive Grammars over a Unary AlphabetArtur Jez, Alexander Okhotin. 191-202 [doi]
• Concatenation of Regular Languages and Descriptional ComplexityGalina Jirásková. 203-214 [doi]
• Approximability of the Maximum Solution Problem for Certain Families of AlgebrasPeter Jonsson, Johan Thapper. 215-226 [doi]
• Complete Complexity Classification of Short Shop SchedulingAlexander Kononov, Sergey Sevastyanov, Maxim Sviridenko. 227-236 [doi]
• Compressed Word Problems in HNN-Extensions and Amalgamated ProductsNiko Haubold, Markus Lohrey. 237-249 [doi]
• Variations on Muchnik s Conditional Complexity TheoremDaniil Musatov, Andrei E. Romashchenko, Alexander Shen. 250-262 [doi]
• Aperiodicity Measure for Infinite SequencesYuri Pritykin, Julya Ulyashkina. 274-285 [doi]
• On the Complexity of Matroid Isomorphism ProblemsB. V. Raghavendra Rao, Jayalal M. N. Sarma. 286-298 [doi]
• Breaking Anonymity by Learning a Unique Minimum Hitting SetDogan Kesdogan, Daniel Mölle, Stefan Richter, Peter Rossmanith. 299-309 [doi]
• The Budgeted Unique Coverage Problem and Color-CodingNeeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar. 310-321 [doi]
• Formal Verification of Gate-Level Computer SystemsMark A. Hillebrand, Sergey Tverdyshev. 322-333 [doi]
• On Models of a Nondeterministic ComputationMikhail N. Vyalyi. 334-345 [doi]
• New Plain-Exponential Time Classes for Graph HomomorphismMagnus Wahlström. 346-355 [doi]
• Languages Recognized with Unbounded Error by Quantum Finite AutomataAbuzer Yakaryilmaz, A. C. Cem Say. 356-367 [doi]