Return to home page
Searching: Muskingum library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.
  Previous Record Previous Item Next Item Next Record
  Reviews, Summaries, etc...
EBOOK
Conference Italian Conference on Algorithms and Complexity (3rd : 1997 : Rome, Italy)
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.).
Imprint Berlin ; New York : Springer, [1997]
©1997

LOCATION CALL # STATUS MESSAGE
 OHIOLINK SPRINGER EBOOKS    ONLINE  
View online
LOCATION CALL # STATUS MESSAGE
 OHIOLINK SPRINGER EBOOKS    ONLINE  
View online
Conference Italian Conference on Algorithms and Complexity (3rd : 1997 : Rome, Italy)
Series Lecture notes in computer science, 0302-9743 ; 1203
Lecture notes in computer science ; 1203.
Subject Algorithms -- Congresses.
Computational complexity -- Congresses.
Alt Name Bongiovanni, Giancarlo.
Bovet, Daniel P. (Daniel Pierre)
Di Battista, Giuseppe.
Description viii, 310 pages : illustrations ; 24 cm.
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 [et al.] -- 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.
Access Available to OhioLINK libraries.
Reproduction Electronic reproduction. Columbus, OH : OhioLINK, 2008.
System Details Mode of access: World Wide Web.
ISBN 3540625925 (softcover : alk. paper)
9783540625926 (softcover : alk. paper)
OCLC # 644359646
Link OhioLINK electronic book center (OCoLC)180989150
SpringerLink (OCoLC)43927870
Additional Format Italian Conference on Algorithms and Complexity (3rd : 1997 : Rome, Italy) Algorithms and complexity : third Italian conference, CIAC '97, Rome, Italy, March 12-14, 1997 : proceedings (OCoLC)36343441


If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team