\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{bentley-sedgewick:ternary}
John Bentley and Robert Sedgewick, \emph{Ternary tree}, Dr. Dobb's (1998).

\bibitem{bentley:pearls}
Jon Bentley, \emph{Programming pearls}, second ed., Addison-Wesley, 2000.

\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{dek:spaa}
\bysame, \emph{Selected papers on analysis of algorithms}, CSLI, 2000.

\bibitem{apostol:calculus}
Tom M.Apostol, \emph{Calculus: One-variable calculus, with an introduction to
  linear algebra}, second edition ed., vol.~I, John Wiley \& Sons, Inc., 1967.

\bibitem{sedgewick:algo}
Robert Sedgewick, \emph{Algorithms}, Addison-Wesley, 1988.

\bibitem{sedgewick:flajolet:analysis}
Robert Sedgewick and Philip Flajolet, \emph{Introduction to the analysis of
  algorithms}, Addison-Wesley, 1996.

\end{thebibliography}
