Komm, Dennis.
An Introduction to Online Computation Determinism, Randomization, Advice / [electronic resource] : by Dennis Komm. - XV, 349 p. 58 illus. online resource. - Texts in Theoretical Computer Science. An EATCS Series, 1862-4499 . - Texts in Theoretical Computer Science. An EATCS Series, .
Introduction -- Randomization -- Advice Complexity -- The k-Server Problem -- Job Shop Scheduling -- The Knapsack Problem -- The Bit Guessing Problem -- Problems on Graphs.
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.
9783319427492
10.1007/978-3-319-42749-2 doi
Computer science.
Computers.
Algorithms.
Computer Science.
Theory of Computation.
Algorithms.
QA75.5-76.95
004.0151
An Introduction to Online Computation Determinism, Randomization, Advice / [electronic resource] : by Dennis Komm. - XV, 349 p. 58 illus. online resource. - Texts in Theoretical Computer Science. An EATCS Series, 1862-4499 . - Texts in Theoretical Computer Science. An EATCS Series, .
Introduction -- Randomization -- Advice Complexity -- The k-Server Problem -- Job Shop Scheduling -- The Knapsack Problem -- The Bit Guessing Problem -- Problems on Graphs.
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.
9783319427492
10.1007/978-3-319-42749-2 doi
Computer science.
Computers.
Algorithms.
Computer Science.
Theory of Computation.
Algorithms.
QA75.5-76.95
004.0151