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

Bonuccelli, Maurizio

ISBN 10: 3540578110 / ISBN 13: 9783540578116

Editore: Springer 1994-02, 1994

Riguardo questo articolo

Codice articolo 6666-IUK-9783540578116

Dati bibliografici

Titolo: Algorithms and Complexity : Second Italian ...

Casa editrice: Springer 1994-02

Data di pubblicazione: 1994

Legatura: PF

Condizione: New

Descrizione articolo

Riassunto:

The papers in this volume were presented at the SecondItalian Conference onAlgorithms and Complexity, held inFebruary 1994 in Rome. This biannual conference series isintended to present research contributions in theory andapplications of sequential, parallel, and distributedalgorithms, data structures, and computational complexity.The volume contains four invited presentations and 14regular presentations selected from 32 submissions, each ofwhich was evaluated by at least four program committeemembers. The invited presentations are by J. Hartmanis andS. Chari, A. Garg and R. Tamassia, S.C. Sahinalp and U.Vishkin, and M. Yannakakis.

Contenuti:

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 protocols 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.