# Difference between revisions of "Workshops:Kanpur 2006"

Line 1: | Line 1: | ||

{{DISPLAYTITLE:IITK Workshop on Algorithms for Data Streams 2006}} | {{DISPLAYTITLE:IITK Workshop on Algorithms for Data Streams 2006}} | ||

− | The workshop was held at the Indian Institute of Technology Kanpur in December of 2006. Many open problems and research directions were discussed at the workshop or were posed during presentations. [ | + | The workshop was held at the Indian Institute of Technology Kanpur in December of 2006. Many open problems and research directions were discussed at the workshop or were posed during presentations. [https://{{SERVERNAME}}/files/kanpur2006.pdf The original list of open problems] was scribed by Andrew McGregor. Further details, including videos of discussion sections, can be found at [http://www.cse.iitk.ac.in/users/sganguly/workshop.html the workshop webpage]. |

== Links == | == Links == | ||

* [http://www.cse.iitk.ac.in/users/sganguly/workshop.html Workshop webpage] | * [http://www.cse.iitk.ac.in/users/sganguly/workshop.html Workshop webpage] | ||

− | * [ | + | * [https://{{SERVERNAME}}/files/kanpur2006.pdf List of open problems in the pdf format] |

== Open Problems == | == Open Problems == |

## Latest revision as of 06:08, 19 January 2017

The workshop was held at the Indian Institute of Technology Kanpur in December of 2006. 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. Further details, including videos of discussion sections, can be found at the workshop webpage.

## Contents

## Links[edit]

## Open Problems[edit]

- Problem 1: Fast $L_1$ Difference
- Problem 2: Quantiles
- Problem 3: $L_\infty$ Estimation
- Problem 4: Deterministic Summary Structures
- Problem 5: Characterizing Sketchable Distances
- Problem 6: Filtering Irrelevant Data
- Problem 7: Estimating Earth-Mover Distance
- Problem 8: Mixed Norms
- Problem 9: Open-Shortest-Path-First Routing
- Problem 10: Multi-Round Communication of Gap-Hamming Distance
- Problem 11: Counting Triangles
- Problem 12: Deterministic $CUR$-Type Decompositions
- Problem 13: Effects of Subsampling
- Problem 14: Graph Distances
- Problem 15: Semi-Random Streams
- Problem 16: Graph Matchings
- Problem 17: The Massive, Unordered, Distributed-Data Model
- Problem 18: Finite Cursor Machines
- Problem 19: Sketching vs. Streaming
- Problem 20: Relations between Streaming Models
- Problem 21: Deterministic Heavy-Hitters & Fast Matrix Algorithms

## Workshop Speakers[edit]

- Pankaj Agarwal
- Surender Baswana
- Amit Chakarabarti
- Graham Cormode
- Sudipto Guha
- Piotr Indyk
- T. S. Jayram
- Ravi Kannan
- Sampath Kannan
- Ravi Kumar
- Stefano Leonardi
- Yossi Matias
- Michael Mahoney
- Andrew McGregor
- S. Muthukrishnan
- Rajeev Raman
- Nicole Schweikardt
- D. Sivakumar
- Christian Sohler
- Divesh Srivastava
- Martin Strauss
- Subhash Suri
- Srikanta Tirthapura