default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th IFIP TCS 2008: Milano, Italy
- Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri, C.-H. Luke Ong:
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. IFIP 273, Springer 2008, ISBN 978-0-387-09679-7
Track A
Invited talks
- Dora Giammarresi, Antonio Restivo:
Ambiguity and Complementation in Recognizable Two-dimensional Languages. 5-20 - Tim Roughgarden:
Algorithmic Game Theory: Some Greatest Hits and Future Directions. 21-42 - A. N. Trahtman:
Synchronizing Road Coloring. 43-53
Contributed talks
- Rena Bakhshi
, Wan J. Fokkink, Jun Pang, Jaco van de Pol:
Leader Election in Anonymous Rings: Franklin Goes Probabilistic. 57-72 - Tobias Berg, Harald Hempel:
Inverse Problems Have Inverse Complexity. 73-86 - Alberto Bertoni, Christian Choffrut, Roberto Radicioni:
Literal Shuffle of Compressed Words. 87-100 - Alexandre Blondin Massé, Srecko Brlek, Andrea Frosini, Sébastien Labbé, Simone Rinaldi:
Reconstructing words from a fixed palindromic length sequence. 101-114 - Olivier Cogis, Benoît Darties, Sylvain Durand, Jean-Claude König, Geneviève Simonet:
The mv-decomposition: definition and application to the distance-2 broadcast problem in multi-hops radio networks. 115-126 - Amin Coja-Oghlan, André Lanka:
Partitioning Random Graphs with General Degree Distributions. 127-141 - Maxime Crochemore, Alessandra Gabriele, Filippo Mignosi, Mauriana Pesaresi:
On the Longest Common Factor Problem. 143-155 - Alberto Dennunzio, Pierre Guillon, Benoît Masson:
Stable Dynamics of Sand Automata. 157-169 - Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl:
On tractability of Cops and Robbers game. 171-185 - Grégory Lafitte, Michael Weiss:
Computability of Tilings. 187-201 - Xingwu Liu, Juhua Pu, Jianzhong Pan:
A Classification of Degenerate Loop Agreement. 203-213 - Alexander Okhotin, Panos Rondogiannis:
On the expressive power of univariate equations over sets of natural numbers. 215-227 - Nicolas Ollinger, Gaétan Richard:
Collisions and their Catenations: Ultimately Periodic Tilings of the Plane. 229-240 - Riku Saikkonen, Eljas Soisalon-Soininen:
Cache-sensitive Memory Layout for Binary Trees. 241-255
Track B
Invited talks
- Luca Cardelli:
From Processes to ODEs by Chemistry. 261-281 - Thomas Ehrhard:
Differential Linear Logic and Processes. 283 - Javier Esparza, Stefan Kiefer, Michael Luttenberger:
Solving Monotone Polynomial Equations. 285-298
Contributed talks
- Luca Aceto, Wan J. Fokkink, Anna Ingólfsdóttir, Mohammad Reza Mousavi:
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras. 301-316 - Luca Aceto, Anna Ingólfsdóttir, Bas Luttik, Paul van Tilburg:
Finite Equational Bases for Fragments of CCS with Restriction and Relabelling. 317-332 - Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre:
µ-calculus Pushdown Module Checking with Imperfect State Information. 333-348 - Frédéric Blanqui, Jean-Pierre Jouannaud, Pierre-Yves Strub:
From Formal Proofs to Mathematical Proofs: A Safe, Incremental Way for Building in First-order Decision Procedures. 349-365 - Viviana Bono, Ferruccio Damiani, Elena Giachino:
On Traits and Types in a Java-like Setting. 367-382 - Kaustuv Chaudhuri, Dale Miller, Alexis Saurin:
Canonical Sequent Proofs via Multi-Focusing. 383-396 - David de Frutos-Escrig, Carlos Gregorio-Rodríguez:
Universal Coinductive Characterisations of Process Semantics. 397-412 - Romain Demangeon, Daniel Hirschkoff, Davide Sangiorgi:
Static and dynamic typing for the termination of mobile processes. 413-427 - Emmanuel Filiot, Sophie Tison:
Regular n-ary Queries in Trees and Variable Independence. 429-443 - Dietrich Kuske, Markus Lohrey:
Hamiltonicity of automatic graphs. 445-459 - Kamal Lodaya, Paritosh K. Pandya, Simoni S. Shah:
Marking the chops: an unambiguous temporal logic. 461-476 - Roland Meyer:
On Boundedness in Depth in the pi-Calculus. 477-489 - Nicolas Peltier:
A Unified View of Tree Automata and Term Schematisations. 491-505 - Julian Rathke, Pawel Sobocinski:
Deconstructing behavioural theories of mobility. 507-520 - Manfred Schmidt-Schauß, Joachim Niehren, Jan Schwinghammer, David Sabel:
Adequacy of Compositional Translations for Observational Semantics. 521-535 - Mani Swaminathan, Martin Fränzle, Joost-Pieter Katoen:
The Surprising Robustness of (Closed) Timed Automata against Clock-Drift. 537-553
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-10-22 02:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
