Editing Workshops:Dortmund 2012
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: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 Graph Streams]] |
| − | * | + | *[[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]] |
== Workshop Speakers == | == Workshop Speakers == | ||
