1 option
Algorithms and Complexity : Third Italian Conference, CIAC'97, Rome, Italy, March 12-14, 1997, Proceedings / edited by Giancarlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1203.
- Lecture Notes in Computer Science, 0302-9743 ; 1203
- Language:
- English
- Subjects (All):
- Computers.
- Logic, Symbolic and mathematical.
- Applied mathematics.
- Engineering mathematics.
- Algorithms.
- Data structures (Computer science).
- Theory of Computation.
- Mathematical Logic and Foundations.
- Applications of Mathematics.
- Algorithm Analysis and Problem Complexity.
- Computation by Abstract Devices.
- Data Structures.
- Local Subjects:
- Theory of Computation.
- Mathematical Logic and Foundations.
- Applications of Mathematics.
- Algorithm Analysis and Problem Complexity.
- Computation by Abstract Devices.
- Data Structures.
- Physical Description:
- 1 online resource (IX, 319 pages).
- Edition:
- First edition 1997.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
- System Details:
- text file PDF
- Summary:
- 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.
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-68323-0
- 9783540683230
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.