Automata theory, languages, and computation
The price of validity in dynamic networks
Nonclairvoyant scheduling
Models and issues in data stream systems
Maintaining Stream Statistics over Sliding Windows
Proof verification and the hardness of approximation problems
Proceedings of the 1997 ACM SIGMOD international conference on Management of data - SIGMOD ’97
Theoretical Computer Science
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC ’98
Proceedings of the 2004 ACM SIGMOD international conference on Management of data - SIGMOD ’04
Proceedings of the VLDB Endowment
Journal of the ACM
Aristides Gionis
Piotr Indyk
Mayur Datar
John E Hopcroft
Madhu Sudan
Mayank Bawa
Stable distributions, pseudorandom generators, embeddings, and data stream computation
The geometric maximum traveling salesman problem
Multi-processor scheduling to minimize flow time with ? resource augmentation
Affordable Analytics on Expensive Data
Beating CountSketch for heavy hitters in insertion streams
Bypassing UGC from Some Optimal Geometric Inapproximability Results