Maurizio Bonuccelli / Pierluigi Crescenzi / Rossella Petreschi (eds.)

Algorithms and Complexity

Second Italian Conference, CIAC '94, Rome, Italy, February 23 - 25, 1994. Proceedings
Mitarbeit:Bonuccelli, Maurizio; Crescenzi, Pierluigi; Petreschi, Rossella

• Broschiertes Buch

Produktbeschreibung

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.

Produktdetails

• Lecture Notes in Computer Science 778
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-57811-6
• 1994.
• Seitenzahl: 236
• Erscheinungstermin: 11. Februar 1994
• Englisch
• Abmessung: 235mm x 155mm x 13mm
• Gewicht: 314g
• ISBN-13: 9783540578116
• ISBN-10: 3540578110
• Artikelnr.: 09222231

Autorenporträt

Rossella Petreschi is Professor in the Dipartimento di Informatica, Università di Roma 'La Sapienza', where she was a founding faculty member and the director from 2003-009. She cofounded the International Conference on Algorithms and Complexity (CIAC), and she coauthored many formal academic journal and conference publications. Her research interests include algorithm design and analysis, parallel and distributed computing, efficient solutions of graph problems, labelled tree encodings, and frequency assignments in wireless networks. She has also researched and published on graph drawing, interconnection topologies and experimental algorithmics. Many of her former students occupy key positions in industry and research.

Inhaltsangabe

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.