Editing Workshops:Kanpur 2009
Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
| Latest revision | Your text | ||
| Line 7: | Line 7: | ||
== Open Problems == | == Open Problems == | ||
| − | * | + | *[[Open_Problems:22|Problem 22: Random Walks]] |
| − | * | + | *[[Open_Problems:23|Problem 23: Approximate 2D Width]] |
| − | * | + | *[[Open_Problems:24|Problem 24: “Ultimate” Deterministic Sparse Recovery]] |
| − | * | + | *[[Open_Problems:25|Problem 25: Communication Complexity and Metric Spaces]] |
| − | * | + | *[[Open_Problems:26|Problem 26: Equivalence of Two MapReduce Models]] |
| − | * | + | *[[Open_Problems:27|Problem 27: Modeling of Distributed Computation]] |
| − | * | + | *[[Open_Problems:28|Problem 28: Randomness of Partially Random Streams]] |
| − | * | + | *[[Open_Problems:29|Problem 29: Strong Lower Bounds for Graph Problems]] |
| − | * | + | *[[Open_Problems:30|Problem 30: Universal Sketching]] |
| − | * | + | *[[Open_Problems:31|Problem 31: Gap-Hamming Information Cost]] |
| − | * | + | *[[Open_Problems:32|Problem 32: The Value of a Reverse Pass]] |
| − | * | + | *[[Open_Problems:33|Problem 33: Group Testing]] |
| − | * | + | *[[Open_Problems:34|Problem 34: Linear Algebra Computation]] |
| − | * | + | *[[Open_Problems:35|Problem 35: Maximal Complex Equiangular Tight Frames]] |
== Workshop Participants == | == Workshop Participants == | ||
