Algorithms and Complexity: Third Italian Conference, CIAC'97, Rome, Italy, March 12-14, 1997, Proceedings - Softcover

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.