ICTCS01: Accepted papers (on a total of 45 submissions)

Title/Link to abstract	Contact person
The unsatisfiability threshold revisited	Michele Zito
E-unifiability via Narrowing	Emanuele Viola
Distance constrained labeling of precolored trees	Jiri Fiala
On the Distribution of a Key Distribution Center	Paolo D'Arco
Complexity of Layered Binary Search Trees with Relaxed Balance	Lars Jacobsen
Instantaneous Actions vs. Full Asynchronicity: Controlling and Coordinating a Set of Autonomous Mobile Robots	Giuseppe Prencipe
On Synchronous and Asynchronous Communication Paradigms	Diletta Romana Cacciagrano
P Systems with Gemmation of Mobile Membranes	Claudio Zandron
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions	Joerg Rothe
Exponentially Decreasing Number of Operations in Balanced Trees	Lars Jacobsen
Constructing finite maximal codes from Schuetzenberger Conjecture	Marcella Anselmo
Job shop scheduling with unit length tasks: Bounds and algorithms	Peter Widmayer
Filter Models and Easy Terms	Fabio  Alessi
Block-Deterministic Regular Languages	Dora Giammarresi
Online Advertising: Secure E-coupons	Stelvio Cimato
Job Shop Scheduling Problems with Controllable Processing Times	Monaldo Mastrolilli
Some structural properties of Associative Language Descriptions	Pierluigi San Pietro
A calculus and complexity bound for minimal conditional logic	nicola olivetti
Call-By-Value Separability and Computability	Luca Paolini
Confluence of untyped lambda calculus via simple types	Silvia Ghilezan
Upper Bounds on the Size of One-way Quantum Finite Automata	Carlo Mereghetti
An effective translation of Fickle into Java	Ferruccio Damiani
Subtyping and Matching for Mobile Objects	MIchele  Bugliesi
Reasoning about Complex Actions with Incomplete Knowledge: a Modal Approach	Matteo Baldoni
Incremental Inference of Partial Types	Mario Coppo