LEADER 01017nam 2200337 450 001 9910163181503321 005 20230803015535.0 010 $a1-908902-76-0 035 $a(CKB)3710000001046278 035 $a(MiAaPQ)EBC4807282 035 $a(EXLCZ)993710000001046278 100 $a20200107d2013 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 14$aThe personal memoirs of U.S. Grant$h2 volumes in one /$fUlysses S. Grant 210 1$a[Place of publication not identified] :$cPickle Partners Publishing,$d[2013] 210 4$dİ2013 215 $a1 online resource (874 pages) 607 $aUnited States$xHistory$yCivil War, 1861-1865$xCampaigns 676 $a973.73 700 $aGrant$b Ulysses S.$01119388 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910163181503321 996 $aThe personal memoirs of U.S. Grant$93411690 997 $aUNINA LEADER 03348nam 22008175 450 001 9910484943003321 005 20251226202405.0 010 $a3-642-38233-9 024 7 $a10.1007/978-3-642-38233-8 035 $a(CKB)3280000000007637 035 $a(DE-He213)978-3-642-38233-8 035 $a(SSID)ssj0000904554 035 $a(PQKBManifestationID)11512237 035 $a(PQKBTitleCode)TC0000904554 035 $a(PQKBWorkID)10921245 035 $a(PQKB)11745024 035 $a(MiAaPQ)EBC3093159 035 $a(PPN)170491897 035 $a(EXLCZ)993280000000007637 100 $a20130516d2013 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Complexity $e8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings /$fedited by Paul G. Spirakis, Maria Serna 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XIV, 384 p. 75 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7878 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-38232-0 327 $aComputational complexity and the use -- Design, analysis and experimentation -- Efficient algorithms -- Data structures. 330 $aThis book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7878 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence$xData processing 606 $aNumerical analysis 606 $aComputer graphics 606 $aComputer networks 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 606 $aNumerical Analysis 606 $aComputer Graphics 606 $aComputer Communication Networks 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence$xData processing. 615 0$aNumerical analysis. 615 0$aComputer graphics. 615 0$aComputer networks. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 615 24$aNumerical Analysis. 615 24$aComputer Graphics. 615 24$aComputer Communication Networks. 676 $a006.31 702 $aSpirakis$b Paul G$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSerna$b Maria$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484943003321 996 $aAlgorithms and Complexity$94381040 997 $aUNINA