Theoretical computer science

de Carlo Blundo

Theoretical Computer Science: 7th Italian Conference, ICTCS 2001 Torino, Italy, October 4–6, 2001 Proceedings<br />Author: Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-42672-1<br /> DOI: 10.1007/3-540-45446-2<br /><br />Table of Contents:<p></p><ul><li>A LTS Semantics of Ambients via Graph Synchronization with Mobility </li><li>Filter Models and Easy Terms </li><li>Confluence of Untyped Lambda Calculus via Simple Types </li><li>Incremental Inference of Partial Types </li><li>Call-by-Value Separability and Computability </li><li>Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms </li><li>Job Shop Scheduling Problems with Controllable Processing Times </li><li>Upper Bounds on the Size of One-Way Quantum Finite Automata </li><li>P Systems with Gemmation of Mobile Membranes </li><li>Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Sset of Autonomous Mobile Robots </li><li>Some Structural Properties of Associative Language Descriptions </li><li>Block-Deterministic Regular Languages </li><li>Constructing Finite Maximal Codes from Schützenberger Conjecture </li><li>An Effective Translation of Fickle into Java </li><li>Subtyping and Matching for Mobile Objects </li><li>On Synchronous and Asynchronous Communication Paradigms </li><li>Complexity of Layered Binary Search Trees with Relaxed Balance </li><li>Distance Constrained Labeling of Precolored Trees </li><li>Exponentially Decreasing Number of Operations in Balanced Trees </li><li>Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach</li></ul>