Conferences in DBLP
Gian Luigi Ferrari , Ugo Montanari , Emilio Tuosto A LTS Semantics of Ambients via Graph Synchronization with Mobility. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:1-16 [Conf ] Fabio Alessi , Mariangiola Dezani-Ciancaglini , Furio Honsell Filter Models and Easy Terms. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:17-37 [Conf ] Silvia Ghilezan , Viktor Kuncak Confluence of Untyped Lambda Calculus via Simple Types. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:38-49 [Conf ] Mario Coppo , Daniel Hirschkoff Incremental Inference of Partial Types. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:50-73 [Conf ] Luca Paolini Call-by-Value Separability and Computability. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:74-89 [Conf ] Juraj Hromkovic , Kathleen Steinhöfel , Peter Widmayer Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:90-106 [Conf ] Klaus Jansen , Monaldo Mastrolilli , Roberto Solis-Oba Job Shop Scheduling Problems with Controllable Processing Times. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:107-122 [Conf ] Carlo Mereghetti , Beatrice Palano Upper Bounds on the Size of One-Way Quantum Finite Automata. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:123-135 [Conf ] Daniela Besozzi , Claudio Zandron , Giancarlo Mauri , Nicoletta Sabadini P Systems with Gemmation of Mobile Membranes. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:136-153 [Conf ] Giuseppe Prencipe Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile Robots. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:154-171 [Conf ] Alessandra Cherubini , Stefano Crespi-Reghizzi , Pierluigi San Pietro Some Structural Properties of Associative Language Descriptions. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:172-183 [Conf ] Dora Giammarresi , Rosa Montalbano , Derick Wood Block-Deterministic Regular Languages. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:184-196 [Conf ] Marcella Anselmo Constructing Finite Maximal Codes from Schützenberger Conjecture. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:197-214 [Conf ] Davide Ancona , Christopher Anderson , Ferruccio Damiani , Sophia Drossopoulou , Paola Giannini , Elena Zucca An Effective Translation of Fickle into Java. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:215-234 [Conf ] Michele Bugliesi , Giuseppe Castagna , Silvia Crafa Subtyping and Matching for Mobile Objects. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:235-255 [Conf ] Diletta Cacciagrano , Flavio Corradini On Synchronous and Asynchronous Communication Paradigms. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:256-268 [Conf ] Lars Jacobsen , Kim S. Larsen Complexity of Layered Binary Search Trees with Relaxed Balance. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:269-284 [Conf ] Jirí Fiala , Jan Kratochvíl , Andrzej Proskurowski Distance Constrained Labeling of Precolored Trees. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:285-292 [Conf ] Lars Jacobsen , Kim S. Larsen Exponentially Decreasing Number of Operations in Balanced Trees. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:293-311 [Conf ] Giorgio Ausiello , Paolo Giulio Franciosa , Daniele Frigioni Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:312-327 [Conf ] Alexis C. Kaporis , Lefteris M. Kirousis , Yannis C. Stamatiou , Malvina Vamvakari , Michele Zito Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:328-338 [Conf ] André Große , Jörg Rothe , Gerd Wechsung Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:339-356 [Conf ] Paolo D'Arco On the Distribution of a Key Distribution Center. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:357-369 [Conf ] Stelvio Cimato , Annalisa De Bonis Online Advertising: Secure E-coupons. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:370-383 [Conf ] Nicola Olivetti , Camilla Schwind A Calculus and Complexity Bound for Minimal Conditional Logic. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:384-404 [Conf ] Matteo Baldoni , Laura Giordano , Alberto Martelli , Viviana Patti Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:405-425 [Conf ] Emanuele Viola E-unifiability via Narrowing. [Citation Graph (0, 0)][DBLP ] ICTCS, 2001, pp:426-438 [Conf ]