Corrections: Chapter 3.

[saga.git] / biblio.bib

diff --git a/biblio.bib b/biblio.bib
index 3dead5b6834094149ef2e152504f2d8e4d6f1589..a2cbfa0aa827f460fa3de921740f6d441d01944c 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -6,7 +6,18 @@
     year = "2000",
     url = "citeseer.ist.psu.edu/bender00lca.html" }
 
-@inproceedings{ frederickson91ambivalent,
+@article{ frederickson:ambivalent,
+  author = "Frederickson, Greg N.",
+  title = "Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and $k$ Smallest Spanning Trees",
+  journal={SIAM journal on computing},
+  volume={26},
+  number={2},
+  pages={484--538},
+  year={1997},
+  publisher={Society for Industrial and Applied Mathematics}
+}
+
+@inproceedings{ frederickson:ambifocs,
     author = "Greg N. Frederickson",
     title = "Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and $k$ Smallest Spanning Trees",
     booktitle = "{IEEE} Symposium on Foundations of Computer Science",
@@ -1362,7 +1373,8 @@
   title={{Dynamick\'e grafov\'e algoritmy}},
   author={Martin Mare\v{s}},
   school={Charles University in Prague, Faculty of Math and Physics},
-  year={2000}
+  year={2000},
+  notes={In Czech}
 }
 
 @techreport{ henzinger:twoec,
@@ -1483,3 +1495,102 @@
   year={1992},
   publisher={Oxford University Press}
 }
+
+@article{ katoh:kmin,
+  author = {N. Katoh and T. Ibaraki and H. Mine},
+  title = {An Algorithm for Finding $K$ Minimum Spanning Trees},
+  publisher = {SIAM},
+  year = {1981},
+  journal = {SIAM Journal on Computing},
+  volume = {10},
+  number = {2},
+  pages = {247--255},
+}
+
+@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},
+  volume = {48},
+  number = {2},
+  year = {2001},
+  issn = {0004-5411},
+  pages = {297--323},
+  doi = {http://doi.acm.org/10.1145/375827.375847},
+  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}
+}
+
+@techreport { mm:ga,
+  author = "Martin Mare\v{s}",
+  title = "{Krajinou grafov\'ych algoritm\accent23u}",
+  institution = "Institut Teoretick\'e Informatiky",
+  address = "Praha, Czech Republic",
+  year = "2007",
+  number = "2007--330",
+  type = "ITI series",
+  note = {In Czech},
+}
+
+@book { horak:mofivefour,
+  author = {Hor\'ak, Karel and Mare\v{s}, Martin and Novotn\'y, Peter and \v{S}im\v{s}a, Jarom\'\i{}r and \v{S}vr\v{c}ek, Jaroslav and T\"opfer, Pavel and Zhouf, Jaroslav},
+  title = {54.~ro\v{c}n\'\i{}k matematick\'e olympi\'ady na st\v{r}edn\'\i{}ch \v{s}kol\'ach},
+  publisher = {Jednota \v{c}esk\'ych matematik\accent23u a fyzik\accent23u},
+  address = {Praha},
+  year = {2007},
+  note = {In Czech},
+  isbn = {80-7015-109-9},
+}
+
+@article{ tarjan:applpc,
+ author = {Robert Endre Tarjan},
+ title = {Applications of Path Compression on Balanced Trees},
+ journal = {Journal of the ACM},
+ volume = {26},
+ number = {4},
+ year = {1979},
+ issn = {0004-5411},
+ pages = {690--715},
+ doi = {http://doi.acm.org/10.1145/322154.322161},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+}