This preview shows page 1. Sign up to view the full content.
Unformatted text preview: being covered in 621 or 721, using a number of benchmarks. A study of communication complexity of algorithms: study of the literature and de-velopment of theoretical complexity measure for an algorithm without a currently published result. 1. Project Identication (Due 2/14) : Identify your project topic. Submit a title and abstract via Carmen. No two students may undertake the same project; rst-come rst-serve in case of conicts. . 2. Interim Status Report (Due 2/25) : Brief (1-2 page) summary of progress to date, and plan for remainder of work. I will meet with each of you to discuss the project. 3. Final Written Report and Presentation (Due 3/15) : A written report and a 20 minute oral presentation are required. Although not required, if appropriate, a demo is highly recommended. I will schedule presentations (and demo, if applicable) during exams week....
View Full Document
This note was uploaded on 03/08/2012 for the course CSE 721 taught by Professor Saday during the Winter '11 term at Ohio State.
- Winter '11