Skip to main content

Papers accepted to track B of ICALP 2012

  • Volker Diekert, Manfred Kufleitner, Klaus Reinhardt and Tobias Walter. Regular Languages are Church-Rosser Congruential
  • John Fearnley and Sven Schewe. Time and Parallelizability Results for Parity Games with Bounded Treewidth
  • Hongfei Fu. Computing Game Metrics on Markov Decision Processes
  • Yaron Velner. The Complexity of Mean-Payoff Automaton Expression
  • Denis Kuperberg and Michael Vanden Boom. On the Expressive Power of Cost Logics over Infinite Words
  • Tomáš Gavenčiak, Daniel Kral and Sang-Il Oum. Deciding first order logic properties of matroids
  • C.-H. Luke Ong and Takeshi Tsukada. Two-Level Game Semantics, Intersection Types and Recursion Schemes
  • Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii and Michael Zakharyaschev. Exponential Lower Bounds and Separation for Query Rewriting
  • Sylvain Salvati, Giulio Manzonetto, Mai Gehrke and Henk Barendregt. Urzyczyn and Loader are Logically Related
  • Michael Benedikt, Pierre Bourhis and Pierre Senellart. Monadic Datalog Containment
  • Mikolaj Bojańczyck and Thomas Place. Regular Languages of Infinite Trees that are Boolean Combinations of Open Sets
  • Mikolaj Bojanczyk and Thomas Place. Model theory in nominal sets
  • Patricia Bouyer, Nicolas Markey and Ocan Sankur. Robust Reachability in Timed Automata: A Game-based Approach
  • Rajeev Alur and Loris D'Antoni. Streaming Tree Transducers
  • Luca Aceto, Arnaud Carayol, Zoltan Esik and Anna Ingolfsdottir. Algebraic Synchronization Trees and Processes
  • Chris Broadbent, Arnaud Carayol, Matthew Hague and Olivier Serre. A Saturation Method for Collapsible Pushdown Systems
  • Tomas Brazdil, Antonin Kucera, Petr Novotný and Dominik Wojtczak. Minimizing Expected Termination Time in One-Counter Markov Decision Processes
  • Gilles Dowek and Pablo Arrighi. Causal graph dynamics
  • Manfred Kufleitner and Alexander Lauser. Lattices of Logical Fragments over Words
  • Bjarki Holm and Anuj Dawar. Pebble Games with Algebraic Rules
  • Mikołaj Bojańczyk and Sławomir Lasota. Application of nominal sets to machine-independent characterization of timed languages
  • Andrzej Murawski and Nikos Tzevelekos. Algorithmic games for full ground references
  • Marcelo Fiore. Generalised Polynomial Functors: Theory and Applications
  • Szymon Toruńczyk. Languages of profinite words and the limitedness problem
  • Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano and Lutz Schröder. Coalgebraic Predicate Logic
  • Grigore Rosu and Andrei Stefanescu. Towards a Unified Theory of Operational and Axiomatic Semantics
  • Maribel Fernandez and Albert Rubio. Nominal Completion for Rewrite Systems with Binders
  • Christopher Broadbent. Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata
  • Anuj Dawar and Albert Atserias. Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers
  • Uday Reddy and Brian Dunphy. An automata-theoretic model of Idealized Algol An automata-theoretic model of Idealized Algol