© 2016

An Introduction to Online Computation

Determinism, Randomization, Advice


Table of contents

  1. Front Matter
    Pages i-xv
  2. Dennis Komm
    Pages 1-30
  3. Dennis Komm
    Pages 31-83
  4. Dennis Komm
    Pages 85-112
  5. Dennis Komm
    Pages 113-154
  6. Dennis Komm
    Pages 155-182
  7. Dennis Komm
    Pages 183-210
  8. Dennis Komm
    Pages 211-240
  9. Dennis Komm
    Pages 241-267
  10. Back Matter
    Pages 269-349

About this book


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.


Advice Complexity Computational Complexity Online Algorithms Oracles Paging Problem Randomized Algorithms

Authors and affiliations

  1. 1.Chair of Info. Technol & Educat. CAB F 13.1ETH ZürichZürichSwitzerland

About the authors

Dr. Dennis Komm is a lecturer in the Chair of Information Technology and Education at ETH Zürich. His research interests include approximation algorithms for hard optimization problems, re-optimization of optimization problems, and advice complexity in different setups and environments.

Bibliographic information

  • Book Title An Introduction to Online Computation
  • Book Subtitle Determinism, Randomization, Advice
  • Authors Dennis Komm
  • Series Title Texts in Theoretical Computer Science. An EATCS Series
  • Series Abbreviated Title Texts in Theoret.Computer Science
  • DOI
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science Computer Science (R0)
  • Hardcover ISBN 978-3-319-42747-8
  • Softcover ISBN 978-3-319-82653-0
  • eBook ISBN 978-3-319-42749-2
  • Series ISSN 1862-4499
  • Edition Number 1
  • Number of Pages XV, 349
  • Number of Illustrations 58 b/w illustrations, 0 illustrations in colour
  • Topics Theory of Computation
  • Buy this book on publisher's site
Industry Sectors
IT & Software
Consumer Packaged Goods
Finance, Business & Banking


“This book is about online algorithms for optimization problems. … The book can be used as a textbook on the undergraduate level. … The book can also be used for self-study and as a reference. Its strength in this regard is enhanced by the historical notes at the end of each chapter and a comprehensive bibliography.” (Bogdan S. Chlebus, Mathematical Reviews, March, 2018)

“This text is an important contribution to the field of online algorithms. … Without a doubt, this text is a must-read for anyone seriously pursuing the analysis of algorithms, particularly online versions of those algorithms.” (Michael Goldberg and R. Goldberg, Computing Reviews, October, 2017)