Algorithms and Complexity: Second Italian Conference, CIAC '94, Rome, Italy, February 23 - 25, 1994. Proceedings / Edition 1

by Maurizio Bonuccelli, Pierluigi Crescenzi, Rossella Petreschi

Overview

The papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February 1994 in Rome. This biannual conference series is intended to present research contributions in theory and applications of sequential, parallel, and distributed algorithms, data structures, and computational complexity. The volume contains four invited presentations and 14 regular presentations selected from 32 submissions, each of which was evaluated by at least four program committee members. The invited presentations are by J. Hartmanis and S. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U. Vishkin, and M. Yannakakis.

Product Details

ISBN-13:	9783540578116
Publisher:	Springer Berlin Heidelberg
Publication date:	03/18/1994
Series:	Lecture Notes in Computer Science , #778
Edition description:	1994
Pages:	227
Product dimensions:	6.10(w) x 9.25(h) x 0.02(d)

Table of Contents

On the intellectual terrain around NP.- Advances in graph drawing.- On a parallel-algorithms method for string matching problems (overview).- Some open problems in approximation.- New local search approximation techniques for maximum generalized satisfiability problems.- Learning behaviors of automata from multiplicity and equivalence queries.- Measures of Boolean function complexity based on Harmonic Analysis.- Graph theory and interactive prools for Reachability Problems on finite Cellular automata.- Parallel pruning decomposition (PDS) and biconnected components of graphs.- A non-interactive electronic cash system.- A unified scheme for routing in expander based networks.- Dynamization of backtrack-free search for the constraint satisfaction problem.- Efficient reorganization of binary search trees.- Time-message trade-offs for the weak unison problem.- On set equality-testing.- On the complexity of some reachability problems.- On self-reducible sets of low information content.- Lower bounds for merging on the hypercube.