Dennis Komm

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.

Determinism, Randomization, Advice

An Introduction to Online Computation

Rastislav Královič

Richard Královič

Tobias Mömke

Randomized Online Algorithms with High Probability Guarantees

Juraj Hromkovič

Hans-Joachim Böckenhauer

A Technique to Obtain Hardness Results for Randomized Online Algorithms - a Survey

Dennis Komm

About

Books

Join the club