<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://sublinear.info/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=73.241.98.76</id>
	<title>Open Problems in Sublinear Algorithms - User contributions [en]</title>
	<link rel="self" type="application/atom+xml" href="https://sublinear.info/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=73.241.98.76"/>
	<link rel="alternate" type="text/html" href="https://sublinear.info/index.php?title=Special:Contributions/73.241.98.76"/>
	<updated>2026-04-22T18:37:19Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.31.10</generator>
	<entry>
		<id>https://sublinear.info/index.php?title=Resources&amp;diff=974</id>
		<title>Resources</title>
		<link rel="alternate" type="text/html" href="https://sublinear.info/index.php?title=Resources&amp;diff=974"/>
		<updated>2016-04-06T05:11:57Z</updated>

		<summary type="html">&lt;p&gt;73.241.98.76: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Resources on Sublinear Algorithms}}&lt;br /&gt;
__TOC__&lt;br /&gt;
(Please add links only to class and workshop websites that provide lecture notes, slides, or videos.)&lt;br /&gt;
&lt;br /&gt;
== Communication complexity (sublinear communication) ==&lt;br /&gt;
=== Classes ===&lt;br /&gt;
*  P. Harsha, M. Mahajan, and J. Radhakrishnan. [http://www.tcs.tifr.res.in/~prahladh/teaching/2011-12/comm/ ''Communication Complexity.''] TIFR &amp;amp;amp; IMSc, Monsoon Semester 2011-12. &lt;br /&gt;
&lt;br /&gt;
=== Workshops ===&lt;br /&gt;
* [http://www.cs.princeton.edu/~mbraverm/pmwiki/index.php?n=Research.STOC13Workshop Information Complexity and Applications] at STOC 2013.&lt;br /&gt;
* [https://www.birs.ca/events/2014/5-day-workshops/14w5164 Communication Complexity and Applications] in Banff, 2014.&lt;br /&gt;
&lt;br /&gt;
== Compressed sensing (sublinear measurement) ==&lt;br /&gt;
=== Classes ===&lt;br /&gt;
* P. Indyk. [http://stellar.mit.edu/S/course/6/fa07/6.895/ ''Sketching, streaming, and sub-linear space algorithms.''] MIT, Fall 2007. &lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. &lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013. &lt;br /&gt;
&lt;br /&gt;
== Property testing and sublinear-time algorithms ==&lt;br /&gt;
=== Classes ===&lt;br /&gt;
* R. Rubinfeld and E. Ben-Sasson. [http://people.csail.mit.edu/ronitt/COURSE/F04/index.html ''Sublinear Time Algorithms.''] MIT, Fall 2004. &lt;br /&gt;
* R. Rubinfeld. [http://people.csail.mit.edu/ronitt/COURSE/S07/ ''Sublinear Time Algorithms.''] MIT, Spring 2007. &lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. &lt;br /&gt;
* S. Raskhodnikova. [http://www.cse.psu.edu/~sofya/sublinear598/ ''Sublinear Algorithms.''] Penn State, Spring 2012.&lt;br /&gt;
* T. Sauerwald. [http://www.mpi-inf.mpg.de/departments/d1/teaching/ws12/sublinear/ ''Sublinear Algorithms.''] Max Planck Institut, Winter Semester 2012.&lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013.&lt;br /&gt;
* G. Yaroslavtsev. [http://grigory.us/big-data.html ''Sublinear Algorithms for Big Data.''] University of Buenos Aires, Summer 2014.&lt;br /&gt;
* E. Price. [http://www.cs.utexas.edu/~ecprice/courses/sublinear/ ''Sublinear Algorithms''] UT Austin, Fall 2014&lt;br /&gt;
* R. Servedio. [http://www.cs.columbia.edu/~rocco/Teaching/S14/# ''Sublinear Time Algorithms in Learning and Property Testing''] Columbia, Spring 2014&lt;br /&gt;
&lt;br /&gt;
=== News ===&lt;br /&gt;
* Blog [http://ptreview.sublinear.info/ ''Property Testing Review.''] &lt;br /&gt;
&lt;br /&gt;
=== Lecture Notes ===&lt;br /&gt;
&lt;br /&gt;
* [http://www.wisdom.weizmann.ac.il/~oded/pt-ln.html ''Oded Goldreich's notes'']&lt;br /&gt;
&lt;br /&gt;
=== Surveys ===&lt;br /&gt;
* E. Fischer. [http://www.cs.technion.ac.il/~eldar/surv.ps ''The art of uninformed decisions: a primer to property testing.''] 2001. &lt;br /&gt;
* D. Ron. [http://www.eng.tau.ac.il/~danar/Public-pdf/tut.pdf ''Property Testing.''] Handbook of Randomized Computing, Vol. II, 2001. &lt;br /&gt;
* R. Rubinfeld. [http://www.icm2006.org/proceedings/Vol_III/contents/ICM_Vol_3_53.pdf ''Sublinear time algorithms.''] Proceedings of the International Congress of Mathematicians, 2006. &lt;br /&gt;
* D. Ron. [http://www.eng.tau.ac.il/~danar/Public-pdf/fnt-ml.pdf ''Property testing: a learning theory perspective.''] 2008. &lt;br /&gt;
* A. Czumaj and C. Sohler. [http://www.dcs.warwick.ac.uk/~czumaj/PUBLICATIONS/DRAFTS/Draft-Survey-Sublinear.pdf ''Sublinear-time algorithms.''] In ''Property Testing. Current Research and Surveys.'' 2010. &lt;br /&gt;
* O. Goldreich. [http://www.wisdom.weizmann.ac.il/~oded/p_tgp.html ''Introduction to testing graph properties.''] 2010.&lt;br /&gt;
* R. Rubinfeld and A. Shapira. [http://www.math.tau.ac.il/~asafico/sublinear.pdf ''Sublinear time algorithms.''] SIAM Journal on Discrete Mathematics 25, 2011. &lt;br /&gt;
* R. Rubinfeld. [https://dl.acm.org/citation.cfm?id=2331052 ''Taming big probability distributions.''] XRDS, 2012.&lt;br /&gt;
* A. Montanaro and R. de Wolf. [http://arxiv.org/abs/1310.2035 ''A Survey of Quantum Property Testing.''] 2013.&lt;br /&gt;
* C. Canonne. [http://eccc.hpi-web.de/report/2015/063/ ''A Survey on Distribution Testing: Your Data is Big. But is it Blue?''] 2015.&lt;br /&gt;
* O. Goldreich. [http://www.wisdom.weizmann.ac.il/~oded/PDF/pt-intro.pdf ''Notes for the first lecture in a course on Property Testing.''] 2016.&lt;br /&gt;
&lt;br /&gt;
=== Books ===&lt;br /&gt;
* Arnab Bhattacharyya and Yuichi Yoshida. [http://propertytestingbook.wordpress.com &amp;quot;Property Testing.&amp;quot;] 2017?.&lt;br /&gt;
&lt;br /&gt;
== Streaming algorithms ==&lt;br /&gt;
=== Classes ===&lt;br /&gt;
* P. Indyk. [http://stellar.mit.edu/S/course/6/fa07/6.895/ ''Sketching, streaming, and sub-linear space algorithms.''] MIT, Fall 2007. &lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. &lt;br /&gt;
* A. McGregor. [http://people.cs.umass.edu/~mcgregor/courses/CS711S12/ ''Data streams and massive data.''] University of Massachusetts in Amherst, Spring 2012. &lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013.&lt;br /&gt;
* J. Nelson. [http://people.seas.harvard.edu/~minilek/cs229r/ ''Algorithms for Big Data.''] Harvard, Fall 2013.&lt;br /&gt;
* G. Yaroslavtsev. [http://grigory.us/big-data.html ''Sublinear Algorithms for Big Data.''] University of Buenos Aires, Summer 2014.&lt;br /&gt;
&lt;br /&gt;
=== Surveys ===&lt;br /&gt;
* S. Muthukrishnan. [http://algo.research.googlepages.com/eight.ps ''Data streams: algorithms and applications.''] Now Publishers Inc, 2005. &lt;br /&gt;
* A. McGregor. [http://people.cs.umass.edu/~mcgregor/papers/13-graphsurvey.pdf ''Graph Stream Algorithms: A Survey.''] 2013.&lt;br /&gt;
&lt;br /&gt;
=== Workshops ===&lt;br /&gt;
* [http://wsga.sandia.gov/presentations.html Workshop on Streaming Graph Algorithms] at the Sandia National Laboratories, 2014.&lt;br /&gt;
&lt;br /&gt;
__FORCETOC__&lt;/div&gt;</summary>
		<author><name>73.241.98.76</name></author>
		
	</entry>
	<entry>
		<id>https://sublinear.info/index.php?title=Resources&amp;diff=973</id>
		<title>Resources</title>
		<link rel="alternate" type="text/html" href="https://sublinear.info/index.php?title=Resources&amp;diff=973"/>
		<updated>2016-04-06T05:11:22Z</updated>

		<summary type="html">&lt;p&gt;73.241.98.76: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;{{DISPLAYTITLE:Resources on Sublinear Algorithms}}&lt;br /&gt;
__TOC__&lt;br /&gt;
(Please add links only to class and workshop websites that provide lecture notes, slides, or videos.)&lt;br /&gt;
&lt;br /&gt;
== Communication complexity (sublinear communication) ==&lt;br /&gt;
=== Classes ===&lt;br /&gt;
*  P. Harsha, M. Mahajan, and J. Radhakrishnan. [http://www.tcs.tifr.res.in/~prahladh/teaching/2011-12/comm/ ''Communication Complexity.''] TIFR &amp;amp;amp; IMSc, Monsoon Semester 2011-12. &lt;br /&gt;
&lt;br /&gt;
=== Workshops ===&lt;br /&gt;
* [http://www.cs.princeton.edu/~mbraverm/pmwiki/index.php?n=Research.STOC13Workshop Information Complexity and Applications] at STOC 2013.&lt;br /&gt;
* [https://www.birs.ca/events/2014/5-day-workshops/14w5164 Communication Complexity and Applications] in Banff, 2014.&lt;br /&gt;
&lt;br /&gt;
== Compressed sensing (sublinear measurement) ==&lt;br /&gt;
=== Classes ===&lt;br /&gt;
* P. Indyk. [http://stellar.mit.edu/S/course/6/fa07/6.895/ ''Sketching, streaming, and sub-linear space algorithms.''] MIT, Fall 2007. &lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. &lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013. &lt;br /&gt;
&lt;br /&gt;
== Property testing and sublinear-time algorithms ==&lt;br /&gt;
=== Classes ===&lt;br /&gt;
* R. Rubinfeld and E. Ben-Sasson. [http://people.csail.mit.edu/ronitt/COURSE/F04/index.html ''Sublinear Time Algorithms.''] MIT, Fall 2004. &lt;br /&gt;
* R. Rubinfeld. [http://people.csail.mit.edu/ronitt/COURSE/S07/ ''Sublinear Time Algorithms.''] MIT, Spring 2007. &lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. &lt;br /&gt;
* S. Raskhodnikova. [http://www.cse.psu.edu/~sofya/sublinear598/ ''Sublinear Algorithms.''] Penn State, Spring 2012.&lt;br /&gt;
* T. Sauerwald. [http://www.mpi-inf.mpg.de/departments/d1/teaching/ws12/sublinear/ ''Sublinear Algorithms.''] Max Planck Institut, Winter Semester 2012.&lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013.&lt;br /&gt;
* G. Yaroslavtsev. [http://grigory.us/big-data.html ''Sublinear Algorithms for Big Data.''] University of Buenos Aires, Summer 2014.&lt;br /&gt;
* E. Price. [http://www.cs.utexas.edu/~ecprice/courses/sublinear/ ''Sublinear Algorithms''] UT Austin, Fall 2014&lt;br /&gt;
* R. Servedio. [http://www.cs.columbia.edu/~rocco/Teaching/S14/# ''Sublinear Time Algorithms in Learning and Property Testing''] Columbia, Spring 2014&lt;br /&gt;
&lt;br /&gt;
=== News ===&lt;br /&gt;
* Blog [http://ptreview.sublinear.info/ ''Property Testing Review.''] &lt;br /&gt;
&lt;br /&gt;
=== Lecture Notes ===&lt;br /&gt;
&lt;br /&gt;
* [''http://www.wisdom.weizmann.ac.il/~oded/pt-ln.html'' Oded Goldreich's notes]&lt;br /&gt;
&lt;br /&gt;
=== Surveys ===&lt;br /&gt;
* E. Fischer. [http://www.cs.technion.ac.il/~eldar/surv.ps ''The art of uninformed decisions: a primer to property testing.''] 2001. &lt;br /&gt;
* D. Ron. [http://www.eng.tau.ac.il/~danar/Public-pdf/tut.pdf ''Property Testing.''] Handbook of Randomized Computing, Vol. II, 2001. &lt;br /&gt;
* R. Rubinfeld. [http://www.icm2006.org/proceedings/Vol_III/contents/ICM_Vol_3_53.pdf ''Sublinear time algorithms.''] Proceedings of the International Congress of Mathematicians, 2006. &lt;br /&gt;
* D. Ron. [http://www.eng.tau.ac.il/~danar/Public-pdf/fnt-ml.pdf ''Property testing: a learning theory perspective.''] 2008. &lt;br /&gt;
* A. Czumaj and C. Sohler. [http://www.dcs.warwick.ac.uk/~czumaj/PUBLICATIONS/DRAFTS/Draft-Survey-Sublinear.pdf ''Sublinear-time algorithms.''] In ''Property Testing. Current Research and Surveys.'' 2010. &lt;br /&gt;
* O. Goldreich. [http://www.wisdom.weizmann.ac.il/~oded/p_tgp.html ''Introduction to testing graph properties.''] 2010.&lt;br /&gt;
* R. Rubinfeld and A. Shapira. [http://www.math.tau.ac.il/~asafico/sublinear.pdf ''Sublinear time algorithms.''] SIAM Journal on Discrete Mathematics 25, 2011. &lt;br /&gt;
* R. Rubinfeld. [https://dl.acm.org/citation.cfm?id=2331052 ''Taming big probability distributions.''] XRDS, 2012.&lt;br /&gt;
* A. Montanaro and R. de Wolf. [http://arxiv.org/abs/1310.2035 ''A Survey of Quantum Property Testing.''] 2013.&lt;br /&gt;
* C. Canonne. [http://eccc.hpi-web.de/report/2015/063/ ''A Survey on Distribution Testing: Your Data is Big. But is it Blue?''] 2015.&lt;br /&gt;
* O. Goldreich. [http://www.wisdom.weizmann.ac.il/~oded/PDF/pt-intro.pdf ''Notes for the first lecture in a course on Property Testing.''] 2016.&lt;br /&gt;
&lt;br /&gt;
=== Books ===&lt;br /&gt;
* Arnab Bhattacharyya and Yuichi Yoshida. [http://propertytestingbook.wordpress.com &amp;quot;Property Testing.&amp;quot;] 2017?.&lt;br /&gt;
&lt;br /&gt;
== Streaming algorithms ==&lt;br /&gt;
=== Classes ===&lt;br /&gt;
* P. Indyk. [http://stellar.mit.edu/S/course/6/fa07/6.895/ ''Sketching, streaming, and sub-linear space algorithms.''] MIT, Fall 2007. &lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. &lt;br /&gt;
* A. McGregor. [http://people.cs.umass.edu/~mcgregor/courses/CS711S12/ ''Data streams and massive data.''] University of Massachusetts in Amherst, Spring 2012. &lt;br /&gt;
* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013.&lt;br /&gt;
* J. Nelson. [http://people.seas.harvard.edu/~minilek/cs229r/ ''Algorithms for Big Data.''] Harvard, Fall 2013.&lt;br /&gt;
* G. Yaroslavtsev. [http://grigory.us/big-data.html ''Sublinear Algorithms for Big Data.''] University of Buenos Aires, Summer 2014.&lt;br /&gt;
&lt;br /&gt;
=== Surveys ===&lt;br /&gt;
* S. Muthukrishnan. [http://algo.research.googlepages.com/eight.ps ''Data streams: algorithms and applications.''] Now Publishers Inc, 2005. &lt;br /&gt;
* A. McGregor. [http://people.cs.umass.edu/~mcgregor/papers/13-graphsurvey.pdf ''Graph Stream Algorithms: A Survey.''] 2013.&lt;br /&gt;
&lt;br /&gt;
=== Workshops ===&lt;br /&gt;
* [http://wsga.sandia.gov/presentations.html Workshop on Streaming Graph Algorithms] at the Sandia National Laboratories, 2014.&lt;br /&gt;
&lt;br /&gt;
__FORCETOC__&lt;/div&gt;</summary>
		<author><name>73.241.98.76</name></author>
		
	</entry>
</feed>