The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Giuseppe Castagna
    Semantic Subtyping: Challenges, Perspectives, and Open Problems. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:1-20 [Conf]
  2. Luca Cardelli
    Biological Systems as Reactive Systems. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:21- [Conf]
  3. Nicola Santoro
    Mobile Agents Computing: Security Issues and Algorithmic Solutions. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:22- [Conf]
  4. Luzi Anderegg, Mark Cieliebak, Giuseppe Prencipe
    Efficient Algorithms for Detecting Regular Point Configurations. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:23-35 [Conf]
  5. Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa
    Pickup and Delivery for Moving Objects on Broken Lines. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:36-50 [Conf]
  6. Benjamin Aziz, David Gray, Geoff W. Hamilton
    A Static Analysis of PKI-Based Systems. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:51-65 [Conf]
  7. Steffen van Bakel, Ugo de'Liguoro
    Subtyping Object and Recursive Types Logically. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:66-80 [Conf]
  8. Steffen van Bakel, Stephane Lengrand, Pierre Lescanne
    The Language chi: Circuits, Computations and Classical Logic. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:81-96 [Conf]
  9. Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari
    Checking Risky Events Is Enough for Local Policies. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:97-112 [Conf]
  10. Clara Bertolissi
    The Graph Rewriting Calculus: Confluence and Expressiveness. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:113-127 [Conf]
  11. Lorenzo Bettini, Viviana Bono, Silvia Likavec
    Safe Object Composition in the Presence of Subtyping. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:128-142 [Conf]
  12. Nadia Busi, Gianluigi Zavattaro
    Reachability Analysis in Boxed Ambients. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:143-159 [Conf]
  13. Giuseppe Castagna, Dario Colazzo, Alain Frisch
    Error Mining for Regular Expression Patterns. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:160-172 [Conf]
  14. Marie-Christine Costa, Fethi Jarray, Christophe Picouleau
    Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:173-181 [Conf]
  15. Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani
    Inapproximability Results for the Lateral Gene Transfer Problem. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:182-195 [Conf]
  16. Gianluca De Marco, Marco Pellegrini, Giovanni Sburlati
    Faster Deterministic Wakeup in Multiple Access Channels. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:196-204 [Conf]
  17. Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
    Weighted Coloring: Further Complexity and Approximability Results. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:205-214 [Conf]
  18. Stephen A. Fenner, Yong Zhang
    Quantum Algorithms for a Set of Group Theoretic Problems. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:215-227 [Conf]
  19. Jirí Fiala, Jan Kratochvíl
    On the Computational Complexity of the L(2, 1)-Labeling Problem for Regular Graphs. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:228-236 [Conf]
  20. Giuditta Franco
    A Polymerase Based Algorithm for SAT. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:237-250 [Conf]
  21. Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keung Poon
    Laxity Helps in Broadcast Scheduling. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:251-264 [Conf]
  22. Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena
    Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:265-279 [Conf]
  23. Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
    Synthesis from Temporal Specifications Using Preferred Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:280-294 [Conf]
  24. Wojciech Jamroga, Jürgen Dix
    Model Checking Strategic Abilities of Agents Under Incomplete Information. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:295-308 [Conf]
  25. Tsvi Kopelowitz, Ely Porat
    Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:309-322 [Conf]
  26. Tetsuji Kuboyama, Kilho Shin, Tetsuhiro Miyahara, Hiroshi Yasuda
    A Theoretical Analysis of Alignment and Edit Problems for Trees. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:323-337 [Conf]
  27. Marco Macchetti, Mario Caironi, Luca Breveglieri, Alessandra Cherubini
    A Complete Formulation of Generalized Affine Equivalence. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:338-347 [Conf]
  28. Sabrina Mantaci, Antonio Restivo, G. Rosone, Marinella Sciortino
    A New Combinatorial Approach to Sequence Comparison. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:348-359 [Conf]
  29. Ricardo Medel, Adriana B. Compagnoni, Eduardo Bonelli
    A Typed Assembly Language for Non-interference. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:360-374 [Conf]
  30. Venkatesh Raman, Saket Saurabh, Somnath Sikdar
    Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:375-389 [Conf]
  31. Jan Schwinghammer
    A Typed Semantics of Higher-Order Store and Subtyping. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:390-405 [Conf]
  32. Richard Statman
    Two Variables Are Not Enough. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:406-409 [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