An Introduction to Online Computation

Determinism, Randomization, Advice

  • Dennis Komm

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

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

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-42747-8
  • Online ISBN 978-3-319-42749-2
  • Series Print ISSN 1862-4499
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
IT & Software
Consumer Packaged Goods