MARC record from Internet Archive

LEADER: 04465cam 2200769Ia 4500
001 ocn756508018
003 OCoLC
005 20180620004536.0
008 111010s2011 gw a ob 101 0 eng d
006 m o d
007 cr cn|||||||||
040 $aGW5XE$beng$epn$cGW5XE$dGZM$dUKMGB$dOCLCQ$dOCLCA$dOCLCF$dBEDGE$dE7B$dOCLCO$dOCLCQ$dOCLCO$dCOO$dYDXCP$dAU@$dNUI$dOCL$dOCLCO$dOCLCQ$dOCLCO$dEBLCP$dOCLCQ$dVGM$dESU$dOCLCQ$dBUF$dIOG$dSHS
016 7 $a015890773$2Uk
019 $a763157666$a769767696$a846862381$a858858637
020 $a9783642237195$q(electronic bk.)
020 $a3642237193$q(electronic bk.)
020 $z9783642237188
020 $z3642237185$q(soft cover ;$qalk. paper)
024 7 $a10.1007/978-3-642-23719-5$2doi
035 $a(OCoLC)756508018$z(OCoLC)763157666$z(OCoLC)769767696$z(OCoLC)846862381$z(OCoLC)858858637
037 $a978-3-642-23718-8$bSpringer$nhttp://www.springerlink.com
050 4 $aQA76.9.A43$bE83 2011
072 7 $aUMB$2bicssc
072 7 $aCOM051300$2bisacsh
082 04 $a005.1$223
111 2 $aESA (Symposium)$n(19th :$d2011 :$cSaarbru cken, Germany)
245 10 $aAlgorithms--ESA 2011 :$b19th annual European symposium, Saarbru cken, Germany, September 5-9, 2011 : proceedings /$cCamil Demetrescu, Magnu s M. Halldo rsson (eds.).
246 30 $aESA 2011
260 $aBerlin ;$aNew York :$bSpringer,$c℗♭2011.
300 $a1 online resource (xix, 813 pages) :$billustrations.
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 ;$v6942
490 1 $aLNCS sublibrary, SL 1, Theoretical computer science and general issues
500 $aInternational conference proceedings.
504 $aIncludes bibliographical references and author index.
520 $aThis book constitutes the refereed proceedings of the 19th Annual European Symposium on Algorithms, ESA 2011, held in Saarbru cken, Germany, in September 2011 in the context of the combined conference ALGO 2011. The 67 revised full papers presented were carefully reviewed and selected from 255 initial submissions: 55 out of 209 in track design and analysis and 12 out of 46 in track engineering and applications. The papers are organized in topical sections on approximation algorithms, computational geometry, game theory, graph algorithms, stable matchings and auctions, optimization, online algorithms, exponential-time algorithms, parameterized algorithms, scheduling, data structures, graphs and games, distributed computing and networking, strings and sorting, as well as local search and set systems.
650 0 $aComputer algorithms$vCongresses.
650 7 $aInformatique.$2eclas
650 7 $aComputer algorithms.$2fast$0(OCoLC)fst00872010
655 4 $aElectronic books.
655 7 $aConference papers and proceedings.$2fast$0(OCoLC)fst01423772
700 1 $aDemetrescu, Camil.
700 0 $aMagnu s M. Halldo rsson.
776 08 $iPrint version:$aEuropean Symposium on Algorithms (19th : 2011 : Saarbru cken, Germany).$tAlgorithms.$dHeidelberg : Springer, 2011$w(DLC) 2011935220
830 0 $aLecture notes in computer science ;$v6942.$x0302-9743
830 0 $aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues.
856 40 $3Ebook Library$uhttp://public.eblib.com/choice/publicfullrecord.aspx?p=3067285
856 40 $3ebrary$uhttp://site.ebrary.com/id/10499436
856 40 $3SpringerLink$uhttp://dx.doi.org/10.1007/978-3-642-23719-5
856 40 $3SpringerLink$uhttp://link.springer.com/openurl?genre=book&isbn=978-3-642-23718-8
856 40 $3Click to access in SpringerLink$uhttp://gate.lib.buffalo.edu/login?url=https://link.springer.com/book/10.1007/978-3-642-23719-5
856 40 $uhttps://grinnell.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-642-23719-5$zAccess Springer Electronic Book
938 $aEBL - Ebook Library$bEBLB$nEBL3067285
938 $aebrary$bEBRY$nebr10499436
938 $aYBP Library Services$bYANK$n7104994
029 1 $aAU@$b000048698546
029 1 $aAU@$b000051314869
029 1 $aAU@$b000058157559
029 1 $aDKDLA$b820120-katalog:000459713
029 1 $aDKDLA$b820120-katalog:000686969
029 1 $aNZ1$b13935939
029 1 $aAU@$b000060505227
994 $aZ0$bPMR
948 $hNO HOLDINGS IN PMR - 354 OTHER HOLDINGS