Differences

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

--- assignments:a1 [2010/02/07 18:59] – w2yehia
+++ assignments:a1 [2010/02/07 22:53] – franck
@@ Line 32: / Line 32: @@
   * Franck van Breugel:\\ Carla Schlatter Ellis. [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1109/TC.1980.1675680|Concurrent Search and Insertion in AVL Trees]]. //IEEE Transactions on Computers//, 29(9): 811-817, September 1980.
-  * Joanna Helga:\\ Eric Ruppert. Lock-Free Binary Search Trees. //Draft paper//, February 2010.
+  * Joanna Helga:\\ Eric Ruppert, Panagiota Fatourou, Faith Ellen. Lock-Free Binary Search Trees. //Draft paper//, February 2010.
-  * Jun Miao:\\ Maged M.Michael, Michael L.Scott. [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1145/248052.248106|Simple, fast, and practical non-blocking and blocking concurrent queue algorithms]]. In //Proceedings of the fifteenth Annual ACM Symposium on Principles of Distributed Computing//, pages 267-275, Philadelphia, PA, USA, May 1996. ACM.
+  * Jun Miao:\\ Maged M.Michael, Michael L.Scott. [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1145/248052.248106|Simple, fast, and practical non-blocking and blocking concurrent queue algorithms]]. In //Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing//, pages 267-275, Philadelphia, PA, USA, May 1996. ACM.
   * Mehdi Kargar:\\ Marcel Kornacker, Douglas Banks. [[http://portal.acm.org/citation.cfm?id=645921.673305&coll=Portal&dl=GUIDE&CFID=76472520&CFTOKEN=14839502|High-Concurrency Locking in R-Trees]]. In //Proceedings of the 21th International Conference on Very Large Data Bases//, pages 134-145, Zurich, Switzerland, September 1995. Morgan Kaufmann.
-  * Haneen Dabain:\\ Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg. [[http://portal.acm.org.ezproxy.library.yorku.ca/citation.cfm?id=777412.777428&coll=Portal&dl=GUIDE&CFID=75193774&CFTOKEN=78556525|MST construction in O(log log n) communication rounds]]. In //Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures//, pages 94 - 100, California, USA, 2003.
+  * Haneen Dabain:\\ Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg. [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1145/777412.777428|MST construction in O(log log n) communication rounds]]. In //Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures//, pages 94-100, San Diego, CA, USA, June 2003. ACM.
-  * Wael Yehia:\\ D. Hendler, N. Shavit, L. Yerushalmi.[[http://doi.acm.org/10.1145/1007912.1007944|A Scalable Lockfree Stack Algorithm]]. //In SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallel Algorithms//, June 27-30, 2004, Barcelona, Spain, pages 206–215.
+  * Wael Yehia:\\ D. Hendler, N. Shavit, L. Yerushalmi.[[http://dx.doi.org.ezproxy.library.yorku.ca/10.1145/1007912.1007944|A Scalable Lockfree Stack Algorithm]]. In //Proceedings of the 16th Annual ACM Symposium on Parallel Algorithms//, pages 206–215, Barcelona, Spain, June 2004. ACM.