Willkommen, schön sind Sie da!
Logo Ex Libris

Algorithms and Complexity

  • Kartonierter Einband
  • 236 Seiten
(0) Erste Bewertung abgeben
Bewertungen
(0)
(0)
(0)
(0)
(0)
Alle Bewertungen ansehen
The papers in this volume were presented at the Second Italian Conference onAlgorithms and Complexity, held in February 1994 in Ro... Weiterlesen
20%
86.00 CHF 68.80
Sie sparen CHF 17.20
Print on Demand - Auslieferung erfolgt in der Regel innert 4 bis 6 Wochen.
Bestellung & Lieferung in eine Filiale möglich

Beschreibung

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.

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

Klappentext

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.



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

Produktinformationen

Titel: Algorithms and Complexity
Untertitel: Second Italian Conference, CIAC '94, Rome, Italy, February 23 - 25, 1994. Proceedings
Editor:
EAN: 9783540578116
ISBN: 3540578110
Format: Kartonierter Einband
Herausgeber: Springer Berlin Heidelberg
Anzahl Seiten: 236
Gewicht: 365g
Größe: H235mm x B155mm x T12mm
Jahr: 1994
Untertitel: Englisch
Auflage: 1994

Weitere Produkte aus der Reihe "Lecture Notes in Computer Science"