MediaWiki API result
This is the HTML representation of the JSON format. HTML is good for debugging, but is unsuitable for application use.
Specify the format parameter to change the output format. To see the non-HTML representation of the JSON format, set format=json.
See the complete documentation, or the API help for more information.
{
"batchcomplete": "",
"continue": {
"gapcontinue": "Waiting",
"continue": "gapcontinue||"
},
"query": {
"pages": {
"194": {
"pageid": 194,
"ns": 0,
"title": "Resources",
"revisions": [
{
"contentformat": "text/x-wiki",
"contentmodel": "wikitext",
"*": "{{DISPLAYTITLE:Resources on Sublinear Algorithms}}\n__TOC__\n(Please add links only to class and workshop websites that provide lecture notes, slides, or videos.)\n\n== Communication complexity (sublinear communication) ==\n=== Courses ===\n* P. Harsha, M. Mahajan, and J. Radhakrishnan. [http://www.tcs.tifr.res.in/~prahladh/teaching/2011-12/comm/ ''Communication Complexity.''] TIFR & IMSc, Monsoon Semester 2011-12. \n\n=== Workshops ===\n* [http://www.cs.princeton.edu/~mbraverm/pmwiki/index.php?n=Research.STOC13Workshop Information Complexity and Applications] at STOC 2013.\n* [https://www.birs.ca/events/2014/5-day-workshops/14w5164 Communication Complexity and Applications] in Banff, 2014.\n\n== Compressed sensing (sublinear measurement) ==\n=== Courses ===\n* P. Indyk. [http://stellar.mit.edu/S/course/6/fa07/6.895/ ''Sketching, streaming, and sub-linear space algorithms.''] MIT, Fall 2007. \n* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. \n* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013. \n* E. Price. [http://www.cs.utexas.edu/~ecprice/courses/sublinear/ ''Sublinear Algorithms.''] UT Austin, Fall 2014.\n\n== Property testing and sublinear-time algorithms ==\n=== Books ===\n* A. Bhattacharyya and Y. Yoshida. [https://link.springer.com/book/10.1007/978-981-16-8622-1 ''Property Testing.''] Springer Singapore, 2022.\n* O. Goldreich. [http://www.wisdom.weizmann.ac.il/~oded/pt-intro.html ''Introduction to Property Testing.''] In preparation.\n\n=== Courses ===\n* R. Rubinfeld and E. Ben-Sasson. [http://people.csail.mit.edu/ronitt/COURSE/F04/index.html ''Sublinear Time Algorithms.''] MIT, Fall 2004. \n* R. Rubinfeld. [http://people.csail.mit.edu/ronitt/COURSE/S07/ ''Sublinear Time Algorithms.''] MIT, Spring 2007. \n* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. \n* S. Raskhodnikova. [http://www.cse.psu.edu/~sofya/sublinear598/ ''Sublinear Algorithms.''] Penn State, Spring 2012.\n* T. Sauerwald. [http://www.mpi-inf.mpg.de/departments/d1/teaching/ws12/sublinear/ ''Sublinear Algorithms.''] Max Planck Institut, Winter Semester 2012.\n* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013.\n* G. Yaroslavtsev. [http://grigory.us/big-data.html ''Sublinear Algorithms for Big Data.''] University of Buenos Aires, Summer 2014.\n* E. Price. [http://www.cs.utexas.edu/~ecprice/courses/sublinear/ ''Sublinear Algorithms.''] UT Austin, Fall 2014.\n* R. Servedio. [http://www.cs.columbia.edu/~rocco/Teaching/S14/# ''Sublinear Time Algorithms in Learning and Property Testing.''] Columbia, Spring 2014.\n\n=== News ===\n* Blog [http://ptreview.sublinear.info/ ''Property Testing Review.''] \n\n=== Surveys ===\n* E. Fischer. [http://www.cs.technion.ac.il/~eldar/surv.ps ''The art of uninformed decisions: a primer to property testing.''] 2001. \n* D. Ron. [http://www.eng.tau.ac.il/~danar/Public-pdf/tut.pdf ''Property Testing.''] Handbook of Randomized Computing, Vol. II, 2001. \n* 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. \n* D. Ron. [http://www.eng.tau.ac.il/~danar/Public-pdf/fnt-ml.pdf ''Property testing: a learning theory perspective.''] 2008. \n* 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. \n* O. Goldreich. [http://www.wisdom.weizmann.ac.il/~oded/p_tgp.html ''Introduction to testing graph properties.''] 2010.\n* R. Rubinfeld and A. Shapira. [http://www.math.tau.ac.il/~asafico/sublinear.pdf ''Sublinear time algorithms.''] SIAM Journal on Discrete Mathematics 25, 2011. \n* R. Rubinfeld. [https://dl.acm.org/citation.cfm?id=2331052 ''Taming big probability distributions.''] XRDS, 2012.\n* A. Montanaro and R. de Wolf. [http://arxiv.org/abs/1310.2035 ''A Survey of Quantum Property Testing.''] 2013.\n* C. Canonne. [http://eccc.hpi-web.de/report/2015/063/ ''A Survey on Distribution Testing: Your Data is Big. But is it Blue?''] 2015.\n* 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.\n\n=== Workshops ===\n* [http://dimacs.rutgers.edu/Workshops/ParallelAlgorithms/ DIMACS Workshop on Big Data through the Lens of Sublinear Algorithms] at DIMACS Center, CoRE Building, Rutgers University, 2015.\n\n== Streaming algorithms ==\n=== Courses ===\n* P. Indyk. [http://stellar.mit.edu/S/course/6/fa07/6.895/ ''Sketching, streaming, and sub-linear space algorithms.''] MIT, Fall 2007. \n* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/fa10/6.896/ ''Sublinear Algorithms.''] MIT, Fall 2010. \n* A. McGregor. [http://people.cs.umass.edu/~mcgregor/courses/CS711S12/ ''Data streams and massive data.''] University of Massachusetts in Amherst, Spring 2012. \n* P. Indyk and R. Rubinfeld. [http://stellar.mit.edu/S/course/6/sp13/6.893/ ''Sublinear Algorithms.''] MIT, Spring 2013.\n* J. Nelson. [http://people.seas.harvard.edu/~minilek/cs229r/ ''Algorithms for Big Data.''] Harvard, Fall 2013.\n* G. Yaroslavtsev. [http://grigory.us/big-data.html ''Sublinear Algorithms for Big Data.''] University of Buenos Aires, Summer 2014.\n* E. Price. [http://www.cs.utexas.edu/~ecprice/courses/sublinear/ ''Sublinear Algorithms.''] UT Austin, Fall 2014.\n\n=== Surveys ===\n* S. Muthukrishnan. [http://algo.research.googlepages.com/eight.ps ''Data streams: algorithms and applications.''] Now Publishers Inc, 2005. \n* A. McGregor. [http://people.cs.umass.edu/~mcgregor/papers/13-graphsurvey.pdf ''Graph Stream Algorithms: A Survey.''] 2013.\n\n=== Workshops ===\n* [http://wsga.sandia.gov/presentations.html Workshop on Streaming Graph Algorithms] at the Sandia National Laboratories, 2014.\n* [http://dimacs.rutgers.edu/Workshops/ParallelAlgorithms/ DIMACS Workshop on Big Data through the Lens of Sublinear Algorithms] at DIMACS Center, CoRE Building, Rutgers University, 2015.\n__FORCETOC__"
}
]
},
"234": {
"pageid": 234,
"ns": 0,
"title": "TODO",
"revisions": [
{
"contentformat": "text/x-wiki",
"contentmodel": "wikitext",
"*": "Please add suggestions how to improve the wiki. What new feature would be useful? Also do not hesitate to comment on how a specific improvement could be implemented. Unfortunately, we cannot guarantee that any comment will ever be addressed. If you want to help with implementing a specific feature, please email [mailto:admin@sublinear.info admin@sublinear.info].\n\n* Nicer front page. Organize the content in boxes like at [http://www.mediawiki.org/wiki/MediaWiki this page]?\n* RSS/Atom feeds to follow new problems.\n** A partial solution is to follow this feed for now: http://sublinear.info/index.php?title=Open_Problems:By_Number&feed=atom&action=history\n* Organize problems in categories such as “Streaming”, “Sublinear-Time”, “Graph Problem”, “Communication Complexity”, etc.\n\n== Done ==\n\n* Replace email confirmation with CAPTCHAs.\n* A single PDF with all problems."
}
]
}
}
}
}