Differences

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

--- assignments:a1 [2011/02/02 18:27] – franck
+++ assignments:a1 [2011/02/07 15:31] – milner
@@ Line 33: / Line 33: @@
   * Loutfouz Zaman:\\ Thomas Umland [[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.2387|Parallel Graph Coloring using JAVA]]. In, P.H. Welch and A.W.P. Bakkers, editors, //Architectures, Languages and Patterns for Parallel and Distributed Applications//, volume 52 of //Concurrent Systems Engineering Series//, pages 211-218, Amsterdam, April 1998. IOS Press.
-  * Elise Cormie:\\ Vladimir Lanin and Dennis Shasha. [[http://portal.acm.org.ezproxy.library.yorku.ca/citation.cfm?id=324493.324589&coll=DL&dl=GUIDE&CFID=5753246&CFTOKEN=91142545|A symmetric concurrent B-tree algorithm]]. //Proceedings of 1986 ACM Fall joint computer conference//, 380-389, 1986.
+  * Elise Cormie:\\ Vladimir Lanin and Dennis Shasha. [[http://portal.acm.org.ezproxy.library.yorku.ca/citation.cfm?id=324493.324589&coll=DL&dl=GUIDE&CFID=5753246&CFTOKEN=91142545|A symmetric concurrent B-tree algorithm]]. In //Proceedings of 1986 ACM Fall Joint Computer Conference//, pages 380-389, Dallas, TX, USA, 1986. IEEE.
-  * Steven Xu\\ P. A. Franaszek, J. T. Robinson, and A. Thomasian. [[http://dx.doi.org/10.1109/ICDE.1991.131456|Wait Depth Limited Concurrency Control]]. //Proceedings of Seventh International Conference on Data Engineering//, 92-101, 1991.
+  * Steven Xu\\ P. A. Franaszek, J. T. Robinson, and A. Thomasian. [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1109/ICDE.1991.131456|Wait Depth Limited Concurrency Control]]. In //Proceedings of Seventh International Conference on Data Engineering//, 92-101, 1991.
-  * Xiwen Chen\\ R. Setia, A. Nedunchezhian, S. Balachandran. [[http://www.hipc.org/hipc2009/documents/HIPCSS09Papers/1569250351.pdf|A new parallel algorithm for minimum spanning tree problem]]. //Proc.International Conference on High Performance Computing(HiPC)//, pp. 1-5, 2009.
+  * Xiwen Chen\\ R. Setia, A. Nedunchezhian, S. Balachandran. [[http://www.hipc.org/hipc2009/documents/HIPCSS09Papers/1569250351.pdf|A new parallel algorithm for minimum spanning tree problem]]. In //Proceedings of the 16th annual IEEE International Conference on High Performance Computing//, pages 1-5, Kochi, India, December 2009. IEEE.
   * Vladimir Magdin:\\ Xavier Messeguer. [[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.514|Skip trees, an alternative data structure to skip lists in a concurrent approach]]. //RAIRO Theoretical Informatics and Applications//, 31(3): 251-269, May 1997.
-  * Mohammed-Ali Khan:\\ Hsi Chang and S. Sitharama Iyengar. [[http://portal.acm.org.ezproxy.library.yorku.ca/citation.cfm?doid=358105.358191|Efficient Algorithms to globally balance a binary search tree]]. //Commun. ACM//, 27 (7),pp. 697-702. July 1984.
+  * Mohammed-Ali Khan:\\ Hsi Chang and S. Sitharama Iyengar. [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1145/358105.358191 |Efficient algorithms to globally balance a binary search tree]]. //Communications of the ACM//, 27(7):697-702. July 1984.
-  * Calden Wloka:\\ Y.T. Kotb, S.S. Beauchemin, and J.L. Barron.  [[http://doi.ieeecomputersociety.org/10.1109/CRV.2007.49|Petri Net-Based Cooperation in Multi-Agent Systems]].  //Fourth Canadian Conference on Computer and Robot Vision//, pp. 123-130, 2007
+  * Calden Wloka:\\ Y.T. Kotb, S.S. Beauchemin, and J.L. Barron.  [[http://dx.doi.org.ezproxy.library.yorku.ca/10.1109/CRV.2007.49|Petri Net-Based Cooperation in Multi-Agent Systems]].  In //Fourth Canadian Conference on Computer and Robot Vision//, pages 123-130, Montreal, QC, Canada, May 2007. IEEE.
+  * Andrew Milner:\\R.V. Nageshwara, V. Kumar, [[http://dx.doi.org/10.1109/12.9744|Concurrent Access of Priority Queues]]. //IEEE Transactions on Computers//, 37(12):1657-1665, Dec. 1988.