An Introduction to Online Computation

Focusing on online computation, this textbook delves into randomization and advice complexity across various scenarios. It thoroughly analyzes a range of online problems, including the paging problem, k-server problem, job shop scheduling, knapsack problem, bit guessing problem, and graph-related challenges. The text provides a comprehensive exploration of these topics, making it a valuable resource for understanding the complexities and strategies involved in online algorithms.