| 2011 | Semantics of Higher-Order Quantum Computation via Geometry of Interaction. | Ichiro Hasuo, Naohiko Hoshino |
| 2011 | Continuous Random Variables. | Jean Goubault-Larrecq, Daniele Varacca |
| 2011 | Powermonads and Tensors of Unranked Effects. | Sergey Goncharov, Lutz Schrder |
| 2011 | The Complexity of Verifying Ground Tree Rewrite Systems. | Stefan Gller, Anthony Widjaja Lin |
| 2011 | Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma. | Diego Figueira, Santiago Figueira, Sylvain Schmitz, Philippe Schnoebelen |
| 2011 | A Decidable Two-Way Logic on Data Words. | Diego Figueira |
| 2011 | The Computational Meaning of Probabilistic Coherence Spaces. | Thomas Ehrhard, Michele Pagani, Christine Tasson |
| 2011 | Isomorphisms of Types in the Presence of Higher-Order References. | Pierre Clairambault |
| 2011 | Imperative Programs as Proofs via Game Semantics. | Martin Churchill, James Laird, Guy McCusker |
| 2011 | Listings and Logics. | Yijia Chen, Jrg Flum |
| 2011 | Qualitative Tree Languages. | Arnaud Carayol, Axel Haddad, Olivier Serre |
| 2011 | What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBL. | Davide Bresolin, Angelo Montanari, Pietro Sala, Guido Sciavicco |
| 2011 | Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. | Toms Brzdil, Vclav Brozek, Krishnendu Chatterjee, Vojtech Forejt, Antonn Kucera |
| 2011 | Temporal Specifications with Accumulative Values. | Udi Boker, Krishnendu Chatterjee, Thomas A. Henzinger, Orna Kupferman |
| 2011 | Automata with Group Actions. | Mikolaj Bojanczyk, Bartek Klin, Slawomir Lasota |
| 2011 | Decidability of Definability. | Manuel Bodirsky, Michael Pinsker, Todor Tsankov |
| 2011 | First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees. | Lars Birkedal, Rasmus Ejlers Mgelberg, Jan Schwinghammer, Kristian Stvring |
| 2011 | Regular Repair of Specifications. | Michael Benedikt, Gabriele Puppis, Cristian Riveros |
| 2011 | The Dichotomy for Conservative Constraint Satisfaction Problems Revisited. | Libor Barto |
| 2011 | CoQMTU: A Higher-Order Type Theory with a Predicative Hierarchy of Universes Parametrized by a Decidable First-Order Theory. | Bruno Barras, Jean-Pierre Jouannaud, Pierre-Yves Strub, Qian Wang |
| 2011 | A Why-on-Earth Tutorial on Finite Model Theory. | Albert Atserias |
| 2011 | Rigorous Approximated Determinization of Weighted Automata. | Benjamin Aminof, Orna Kupferman, Robby Lampert |
| 2011 | Noncomputable Conditional Distributions. | Nathanael L. Ackerman, Cameron E. Freer, Daniel M. Roy |
| 2011 | Computing Optimal Coverability Costs in Priced Timed Petri Nets. | Parosh Aziz Abdulla, Richard Mayr |
| 2010 | Polarity and the Logic of Delimited Continuations. | Noam Zeilberger |