Conferences in DBLP

Italian Conference on Algorithms and Complexity (CIAC) (ciac)
1997 (conf/ciac/1997)

1. Gianfranco Bilardi
   Algorithms and Data Structures for Control Dependence and Related Compiler Problems. [Citation Graph (0, 0)][DBLP]
   CIAC, 1997, pp:1-2 [Conf]
   
2. Guy Even, Shimon Even
   Embedding Interconnection Networks in Grids via the Layered Cross Product. [Citation Graph (0, 0)][DBLP]
   CIAC, 1997, pp:3-12 [Conf]
   
3. Yefim Dinitz, Zeev Nutov
   Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for k=3, 4, 5. [Citation Graph (0, 0)][DBLP]
   CIAC, 1997, pp:13-24 [Conf]
   
4. Klaus Jansen
   The Optimum Cost Chromatic Partition Problem. [Citation Graph (0, 0)][DBLP]
   CIAC, 1997, pp:25-36 [Conf]
   
5. Samir Khuller, Robert Pless, Yoram J. Sussmann
   Fault Tolerant K-Center Problems. [Citation Graph (0, 0)][DBLP]
   CIAC, 1997, pp:37-48 [Conf]
   
6. Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
   R^SN_1-tt(NP) Distinguishes Robust Many-One and Turing Completeness. [Citation Graph (0, 0)][DBLP]
   CIAC, 1997, pp:49-60 [Conf]
   
7. Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino
   Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. [Citation Graph (0, 0)][DBLP]
   CIAC, 1997, pp:61-73 [Conf]
   
8. Uriel Feige, Giora Rayzman
   On the Drift of Short Schedules. [Citation Graph (0, 0)][DBLP]
   CIAC, 1997, pp:74-85 [Conf]
   
9. Francisco Gómez, Suneeta Ramaswami, Godfried T. Toussaint
   On Removing Non-degeneracy Assumptions in Computational Geometry. [Citation Graph (0, 0)][DBLP]
   CIAC, 1997, pp:86-99 [Conf]
   
10. Fabrizio d'Amore, Paolo Giulio Franciosa, Roberto Giaccio, Maurizio Talamo
    Maintaining Maxima under Boundary Updates. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:100-109 [Conf]
    
11. Amitava Datta, Kamala Krithivasan, Thomas Ottmann
    An Optimal Algorithm for One-Separation of a Set of Isothetic Polygons. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:110-121 [Conf]
    
12. Ulrich Fößmeier, Michael Kaufmann
    Nice Drawings for Planar Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:122-134 [Conf]
    
13. Giuseppe Liotta, Roberto Tamassia, Ioannis G. Tollis, Paola Vocca
    Area Requirement of Gabriel Drawings. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:135-146 [Conf]
    
14. Fabrizio Luccio, Alberto Pedrotti
    Design of Reliable Combinatorial Algorithms Using Certificates. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:147-158 [Conf]
    
15. Amihood Amir, Emanuel Dar
    An Improved Deterministic Algorithms for Generalized Random Sampling. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:159-170 [Conf]
    
16. Carlos Domingo
    Polynominal Time Algorithms for Some Self-Duality Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:171-180 [Conf]
    
17. Paolo Ferragina, Roberto Grossi, Manuela Montangero
    A Note on Updating Suffix Tree Labels. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:181-192 [Conf]
    
18. Sabine Hanke, Thomas Ottmann, Eljas Soisalon-Soininen
    Relaxed Balanced Red-Black Trees. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:193-204 [Conf]
    
19. Peter Damaschke
    The Algorithmic Complexity of Chemical Threshold Testing. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:205-216 [Conf]
    
20. Jyrki Katajainen, Jesper Larsson Träff
    A Meticulous Analysis of Mergesort Programs. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:217-228 [Conf]
    
21. Jop F. Sibeyn, Michael Kaufmann
    BSP-Like External-Memory Computation. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:229-240 [Conf]
    
22. Gianpiero Cattaneo, Michele Finelli, Luciano Margara
    Topological Chaos for Elementary Cellular Automata. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:241-252 [Conf]
    
23. Anna Bernasconi
    On the Complexity of Balanced Boolean Functions. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:253-263 [Conf]
    
24. Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
    On Sets with Easy Certificates and the Existence of One-Way Permutations. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:264-275 [Conf]
    
25. Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
    Isomorphism for Graphs of Bounded Distance Width. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:276-287 [Conf]
    
26. Paola Alimonti, Viggo Kann
    Hardness of Approximating Problems on Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:288-298 [Conf]
    
27. Ming-Yang Kao
    Tree Contractions and Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:299-310 [Conf]