Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar7. ICTCS 2001: Torino, Italy
Antonio Restivo, Simona Ronchi Della Rocca, Luca Roversi:
Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings. Lecture Notes in Computer Science 2202, Springer 2001, ISBN 3-540-42672-8
Invited Talk 1
- Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto:
A LTS Semantics of Ambients via Graph Synchronization with Mobility. 1-16
Lambda Calculus and Types
Algorithms and Data Structures I
- Juraj Hromkovic, Kathleen Steinhöfel, Peter Widmayer:
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. 90-106 - Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba:
Job Shop Scheduling Problems with Controllable Processing Times. 107-122
New Computing Paradigms
- Carlo Mereghetti, Beatrice Palano:
Upper Bounds on the Size of One-Way Quantum Finite Automata. 123-135 - Daniela Besozzi, Claudio Zandron, Giancarlo Mauri, Nicoletta Sabadini:
P Systems with Gemmation of Mobile Membranes. 136-153 - Giuseppe Prencipe:
Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile Robots. 154-171
Formal Languages
- Alessandra Cherubini, Stefano Crespi-Reghizzi, Pierluigi San Pietro:
Some Structural Properties of Associative Language Descriptions. 172-183
Objects and Mobility
- Davide Ancona, Christopher Anderson, Ferruccio Damiani, Sophia Drossopoulou, Paola Giannini, Elena Zucca:
An Effective Translation of Fickle into Java. 215-234 - Michele Bugliesi, Giuseppe Castagna, Silvia Crafa:
Subtyping and Matching for Mobile Objects. 235-255 - Diletta Cacciagrano, Flavio Corradini:
On Synchronous and Asynchronous Communication Paradigms. 256-268
Algorithms and Data Structures II
- Lars Jacobsen, Kim S. Larsen:
Complexity of Layered Binary Search Trees with Relaxed Balance. 269-284 - Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski:
Distance Constrained Labeling of Precolored Trees. 285-292 - Lars Jacobsen, Kim S. Larsen:
Exponentially Decreasing Number of Operations in Balanced Trees. 293-311
Invited Talk 2
- Giorgio Ausiello, Paolo Giulio Franciosa, Daniele Frigioni:
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. 312-327
Computational Complexity
- Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito:
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. 328-338 - André Große, Jörg Rothe, Gerd Wechsung:
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. 339-356
Security
Logics and Logic Programming
- Nicola Olivetti, Camilla Schwind:
A Calculus and Complexity Bound for Minimal Conditional Logic. 384-404 - Matteo Baldoni, Laura Giordano, Alberto Martelli, Viviana Patti:
Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach. 405-425
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-10-22 22:50 CEST by the dblp team