@article{764147,
      author = {Komm, Dennis,},
      url = {http://library.usi.edu/record/764147},
      title = {An introduction to online computation : determinism,  randomization, advice /},
      abstract = {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.},
      doi = {https://doi.org/10.1007/978-3-319-42749-2},
      recid = {764147},
      pages = {1 online resource (xv, 349 pages) :},
}