The SCEAS System
Navigation Menu

Conferences in DBLP

Italian Conference on Theoretical Computer Science (ICTCS) (ictcs)
2001 (conf/ictcs/2001)

  1. 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]
  2. Fabio Alessi, Mariangiola Dezani-Ciancaglini, Furio Honsell
    Filter Models and Easy Terms. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:17-37 [Conf]
  3. Silvia Ghilezan, Viktor Kuncak
    Confluence of Untyped Lambda Calculus via Simple Types. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:38-49 [Conf]
  4. Mario Coppo, Daniel Hirschkoff
    Incremental Inference of Partial Types. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:50-73 [Conf]
  5. Luca Paolini
    Call-by-Value Separability and Computability. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:74-89 [Conf]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. Dora Giammarresi, Rosa Montalbano, Derick Wood
    Block-Deterministic Regular Languages. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:184-196 [Conf]
  13. Marcella Anselmo
    Constructing Finite Maximal Codes from Schützenberger Conjecture. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:197-214 [Conf]
  14. 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]
  15. Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
    Subtyping and Matching for Mobile Objects. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:235-255 [Conf]
  16. Diletta Cacciagrano, Flavio Corradini
    On Synchronous and Asynchronous Communication Paradigms. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:256-268 [Conf]
  17. 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]
  18. Jirí Fiala, Jan Kratochvíl, Andrzej Proskurowski
    Distance Constrained Labeling of Precolored Trees. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:285-292 [Conf]
  19. Lars Jacobsen, Kim S. Larsen
    Exponentially Decreasing Number of Operations in Balanced Trees. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:293-311 [Conf]
  20. 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]
  21. 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]
  22. 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]
  23. Paolo D'Arco
    On the Distribution of a Key Distribution Center. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:357-369 [Conf]
  24. Stelvio Cimato, Annalisa De Bonis
    Online Advertising: Secure E-coupons. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:370-383 [Conf]
  25. Nicola Olivetti, Camilla Schwind
    A Calculus and Complexity Bound for Minimal Conditional Logic. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:384-404 [Conf]
  26. 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]
  27. Emanuele Viola
    E-unifiability via Narrowing. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:426-438 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002