References

[AHU89]

Alfred Aho, John E. Hopcroft, and Jeffrey Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1989.

[AVL62]

G. M. Adel'son-Vel'skivi and E. M. Landis. An algorithm for the organization of information. Soviet Mathematics Doklady, 3:1259--1263, 1962.

[Bay72]

R. Bayer. Symmetric binary B-trees: Data structure and maintenance algorithms. Acta Informatica, 1:290--306, 1972.

[CLR90]

Thomas H. Cormen, Charles E. Leierson, and Ronald L. Rivest. An Introduction to Algorithms. MIT Press, 1990.

[dPF02]

Leonardo di Pisa (``Fibonacci''). Liber Abaci. 1202.

[Heu97]

Volker Heun. Grundlegende Algorithmen. Vorlesungsskript TU München, October 1997.

[HJ89]

C. A. R. Hoare and Cliff B. Jones, editors. Essays in Computing Science. International Series in Computer Science. Prentice Hall, 1989.

[Hoa62]

C. A. R. Hoare. Quicksort. BCS Computer Journal, 5(1):10--15, 1962. Reprinted in [HJ89].

[HU79]

J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

[Knu73a]

Donald Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts, 1973.

[Knu73b]

Donald Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, Reading, Massachusetts, 1973.

[Moo59]

Edward F. Moore. The shortest path through a maze. In Proceedings of the International Symposium on the Theory of Switching, pages 285--292. Harvard University Press, 1959.

[Pap94]

Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

[Sed90]

Robert Sedgewick. Algorithms in C. Addison-Wesley, 1990.

[Ski97]

Steven S. Skiena. The Algorithm Design Manual. Springer, Telos, 1997.

[Tar72]

Robert Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146--160, June 1972.

[Wil64]

J. W. J. Williams. Heapsort (Algorithm 232). Communications of the ACM, 7(6):347--348, 1964.