LEADER 05394nam 22007695 450 001 9910144927003321 005 20200704230820.0 010 $a3-540-68323-2 024 7 $a10.1007/3-540-62592-5 035 $a(CKB)1000000000234601 035 $a(SSID)ssj0000321202 035 $a(PQKBManifestationID)11238203 035 $a(PQKBTitleCode)TC0000321202 035 $a(PQKBWorkID)10276825 035 $a(PQKB)11420478 035 $a(DE-He213)978-3-540-68323-0 035 $a(PPN)155234854 035 $a(EXLCZ)991000000000234601 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Complexity$b[electronic resource] $eThird Italian Conference, CIAC'97, Rome, Italy, March 12-14, 1997, Proceedings /$fedited by Giancarlo Bongiovanni, Daniel P. Bovet, Giuseppe Di Battista 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (IX, 319 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1203 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-62592-5 327 $aAlgorithms 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. 330 $aThis 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1203 606 $aComputers 606 $aLogic, Symbolic and mathematical 606 $aApplied mathematics 606 $aEngineering mathematics 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aApplications of Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M13003 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 615 0$aComputers. 615 0$aLogic, Symbolic and mathematical. 615 0$aApplied mathematics. 615 0$aEngineering mathematics. 615 0$aAlgorithms. 615 0$aData structures (Computer science) 615 14$aTheory of Computation. 615 24$aMathematical Logic and Foundations. 615 24$aApplications of Mathematics. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aComputation by Abstract Devices. 615 24$aData Structures. 676 $a511.3 702 $aBongiovanni$b Giancarlo$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aBovet$b Daniel P$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aDi Battista$b Giuseppe$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aItalian Conference on Algorithms and Complexity 906 $aBOOK 912 $a9910144927003321 996 $aAlgorithms and Complexity$93241163 997 $aUNINA