2. CIAC 1994: Rome, Italy

Maurizio A. Bonuccelli, Pierluigi Crescenzi, Rossella Petreschi (Eds.): Algorithms and Complexity, Second Italian Conference, CIAC '94, Rome, Italy, February 23-25, 1994, Proceedings. Lecture Notes in Computer Science 778 Springer 1994, ISBN 3-540-57811-0 BibTeX

@proceedings{DBLP:conf/ciac/1994,
  editor    = {Maurizio A. Bonuccelli and
               Pierluigi Crescenzi and
               Rossella Petreschi},
  title     = {Algorithms and Complexity, Second Italian Conference, CIAC '94,
                Rome, Italy, February 23-25, 1994, Proceedings},
  booktitle = {CIAC},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {778},
  year      = {1994},
  isbn      = {3-540-57811-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Presentations

Juris Hartmanis, Suresh Chari: On the Intellectual Terrain Around NP. 1-11 BibTeX
Ashim Garg, Roberto Tamassia: Advances in Graph Drawing. 12-21 BibTeX
Süleyman Cenk Sahinalp, Uzi Vishkin: On a Parallel-Algorithms Method for String Matching Problems. 22-32 BibTeX
Mihalis Yannakakis: Some Open Problems in Approximation. 33-39 BibTeX

Regular Presentations

Paola Alimonti: New Local Search Approximation Techniques for Maximum Generalized Satisfiability Problems. 40-53 BibTeX
Francesco Bergadano, Stefano Varricchio: Learning Behaviors of Automata from Multiplicity and Equivalence Queries. 54-62 BibTeX
Anna Bernasconi, Bruno Codenotti: Measures of Boolean Function Complexity Based on Harmonic Analysis. 63-72 BibTeX
Andrea E. F. Clementi, Russell Impagliazzo: Graph Theory and Interactive Protocols for Reachability Problems on Finite Cellular Automata. 73-90 BibTeX
Eliezer Dekel, Jie Hu: Parallel Pruning Decomposition (PDS) and Biconnected Components of Graphs. 91-108 BibTeX
Giovanni Di Crescenzo: A Non-Iterative Electronic Cash System. 109-124 BibTeX
Shimon Even, Ami Litman: A Unified Scheme for Routing in Expander Based Networks. 125-135 BibTeX
Daniele Frigioni, Alberto Marchetti-Spaccamela, Umberto Nanni: Dynamization of Backtrack-Free Search for the Constraint Satisfaction Problem. 136-151 BibTeX
Micha Hofri, Hadas Shachnai: Efficient Reorganization of Binary Search Trees. 152-166 BibTeX
Amos Israeli, Evangelos Kranakis, Danny Krizanc, Nicola Santoro: Time-Message Trade-Offs for the Weak Unison Problem. 167-178 BibTeX
Tak Wah Lam, Ka Hing Lee: On Set Equality-Testing. 179-191 BibTeX
Angelo Monti, Alessandro Roncato: On the Complexity of Some Reachability Problems. 192-202 BibTeX
Martin Mundhenk: On Self-Reducible Sets of Low Information Content. 203-212 BibTeX
Christine Rüb: Lower Bounds for Merging on the Hypercube. 213-222 BibTeX