Yet more fixes to bibliography.

diff --git a/adv.tex b/adv.tex
index 09670b6ad62cfdca95e14422c430a4eef9da15f9..b799f6f26fde5528a46866054491dfcba3c6e7d8 100644 (file)
--- a/adv.tex
+++ b/adv.tex
@@ -374,7 +374,7 @@ Another possibility is to use the 2-3-heaps \cite{takaoka:twothree} or Trinomial
 heaps \cite{takaoka:trinomial}. Both have the same asymptotic complexity as Fibonacci
 heaps (the latter even in the worst case, but it does not matter here) and their
 authors claim faster implementation. For integer weights, we can use Thorup's priority
-queues described in \cite{thorup:pqsssp} which have constant-time \<Insert> and \<Decrease>
+queues described in \cite{thorup:sssp} which have constant-time \<Insert> and \<Decrease>
 and $\O(\log\log n)$ time \<DeleteMin>. (We will however omit the details since we will
 show a~faster integer algorithm soon.)
 

diff --git a/biblio.bib b/biblio.bib
index 73c04bb6e03ea03104d49fbc42ce1a1daecba8b3..2686c042327131bebf94f019905321b1fd6a7370 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -173,7 +173,7 @@
 
 @techreport { pettie:ackermann,
     author = "Seth Pettie",
-    title = "{Finding minimum spanning trees in $\O(m\alpha(m,n))$ time}",
+    title = "{Finding minimum spanning trees in $\O(m\timesalpha(m,n))$ time}",
     institution = "Univ. of Texas at Austin",
     year = "1999",
     number = "TR99-23",
@@ -560,7 +560,6 @@
  year = {1997},
  isbn = {0-201-89683-4},
  publisher = {Addison Wesley Longman Publishing Co., Inc.},
- address = {Redwood City, CA, USA},
 }
 
 @book{ knuth:seminalg,
@@ -569,7 +568,6 @@
  year = {1997},
  isbn = {978-0-201-89684-8},
  publisher = {Addison Wesley Longman Publishing Co., Inc.},
- address = {Redwood City, CA, USA},
 }
 
 @book{ knuth:sas,
@@ -578,7 +576,6 @@
   year = {1998},
   isbn = {978-0-201-89685-5},
   publisher = {Addison Wesley Longman Publishing Co., Inc.},
-  address = {Redwood City, CA, USA},
 }
 
 @inproceedings{ hagerup:wordram,
@@ -652,10 +649,10 @@
   year={1993},
 }
 
-@article{ han:detsort,
+@inproceedings{ han:detsort,
   title={{Deterministic sorting in $\O(n \log\log n)$ time and linear space}},
   author={Han, Y.},
-  journal={Proceedings of the 34th annual ACM Symposium on Theory of Computing},
+  booktitle={Proceedings of the 34th annual ACM Symposium on Theory of Computing},
   pages={602--608},
   year={2002},
 }
@@ -668,10 +665,10 @@
   year={2002},
 }
 
-@article{ ito:newrap,
+@inproceedings{ ito:newrap,
   title={{Efficient Initial Approximation and Fast Converging Methods for Division and Square Root}},
   author={Ito, M. and Takagi, N. and Yajima, S.},
-  journal={Proc. 12th IEEE Symp. Computer Arithmetic},
+  booktitle={Proceedings of the 12th IEEE Symposium on Computer Arithmetic},
   pages={2--9},
   year={1995}
 }
@@ -749,7 +746,7 @@
 }
 
 @article{ ruskey:hce,
-  title={{Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of Sn}},
+  title={{Hamilton Cycles that Extend Transposition Matchings in Cayley Graphs of $S_n$}},
   author={Ruskey, F. and Savage, C. D.},
   journal={SIAM Journal on Discrete Mathematics},
   volume={6},
@@ -877,10 +874,10 @@
   year={1967}
 }
 
-@article{ yuster:matching,
+@inproceedings{ yuster:matching,
   title={{Maximum matching in graphs with an excluded minor}},
   author={Yuster, R. and Zwick, U.},
-  journal={SODA 2007: Proceedings of the 18th annual ACM-SIAM Symposium on Discrete Algorithms},
+  booktitle={SODA 2007: Proceedings of the 18th annual ACM-SIAM Symposium on Discrete Algorithms},
   pages={108--117},
   year={2007},
 }
@@ -993,7 +990,7 @@
 @article{ shamos:closest,
   title={{Closest-point problems}},
   author={Shamos, M. I. and Hoey, D.},
-  journal={Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science},
+  journal={FOCS '75: Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science},
   pages={151--162},
   year={1975}
 }
@@ -1087,7 +1084,7 @@
 
 @inproceedings{ bhalgat:ght,
  author = {Ramesh Hariharan and Telikepalli Kavitha and Debmalya Panigrahi and Anand Bhalgat},
- title = {{An $\widehat\O(mn)$ Gomory-Hu tree construction algorithm for unweighted graphs}},
+ title = {{An $\widetilde\O(mn)$ Gomory-Hu tree construction algorithm for unweighted graphs}},
  booktitle = {STOC '07: Proceedings of the 39th annual ACM Symposium on Theory of Computing},
  year = {2007},
  isbn = {978-1-59593-631-8},
@@ -1250,7 +1247,6 @@
   journal={INTEGERS: The Electronic Journal of Combinatorial Number Theory},
   volume={2},
   number={A11},
-  pages={2},
   year={2002}
 }
 
@@ -1304,10 +1300,10 @@
   year={1997},
 }
 
-@article{ henzinger:mst,
+@inproceedings{ henzinger:mst,
   title={{Maintaining minimum spanning trees in dynamic graphs}},
   author={Henzinger, M. R. and King, V.},
-  journal={ICALP '97: Proceedings of the 24th International Colloquium on Automata, Languages and Programming},
+  booktitle={ICALP '97: Proceedings of the 24th International Colloquium on Automata, Languages and Programming},
   pages={594--604},
   year={1997},
 }
@@ -1317,7 +1313,7 @@
   author={Martin Mare\v{s}},
   school={Charles University in Prague, Faculty of Math and Physics},
   year={2000},
-  notes={In Czech}
+  note={In Czech}
 }
 
 @techreport{ henzinger:twoec,
@@ -1483,7 +1479,7 @@
   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}
+  publisher={Addison Wesley Longman Publishing Co., Inc.}
 }
 
 @techreport { mm:ga,