The Advice Complexity of a Class of Hard Online Problems

Amortized efficiency of list update and paging rules

Daniel D. Sleator, Robert E. Tarjan · Communications of the ACM · 1985 · 2.1K citations · Full text

Computing, Computer Engineering, Computer Science +17

Clique is hard to approximate within n1−ε

Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text

Computing, Computer Science, Algorithms +3

A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

Ran Raz · 1997 · 842 citations

Natural Sciences, Computer Science, Fault Tolerance +5

Competitive snoopy caching

Anna R. Karlin, Mark S. Manasse, Larry Rudolph et al. · Algorithmica · 1988 · 612 citations

Computing, Computer Engineering, Computer Science +11

Stochastic on-line knapsack problems

Alberto Marchetti-Spaccamela, Carlo Vercellis · Mathematical Programming · 1995 · 147 citations

Natural Sciences, Mathematics, Optimization +8