Literatur
- [CLR91]
T.~H. Cormen, C.~E. Leiserson, and R.~L. Rivest.
Introduction to Algorithms.
The MIT Press, 1991.
http://theory.lcs.mit.edu/~clr/.
- [Har97]
Rolf Hartwig.
Algebraische Spezifikation abstrakter Datentypen (Skript zur
Vorlesung).
http://www.informatik.uni-leipzig.de/~rhartwig/lad/skr4.html,
1997.
- [Har98]
Rolf Hartwig.
Grundlagen der Programmverifikation (Skript zur Vorlesung).
http://www.informatik.uni-leipzig.de/~rhartwig/lad/skr1.html,
1998.
- [Hin98]
Ralf Hinze.
Numerical representations as higher order nested datatypes.
Technical Report IAI-TR-98-12, Institut für Informatik III,
Universit\"at Bonn, 1998.
http://www.informatik.uni-bonn.de/~ralf/HigherOrderNested.ps.gz.
- [Hin99]
Ralf Hinze.
Explaining binomial heaps.
Journal of Functional Programming, 9(1):93--104, 1999.
http://www.informatik.uni-bonn.de/~ralf/publications.html.
- [Kil99]
Lee Killough.
Priority queues.
http://priority-queues.webhop.org/, 1999.
- [Knu93]
Donald~Erwin Knuth.
The Stanford Graphbase: A Platform for Combinatorial Computing.
ACM Press, New York, 1993.
ftp://labrea.stanford.edu/pub/sgb/.
- [Knu98]
Donald~Erwin Knuth.
The Art of Computer Programming, volume 3: Sorting and
Searching.
Addison-Wesley, 1998.
http://www-cs-staff.stanford.edu/~uno/taocp.html.
- [May98]
Ernst~W. Mayr.
Effiziente Algorithmen und Datenstrukturen (Skript zur
Vorlesung).
\urlhttp://www14.informatik.tu-muenchen.de/skripten/ead_ws9899_html/index.h%
tml, 1998.
- [MT90]
K.~Mehlhorn and A.~Tsakalidis.
Data Structures, pages 301--342.
Volume~A of van Leeuwen \citeHTCS, 1990.
- [Oka98]
Chris Okasaki.
Purely Functional Data Structures.
Cambridge University Press, 1998.
http://www.cs.columbia.edu/~cdo/papers.html#cup98.
- [Pip90]
N.~Pippenger.
Communication Networks, pages 805--834.
Volume~A of van Leeuwen \citeHTCS, 1990.
- [Sho92]
Berry Shoemakers.
Data structures and Amortized Complexity in a Functional
Setting.
PhD thesis, Eindhoven University of Technology, 1992.
http://www.win.tue.nl/math/dw/pp/berry/phd.html.
- [VF90]
J.~S. Vitter and Ph. Flajolet.
Average-Case ananlysis of Algorithms and Data Structures, pages
431--524.
Volume~A of van Leeuwen \citeHTCS, 1990.
- [vL90a]
J.~van Leeuwen.
Graph Algorithms, pages 525--632.
Volume~A of van Leeuwen \citeHTCS, 1990.
- [vL90b]
Jan van Leeuwen, editor.
Handbook of Theoretical Computer Science.
Elsevier Science Publishers B.V., 1990.
- [Wan95]
Rolf Wanka.
Parallele Sortiernetzwerke (Skript zur Vorlesung).
\urlhttp://www.uni-paderborn.de/fachbereich/AG/agmadh/WWW/german/RolfsVorle%
sungen/ParSort/parsort.html, 1995.
- [Wei93]
Mark~Allen Weiss.
Data Structures and Algorithms in Ada.
Benjamin/Cummings, 1993.
http://www.cs.fiu.edu/~weiss/.