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.
Les mer
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;
Les mer
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.
Les mer
Springer Book Archives
Springer Book Archives
GPSR Compliance
The European Union's (EU) General Product Safety Regulation (GPSR) is a set of rules that requires consumer products to be safe and our obligations to ensure this.
If you have any concerns about our products you can contact us on ProductSafety@springernature.com.
In case Publisher is established outside the EU, the EU authorized representative is:
Springer Nature Customer Service Center GmbH
Europaplatz 3
69115 Heidelberg, Germany
ProductSafety@springernature.com
Les mer
Produktdetaljer
ISBN
9783540625926
Publisert
1997-02-26
Utgiver
Vendor
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Høyde
235 mm
Bredde
155 mm
Aldersnivå
Research, UP, P, 05, 06
Språk
Product language
Engelsk
Format
Product format
Heftet