Research Catalog

Algorithms and complexity : third Italian conference, CIAC '97, Rome, Italy, March 12-14, 1997 : proceedings

Title
Algorithms and complexity : third Italian conference, CIAC '97, Rome, Italy, March 12-14, 1997 : proceedings / Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Di Battista (eds.).
Author
Italian Conference on Algorithms and Complexity (3rd : 1997 : Rome, Italy)
Publication
Berlin ; New York : Springer, ©1997.

Items in the Library & Off-site

Filter by

1 Item

StatusFormatAccessCall NumberItem Location
TextUse in library QA9.58 .I885 1997Off-site

Details

Additional Authors
  • Bongiovanni, Giancarlo.
  • Bovet, Daniel P. (Daniel Pierre)
  • Di Battista, Giuseppe.
Description
viii, 310 pages : illustrations; 24 cm
Series Statement
Lecture notes in computer science, 0302-9743 ; 1203
Uniform Title
Lecture notes in computer science ; 1203.
Subject
  • Algorithms > Congresses
  • Computational complexity > Congresses
  • Algorithms
  • Computational complexity
  • Algorithmus
  • Komplexitätstheorie
  • Kongress
  • Complexiteit
  • Algoritmen
  • Computerwiskunde
  • Computabilidade e modelos de computacao
  • Computer algorithms > Congresses
  • Algorithmes > Congrès
  • Complexité de calcul (informatique) > Congrès
Genre/Form
  • Conference papers and proceedings.
  • Rom (1997)
Note
  • Papers presented at the Third Conference on Algorithms and Complexity, Mar. 12-14, 1997 in Rome.
Bibliography (note)
  • Includes bibliographical references and index.
Contents
Algorithms and Data Structures for Control Dependence and Related Compiler Problems / G. Bilardi -- Embedding Interconnection Networks in Grids via the Layered Cross Product / G. Even and S. Even -- Finding Optimum k-vertex Connected Spanning Subgraphs: Improved Approximation Algorithms for K = 3,4,5 / Y. Dinitz and Z. Nutov -- The Optimum Cost Chromatic Partition Problem / K. Jansen -- Fault Tolerant K-Center Problems / S. Khuller, R. Pless and Y.J. Sussmann -- [actual symbol not reproducible] (NP) Distinguished Robust Many-One and Turing Completeness / E. Hemaspaandra, L.A. Hemaspaandra and H. Hempel -- Syntactic Characterization in LISP of the Polynomial Complexity Classes and Hierarchy / S. Caporaso, M. Zito and N. Galesi [and others] -- On the Drift of Short Schedules / U. Feige and G. Rayzman -- On Removing Non-degeneracy Assumptions in Computational Geometry / F. Gomez, S. Ramaswami and G. Toussaint.
ISBN
  • 3540625925
  • 9783540625926
LCCN
97006970
OCLC
  • ocm36343441
  • 36343441
  • SCSB-9151757
Owning Institutions
Princeton University Library