Algorithms and Complexity

Third Italian Conference, CIAC'97, Rome, Italy, March 12-14, 1997, Proceedings
1997
ISBN: 978-3-540-62592-6
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 1203, 319 Seiten, Paperback, Format (B × H): 155 mm x 235 mm, Gewicht: 1020 g

Reihe: Lecture Notes in Computer Science

This book constitutes the refereed proceedings of the Third Italian Conference on Algorithms and Complexity, CIAC'97, held in Rome, Italy in March 1997.
The 25 revised full papers included in the volume were carefully selected from a total of 74 submissions; also included is an invited paper and an invited abstract. All in all, the papers present an interesting snapshot of current research activities and recent results in theory and applications of sequential, distributed, and parallel algorithms, data structures, and computational complexity.

Zielgruppe

Research

Autoren/Hrsg.

Bongiovanni, Giancarlo

Di Battista, Giuseppe

Bovet, Daniel P.

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
• Mathematik | Informatik EDV | Informatik Daten / Datenbanken Zeichen- und Zahlendarstellungen
• Mathematik | Informatik Mathematik Algebra Elementare Algebra
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Grafikprogrammierung
• Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Computeranwendungen in der Mathematik
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten

Inhaltsverzeichnis

Algorithms and data structures for control dependence and related compiler problems.- Embedding interconnection networks in grids via the Layered Cross Product.- Finding optimum k-vertex connected spanning subgraphs: Improved approximation algorithms for k=3, 4, 5.- The optimum cost chromatic partition problem.- Fault tolerant K-center problems.- R 1?tt SN (NP) distinguishes robust many-one and Turing completeness.- Syntactic characterization in Lisp of the polynomial complexity classes and hierarchy.- On the drift of short schedules.- On removing non-degeneracy assumptions in computational geometry.- Maintaining maxima under boundary updates.- An optimal algorithm for one-separation of a set of isothetic polygons.- Nice drawings for planar bipartite graphs.- Area requirement of Gabriel drawings (extended abstract).- Design of reliable combinatorial algorithms using certificates.- An improved deterministic algorithm for generalized random sampling.- Polynomial time algorithms for some self-duality problems.- A note on updating suffix tree labels.- Relaxed balanced red-black trees.- The algorithmic complexity of chemical threshold testing.- A meticulous analysis of mergesort programs.- BSP-like external-memory computation.- Topological chaos for elementary cellular automata.- On the complexity of balanced Boolean functions.- On sets with easy certificates and the existence of one-way permutations.- Isomorphism for graphs of bounded distance width.- Hardness of approximating problems on cubic graphs.- Tree contractions and evolutionary trees.