Remy Haemmerle, Francois Fages and Sylvain Soliman.
Closures and
Modules within Linear Logic Concurrent Constraint Programming.
Krishnendu Chatterjee.
Stochastic Muller Games are
PSPACE-complete.
Mathieu Brevilliers, Nicolas Chevallier and Dominique
Schmitt.
Triangulations of Line Segments Sets in the Plane.
Olaf Beyersdorff.
The Deduction Theorem for Strong Propositional Proof
Systems.
Christian Glasser, Alan L. Selman, Stephen Travers and Liyu
Zhang.
Non-Mitotic Sets.
Jacobo Toran.
Reductions to Graph Isomorphism.
Herbert Fleischner, Egbert Mujuni, Daniel Paulusma and Stefan
Szeider.
Covering Graphs with Few Complete Bipartite Subgraphs.
Telikepalli Kavitha.
Faster Algorithms for All-Pairs Small Stretch
Distances in Weighted Graphs.
Christian Glasser, Christian Reitwiessner, Stephen Travers and
Matthias Waldherr.
Satisfiability of Algebraic Circuits over Sets of
Natural Numbers.
Michael Backes, Markus Duermuth and Ralf Kuesters.
On Simulatability
Soundness and Mapping Soundness of Symbolic Cryptography.
Andre Hirschowitz, Michel Hirschowitz and Tom Hirschowitz.
A Theory
for Game Theories.
Stephanie Delaune, Steve Kremer and Mark Ryan.
Symbolic bisimulation
for the Applied Pi Calculus.
Andreas Jakoby and Till Tantau.
Logspace Algorithms for Computing
Shortest and Longest Paths in Series-Parallel Graphs.
Noga Alon, Fedor Fomin, Gregory Gutin, Michael Krivelevich and Saket
Saurabh.
Better Algorithms and Bounds for Directed Maximum Leaf
Problems.
Nicolas Baudru and Remi Morin.
Synthesis of Safe Message Passing
Systems.
Krishnendu Chatterjee.
Markov Decision Processes with Multiple
Long-run Average Objectives.
Myrto Arapinis and Marie Duflot.
Bounding messages for free in
security protocols.
Benedikt Bollig, Dietrich Kuske and Ingmar Meinecke.
Propositional
Dynamic Logic for Message-Passing Systems.
Masud Hasan, Therese Biedl and Alejandro Lopez-Ortiz.
Reconstructing
convex polygons and polyhedra from edge and face counts in orthogonal
projections.
Amit Kumar and Yogish Sabharwal.
The priority k-median problem.
Michael Benedikt and Alan Jeffrey.
Efficient and Expressive Tree
Filters.
Yannick Chevalier and Mounira Kourjieh.
Key Substitution in the
Symbolic Analysis of Cryptographic Protocols.
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye and
Marcus Groesser.
Probabilistic and Topological Semantics for Timed
Automata.
Sanjeev Khanna, Keshav Kunal and Benjamin Pierce.
A Formal
Investigation of Diff3.
Ravi Kumar and D Sivakumar.
Communication Lower Bounds via the
Chromatic Number.
R. Inkulu and Sanjiv Kapoor.
Finding a Rectilinear Shortest Path in
R^2 using corridor based staircase structures.
Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung.
Compressed
Dynamic Tries with Applications to LZ-Compression in Sublinear Time
and Space.
Naveen Garg, Amit Kumar and Vinayaka Pandit.
Order Scheduling Models:
Hardness and Algorithms.
Takuro Fukunaga, Magnus Halldorsson and Hiroshi Nagamochi.
Rent-or-Buy
Scheduling and Cost Coloring Problems.
Luigi Santocanale and Walid Belkhir.
Undirected Graphs of Entanglement
Two.
Jerome Leroux and Gregoire Sutre.
Acceleration in Convex Data-Flow
Analysis.
Veronique Cortier, Jeremie Delaitre and Stephanie Delaune.
Safely
composing security protocols.
Diptikalyan Saha.
An Incremental Bisimulation Algorithm.
Sven Schewe.
Solving Parity Games in Big Steps.
Pierre Chambart and Philippe Schnoebelen.
Post Embedding Problem Is
Not Primitive Recursive, With Applications To Channel Systems.
Judicael Courant, Cristian Ene and Yassine Lakhnech.
Computationally
sound typing for Non-Interference: The case of deterministic
encryption
Anand Srivastav and Soren Werth.
Probabilistic Analysis of the Degree
Bounded Minimum Spanning Tree Problem.
S. Akshay, Benedikt Bollig and Paul Gastin.
Automata and Logics for
Timed Message Sequence Charts.
John Hitchcock, Ryan Harkins and A Pavan.
Strong Reductions and.
Isomorphism of Complete Sets