Presentation Schedule (Each presentation is 50 minutes long).
- Mon Nov 28. Obrian 109.
- Wed Nov 30. Obrian 109.
- Fri Dec 02. Obrian 109.
- Mon Dec 05. Obrian 109.
- Tue Dec 06. Obrian 109.
- Wed Dec 07. Obrian 109.
- Thu Dec 08. Obrian 109.
- Fri Dec 09. Obrian 109.
Logistics
- Student presentations are in the last 2 weeks (Nov 28 to Dec 09).
We will likely have to find another room for some of the presentations
because there are more than 6 presentations.
- Requirements:
- Please prepare slides.
- It is preferable if you use LaTeX Beamer. PPT is ok but it looks
very ugly when there's heavy math formulas. Here is a
set of slides from my first lecture
prepared using Beamer, which you should make use of as a template.
Note the following:
- Type
make
will produce main.pdf
which
could be viewed with acroread
, xpdf
in Linux or
preview
under MacOSX. In Linux, xpdf
is preferred
because it refreshes automatically.
- To produce the final slides, do
make
twice in a row,
or pdflatex main
twice in a row. This makes sure the the table
of content and cross-references are correctly constructed and
- If you do include graphics, use the
includegraphics
command as in the template. Most graphic types are ok: pdf, jpeg, png, etc., except for eps/ps which you'll have to convert to pdf before inclusion.
- Please follow roughly the following outline in the presentation:
- What's the problem
- What are the related works to date (of the paper)
- What's the main line of attack, i.e. outline the key lemmas and theorems (before proving them)
- Try to explain in English the main ideas behind the lemmas and theorems
- Finally, prove some of them as time allows. Skip calculus or elementary details.
- Let us know what you think might be next in terms of open problems, things you might try, etc.
The following list of presentation choices will be updated.
Coupon Collector
- Foata, Dominique; Zeilberger, Doron The collector's brotherhood problem using the Newman-Shepp symbolic method. Dedicated to the memory of Gian-Carlo Rota. Algebra Universalis 49 (2003), no. 4, 387–395.
- D. Newman and L. Shepp, (1960) The Double Dixie Cup Problem, Amer. Math. Monthly, 67 (1960), pp. 58–61.
- Adler, I., Oren, S., and Ross, S. (2003). The Coupon Collector's Problem Revisited, J. Appl. Probab., 40, no. 2, 513-518.
Balls into Bins
- Yossi Azar, Andrei Z. Broder, Anna R. Karlin, Eli Upfal: Balanced Allocations. SIAM J. Comput. 29(1): 180-200 (1999)
- Petra Berenbrink, Artur Czumaj, Angelika Steger, Berthold Vöcking: Balanced Allocations: The Heavily Loaded Case. SIAM J. Comput. 35(6): 1350-1385 (2006)
[ pdf ]
- B. Vöcking, How asymetry helps load balancing, J. ACM, 50 (2003), pp. 568–589.
[ pdf ]
- Kunal Talwar, Udi Wieder Balanced allocations: the weighted case. STOC'07—Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 256–265, ACM, New York, 2007
Networking
Hashing
- [Hung will discuss]A. Pagh and F. Rodler. Cuckoo hashing. Journal of Algorithms, 51(2):122-144, 2004. [ pdf ]
- Yuriy Arbitman, Moni Naor, and Gil Segev. 2009. De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. In Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I (ICALP '09) [ pdf ]
- M. Mitzenmacher and S. Vadhan. Why simple hash functions work: exploiting the
entropy in a data stream. In Proceedings of the Nineteenth Annual ACM-SIAM
Symposium on Discrete Algorithms (SODA), pp. 746-755, 2008
[ pdf ]
- Michael Mitzenmacher, Some Open Questions Related to Cuckoo Hashing
Complexity
Cryptography and Security
Learning
Data Streaming
Privacy Preserving Algorithms
- Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum: Differential privacy under continual observation. STOC 2010: 715-724
[ pdf ]
- Cynthia Dwork: Differential Privacy in New Settings. SODA 2010: 174-183.
[ pdf ]
- Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan: Boosting and Differential Privacy. FOCS 2010: 51-60
[ pdf ]
- Cynthia Dwork: Differential Privacy: A Survey of Results. TAMC 2008: 1-19
[ pdf ]
- Michael T. Goodrich Randomized Shellsort: A Simple Oblivious Sorting Algorithm. 1262-1277 2010 SODA
[ pdf ]
Databases