Table of Contents

• Frontmatter, Table of Contents, Preface, Conference Organization, Author IndexKamal Lodaya, Meena Mahajan. [doi]
• Expressiveness of streaming string transducersRajeev Alur, Pavol Cerný. 1-12 [doi]
• Special tree-width and the verification of monadic second-order graph pr opertiesBruno Courcelle. 13-29 [doi]
• On extracting computations from propositional proofs (a survey)Pavel Pudlák. 30-41 [doi]
• Recent Progress and Open Problems in Algorithmic Convex GeometrySantosh Vempala. 42-64 [doi]
• Playing in stochastic environment: from multi-armed bandits to two-player gamesWieslaw Zielonka. 65-72 [doi]
• Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-widthRobert Ganian, Petr Hlinený, Jan Obdrzálek. 73-83 [doi]
• Satisfiability of Acyclic and Almost Acyclic CNF FormulasSebastian Ordyniak, Daniël Paulusma, Stefan Szeider. 84-95 [doi]
• The effect of girth on the kernelization complexity of Connected Dominating SetNeeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh. 96-107 [doi]
• One-Counter Stochastic GamesTomás Brázdil, Václav Brozek, Kousha Etessami. 108-119 [doi]
• ATL with Strategy Contexts: Expressiveness and Model CheckingArnaud Da Costa Lopes, François Laroussinie, Nicolas Markey. 120-132 [doi]
• Reasoning About StrategiesFabio Mogavero, Aniello Murano, Moshe Y. Vardi. 133-144 [doi]
• New Results on Quantum Property TestingSourav Chakraborty, Eldar Fischer, Arie Matsliah, Ronald de Wolf. 145-156 [doi]
• Lower bounds for Quantum Oblivious TransferAndré Chailloux, Iordanis Kerenidis, Jamie Sikora. 157-168 [doi]
• Minimizing Busy Time in Multiple Machine Real-time SchedulingRohit Khandekar, Baruch Schieber, Hadas Shachnai, Tami Tamir. 169-180 [doi]
• A Near-linear Time Constant Factor Algorithm for Unsplittable Flow Problem on Line with Bag ConstraintsVenkatesan T. Chakaravarthy, Anamitra R. Choudhury, Yogish Sabharwal. 181-191 [doi]
• Place-Boundedness for Vector Addition Systems with one zero-testRémi Bonnet, Alain Finkel, Jérôme Leroux, Marc Zeitoun. 192-203 [doi]
• Model checking time-constrained scenario-based specificationsS. Akshay, Paul Gastin, Madhavan Mukund, K. Narayan Kumar. 204-215 [doi]
• Global Model Checking of Ordered Multi-Pushdown SystemsMohamed Faouzi Atig. 216-227 [doi]
• The Complexity of Model Checking (Collapsible) Higher-Order Pushdown SystemsMatthew Hague, Anthony Widjaja To. 228-239 [doi]
• A graph polynomial for independent sets of bipartite graphsQi Ge, Daniel Stefankovic. 240-250 [doi]
• Finding Independent Sets in Unions of Perfect GraphsVenkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal. 251-259 [doi]
• Fast equivalence-checking for normed context-free processesWojciech Czerwinski, Slawomir Lasota. 260-271 [doi]
• Generalizing the powerset construction, coalgebraicallyAlexandra Silva, Filippo Bonchi, Marcello M. Bonsangue, Jan J. M. M. Rutten. 272-283 [doi]
• Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite SystemsNicholas Radcliffe, Rakesh M. Verma. 284-295 [doi]
• Deterministic Black-Box Identity Testing pi -Ordered Algebraic Branching ProgramsMaurice Jansen, Youming Qiao, Jayalal M. N. Sarma. 296-307 [doi]
• Computing Rational Radical Sums in Uniform TC^0Paul Hunter, Patricia Bouyer, Nicolas Markey, Joël Ouaknine, James Worrell. 308-316 [doi]
• Graph Isomorphism is not AC^0 reducible to Group IsomorphismArkadev Chattopadhyay, Jacobo Torán, Fabian Wagner. 317-326 [doi]
• Colored Hypergraph Isomorphism is Fixed Parameter TractableVikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda. 327-337 [doi]
• Global Escape in Multiparty SessionsSara Capecchi, Elena Giachino, Nobuko Yoshida. 338-351 [doi]
• Computationally Sound Abstraction and Verification of Secure Multi-Party ComputationsMichael Backes, Matteo Maffei, Esfandiar Mohammadi. 352-363 [doi]
• Model Checking Concurrent Programs with Nondeterminism and RandomizationRohit Chadha, A. Prasad Sistla, Mahesh Viswanathan. 364-375 [doi]
• Two Size Measures for Timed LanguagesEugene Asarin, Aldric Degorre. 376-387 [doi]
• Average Analysis of Glushkov Automata under a BST-Like ModelCyril Nicaud, Carine Pivoteau, Benoît Razet. 388-399 [doi]
• Beyond Hyper-Minimisation---Minimising DBAs and DPAs is NP-CompleteSven Schewe. 400-411 [doi]
• Parityizing Rabin and StreettUdi Boker, Orna Kupferman, Avital Steinitz. 412-423 [doi]
• Finding Sparser Directed SpannersPiotr Berman, Sofya Raskhodnikova, Ge Ruan. 424-435 [doi]
• Combinatorial Problems with Discounted Price Functions in Multi-agent SystemsGagan Goel, Pushkar Tripathi, Lei Wang. 436-446 [doi]
• Quasi-Random PCP and Hardness of 2-Catalog SegmentationRishi Saket. 447-458 [doi]
• Determining the Winner of a Dodgson Election is HardMichael R. Fellows, Bart M. P. Jansen, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh. 459-468 [doi]
• Verifying Recursive Active Documents with Positive Data Tree RewritingBlaise Genest, Anca Muscholl, Zhilin Wu. 469-480 [doi]
• Temporal Logics on Words with Multiple Data ValuesAhmet Kara, Thomas Schwentick, Thomas Zeume. 481-492 [doi]
• First-Order Logic with Reachability Predicates on Infinite SystemsStefan Schulz. 493-504 [doi]
• Generalized Mean-payoff and Energy GamesKrishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Jean-François Raskin. 505-516 [doi]