Anna Karlin

Bill & Melinda Gates Chair at UW & Online Algorithms Pioneer

Lifespan 1960–

Technical Depth advanced

Key Breakthrough Competitive Online Analysis & Randomized Snoopy Caching (1988)

Focus Areas

theoretical computer science online algorithms algorithmic game theory

Topic Keywords

#online-algorithms #caching #game-theory #randomized-algorithms #theory

Source: Historical Biographical Archive / Wikimedia Commons

Anna Karlin

Bill & Melinda Gates Chair at UW & Online Algorithms Pioneer

Biographical Overview

Bill & Melinda Gates Chair in Computer Science & Engineering at the University of Washington. She is an authority in theoretical computer science, pioneering competitive analysis of online algorithms, randomized caching, and algorithmic game theory.

"Making optimal decisions in real time without knowing the future is the central mathematical puzzle of computer systems."
— Anna Karlin

Lifespan 1960–

Technical Depth advanced

Key Breakthrough Competitive Online Analysis & Randomized Snoopy Caching (1988)

Focus Areas

theoretical computer science online algorithms algorithmic game theory

Topic Keywords

#online-algorithms #caching #game-theory #randomized-algorithms #theory

Source: Historical Biographical Archive / Wikimedia Commons

💡

Historical Context & Impact

In short

While working at DEC Systems Research Center in the late 1980s, Karlin helped invent "competitive analysis" for online algorithms. She proved mathematically that an operating system making cache eviction decisions without any knowledge of future memory requests could perform within a provable constant factor of a hypothetical clairvoyant computer.

Key Technical Breakthroughs & Inventions

Competitive Analysis of Online Algorithms (1988) Co-invented competitive analysis frameworks that evaluate the performance of online algorithms against optimal offline algorithms with full future knowledge.

Randomized Cache Eviction & Memory Management Developed randomized snoopy caching algorithms that proved randomized paging could achieve strictly better competitive ratios than deterministic paging.

Balls-into-Bins & Load Balancing Analysis Proved foundational concentration bounds for randomized hashing and distributed load balancing that underpin modern distributed hash tables (DHTs).

Algorithmic Mechanism Design & Auction Theory Co-authored the graduate textbook "Game Theory, Alive," analyzing equilibrium computation, ad auction design, and revenue maximization.