assignments:a1
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
assignments:a1 [2009/12/24 14:40] – franck | assignments:a1 [2010/03/10 07:10] (current) – joanna | ||
---|---|---|---|
Line 11: | Line 11: | ||
===== Add your paper to the list ===== | ===== Add your paper to the list ===== | ||
- | Once your paper has been approved by the instructor, add your paper to the list below. | + | Once your paper has been approved by the instructor, add your paper to the list below. |
===== Write a report ===== | ===== Write a report ===== | ||
Line 23: | Line 23: | ||
chose). | chose). | ||
- | Use LaTeX and BiBTeX to write your report. You may start from the files {{public: | + | Use LaTeX and BiBTeX to write your report. You may start from the files {{public: |
The report should be roughly between 3 and 8 pages. | The report should be roughly between 3 and 8 pages. | ||
As the audience of your report, consider your fellow students in the course. | As the audience of your report, consider your fellow students in the course. | ||
- | |||
===== List your paper ===== | ===== List your paper ===== | ||
- | * Franck van Breugel:\\ Carla Schlatter Ellis. [[http:// | + | * Franck van Breugel:\\ Carla Schlatter Ellis. [[http:// |
+ | |||
+ | * Joanna Helga:\\ Eric Ruppert, Franck van Breugel, Panagiota Fatourou, Faith Ellen. Non-Blocking Binary Search Trees. //Draft paper//, February 18, 2010. | ||
+ | |||
+ | * Jun Miao:\\ Maged M.Michael, Michael L.Scott. [[http:// | ||
+ | |||
+ | * Mehdi Kargar:\\ Marcel Kornacker, Douglas Banks. [[http:// | ||
+ | |||
+ | * Haneen Dabain:\\ Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, | ||
+ | * Wael Yehia:\\ D. Hendler, N. Shavit, L. Yerushalmi.[[http:// |
assignments/a1.1261665646.txt.gz · Last modified: 2009/12/24 14:40 by franck