home *** CD-ROM | disk | FTP | other *** search
- {\magtwo References}
- \bigskip
- \parindent 3.3truecm
- \def\ref #1 #2 {
- \item {\hbox to \parindent {\bf \ [#1] \hfill}} #2}
- \ref{AHU83}
- {A.V. Aho, J.E. Hopcroft, J.D. Ullman: ``Data Structures and
- Algorithms'', Addison-Wesley Publishing Company, 1983}
- \medskip
- \ref{DKMMRT88}
- {M. Dietzfelbinger, A. Karlin, K.Mehlhorn, F. Meyer
- auf der Heide, H. Rohnert, R. Tarjan: ``Upper and Lower Bounds for
- the Dictionary Problem'', Proc. of the 29th IEEE Symposium on
- Foundations of Computer Science, 1988}
- \medskip
- \ref{FT84}
- {M.L. Fredman, and R.E. Tarjan: ``Fibonacci Heaps and Their Uses in
- Improved Network Optimization Algorithms'', 25th Annual IEEE Symp.
- on Found. of Comp. Sci., 338-346, 1984}
- \medskip
- \ref{L89}
- {S.B. Lippman: ``\CC Primer'', Addison-Wesley, Publishing Company, 1989}
- \medskip
- \ref{M84}
- {K. Mehlhorn: ``Data Structures and Algorithms'', Vol. 1--3,
- Springer Publishing Company, 1984}
- \medskip
- \ref{MN89}
- {K. Mehlhorn, S. N\"aher: `` LEDA, a Library of Efficient Data Types and
- Algorithms'', TR A 04/89, FB10, Universit\"at des Saarlandes,
- Saarbr\"ucken, 1989}
- \medskip
- \ref{S86}
- {B. Stroustrup: `` The \CC Programming Language'', Addison-Wesley
- Publishing Company, 1986}
- \medskip
- \ref{T83}
- {R.E. Tarjan: ``Data Structures and Network Algorithms'',
- CBMS-NSF Regional Conference Series in Applied Mathematics,
- Vol. 44, 1983}
-
- \vfill\eject
- \vglue 10cm
- \vfill\eject
-