\providecommand{\bysame}{\leavevmode\hbox to3em{\hrulefill}\thinspace}
\providecommand{\MR}{\relax\ifhmode\unskip\space\fi MR }
% \MRhref is called by the amsart/book/proc definition of \MR.
\providecommand{\MRhref}[2]{%
  \href{http://www.ams.org/mathscinet-getitem?mr=#1}{#2}
}
\providecommand{\href}[2]{#2}
\begin{thebibliography}{1}

\bibitem{ahu:daca}
Alfred~V. Aho, Jonh~E. Holpcroft, and John~D. Ullman, \emph{The design and
  analysis of computer algorithms}, Addison-Wesley, 1974.

\bibitem{bayer:prefix.btree}
R.~Bayer and K.~Unterauer, \emph{Prefix {B}-trees}, ACM Transaction on Databse
  Systems \textbf{2} (1977), 11--26.

\bibitem{comer:btree}
D.~Comer, \emph{The ubiquitous {B}-{T}ree}, ACM Computing Surveys \textbf{11}
  (1979), 121--137.

\bibitem{ferragina:string.btree}
P.~Ferragina and R.~Grossi, \emph{The string {B}-tree: A new data structure for
  string search in external memory and its applications}, Journal of ACM
  \textbf{46} (1999), 236--280.

\bibitem{cormen:lrs:algo}
Thomas H.Cormen, Charles E.Leiserson, Ronald L.Rivest, and Clifford Stein,
  \emph{Introduction to algorithms}, MIT Press, 2001.

\bibitem{dek:taocp:iii}
Donald~E. Knuth, \emph{The art of computer programmimg, volume 3: Sorting and
  searching}, Addison-Wesley, 1998.

\bibitem{overmars:dynamic.ds}
Mark~H. Overmars, \emph{The design and analysis of dynamic data structures},
  Lecture Notes in Computer Science, Springer-Verlag, 1983.

\bibitem{overmars:dynamic-ds}
\bysame, \emph{The design of dynamic data structures}, Springer-Verlag, 1983.

\bibitem{wirth:a.ds}
Niklaus Wirh, \emph{Algorithms and data structures}, ?, 1990.

\end{thebibliography}
