Your project is to read and present one paper in the area of Algorithms. It's best if you pick your own paper, but if you are stuck, a list of suggested papers is included below. Note that some of these papers are "classics" and some are quite recent and assume some sophisticated background.
The paper you choose must include some analysis, i.e. a paper with only heuristics and/or experimental results is not sufficient. (Such practical work can be extremely valuable, but is not appropriate for this course.) You may choose a paper that will be useful to you in your other graduate research, but you may not choose a paper that you have already studied.
Step 1 is to get your choice of paper approved. Send me email by Monday Nov. 12.
Step 2 is to present your paper to me. You may use slides or a black/white board. There will be 15 minutes for the presentation and 5 minutes for questions. You should summarize the results in the paper in your own words, and try to put the paper in context -- what came before and after. You are not responsible for following all the details of all the proofs, but should have a good overview.
Tarjan, Robert E., Caleb Levy, Stephen Timmel. 2018. Zip trees.
Driscoll, J. R., Gabow, H. N., Shrairman, R., and Tarjan, R. E. 1988. Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation. Commun. ACM 31, 11 (Nov. 1988), 1343-1354.
Demaine, Erik D. and Harmon, Dion and Iacono, John and Kane, Daniel and Patrascu, Mihai. 2009. The geometry of binary search trees. Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) 496--505.
Takehiro Ito, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno, On the complexity of reconfiguration problems. 2011. Theoretical Computer Science, 412(12–14), 1054-1065.