Differences

This shows you the differences between two versions of the page.

--- assignments:a1 [2007/10/11 23:59] – yfeng
+++ assignments:a1 [2007/10/22 19:01] – bashir
@@ Line 29: / Line 29: @@
 As the audience of your report, consider your fellow students in the course.
@@ Line 66: / Line 71: @@
    * 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 //Proceedings of the 9th International Conference On Principles Of Distributed Systems,// volume 3974 of //Lecture Notes in Computer Science//, pages 3-16, Pisa, Italy, December 2005. Springer-Verlag.
-   * Yi Feng:\\ Ori Shalev, Nir Shavit.[[http://doi.acm.org/10.1145/1147954.1147958|Split-ordered lists: Lock-free extensible hash tables]]. In //Journal of the ACM (JACM)//,  Volume 53 Issue 3, Pages: 379 - 405, May 2006
+   * Yi Feng:\\ Ori Shalev and Nir Shavit.[[http://dx.doi.org/10.1145/1147954.1147958|Split-ordered lists: Lock-free extensible hash tables]]. //Journal of the ACM//, 53(3):379-405, May 2006.
+   * Pourya Jafari:\\ Jehoshua Bruck, Ching-Tien Ho, Shlomo Kipnis, Shlomo Kipnis and Derrick Weathersby. [[http://dx.doi.org/10.1109/71.642949|Efficient Algorithms for All-to-All Communications in Multiport Message-Passing Systems ]]. //IEEE Transactions on Parallel and Distributed Systems//, 8(11):1143 - 1156, November 1997.
+   * Bashir Raeesmohammadian:\\ Sung-Chae Lim, Joonseon Ahn, Myoung Ho Kim [[http://www.springerlink.com/content/q1uny2fdlbf8yxrx/?p=4a350778aa4d44abb4a50125e0077682&pi=0|A Concurrent B-Tree Algorithm Using a Cooperative Locking Protocol]]. //	Lecture Notes in Computer Science, Springer Berlin / Heidelberg//, Volume 2712/2003.