Theoretical Computer Science

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