Approaching Optimality. Very slowly.

[saga.git] / biblio.bib

diff --git a/biblio.bib b/biblio.bib
index 4fb17c083e3e9c4f55a23d43e781fb3805baab25..b3b60868f2333fb3aa28ec6c0d30e3953664f938 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -1141,3 +1141,41 @@ inproceedings{ pettie:minirand,
  year         = {2002},
  pages        = {1879--1895},
 }
+
+@article{ chazelle:softheap,
+ author = {Bernard Chazelle},
+ title = {The soft heap: an approximate priority queue with optimal error rate},
+ journal = {J. ACM},
+ volume = {47},
+ number = {6},
+ year = {2000},
+ issn = {0004-5411},
+ pages = {1012--1027},
+ doi = {http://doi.acm.org/10.1145/355541.355554},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+}
+
+@article{ propp:randommst,
+ author = {James Gary Propp and David Bruce Wilson},
+ title = {How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph},
+ journal = {J. Algorithms},
+ volume = {27},
+ number = {2},
+ year = {1998},
+ issn = {0196-6774},
+ pages = {170--217},
+ doi = {http://dx.doi.org/10.1006/jagm.1997.0917},
+ publisher = {Academic Press, Inc.},
+ address = {Duluth, MN, USA},
+}
+
+@article{ vuillemin:binheap,
+  title={{A Data Structure for Manipulating Priority Queues}},
+  author={Vuillemin, Jean},
+  journal={Communications of the ACM},
+  volume = 21,
+  number = 4,
+  pages={309--315},
+  year={1978}
+}