# IITK Workshop on Algorithms for Processing Massive Data Sets 2009

Revision as of 10:17, 17 October 2012 by Krzysztof Onak (talk | contribs)

The workshop was held at the Indian Institute of Technology Kanpur in December of 2009. Many open problems and research directions were discussed at the workshop or were posed during presentations. The original list of open problems was scribed by Andrew McGregor and Krzysztof Onak. Further details can be found at the workshop webpage.

## Links

## Open Problems

- Problem 22: Random Walks
- Problem 23: Approximate 2D Width
- Problem 24: “Ultimate” Deterministic Sparse Recovery
- Problem 25: Communication Complexity and Metric Spaces
- Problem 26: Equivalence of Two MapReduce Models
- Problem 27: Modeling of Distributed Computation
- Problem 28: Randomness of Partially Random Streams
- Problem 29: Strong Lower Bounds for Graph Problems
- Problem 30: Universal Sketching
- Problem 31: Gap-Hamming Information Cost
- Problem 32: The Value of a Reverse Pass
- Problem 33: Group Testing
- Problem 34: Linear Algebra Computation
- Problem 35: Maximal Complex Equiangular Tight Frames

## Workshop Participants

- Pankaj K. Agarwal
- Kook Jin Ahn
- Paul Beame
- Amit Chakrabarti
- Inderjit Dhillon
- Dan Feldman
- Sumit Ganguly
- Sudipto Guha
- Piotr Indyk
- T. S. Jayram
- Christiane Lammersen
- Michael Mahoney
- Andrew McGregor
- Jelani Nelson
- Krzysztof Ona
- Rina Panigrahy
- Ely Porat
- Jaikumar Radhakrishnan
- Christian Sohler
- Joel Tropp
- Matthias Westermann
- David Woodruff