Practical and parallel algorithms.

[saga.git] / biblio.bib

diff --git a/biblio.bib b/biblio.bib
index 3e75568065f9fbd34d5642534001832b093c43da..9e569206053bf899d33eb3ed3e4cd7fedb42ac4f 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -1495,7 +1495,7 @@
   pages = {247--255},
 }
 
-@article{375847,
+@article{ chong:parallel,
   author = {Ka Wong Chong and Yijie Han and Tak Wah Lam},
   title = {Concurrent threads and optimal parallel minimum spanning trees algorithm},
   journal = {Journal of the ACM},
@@ -1508,3 +1508,42 @@
   publisher = {ACM},
   address = {New York, NY, USA},
 }
+
+@article{ moret:expmst,
+  title={{An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree}},
+  author={Moret, B. M. E. and Shapiro, H. D.},
+  journal={Computational Support for Discrete Mathematics: DIMACS Workshop, March 12-14, 1992},
+  year={1994},
+  publisher={American Mathematical Society}
+}
+
+@article{ fredman:pairingheap,
+  title={{The pairing heap: A new form of self-adjusting heap}},
+  author={Fredman, M.L. and Sedgewick, R. and Sleator, D.D. and Tarjan, R.E.},
+  journal={Algorithmica},
+  volume={1},
+  number={1},
+  pages={111--129},
+  year={1986},
+  publisher={Springer}
+}
+
+@article{ pettie:pairing,
+  author = {Seth Pettie},
+  title = {Towards a Final Analysis of Pairing Heaps},
+  journal = {focs},
+  volume = {00},
+  year = {2005},
+  isbn = {0-7695-2468-0},
+  pages = {174-183},
+  doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.75},
+  publisher = {IEEE Computer Society},
+  address = {Los Alamitos, CA, USA},
+}
+
+@book{ jaja:parallel,
+  title={{An introduction to parallel algorithms}},
+  author={J{\'a}J{\'a}, J.},
+  year={1992},
+  publisher={Addison Wesley Longman Publishing Co., Inc. Redwood City, CA, USA}
+}