Differences

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

--- assignments:a1 [2007/10/21 14:35] – franck
+++ assignments:a1 [2007/10/24 12:41] (current) – franck
@@ Line 29: / Line 29: @@
 As the audience of your report, consider your fellow students in the course.
@@ Line 71: / Line 74: @@
    * 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.ogr/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.
+   * 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 and Myoung Ho Kim [[http://www.springerlink.com/content/q1uny2fdlbf8yxrx/?p=4a350778aa4d44abb4a50125e0077682&pi=0|A Concurrent B-Tree Algorithm Using a Cooperative Locking Protocol]]. In //New Horizons in Information Management//, volume 2713 of //Lecture Notes in Computer Science//, pages 165-??, Springer-Verlag.  2003.