X-Git-Url: http://mj.ucw.cz/gitweb/?a=blobdiff_plain;f=biblio.bib;h=9e569206053bf899d33eb3ed3e4cd7fedb42ac4f;hb=fa37f59e9f5767013d0bf6678544dc1e79159725;hp=fe0e1df6d167d6b844af75eee3bb30808f238691;hpb=68b10fb958ebbf4112b5cf3d2a0f1ad58eedc11d;p=saga.git

diff --git a/biblio.bib b/biblio.bib
index fe0e1df..9e56920 100644
--- a/biblio.bib
+++ b/biblio.bib
@@ -14,7 +14,7 @@
     year = "1991",
     url = "citeseer.ist.psu.edu/frederickson91ambivalent.html" }
 
-@article{ tarjan:setunion,
+@article{ tarjan:wcsetunion,
  author = {Robert E. Tarjan and Jan van Leeuwen},
  title = {Worst-case Analysis of Set Union Algorithms},
  journal = {J. ACM},
@@ -28,6 +28,17 @@
  address = {New York, NY, USA},
 }
 
+@article{ tarjan:setunion,
+  title={{Efficiency of a Good But Not Linear Set Union Algorithm}},
+  author={Tarjan, R.E.},
+  journal={Journal of the ACM},
+  volume={22},
+  number={2},
+  pages={215--225},
+  year={1975},
+  publisher={ACM Press New York, NY, USA}
+}
+
 @inproceedings { fw:transdich,
    author = "M. Fredman and D. E. Willard",
    title = "{Trans-dichotomous algorithms for minimum spanning trees and shortest paths}",
@@ -1354,4 +1365,185 @@
   year={2000}
 }
 
+@techreport{ henzinger:twoec,
+  title = {Fully dynamic 2-edge-connectivity algorithm in polylogarithmic time per operation},
+  author = {Monika Rauch Henzinger and Valerie King},
+  type = {Technical note},
+  institution = {Digital Equipment Corp., Systems Research Ctr.},
+  address = {130 Lytton Rd., Palo Alto, CA, 94301, USA},
+  number = {1997-004},
+  month = {12 Jun},
+  year = {1997},
+  url = {http://gatekeeper.dec.com/pub/DEC/SRC/technical-notes/abstracts/src-tn-1997-004.html}
+}
+
+@book{ overmars:ds,
+  author = {Mark H. Overmars},
+  title = {Design of Dynamic Data Structures},
+  year = {1987},
+  isbn = {038712330X},
+  publisher = {Springer-Verlag New York, Inc.},
+  address = {Secaucus, NJ, USA},
+  series={{Lecture Notes in Computer Science}},
+  volume={156}
+}
+
+@article{ eppstein:ksmallest,
+  title={{Finding the $k$~Smallest Spanning Trees}},
+  author={Eppstein, D.},
+  journal={BIT},
+  volume={32},
+  number={2},
+  pages={237--248},
+  year={1992},
+  publisher={Springer}
+}
+
+@article{ katoh:ksmallest,
+  title={{An Algorithm for Finding\$ K\$ Minimum Spanning Trees}},
+  author={Katoh, N. and Ibaraki, T. and Mine, H.},
+  journal={SIAM Journal on Computing},
+  volume={10},
+  pages={247},
+  year={1981},
+  publisher={SIAM}
+}
+
+@inproceedings{ thorup:nearopt,
+ author = {Mikkel Thorup},
+ title = {Near-optimal fully-dynamic graph connectivity},
+ booktitle = {STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing},
+ year = {2000},
+ isbn = {1-58113-184-4},
+ pages = {343--350},
+ location = {Portland, Oregon, United States},
+ doi = {http://doi.acm.org/10.1145/335305.335345},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+}
+
+@article{ henzinger:lowerbounds,
+  title={{Lower Bounds for Fully Dynamic Connectivity Problems in Graphs}},
+  author={Henzinger, M. R. and Fredman, M. L.},
+  journal={Algorithmica},
+  volume={22},
+  number={3},
+  pages={351--362},
+  year={1998},
+  publisher={Springer}
+}
+
+@article{ thorup:usssp,
+  title={{Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time}},
+  author={Thorup, Mikkel},
+  journal={Journal of the ACM},
+  volume={46},
+  number={3},
+  pages={362--394},
+  year={1999}
+}
 
+@article{ thorup:sssp,
+  author = {Mikkel Thorup},
+  title = {Integer priority queues with decrease key in constant time and the single source shortest paths problem},
+  journal = {Journal of Computer and System Sciences},
+  volume = {69},
+  number = {3},
+  year = {2004},
+  issn = {0022-0000},
+  pages = {330--353},
+  doi = {http://dx.doi.org/10.1016/j.jcss.2004.04.003},
+  publisher = {Academic Press, Inc.},
+  address = {Orlando, FL, USA},
+}
+
+@inproceedings{ hagerup:sssp,
+  author = {Torben Hagerup},
+  title = {Improved Shortest Paths on the Word RAM},
+  booktitle = {ICALP '00: Proceedings of the 27th International Colloquium on Automata, Languages and Programming},
+  year = {2000},
+  isbn = {3-540-67715-1},
+  pages = {61--72},
+  publisher = {Springer-Verlag},
+  address = {London, UK},
+}
+
+@techreport { hakmem,
+    author = "Beeler, Michael and Gosper, R. William and Schroeppel, Rich",
+    title = "{HAKMEM}",
+    institution = "Massachusetts Institute of Technology",
+    year = "1972",
+    number = "239",
+    type = "Memo"
+}
+
+@book{ oxley:matroids,
+  title={{Matroid Theory}},
+  author={Oxley, J.G.},
+  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}
+}