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

Name: Algorithms and Complexity Third Italian Conference, CIAC '97, Rome, Italy, March 12-14, 1997: Proceedings
Price: 39.56 USD
Availability: InStock
ISBN: 9783540625926

ISBN-10: 3540625925

ISBN-13: 9783540625926

Edition: 1997

Authors: Giancarlo Bongiovanni, D. Bovet, Giuseppe Di Battista

List price: $54.99

30 day, 100% satisfaction guarantee!

Marketplace

2 new & used from $39.56

what's this?

Rush Rewards U
Members Receive:

You have reached 400 XP and carrot coins. That is the daily max!

Description:

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.

Book details

List price: $54.99
Copyright year: 1997
Publisher: Springer Berlin / Heidelberg
Publication date: 2/26/1997
Binding: Paperback
Pages: 319
Size: 6.10" wide x 9.25" long
Weight: 2.244
Language: English



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



[actual symbol not reproducible] (NP) Distinguished 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



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



Author Index