IFIP TC6 Open Digital Library

5. IFIP TCS 2008: Milano, Italy

Fifth IFIP International Conference On Theoretical Computer Science - TCS 2008, IFIP 20th World Computer Congress, TC 1, Foundations of Computer Science, September 7-10, 2008, Milano, Italy

Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri, C.-H. Luke Ong

Springer, IFIP 273, ISBN: 978-0-387-09679-7


Track A

Invited talks

Ambiguity and Complementation in Recognizable Two-dimensional Languages.

Dora Giammarresi, Antonio Restivo


Algorithmic Game Theory: Some Greatest Hits and Future Directions.

Tim Roughgarden


Synchronizing Road Coloring.

A. N. Trahtman


Contributed talks

Leader Election in Anonymous Rings: Franklin Goes Probabilistic.

Rena Bakhshi, Wan Fokkink, Jun Pang, Jaco van de Pol


Inverse Problems Have Inverse Complexity.

Tobias Berg, Harald Hempel


Literal Shuffle of Compressed Words.

Alberto Bertoni, Christian Choffrut, Roberto Radicioni


Reconstructing words from a fixed palindromic length sequence.

Alexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé, Simone Rinaldi


The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks.

Olivier Cogis, Benoît Darties, Sylvain Durand, Jean-Claude König, Geneviève Simonet


Partitioning Random Graphs with General Degree Distributions.

Amin Coja-Oghlan, André Lanka


On the Longest Common Factor Problem.

Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi


Stable Dynamics of Sand Automata.

Alberto Dennunzio, Pierre Guillon, Benoît Masson


On tractability of Cops and Robbers game.

Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl


Computability of Tilings.

Grégory Lafitte, Michael Weiss


A Classification of Degenerate Loop Agreement.

Xingwu Liu, Juhua Pu, Jianzhong Pan


On the expressive power of univariate equations over sets of natural numbers.

Alexander Okhotin, Panos Rondogiannis


Collisions and their Catenations: Ultimately Periodic Tilings of the Plane.

Nicolas Ollinger, Gaétan Richard


Cache-sensitive Memory Layout for Binary Trees.

Riku Saikkonen, Eljas Soisalon-Soininen


Track B

Invited talks

From Processes to ODEs by Chemistry.

Luca Cardelli


Differential Linear Logic and Processes.

Thomas Ehrhard


Solving Monotone Polynomial Equations.

Javier Esparza, Stefan Kiefer, Michael Luttenberger


Contributed talks

Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras.

Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Mohammad Reza Mousavi


Finite Equational Bases for Fragments of CCS with Restriction and Relabelling.

Luca Aceto, Anna Ingólfsdóttir, Bas Luttik, Paul van Tilburg


µ-calculus Pushdown Module Checking with Imperfect State Information.

Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre


From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures.

Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub


On Traits and Types in a Java-like Setting.

Viviana Bono, Ferruccio Damiani, Elena Giachino


Canonical Sequent Proofs via Multi-Focusing.

Kaustuv Chaudhuri, Dale Miller, Alexis Saurin


Universal Coinductive Characterisations of Process Semantics.

David de Frutos-Escrig, Carlos Gregorio-Rodríguez


Static and dynamic typing for the termination of mobile processes.

Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi


Regular n-ary Queries in Trees and Variable Independence.

Emmanuel Filiot, Sophie Tison


Hamiltonicity of automatic graphs.

Dietrich Kuske, Markus Lohrey


Marking the chops: an unambiguous temporal logic.

Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah


On Boundedness in Depth in the pi-Calculus.

Roland Meyer


A Unified View of Tree Automata and Term Schematisations.

Nicolas Peltier


Deconstructing behavioural theories of mobility.

Julian Rathke, Pawel Sobocinski


Adequacy of Compositional Translations for Observational Semantics.

Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel


The Surprising Robustness of (Closed) Timed Automata against Clock-Drift.

Mani Swaminathan, Martin Fränzle, Joost-Pieter Katoen