Online Bounded Analysis

  title={Online Bounded Analysis},
  author={J. Boyar and L. Epstein and Lene M. Favrholdt and K. Larsen and A. Levin},
  • J. Boyar, L. Epstein, +2 authors A. Levin
  • Published in CSR 2016
  • Computer Science, Mathematics
  • Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results. Much work has gone into exploring other performance measures, in particular targeted at what seems to be the core problem with competitive analysis: the comparison of the performance of an online algorithm is made to a too powerful adversary. We consider a new approach to restricting the power of the adversary, by… CONTINUE READING
    Weighted Online Problems with Advice
    • 3
    • PDF
    SIGACT News Online Algorithms Column 29
    Relative Worst-Order Analysis: A Survey
    • 2
    • PDF


    Publications referenced by this paper.
    Online-bounded analysis
    • 5
    Amortized efficiency of list update and paging rules
    • 2,251
    • PDF
    Speed is as powerful as clairvoyance
    • 593
    A new measure for the study of on-line algorithms
    • 131
    • PDF
    On the Separation and Equivalence of Paging Strategies and Other Online Algorithms
    • 69
    • PDF
    Randomized online scheduling on two uniform machines
    • 92
    On paging with locality of reference
    • 66
    • PDF
    The relative worst order ratio for online algorithms
    • 71
    • PDF
    Competitive paging with locality of reference
    • 160
    Best-fit bin-packing with random order
    • 139
    • PDF