Buch, Englisch, Band 778, 227 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 365 g
Second Italian Conference, CIAC '94, Rome, Italy, February 23 - 25, 1994. Proceedings
Buch, Englisch, Band 778, 227 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 365 g
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-57811-6
Verlag: Springer Berlin Heidelberg
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik Mathematik Algebra Elementare Algebra
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
Weitere Infos & Material
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.
