Editing Open Problems:By Number
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 1: | Line 1: | ||
Problems suggested at the [[Workshops:Kanpur_2006|IITK Workshop on Algorithms for Data Streams 2006]]: | Problems suggested at the [[Workshops:Kanpur_2006|IITK Workshop on Algorithms for Data Streams 2006]]: | ||
| − | * | + | *[[Open_Problems:1|Problem 1: Fast $L_1$ Difference]] |
| − | * | + | *[[Open_Problems:2|Problem 2: Quantiles]] |
| − | * | + | *[[Open_Problems:3|Problem 3: $L_\infty$ Estimation]] |
| − | * | + | *[[Open_Problems:4|Problem 4: Deterministic Summary Structures]] |
| − | * | + | *[[Open_Problems:5|Problem 5: Characterizing Sketchable Distances]] |
| − | * | + | *[[Open_Problems:6|Problem 6: Filtering Irrelevant Data]] |
| − | * | + | *[[Open_Problems:7|Problem 7: Estimating Earth-Mover Distance]] |
| − | * | + | *[[Open_Problems:8|Problem 8: Mixed Norms]] |
| − | * | + | *[[Open_Problems:9|Problem 9: OSPF Routing]] |
| − | * | + | *[[Open_Problems:10|Problem 10: Multi-Round Communication of Gap-Hamming Distance]] |
| − | * | + | *[[Open_Problems:11|Problem 11: Counting Triangles]] |
| − | * | + | *[[Open_Problems:12|Problem 12: Deterministic $CUR$-Type Decompositions]] |
| − | * | + | *[[Open_Problems:13|Problem 13: Effects of Subsampling]] |
| − | * | + | *[[Open_Problems:14|Problem 14: Graph Distances]] |
| − | * | + | *[[Open_Problems:15|Problem 15: Semi-Random Streams]] |
| − | * | + | *[[Open_Problems:16|Problem 16: Graph Matchings]] |
| − | * | + | *[[Open_Problems:17|Problem 17: The Massive, Unordered, Distributed-Data Model]] |
| − | * | + | *[[Open_Problems:18|Problem 18: Finite Cursor Machines]] |
| − | * | + | *[[Open_Problems:19|Problem 19: Sketching vs. Streaming]] |
| − | * | + | *[[Open_Problems:20|Problem 20: Relations between Streaming Models]] |
| − | * | + | *[[Open_Problems:21|Problem 21: Deterministic Heavy-Hitters & Fast Matrix Algorithms]] |
Problems suggested at the [[Workshops:Kanpur_2009|IITK Workshop on Algorithms for Processing Massive Data Sets 2009]]: | Problems suggested at the [[Workshops:Kanpur_2009|IITK Workshop on Algorithms for Processing Massive Data Sets 2009]]: | ||
| − | * | + | *[[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]] |
Problems suggested at the [[Workshops:Bertinoro_2011|Bertinoro Workshop on Sublinear Algorithms 2011]]: | Problems suggested at the [[Workshops:Bertinoro_2011|Bertinoro Workshop on Sublinear Algorithms 2011]]: | ||
| − | * | + | *[[Open_Problems:36|Problem 36: Learning an $f$-Transformed Product Distribution]] |
| − | * | + | *[[Open_Problems:37|Problem 37: Testing Submodularity]] |
| − | * | + | *[[Open_Problems:38|Problem 38: Query Complexity of Local Partitioning Oracles]] |
| − | * | + | *[[Open_Problems:39|Problem 39: Approximating Maximum Matching Size]] |
| − | * | + | *[[Open_Problems:40|Problem 40: Testing Monotonicity and the Lipschitz Property]] |
| − | * | + | *[[Open_Problems:41|Problem 41: Testing Acyclicity]] |
| − | * | + | *[[Open_Problems:42|Problem 42: Graph Frequency Vectors]] |
| − | * | + | *[[Open_Problems:43|Problem 43: Rank Lower Bound]] |
| − | * | + | *[[Open_Problems:44|Problem 44: Approximating LIS Length in the Streaming Model]] |
| − | * | + | *[[Open_Problems:45|Problem 45: Streaming Max-Cut/Max-CSP]] |
| − | * | + | *[[Open_Problems:46|Problem 46: Fast JL Transform for Sparse Vectors]] |
| − | * | + | *[[Open_Problems:47|Problem 47: Annotated Streaming]] |
| − | * | + | *[[Open_Problems:48|Problem 48: Sketching Shift Metrics]] |
| − | * | + | *[[Open_Problems:49|Problem 49: Sketching Earth Mover Distance]] |
| − | * | + | *[[Open_Problems:50|Problem 50: Sparse Recovery for Tree Models]] |
Problems suggested at the [[Workshops:Dortmund_2012|Dortmund Workshop on Algorithms for Data Streams 2012]]: | Problems suggested at the [[Workshops:Dortmund_2012|Dortmund Workshop on Algorithms for Data Streams 2012]]: | ||
| − | * | + | *[[Open_Problems:51|Problem 51: “For All” Guarantee for Computationally Bounded Adversaries]] |
| − | * | + | *[[Open_Problems:52|Problem 52: TSP in the Streaming Model]] |
| − | * | + | *[[Open_Problems:53|Problem 53: Homomorphic Hash Functions]] |
| − | * | + | *[[Open_Problems:54|Problem 54: Faster JL Dimensionality Reduction]] |
| − | + | *[[Open_Problems:55|Problem 55: Applications of Clifford Algebras in Streaming]] | |
| − | + | *[[Open_Problems:56|Problem 56: Efficient Measures of “Surprisingness” of Sequences]] | |
| − | * | + | *[[Open_Problems:57|Problem 57: Coding Theory in the Streaming Model]] |
| − | + | *[[Open_Problems:58|Problem 58: Signatures for Set Equality]] | |
| − | + | *[[Open_Problems:59|Problem 59: Low Expansion Encoding of Edit Distance]] | |
| − | + | *[[Open_Problems:60|Problem 60: Single-Pass Unweighted Matchings]] | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | * | ||
| − | |||
| − | |||
| − | |||
| − | * | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | * | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | * | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | * | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
