Differences

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

--- assignments:a1 [2015/01/23 12:37] – franck
+++ assignments:a1 [2015/04/03 19:25] – franck
@@ Line 24: / Line 24: @@
 The report should be roughly between 3 and 8 pages.  These bounds are not absolute (but one page is definitely not enough and 20 pages is too much).
 As the audience of your report, consider your fellow students in the course.
+{{:public:myassignment1.pdf|myassignment1.pdf}} contains a sample.  The corresponding LaTeX and BiBTeX files are {{:public:myassignment1.tex.txt|myassignment1.tex}} and {{:public:myassignment1.bib.txt|myassignment1.bib}}, respectively (remove the suffix .txt from the file name).
-{{:public:myassignment1.bib.txt|}}
 ===== List your paper =====
@@ Line 32: / Line 31: @@
   * 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.
+  * Qiyi Tang:\\ Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, and Radu Mardare.  [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1007/978-3-642-36742-7_1|On-the-Fly Exact Computation of Bisimilarity]]. In //Proceedings of the 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems//, volume 7795 of //Lecture Notes in Computer Science//, pages 1–15, Rome, Italy, March 2013.  Springer-Verlag.
+  * Mingbin Xu:\\ Shavit, Nir, and Itay Lotan. [[http://dx.doi.org/10.1109/IPDPS.2000.845994|Skiplist-based concurrent priority queues]]. In //Parallel and Distributed Processing Symposium, 2000. IPDPS 2000. Proceedings. 14th International,// pages 263-268. IEEE, 2000.