Difference between revisions of "Resources"
| Line 8: | Line 8: | ||
=== Workshops === | === Workshops === | ||
| − | * [http://www.cs.princeton.edu/~mbraverm/pmwiki/index.php?n=Research.STOC13Workshop Information Complexity and | + | * [http://www.cs.princeton.edu/~mbraverm/pmwiki/index.php?n=Research.STOC13Workshop Information Complexity and Applications] at STOC 2013. |
== Compressed sensing (sublinear measurement) == | == Compressed sensing (sublinear measurement) == | ||
| Line 14: | Line 14: | ||
* P. Indyk. [http://stellar.mit.edu/S/course/6/fa07/6.895/ ''Sketching, streaming, and sub-linear space algorithms.''] MIT, Fall 2007. | * P. Indyk. [http://stellar.mit.edu/S/course/6/fa07/6.895/ ''Sketching, streaming, and sub-linear space algorithms.''] MIT, Fall 2007. | ||
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. | * P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. | ||
| + | * P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013. | ||
== Property testing and sublinear-time algorithms == | == Property testing and sublinear-time algorithms == | ||
| Line 22: | Line 23: | ||
* S. Raskhodnikova. [http://www.cse.psu.edu/~sofya/sublinear598/ ''Sublinear Algorithms.''] Penn State, Spring 2012. | * S. Raskhodnikova. [http://www.cse.psu.edu/~sofya/sublinear598/ ''Sublinear Algorithms.''] Penn State, Spring 2012. | ||
* T. Sauerwald. [http://www.mpi-inf.mpg.de/departments/d1/teaching/ws12/sublinear/ ''Sublinear Algorithms.''] Max Planck Institut, Winter Semester 2012. | * T. Sauerwald. [http://www.mpi-inf.mpg.de/departments/d1/teaching/ws12/sublinear/ ''Sublinear Algorithms.''] Max Planck Institut, Winter Semester 2012. | ||
| + | * P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013. | ||
=== Surveys === | === Surveys === | ||
| Line 34: | Line 36: | ||
== Streaming algorithms == | == Streaming algorithms == | ||
=== Classes === | === Classes === | ||
| − | |||
* P. Indyk. [http://stellar.mit.edu/S/course/6/fa07/6.895/ ''Sketching, streaming, and sub-linear space algorithms.''] MIT, Fall 2007. | * P. Indyk. [http://stellar.mit.edu/S/course/6/fa07/6.895/ ''Sketching, streaming, and sub-linear space algorithms.''] MIT, Fall 2007. | ||
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. | * P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. | ||
* A. McGregor. [http://people.cs.umass.edu/~mcgregor/courses/CS711S12/ ''Data streams and massive data.''] University of Massachusetts in Amherst, Spring 2012. | * A. McGregor. [http://people.cs.umass.edu/~mcgregor/courses/CS711S12/ ''Data streams and massive data.''] University of Massachusetts in Amherst, Spring 2012. | ||
| + | * P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013. | ||
=== Surveys === | === Surveys === | ||
Revision as of 04:34, 18 June 2013
Contents
(Please add links only to class websites that provide lecture notes and/or slides.)
Communication complexity (sublinear communication)
Classes
- P. Harsha, M. Mahajan, and J. Radhakrishnan. Communication Complexity. TIFR & IMSc, Monsoon Semester 2011-12.
Workshops
- Information Complexity and Applications at STOC 2013.
Compressed sensing (sublinear measurement)
Classes
- P. Indyk. Sketching, streaming, and sub-linear space algorithms. MIT, Fall 2007.
- P. Indyk and R. Rubinfeld. Sublinear Algorithms. MIT, Fall 2010.
- P. Indyk and R. Rubinfeld. Sublinear Algorithms. MIT, Spring 2013.
Property testing and sublinear-time algorithms
Classes
- R. Rubinfeld and E. Ben-Sasson. Sublinear Time Algorithms. MIT, Fall 2004.
- R. Rubinfeld. Sublinear Time Algorithms. MIT, Spring 2007.
- P. Indyk and R. Rubinfeld. Sublinear Algorithms. MIT, Fall 2010.
- S. Raskhodnikova. Sublinear Algorithms. Penn State, Spring 2012.
- T. Sauerwald. Sublinear Algorithms. Max Planck Institut, Winter Semester 2012.
- P. Indyk and R. Rubinfeld. Sublinear Algorithms. MIT, Spring 2013.
Surveys
- E. Fischer. The art of uninformed decisions: a primer to property testing. 2001.
- D. Ron. Property Testing. Handbook of Randomized Computing, Vol. II, 2001.
- R. Rubinfield. Sublinear time algorithms. Proceedings of the International Congress of Mathematicians, 2006.
- D. Ron. Property testing: a learning theory perspective. 2008.
- A. Czumaj and C. Sohler. Sublinear-time algorithms. In Property Testing. Current Research and Surveys. 2010.
- O. Goldreich. Introduction to testing graph properties. 2010.
- R. Rubinfeld and A. Shapira. Sublinear time algorithms. SIAM Journal on Discrete Mathematics 25, 2011.
Streaming algorithms
Classes
- P. Indyk. Sketching, streaming, and sub-linear space algorithms. MIT, Fall 2007.
- P. Indyk and R. Rubinfeld. Sublinear Algorithms. MIT, Fall 2010.
- A. McGregor. Data streams and massive data. University of Massachusetts in Amherst, Spring 2012.
- P. Indyk and R. Rubinfeld. Sublinear Algorithms. MIT, Spring 2013.
Surveys
- S. Muthukrishnan. Data streams: algorithms and applications. Now Publishers Inc, 2005.
