000 04168nam a22005655i 4500
001 978-3-540-68323-0
003 DE-He213
005 20160624102048.0
007 cr nn 008mamaa
008 121227s1997 gw | s |||| 0|eng d
020 _a9783540683230
_9978-3-540-68323-0
024 7 _a10.1007/3-540-62592-5
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aAlgorithms and Complexity
_h[electronic resource] :
_bThird Italian Conference, CIAC '97 Rome, Italy, March 12–14, 1997 Proceedings /
_cedited by Giancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Battista.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1997.
300 _aIX, 319 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1203
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aComputer graphics.
650 0 _aCombinatorics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aData Structures.
650 2 4 _aComputer Graphics.
650 2 4 _aCombinatorics.
700 1 _aBongiovanni, Giancarlo.
_eeditor.
700 1 _aBovet, Daniel Pierre.
_eeditor.
700 1 _aBattista, Giuseppe.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540625926
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v1203
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-62592-5
942 _2EBK6962
_cEBK
999 _c36256
_d36256