Front matter
1-16
A LTS Semantics of Ambients via Graph Synchronization with Mobility
GianLuigi Ferrari, Ugo Montanari and Emilio Tuosto
17-37
Filter Models and Easy Terms
Fabio Alessi, Mariangiola Dezani-Ciancaglini and Furio Honsell
38-49
Confluence of Untyped Lambda Calculus via Simple Types
Silvia Ghilezan and Viktor Kunčak
50-73
Incremental Inference of Partial Types
Mario Coppo and Daniel Hirschkoff
74-89
Call-by-Value Separability and Computability
Luca Paolini
90-106
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
Juraj Hromkovič, Kathleen Steinhöfel and Peter Widmayer
107-122
Job Shop Scheduling Problems with Controllable Processing Times
Klaus Jansen, Monaldo Mastrolilli and Roberto Solis-Oba
123-135
Upper Bounds on the Size of One-Way Quantum Finite Automata
Carlo Mereghetti and Beatrice Palano
136-153
P Systems with Gemmation of Mobile Membranes
Daniela Besozzi, Claudio Zandron, Giancarlo Mauri and Nicoletta Sabadini
154-171
Instantaneous Actions
vs.
Full Asynchronicity
: Controlling and Coordinating a Sset of Autonomous Mobile Robots
Giuseppe Prencipe
172-183
Some Structural Properties of Associative Language Descriptions
Alessandra Cherubini, Stefano Crespi Reghizzi and Pierluigi San Pietro
184-196
Block-Deterministic Regular Languages
Dora Giammarresi, Rosa Montalbano and Derick Wood
197-214
Constructing Finite Maximal Codes from Schützenberger Conjecture
Marcella Anselmo
215-234
An Effective Translation of
Fickle
into Java
(Extended Abstract)
Davide Ancona, Christopher Anderson, Ferruccio Damiani, Sophia Drossopoulou and Paola Giannini, et al.
235-255
Subtyping and Matching for Mobile Objects
Michele Bugliesi, Giuseppe Castagna and Silvia Crafa
256-268
On Synchronous and Asynchronous Communication Paradigms
Diletta Cacciagrano and Flavio Corradini
269-284
Complexity of Layered Binary Search Trees with Relaxed Balance
Lars Jacobsen and Kim S. Larsen
285-292
Distance Constrained Labeling of Precolored Trees
Jiři Fiala, Jan Kratochvíl and Andrzej Proskurowski
293-311
Exponentially Decreasing Number of Operations in Balanced Trees
Lars Jacobsen and Kim S. Larsen
312-328
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
Giorgio Ausiello, Paolo G. Franciosa and Daniele Frigioni
328-338
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold
Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari and Michele Zito
339-356
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions
André Große, Jörg Rothe and Gerd Wechsung
357-369
On the Distribution of a Key Distribution Center
Paolo D’Arco
370-383
Online Advertising: Secure E-coupons
Stelvio Cimato and Annalisa De Bonis
384-404
A Calculus and Complexity Bound for Minimal Conditional Logic
Nicola Olivetti and Camilla B. Schwind
405-426
Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach
Matteo Baldoni, Laura Giordano, Alberto Martelli and Viviana Patti
426-438
E-unifiability via Narrowing
Emanuele Viola
Back matter