LEADER 03383nam 22006375 450 001 996465329103316 005 20200705172937.0 010 $a3-540-68458-1 024 7 $a10.1007/BFb0028290 035 $a(CKB)1000000000234465 035 $a(SSID)ssj0000321692 035 $a(PQKBManifestationID)11246333 035 $a(PQKBTitleCode)TC0000321692 035 $a(PQKBWorkID)10280942 035 $a(PQKB)10458615 035 $a(DE-He213)978-3-540-68458-9 035 $a(PPN)15521411X 035 $a(EXLCZ)991000000000234465 100 $a20121227d1996 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aBounded Incremental Computation$b[electronic resource] /$fby G. Ramalingam 205 $a1st ed. 1996. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1996. 215 $a1 online resource (XII, 196 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1089 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-61320-X 327 $aOn incremental algorithms and their complexity -- Terminology and notation -- Incremental algorithms for shortest-path problems -- Generalizations of the shortest-path problem -- An incremental algorithm for a generalization of the shortest-path problem -- Incremental algorithms for the circuit value annotation problem -- Inherently unbounded incremental computation problems -- Incremental algorithms for reducible flowgraphs -- Conclusions. 330 $aIncremental computation concerns the re-computation of output after a change in the input, whereas algorithms and programs usually derive their output directly from their input. This book investigates the concept of incremental computation and dynamic algorithms in general and provides a variety of new results, especially for computational problems from graph theory: the author presents e.g. efficient incremental algorithms for several shortest-path problems as well as incremental algorithms for the circuit value annotation problem and for various computations in reducible flow graphs. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1089 606 $aAlgorithms 606 $aCombinatorics 606 $aComputers 606 $aOperating systems (Computers) 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aOperating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14045 615 0$aAlgorithms. 615 0$aCombinatorics. 615 0$aComputers. 615 0$aOperating systems (Computers). 615 14$aAlgorithm Analysis and Problem Complexity. 615 24$aCombinatorics. 615 24$aComputation by Abstract Devices. 615 24$aOperating Systems. 676 $a004/.01/5114 700 $aRamalingam$b G$4aut$4http://id.loc.gov/vocabulary/relators/aut$0754223 906 $aBOOK 912 $a996465329103316 996 $aBounded Incremental Computation$92831521 997 $aUNISA LEADER 01421nam0 22003131i 450 001 UON00330167 005 20231205104217.400 010 $a08-10-31477-0 100 $a20090907f1981 |0itac50 ba 101 $aeng 102 $aUS 105 $a||||a ||||| 200 1 $aWomen and feminism in America history$ea guide to information sources$fElizabeth Tingley, Donald F. Tingley 210 $aDetroit$cGale Research Company$dc1981 215 $aXI, 289 p.$d22 cm. 316 $aValore stimato$5IT-UONSI S.CXII B/024 410 1$1001UON00171642$12001 $aAmerican government and history information guide series $1210 $aDetroit$eMich.$cGale Research Company$v12 606 $aDonne$xStati Uniti d'America$xStoria$xBibliografia$3UONC065085$2FI 620 $aUS$dDetroit (MI)$3UONL000416 676 $a016.3054$cBibliografie e cataloghi di gruppi sociali. Donne$v21 700 1$aTINGLEY$bElizabeth$3UONV187921$0700989 701 1$aTINGLEY$bDonald F.$3UONV104443$0675742 712 $aGale Research Company$3UONV255825$4650 801 $aIT$bSOL$c20251128$gRICA 899 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$2UONSI 912 $aUON00330167 950 $aSIBA - SISTEMA BIBLIOTECARIO DI ATENEO$dSI S.C XII B 024 $eSI LO 57265 7 024 Valore stimato 996 $aWomen and feminism in America history$91367480 997 $aUNIOR