Online talks

2008

• Towards Universal Semantic Communication, BIRS Workshop on Analytic Tools in Computational Complexity, Banff, Alberta, Canada, August 5, 2008. (ppt, pdf).
• Algebraic Algorithmic and Coding Theory, Tutorial lecture, ISSAC 2008, Hagenberg, Austria, July 20, 2008.
• Universal Semantic Communication, Distinguished Lecture Series, CS Department, SUNY Buffalo, Buffalo, New York, USA, April 17, 2008. (ppt, pdf).
• 2-Transitivity is insufficient for property testing, Student seminar, Weizmann Institute of Sciences, Rehovot, Israel, March 31, 2008.
• Local Testability and Decodability of Sparse Linear Codes, Theory Seminar, Weizmann Institute of Sciences, Rehovot, Israel, March 31, 2008 (ppt, pdf).
• Universal Semantic Communication, CS Colloquium, Technion, Haifa, Israel, March 25, 2008. (ppt, pdf).
• The Role of Invariance in Property Testing, Colloquium, Microsoft Research India, Bangalore, India, January 8, 2008. (ppt, pdf).
• Universal Semantic Communication, Colloquium, Tata Research, Development and Design Center, Pune, India, January 4, 2008. (ppt, pdf).
• Universal Semantic Communication, CS Colloquium, IIT Mumbai, Mumbai, India, January 3, 2008. (ppt, pdf).

2007

• Local Error-Detection and Error-Correction, Plenary Lecture, AAECC 2007, Bangalore, India, December 17, 2007. (ppt, pdf).
• Algebraic Property Testing, Theory Seminar, U. Wisconsin, Madison, Wisconsin, USA, November 16, 2006.
• Algebraic Property Testing, Mathematics Colloquium, U. Frankfurt, Frankfurt, Germany, June 22, 2007. (ppt, pdf).
• Algebraic Property Testing, CS Colloquium, Tata Institute of Fundamental Research, Mumbai, India, December 31, 2007. (ppt, pdf).
• Universal Semantic Communication, Theory Day at Microsoft Research India, Bangalore, India, December 22, 2007. (ppt, pdf).
• Universal Semantic Communication, Short report, Oberwolfach workshop on Computational Complexity, Mathematical Research Institute, Oberwolfach, Germany, June 29, 2007. (ppt, pdf).
• Universal Semantic Communication, Theory Seminar, Institute for Advanced Study, Princeton, New Jersey, USA, September 24, 2007. (ppt, pdf).
• Towards Universal Semantic Communication, TOC Colloquium, MIT, Cambridge, Massachusetts, USA, February 13, 2007. (ppt, pdf).
• Universal Semantic Communication, Prestige Lecture Series, Purdue University, West Lafayette, Indiana, USA, April 16, 2007. (ppt, pdf).
• Universal Semantic Communication, CS Colloquium, Warsaw University, Warsaw, Poland, October 4, 2007. (ppt, pdf).
• Universal Semantic Communication, Theory Colloquium, Weizmann Institute of Sciences, Rehovot, Israel, May 27, 2007. (ppt, pdf).
• List Decoding: Background and Recent Advances, AAECC-17, Bangalore, India, December 18, 2007
• Alberta List
• AofA
• PTMAMS-List
• RSA-List
• U. Wisc. DL, List-decoding stuff?, 11/15/2006
• Universal Semantic Communication", CS Seminar, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, January 16, 2007.
• Universal Semantic Communication", MIT TOC Colloquium, February 13, 2007.
• Universal Semantic Communication", Algorithms and Randomness Center (ARC) Colloquium, Georgia Institute of Technology, February 19, 2007.
• List decoding: Survey of recent results", Seminar, Claude Shannon Institute, University College Dublin, Ireland, March 22, 2007.

Prehistoric

Some ancient talks in random order.

Error Correcting Codes: Progress and Challenges: (A survey-ish talk presented at MSR Redmond and IAS, 2005).

Coding Theory: Tutorial/Survey. (Slides of a two hour tutorial on coding theory. The accompanying paper is here. )

Probabilistic checking of proofs. (Four hours of lectures on PCP, from talks given a graduate summer school organized by the Park City Mathematical Institute at the Institute for Advanced Study, Princeton, NJ, July 15 - August 5, 2000.)

PCP and Inapproximability: Survey and Open Problems. (Talk given at DIMACS workshop on Approximability of NP-hard problems, Nassau Inn, Princeton, NJ, 20-22 February 2000.)

List decoding of polynomial codes. (Covers joint works with Sanjeev Arora, Venkatesan Guruswami, Luca Trevisan and Salil Vadhan.)

Hardness of approximating the minimum distance of a linear code. (Joint work with Ilya Dumer and Daniele Micciancio.)

Chinese remaindering with errors. (Joint work with Oded Goldreich and Dana Ron.)

Linear consistency testing. (Joint work with Yonatan Aumann, Johan Hastad, and Michael O. Rabin.)