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

Invited Presentations

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

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