The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Juris Hartmanis, Suresh Chari
    On the Intellectual Terrain Around NP. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:1-11 [Conf]
  2. Ashim Garg, Roberto Tamassia
    Advances in Graph Drawing. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:12-21 [Conf]
  3. Süleyman Cenk Sahinalp, Uzi Vishkin
    On a Parallel-Algorithms Method for String Matching Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:22-32 [Conf]
  4. Mihalis Yannakakis
    Some Open Problems in Approximation. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:33-39 [Conf]
  5. Paola Alimonti
    New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:40-53 [Conf]
  6. Francesco Bergadano, Stefano Varricchio
    Learning Behaviors of Automata from Multiplicity and Equivalence Queries. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:54-62 [Conf]
  7. Anna Bernasconi, Bruno Codenotti
    Measures of Boolean Function Complexity Based on Harmonic Analysis. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:63-72 [Conf]
  8. Andrea E. F. Clementi, Russell Impagliazzo
    Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:73-90 [Conf]
  9. Eliezer Dekel, Jie Hu
    Parallel Pruning Decomposition (PDS) and Biconnected Components of Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:91-108 [Conf]
  10. Giovanni Di Crescenzo
    A Non-Iterative Electronic Cash System. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:109-124 [Conf]
  11. Shimon Even, Ami Litman
    A Unified Scheme for Routing in Expander Based Networks. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:125-135 [Conf]
  12. Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni
    Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:136-151 [Conf]
  13. Micha Hofri, Hadas Shachnai
    Efficient Reorganization of Binary Search Trees. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:152-166 [Conf]
  14. Amos Israeli, Evangelos Kranakis, Danny Krizanc, Nicola Santoro
    Time-Message Trade-Offs for the Weak Unison Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:167-178 [Conf]
  15. Tak Wah Lam, Ka Hing Lee
    On Set Equality-Testing. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:179-191 [Conf]
  16. Angelo Monti, Alessandro Roncato
    On the Complexity of Some Reachability Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:192-202 [Conf]
  17. Martin Mundhenk
    On Self-Reducible Sets of Low Information Content. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:203-212 [Conf]
  18. Christine Rüb
    Lower Bounds for Merging on the Hypercube. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:213-222 [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