000764147 000__ 02507cam\a2200505Mi\4500
000764147 001__ 764147
000764147 005__ 20230306142401.0
000764147 006__ m\\\\\o\\d\\\\\\\\
000764147 007__ cr\nn\nnnunnun
000764147 008__ 161031s2016\\\\sz\a\\\\ob\\\\001\0\eng\d
000764147 019__ $$a963732193$$a964883507
000764147 020__ $$a9783319427492$$q(electronic book)
000764147 020__ $$a3319427490$$q(electronic book)
000764147 020__ $$z9783319427478
000764147 0247_ $$a10.1007/978-3-319-42749-2$$2doi
000764147 035__ $$aSP(OCoLC)ocn962018133
000764147 035__ $$aSP(OCoLC)962018133$$z(OCoLC)963732193$$z(OCoLC)964883507
000764147 040__ $$aAZU$$beng$$epn$$cAZU$$dOCLCO$$dGW5XE$$dYDX$$dOCLCQ$$dUPM$$dOCLCF
000764147 049__ $$aISEA
000764147 050_4 $$aQA76.55
000764147 050_4 $$aQA75.5-76.95
000764147 08204 $$a004/.33$$223
000764147 1001_ $$aKomm, Dennis,$$eauthor.
000764147 24513 $$aAn introduction to online computation :$$bdeterminism, randomization, advice /$$cDennis Komm.
000764147 264_1 $$aCham, Switzerland :$$bSpringer,$$c©2016.
000764147 300__ $$a1 online resource (xv, 349 pages) :$$billustrations.
000764147 336__ $$atext$$btxt$$2rdacontent
000764147 337__ $$acomputer$$bc$$2rdamedia
000764147 338__ $$aonline resource$$bcr$$2rdacarrier
000764147 347__ $$atext file$$bPDF$$2rda
000764147 4901_ $$aTexts in theoretical computer science,$$x1862-4499
000764147 504__ $$aIncludes bibliographical references and index.
000764147 5050_ $$aIntroduction -- Randomization -- Advice Complexity -- The k-Server Problem -- Job Shop Scheduling -- The Knapsack Problem -- The Bit Guessing Problem -- Problems on Graphs.
000764147 506__ $$aAccess limited to authorized users.
000764147 520__ $$aThis textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop scheduling, the knapsack problem, the bit guessing problem, and problems on graphs. This book is appropriate for undergraduate and graduate students of computer science, assuming a basic knowledge in algorithmics and discrete mathematics. Also researchers will find this a valuable reference for the recent field of advice complexity.
000764147 650_0 $$aOnline data processing.
000764147 650_0 $$aComputer science.
000764147 650_0 $$aComputers.
000764147 650_0 $$aAlgorithms.
000764147 77608 $$iPrint version:$$z9783319427478
000764147 830_0 $$aTexts in theoretical computer science.
000764147 852__ $$bebk
000764147 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-42749-2$$zOnline Access$$91397441.1
000764147 909CO $$ooai:library.usi.edu:764147$$pGLOBAL_SET
000764147 980__ $$aEBOOK
000764147 980__ $$aBIB
000764147 982__ $$aEbook
000764147 983__ $$aOnline
000764147 994__ $$a92$$bISE