Workshops:Bertinoro 2011 - Revision history

Krzysztof Onak: Switching to HTTPS

2017-01-19T06:24:43Z

Switching to HTTPS

Krzysztof Onak at 01:47, 7 March 2013

2013-03-07T01:47:12Z

Krzysztof Onak: 1 revision

2012-11-08T05:57:35Z

1 revision

Krzysztof Onak: Created page with "{{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 a..."

2012-10-17T10:25:02Z

Created page with "{{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 a..."

New page

{{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. [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 ==
* [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: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 ==
* Nir Ailon
* Noga Alon
* Alexandr Andoni
* Arnab Bhattacharyya
* Vladimir Braverman
* Amit Chakrabarti
* Graham Cormode
* Artur Czumaj
* Pierre Fraigniaud
* Oded Goldreich
* Nir Halman
* Sariel Har-Peled
* Piotr Indyk
* Tali Kaufman
* Robert Krauthgamer
* Oded Lachish
* Michael Mahoney
* Andrew McGregor
* Morteza Monemizadeh
* Jelani Nelson
* Ilan Newman
* Krzysztof Onak
* Ely Porat
* Sofya Raskhodnikova
* Ronitt Rubinfeld
* Rocco Servedio
* Madhu Sudan
* Ben Recht
* Justin Romberg
* Dana Ron
* C. Seshadhri
* Asaf Shapira
* Christian Sohler
* Gilad Tsur
* Paul Valiant
* Roger Wattenhofer
* David Woodruff
* Ning Xie
* Yuichi Yoshida
__FORCETOC__

@@ Line 1: / Line 1: @@
 {{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. [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].
+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. [https://{{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 ==
 * [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]
+* [https://{{SERVERNAME}}/files/bertinoro2011_kanpur2009.pdf List of open problems in the pdf format]
 == Open Problems ==

@@ Line 7: / Line 7: @@
 == Open Problems ==
-*[[Open_Problems:36|Problem 36: Learning an $f$-Transformed Product Distribution]]
+*{{ProblemLink|36}}
-*[[Open_Problems:37|Problem 37: Testing Submodularity]]
+*{{ProblemLink|37}}
-*[[Open_Problems:38|Problem 38: Query Complexity of Local Partitioning Oracles]]
+*{{ProblemLink|38}}
-*[[Open_Problems:39|Problem 39: Approximating Maximum Matching Size]]
+*{{ProblemLink|39}}
-*[[Open_Problems:40|Problem 40: Testing Monotonicity and the Lipschitz Property]]
+*{{ProblemLink|40}}
-*[[Open_Problems:41|Problem 41: Testing Acyclicity]]
+*{{ProblemLink|41}}
-*[[Open_Problems:42|Problem 42: Graph Frequency Vectors]]
+*{{ProblemLink|42}}
-*[[Open_Problems:43|Problem 43: Rank Lower Bound]]
+*{{ProblemLink|43}}
-*[[Open_Problems:44|Problem 44: Approximating LIS Length in the Streaming Model]]
+*{{ProblemLink|44}}
-*[[Open_Problems:45|Problem 45: Streaming Max-Cut/Max-CSP]]
+*{{ProblemLink|45}}
-*[[Open_Problems:46|Problem 46: Fast JL Transform  for Sparse Vectors]]
+*{{ProblemLink|46}}
-*[[Open_Problems:47|Problem 47: Annotated Streaming]]
+*{{ProblemLink|47}}
-*[[Open_Problems:48|Problem 48: Sketching Shift Metrics]]
+*{{ProblemLink|48}}
-*[[Open_Problems:49|Problem 49: Sketching Earth Mover Distance]]
+*{{ProblemLink|49}}
-*[[Open_Problems:50|Problem 50: Sparse Recovery for Tree Models]]
+*{{ProblemLink|50}}
 == Workshop Participants ==

← Older revision	Revision as of 05:57, 8 November 2012
(No difference)