MATH 261
Topics in Probabilistic Combinatorics and Algorithms
Winter, 2010
Instead of the midterm, each student shall
- choose
a paper in the reading list (or other research papers with approval),
-
present a talk in class for 30 minutes,
- write a
short note of your presentation (e.g., the history, theorems,
relevant proof sketches and a list of references).
Thanks to Ariel Levavi alevavi@cs.ucsd.edu and Jay Cummings jjcummings@math.ucsd.edu for agreeing to co-organize the presentations.
Please contact them (soon if not sooner) to grab your slot
for giving your class presentation.
Here is the link to the list of presentations as well as the lecture notes.
Every student will take turns to take lecture notes which will then be put
on the website.
Mark Kempton mkempton@math.ucsd.edu has kindly agreed to coordinate the lecture notes.
Please sign up with Mark for your turn for taking notes.
Resources: