CSE6490A

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.
====== Presentations ======

There will be three presentations. Each presentation covers an assignment. Each presentation is 15 minutes. The presentations will be scheduled around the due dates of the assignments.

====== January 13 ======

  * {{franck1.pdf|Franck van Breugel}}

====== February 8 ======

  * {{haneen1.pdf|Haneen Dabain}}
  * {{lock-free_binary_search_tree.ppt|Joanna Helga}}
  * {{Concurrent R-trees.ppt|Mehdi Kargar}}
  * {{:presentations:2-lock_and_non-blocking.ppt|Jun Miao}}

====== February 10 ======

  *{{:presentations:a1_pres.ppt|Wael Yehia}}

====== February 26 ======

  * {{franck2.pdf|Franck van Breugel}}

====== March 8 ======

  * {{a2_pres.ppt|Wael Yehia}}
  * Jun Miao
  * {{Implementation Concurrent R-trees.ppt|Mehdi Kargar}}
 

====== March 10 ======

  * {{:presentations:joanna_presentation2.ppt|Joanna Helga}}
  * {{haneen1.pdf|Haneen Dabain}}

====== March 22 ======

  * {{franck3.pdf|Franck van Breugel}}

====== March 29 ======

  * {{:presentations:joanna_presentation3.ppt|Joanna Helga}}
====== March 31 ======

  * {{a3_pres.ppt|Wael Yehia}}
  * {{Model Checking Concurrent R-trees.ppt|Mehdi Kargar}}
  * {{haneen3.pdf|Haneen Dabain}}
  * {{:presentations:checking_nonblocking_concurrent_queue_program.ppt|Jun Miao}}