TY  - GEN
N2  - This 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.
DO  - 10.1007/978-3-319-42749-2
DO  - doi
AB  - This 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.
T1  - An introduction to online computation :determinism, randomization, advice /
AU  - Komm, Dennis,
CN  - QA76.55
CN  - QA75.5-76.95
ID  - 764147
KW  - Online data processing.
KW  - Computer science.
KW  - Computers.
KW  - Algorithms.
SN  - 9783319427492
SN  - 3319427490
TI  - An introduction to online computation :determinism, randomization, advice /
LK  - https://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-42749-2
UR  - https://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-42749-2
ER  -