default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th 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
- Fabio Alessi, Mariangiola Dezani-Ciancaglini, Furio Honsell:
Filter Models and Easy Terms. 17-37 - Silvia Ghilezan, Viktor Kuncak:
Confluence of Untyped Lambda Calculus via Simple Types. 38-49 - Mario Coppo, Daniel Hirschkoff:
Incremental Inference of Partial Types. 50-73 - Luca Paolini:
Call-by-Value Separability and Computability. 74-89
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 - Dora Giammarresi, Rosa Montalbano, Derick Wood:
Block-Deterministic Regular Languages. 184-196 - Marcella Anselmo:
Constructing Finite Maximal Codes from Schützenberger Conjecture. 197-214
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
- Paolo D'Arco:
On the Distribution of a Key Distribution Center. 357-369 - Stelvio Cimato, Annalisa De Bonis:
Online Advertising: Secure E-coupons. 370-383
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 - Emanuele Viola:
E-unifiability via Narrowing. 426-438
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-28 23:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
