KS

Markov type

***

Mixture

Algorithms with distributed stability

Sketching, streaming, sensing, sparse approximations

Matrix/operator geometry, computation, and approximation

Primal-dual methods in optimization

Multiplicative weight updates

Spectral Graph Theory

Sparsest cut and multi-commodity flows

Partitioning heuristics

Convex geometry

Functional and Harmonic Analysis

Probability

Groups, algebra and geometry

Game theory

Stochastic Optimization

Complexity

Dynamic optimality

Distance Oracles, Labels, Compact Routing and Oblivious Routing

Here is my summary of lower- and upper-bounds in the routing literature.

Metric Embeddings

Optimization

Algorithms

Coding

Arithmetic and analytic combinatorics

Systems

Return to Petar Maymounkov's homepage.