Editing Workshops:Bertinoro 2011
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: | ||
{{DISPLAYTITLE:Bertinoro Workshop on Sublinear Algorithms 2011}} | {{DISPLAYTITLE:Bertinoro Workshop on Sublinear Algorithms 2011}} | ||
− | The workshop was held in Bertinoro in May of 2011. Many open problems and research directions were discussed at the workshop or were posed during presentations. [ | + | The workshop was held in Bertinoro in May of 2011. Many open problems and research directions were discussed at the workshop or were posed during presentations. [http://{{SERVERNAME}}/files/bertinoro2011_kanpur2009.pdf The original list of open problems] was scribed by Piotr Indyk and Ilan Newman. Further details can be found at [http://www.wisdom.weizmann.ac.il/~robi/Bertinoro2011_SublinearAlgorithms/ the workshop webpage]. |
== Links == | == Links == | ||
* [http://www.wisdom.weizmann.ac.il/~robi/Bertinoro2011_SublinearAlgorithms/ Workshop webpage] | * [http://www.wisdom.weizmann.ac.il/~robi/Bertinoro2011_SublinearAlgorithms/ Workshop webpage] | ||
− | * [ | + | * [http://{{SERVERNAME}}/files/bertinoro2011_kanpur2009.pdf List of open problems in the pdf format] |
== Open Problems == | == Open Problems == | ||
− | * | + | *[[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]] |
== Workshop Participants == | == Workshop Participants == |