User Tools

Site Tools


assignments:a1

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
assignments:a1 [2010/02/07 22:53] franckassignments:a1 [2010/03/10 07:10] (current) joanna
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.   * 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, Panagiota Fatourou, Faith Ellen. Lock-Free Binary Search Trees. //Draft paper//, February 2010.+  * 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://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.    * 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. 
assignments/a1.txt · Last modified: 2010/03/10 07:10 by joanna