A Graph-Theoretic Game and Its Application to the k-Server Problem
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
A simple algorithm for finding frequent elements in streams and bags
A n5/2 algorithm for maximum matchings in bipartite
SIAM Journal on Computing
ACM Transactions on Database Systems
Journal of the ACM
12th Annual Symposium on Switching and Automata Theory (swat 1971)
Scott Shenker
Noga Alon
Douglas West
David Peleg
John E Hopcroft
Christos H. Papadimitriou
Bounds on multiprocessing anomalies and related packing algorithms
Bypassing the embedding
Beating CountSketch for heavy hitters in insertion streams
Selfish load balancing and atomic congestion games