Abstract is missing.
- Clairvoyance and Laziness for on Line Travelling AgentsGiorgio Ausiello. 3
- Proving the Range Property for Lambda Theories and ModelsHenk Barendregt. 4
- Can a Proper Lambda-Model have an R.E. Equational Theory?Chantal Berline. 5
- Session Centered Calculi for Service Oriented ComputingRocco De Nicola. 6-10
- Symmetries in FoundationsGiuseppe Longo. 11
- On the Approximability of Dense Steiner Tree ProblemsMathias Hauptmann. 15-26
- Weak pattern matching in colored graphs: Minimizing the number of connected componentsRiccardo Dondi, Guillaume Fertin, Stéphane Vialette. 27-38
- Weak Markovian Bisimilarity: Abstracting from Prioritized/Weighted Internal Immediate ActionsMarco Bernardo, Alessandro Aldini. 39-56
- Analyzing Non-Interference with respect to ClassesDamiano Zanardini. 57-69
- Computing Minimum Directed Feedback Vertex Set in O(1.9977:::n:::)Igor Razgon. 70-81
- Seeing the Trees and Their Branches in the Forest is HardIyad A. Kanj, Luay Nakhleh, Cuong Than, Ge Xia. 82-93
- Modeling Fuzzy Behaviours in Concurrent SystemsLiliana D Errico, Michele Loreti. 94-105
- A formal framework for compositional compilationDavide Ancona, Elena Zucca. 106-117
- Type inference for polymorphic methods in Java-like languagesDavide Ancona, Giovanni Lagorio, Elena Zucca. 118-129
- Sorting streamed multisetsTravis Gagie. 130-138
- The random generation of derangementsDonatella Merlini, Renzo Sprugnoli, M. Cecilia Verri. 139-150
- The Measure Hypothesis and Efficiency of Polynomial Time Approximation SchemesMathias Hauptmann. 151-162
- Dichotomy Results for Fixed Point Counting in Boolean Dynamical SystemsSven Kosub, Christopher M. Homan. 163-174
- Definable sets in weak Presburger arithmeticChristian Choffrut, Achille Frigeri. 175-186
- On Defining Proofs of Knowledge in the Bare Public Key ModelGiovanni Di Crescenzo, Ivan Visconti. 187-198