A few years ago, Nati Linial and Avi Wigderson taught a course on expander graphs. The course lecture notes have been edited into an article that will appear in the Notices Bulletin of the AMS.
Recent Comments
- Anand on So this is what “FOCS” stands for
- Cplus on The end of UC Berkeley as we know it
- adam on Sadness
- arnab on The Triangle Removal Lemma
- luca on The Triangle Removal Lemma
non-theory
theory
Archives
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
- January 2009
- December 2008
- November 2008
- October 2008
- September 2008
- August 2008
- July 2008
- June 2008
- May 2008
- April 2008
- March 2008
- February 2008
- January 2008
- December 2007
- November 2007
- October 2007
- September 2007
- August 2007
- July 2007
- June 2007
- May 2007
- April 2007
- March 2007
- February 2007
- January 2007
- December 2006
- November 2006
- October 2006
- September 2006
- August 2006
- July 2006
- June 2006
- May 2006
- April 2006
- March 2006
3 comments
Comments feed for this article
September 1, 2006 at 9:29 pm
Luca Aceto
Luca,
I guess you mean Bulletin of the AMS.
In relation to your previous post, are you reading the book on “Additive Combinatorics” by Tao and Vu?
September 1, 2006 at 9:43 pm
Luca
Thanks for the correction. I plan to buy the Tao-Vu book, but it is not yet available in the US.
September 2, 2006 at 12:22 am
Anonymous
We’ve seen applications of expander graphs in:
* Error Correcting Codes
* Network Design
* Algorithms
Do you guys know of any other applications or a survey where they list other applications in computer science of expander graphs?
Jurgen