diff --git a/tpie/doc/tpie.bib b/tpie/doc/tpie.bib
index 69819da2e..4190ccf8e 100644
--- a/tpie/doc/tpie.bib
+++ b/tpie/doc/tpie.bib
@@ -1560,7 +1560,7 @@ @Book{deberg:computational
 
 
 @Manual{vengroff:tpie,
-  title = 	 {TPIE User Manual and Reference},
+  title = 	 {{TPIE} User Manual and Reference},
   author =	 {D. E. Vengroff},
   organization = {Duke University},
   year =	 1997,
@@ -3267,16 +3267,15 @@ @InProceedings{samoladas:lower
   year =         {1998}
 }
 
-@Unpublished{agarwal:dynquad,
-  author =       {P. K. Agarwal and
-                  L. Arge and
-                  O. Procopiuc and
-                  J. S. Vitter},
-  title =        {{I/O}-efficient Dynamic Quad- and K-D-Trees},
-  note =         {In preparation},
-  year =         {1998}
+@InProceedings{aapv-fibld-01,
+  author = "Pankaj K. Agarwal and Lars Arge and Octavian Procopiuc and Jeffrey S. Vitt
+er",
+  title = "A Framework for Index Bulk Loading and Dynamization",
+  year = "2001",
+  booktitle = "Proc. 28th Intl. Colloq. Automata, Languages and Programming (ICALP)",
 }
 
+
 @InProceedings{roussopoulos:nearest,
   author =       {N. Roussopoulos and
                   S. Kelley and
@@ -3303,26 +3302,32 @@ @InProceedings{hjaltason:incremental
   pages =        {237-248}
 }
 
-@Misc{mehlhorn:private,
+
+@InProceedings{mehlhorn:ledasm,
   author =       {A. Crauser and K. Mehlhorn},
-  title =        {{LEDA-SM}: {A} library prototype for Secondary Memory},
-  year =         {1998},
-  note =         {Private communication}
+  title =        {{LEDA-SM}: {E}xtending {LEDA} to Secondary Memory},
+  booktitle =    wae,
+  year =         {1999},
 }
 
-@Unpublished{wang:approximate,
-  author = 	 {M. Wang and J. S. Vitter},
-  title = 	 {Approximate Computation of Multidimensional Aggregates of
-                  Sparse Data Using Wavelets},
-  note = 	 {Submitted},
-  year = 	 {1998}
+
+@inproceedings{wang:approximate,
+  author=       {J. S. Vitter and M. Wang},
+  title=        {Approximate Computation of Multidimensional Aggregates 
+of Sparse Data Using Wavelets},
+  booktitle =   sigmod,
+  address =     {Philadelphia, PA},
+  month =       {June},
+  pages = {193-204},
+  year =         1999
 }
 
-@unpublished{barve:srm_implementation,
-    author = {Rakesh D. Barve and Jeffrey Scott Vitter},
-    title  =  {A Simple and Efficient Parallel Disk Mergesort},
-    year = {1998},
-    note = {In Submission},
+@InProceedings{barve:srm_implementation,
+  author = {R. D. Barve and J. S. Vitter},
+  title  =  {A Simple and Efficient Parallel Disk Mergesort},
+  booktitle = spaa,
+  pages =        {232-241},
+  year =         {1999},
 }
 
 @Article{varman:multiversion,
@@ -3503,3 +3508,12 @@ @article{cormen:ffts
   year  =        1998,
   annote =	 "Journal version of Dartmouth:TR96-294.",
 }
+
+
+@InProceedings{arge:tpie,
+  author = 	 {L. Arge and O. Procopiuc and J. S. Vitter},
+  title = 	 {Implementing {I/O}-Efficient Data Structures Using {TPIE}},
+  booktitle = 	 esa,
+  OPTyear = 	 2002
+}
+
diff --git a/tpie/doc/tpie.tex b/tpie/doc/tpie.tex
index 9c59c9929..c7ac8bf80 100644
--- a/tpie/doc/tpie.tex
+++ b/tpie/doc/tpie.tex
@@ -3,7 +3,7 @@
 %% Copyright (c) 2002 ...
 %% File: tpie.tex
 %%
-%% $Id: tpie.tex,v 1.26 2002-06-25 18:27:17 tavi Exp $
+%% $Id: tpie.tex,v 1.27 2002-06-27 00:27:18 tavi Exp $
 %%
  
 \documentclass[10pt]{book}
@@ -46,7 +46,7 @@
 
 \vspace{2ex}
 
-\noindent Copyright \copyright 1994, 1995 Darren Erik Vengroff, 1999 Lars
+\noindent Copyright \copyright 1994, 1995 Darren Erik Vengroff, 2002 Lars
 Arge, Rakesh Barve, David Hutchinson, Octavian Procopiuc, Laura Toma, Darren Erik
 Vengroff, Rajiv Wickeremesinghe.
 
diff --git a/tpie/doc/user_manual.tex b/tpie/doc/user_manual.tex
index eeaaa0cea..d200b7263 100644
--- a/tpie/doc/user_manual.tex
+++ b/tpie/doc/user_manual.tex
@@ -1,5 +1,5 @@
 %%
-%% $Id: user_manual.tex,v 1.24 2002-06-26 23:42:33 tavi Exp $
+%% $Id: user_manual.tex,v 1.25 2002-06-27 00:24:47 tavi Exp $
 %%
 \chapter{Overview}
 
@@ -49,7 +49,7 @@ \chapter{Overview}
 Subsequently, I/O algorithms for the PDM (mostly with a
 single disk and single processor) have been developed for
 many problem domains, including computational
-geometry~\cite{goodrich:external,arge:buffer,arge:theory,arge:gis,aamvv-empgbtag97,arge:interval,kanellakis:indexing,ramaswamy:path,subramanian:p-range,vengroff:efficient,agarwal:efficient,zhu:further,agarwal:point,arge:scalable,arge:theory,callahan:topology,franciosa:orders,grossi:cross-tree},
+geometry~\cite{aapv-fibld-01,goodrich:external,arge:buffer,arge:theory,arge:gis,aamvv-empgbtag97,arge:interval,kanellakis:indexing,ramaswamy:path,subramanian:p-range,vengroff:efficient,agarwal:efficient,zhu:further,agarwal:point,arge:scalable,arge:theory,callahan:topology,franciosa:orders,grossi:cross-tree,arge:tpie},
 \index{computational geometry} graph
 algorithms~\cite{chiang:external,arge:buffer,kumar:improved,abello:functional,crauser:randomized,arge:obdd,feuerstein:memory,nodine:blocking,ullman:input},
 \index{graph algorithms} and string
@@ -80,9 +80,9 @@ \chapter{Overview}
 geometric I/O algorithms by Chiang\cite{chiang:experiments},
 experiments with FFT and related algorithms by Cormen et
 al.~\cite{cormen:ffts}, implementation of the buffer tree
-\cite{arge:buffer} by Hutchinson et
-al.~\cite{hutchinson:early}, and the LEDA-SM system for
-implementing data types by Crauser et al.\cite{}.  Surveys
+\cite{arge:buffer} by Hutchinson et~al.~\cite{hutchinson:early}, and the
+LEDA-SM system for
+implementing data types by Crauser et al.\cite{mehlhorn:ledasm}.  Surveys
 of previous work in EM algorithm design and implementation
 can be found
 in~\cite{arge:gisbook,arge:thesis,vitter:dimacssurvey}