The following links (from similar courses offered by other colleagues) have some links to potential project topics/papers.
The report you prepare should indicate you have understood the main technique and can present it in enough details that the steps are clear and easy to follow.
The intention is NOT to copy the details of the proofs in the papers, rather provide intuition on the algorithms/techniques. Your report should be enough to present in a 1.5-2 hour lecture.
It is expected you also provide your own assessment of the techniques used and how it relates to the topics covered in the course.

• Algorithmic Techniques for Big Data: Moses Charikar (Stanford).
• Algorithmic Techniques for Big Data Analysis: Barna Saha (University of Minnesota Twin Cities).
• Data Stream Algorithms, Amit Chakrabarti (Dartmouth college)
• Sublinear (and streaming Algorithms): Paul Beam (U. Washington)