assignments:a1
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionNext revisionBoth sides next revision | ||
assignments:a1 [2007/10/08 00:27] – franck | assignments:a1 [2007/10/17 15:45] – pourya | ||
---|---|---|---|
Line 14: | Line 14: | ||
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. | ||
+ | |||
+ | |||
Line 22: | Line 24: | ||
Write a report. In the report, describe your algorithm using pseudocode. If you have found a description of the algorithm in pseudocode in the literature, you may use that description. However, do not forget to mention the source. Also explain the algorithm in your own words. This implies that you do not copy parts of the paper. Feel free to include examples. If the examples are not your own, then mention the source. | Write a report. In the report, describe your algorithm using pseudocode. If you have found a description of the algorithm in pseudocode in the literature, you may use that description. However, do not forget to mention the source. Also explain the algorithm in your own words. This implies that you do not copy parts of the paper. Feel free to include examples. If the examples are not your own, then mention the source. | ||
- | You are encouraged | + | You may want to try LaTeX and BiBTeX to write your report. You may start from the files {{assignments: |
- | The report should be roughly between 4 and 10 pages. | + | The report should be roughly between 4 and 10 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. | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
+ | |||
Line 51: | Line 62: | ||
* Marcin Kwietniewski: | * Marcin Kwietniewski: | ||
- | * Niloufar Shafiei:\\ Maurice Herlihy, Victor Luchangco and Mark Moir. [[http://www.cs.brown.edu/~mph/ | + | * Niloufar Shafiei:\\ Maurice Herlihy, Victor Luchangco and Mark Moir. [[http://dx.doi.org/10.1109/ICDCS.2003.1203503 |
+ | |||
+ | * Nastaran Shafiei:\\ Chien-Hua Shann, Ting-Lu Huang, and Cheng Chen. [[http:// | ||
+ | |||
+ | * Mark Shtern:\\ Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer and Nir Shavit [[http://dx.doi.org/10.1007/11795490_3|A Lazy Concurrent List-Based Set Algorithm]]. In // | ||
+ | |||
+ | * Yi Feng:\\ Ori Shalev and Nir Shavit.[[http: | ||
+ | |||
+ | * Pourya Jafari:\\ Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Shlomo Kipnis, Derrick Weathersby[[http:// | ||
- | * Nastaran Shafiei:\\ Chien-Hua Shann, Ting-Lu Huang, and Cheng Chen. [[http:// | ||
- | * Mark Shtern:\\ Steve Heller, Maurice Herlihy, Victor Luchangco, Mark Moir, William N. Scherer and Nir Shavit [[http:// |
assignments/a1.txt · Last modified: 2007/10/24 12:41 by franck