Skip to main content
SpringerLink
Log in
Book cover

An Introduction to Online Computation

Determinism, Randomization, Advice

  • Textbook
  • © 2016

Overview

Authors:
  1. Dennis Komm

    1. Chair of Info. Technol & Educat. CAB F 13.1, ETH Zürich, Zürich, Switzerland

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • Particular emphasis on the paging problem and advice complexity
  • Appropriate for undergraduate and graduate students of computer science
  • Key feature of author's approach is focus on the information which is hidden in a given instance
  • Includes supplementary material: sn.pub/extras

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 99.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

  1. Front Matter

    Pages i-xv
    Download chapter PDF

  2. Introduction

    • Dennis Komm
    Pages 1-30

  3. Randomization

    • Dennis Komm
    Pages 31-83

  4. Advice Complexity

    • Dennis Komm
    Pages 85-112

  5. The k-Server Problem

    • Dennis Komm
    Pages 113-154

  6. Job Shop Scheduling

    • Dennis Komm
    Pages 155-182

  7. The Knapsack Problem

    • Dennis Komm
    Pages 183-210

  8. The Bit Guessing Problem

    • Dennis Komm
    Pages 211-240

  9. Problems on Graphs

    • Dennis Komm
    Pages 241-267

  10. Back Matter

    Pages 269-349
    Download chapter PDF
Back to top

Keywords

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.

Reviews

“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)

Authors and Affiliations

  • Chair of Info. Technol & Educat. CAB F 13.1, ETH Zürich, Zürich, Switzerland

    Dennis Komm

About the author

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

  • DOI: https://doi.org/10.1007/978-3-319-42749-2

  • Publisher: Springer Cham

  • eBook Packages: Computer Science, Computer Science (R0)

  • Copyright Information: Springer International Publishing Switzerland 2016

  • Hardcover ISBN: 978-3-319-42747-8Published: 10 November 2016

  • Softcover ISBN: 978-3-319-82653-0Published: 28 June 2018

  • eBook ISBN: 978-3-319-42749-2Published: 31 October 2016

  • Series ISSN: 1862-4499

  • Series E-ISSN: 1862-4502

  • Edition Number: 1

  • Number of Pages: XV, 349

  • Number of Illustrations: 58 b/w illustrations

  • Topics: Theory of Computation, Algorithms

Publish with us

Policies and ethics

Back to top

Search

Navigation