Abstract is missing.
- A LTS Semantics of Ambients via Graph Synchronization with MobilityGian Luigi Ferrari, Ugo Montanari, Emilio Tuosto. 1-16 [doi]
- Filter Models and Easy TermsFabio Alessi, Mariangiola Dezani-Ciancaglini, Furio Honsell. 17-37 [doi]
- Confluence of Untyped Lambda Calculus via Simple TypesSilvia Ghilezan, Viktor Kuncak. 38-49 [doi]
- Incremental Inference of Partial TypesMario Coppo, Daniel Hirschkoff. 50-73 [doi]
- Call-by-Value Separability and ComputabilityLuca Paolini. 74-89 [doi]
- Job Shop Scheduling with Unit Length Tasks: Bounds and AlgorithmsJuraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer. 90-106 [doi]
- Job Shop Scheduling Problems with Controllable Processing TimesKlaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba. 107-122 [doi]
- Upper Bounds on the Size of One-Way Quantum Finite AutomataCarlo Mereghetti, Beatrice Palano. 123-135 [doi]
- P Systems with Gemmation of Mobile MembranesDaniela Besozzi, Claudio Zandron, Giancarlo Mauri, Nicoletta Sabadini. 136-153 [doi]
- Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile RobotsGiuseppe Prencipe. 154-171 [doi]
- Some Structural Properties of Associative Language DescriptionsAlessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro. 172-183 [doi]
- Block-Deterministic Regular LanguagesDora Giammarresi, Rosa Montalbano, Derick Wood. 184-196 [doi]
- Constructing Finite Maximal Codes from Schützenberger ConjectureMarcella Anselmo. 197-214 [doi]
- An Effective Translation of Fickle into JavaDavide Ancona, Christopher Anderson, Ferruccio Damiani, Sophia Drossopoulou, Paola Giannini, Elena Zucca. 215-234 [doi]
- Subtyping and Matching for Mobile ObjectsMichele Bugliesi, Giuseppe Castagna, Silvia Crafa. 235-255 [doi]
- On Synchronous and Asynchronous Communication ParadigmsDiletta Cacciagrano, Flavio Corradini. 256-268 [doi]
- Complexity of Layered Binary Search Trees with Relaxed BalanceLars Jacobsen, Kim S. Larsen. 269-284 [doi]
- Distance Constrained Labeling of Precolored TreesJirí Fiala, Jan Kratochvíl, Andrzej Proskurowski. 285-292 [doi]
- Exponentially Decreasing Number of Operations in Balanced TreesLars Jacobsen, Kim S. Larsen. 293-311 [doi]
- Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental ApproachGiorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni. 312-327 [doi]
- Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability ThresholdAlexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito. 328-338 [doi]
- Relating Partial and Complete Solutions and the Complexity of Computing Smallest SolutionsAndré Große, Jörg Rothe, Gerd Wechsung. 339-356 [doi]
- On the Distribution of a Key Distribution CenterPaolo D Arco. 357-369 [doi]
- Online Advertising: Secure E-couponsStelvio Cimato, Annalisa De Bonis. 370-383 [doi]
- A Calculus and Complexity Bound for Minimal Conditional LogicNicola Olivetti, Camilla Schwind. 384-404 [doi]
- Reasoning about Complex Actions with Incomplete Knowledge: A Modal ApproachMatteo Baldoni, Laura Giordano, Alberto Martelli, Viviana Patti. 405-425 [doi]
- E-unifiability via NarrowingEmanuele Viola. 426-438 [doi]