Computerorientierte Mathematik I

312
Literaturverzeichnis
[AHU83] Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. Data Structures and Algorithmus. Addison-Wesley, Reading, NY, 1983. 10.6
[Aig04]
Martin Aigner. Diskrete Mathematik. Vieweg, Wiesbaden/Braunschweig, 2004. 5. Auflage. 1.4
[ASU86]
Alfred V. Aho, Ravi Sethi, and Jeffrey D. Ullman. Compilers, Principles, Techniques, and
Tools. Addison-Wesley, Reading, NY, 1986. 3.5, 4.5
[AU92]
Alfred V. Aho and Jeffrey D. Ullman. Foundations of Computer Science. W. H. Freeman
and Company, New York, 1992. 1.4
[Bro04]
J. Glenn Brookshear. Computer Science: An Overview. Prentice Hall, Englewood Cliffs,
NJ, 8th edition, 2004. 1.4
[CLRS01] Thomas H. Cormen, Charles E. Leiserson, Ronald R. Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press, Cambridge, MA, second edition, 2001. 1.4, 6.4, 9.4,
10.3.1, 10.3.2, 10.5.1, 10.6, 11.3
[CW87]
D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. In
Proc. 19th Ann. Symp. on Comp., pages 1–6, 1987. 10.3.2
[CW98]
Mary Campione and Cathy Walrath. The Java Tutorial: Object-Oriented Programming
for the Internet. Addison-Wesley, Reading, NY, second edition, 1998. Also available
under http://java.sun.com/docs/books/tutorial. 1.4, 2.4, 3.5
[DD01]
Harvey M. Deitel and Paul J. Deitel. Java: How to Program. Prentice Hall, Englewood
Cliffs, NJ, 4th edition, 2001. 1.4, 2.4, 3.5
[Fla02]
David Flanagan. Java in a Nutshell. Deutsche Ausgabe für Java 1.4. O’Reilly & Associates, Sebastopol, CA, 2002. 1.4
[GL02]
Les Goldschlager and Andrew Lister. Informatik – Eine moderne Einführung. Carl Hanser
Verlag, München, third edition, 2002. 1.4
[GMW91] Philip E. Gill, Walter Murray, and Margaret H. Wright. Numerical Linear Algebra and
Optimization, volume 1. Addison-Wesley, Reading, NY, 1991. 6.4
313
314
LITERATURVERZEICHNIS
[GR03]
Ralph P. Grimaldi and David J. Rothman. Discrete and Combinatorial Mathematics: An
Applied Introduction. Addison-Wesley, Reading, NY, 5th edition, 2003. 1.4
[GS04]
Heinz-Peter Gumm and Manfred Sommer. Einführung in die Informatik. Oldenbourg
Verlag, München, 2004. 5. Auflage. 1.4
[GT04]
Michael T. Goodrich and Roberto Tamassia. Data Structures and Algorithms in Java.
John Wiley & Sons, New York, 3rd edition, 2004. 1.4, 5.10
[Hor84]
E. Horowitz. Fundaments of Programming Languages. Springer-Verlag, Berlin, 1984.
Second Edition. 3.5
[HR94]
Mark R. Headington and David D. Riley. Data Abstraction and Structures Using C++.
D. C. Heath and Company, Lexington, MA, 1994. 5.10, 7.5, 10.6
[HU79]
John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages,
and Computation. Addison-Wesley, Reading, NY, 1979. 3.5, 4.5
[Job02]
Fritz Jobst. Programmieren in Java. Carl Hanser Verlag, München, 2002. 4. erweiterte
Auflage. 1.4
[Jun94]
Dieter Jungnickel. Graphen, Netzwerke und Algorithmen. BI Wissenschaftsverlag, Mannheim, 1994. 3. Auflage. 6.4
[Knu97]
Donald. E. Knuth. The Art of Computer Programming, volume 1 Fundamental Algorithms. Addison-Wesley, Reading, NY, third edition, 1997. 1.4
[Knu98a] Donald. E. Knuth. The Art of Computer Programming, volume 2 Seminumerical Algorithms. Addison-Wesley, Reading, NY, third edition, 1998. 1.4, 7.5
[Knu98b] Donald. E. Knuth. The Art of Computer Programming, volume 3 Sorting and Searching.
Addison-Wesley, Reading, NY, second edition, 1998. 1.4, 6.4, 10.6
[Krü02]
Guido Krüger. Handbuch der Java Programmierung. Addison-Wesley, Reading, NY, 3.
auflage edition, 2002. 1.4, 2.4
[Küh99]
Ralf Kühnel. Die Java 1.2 Fibel. Addison-Wesley Longman, Amsterdam, 1999. 3.
Auflage. 1.4, 3.5, 4.1, 4.5, 7.5
[LV92]
G. T. Leavens and M. Vermeulen. The 3 + x problem. Computers Math. Appl., 24:79–99,
1992. 8.1.4, 8.3
[Meh88]
Kurt Mehlhorn. Datenstrukturen und effiziente Algorithmen, Band I: Sortieren und Suchen. Teubner Verlag, Stuttgart, 1988. 1.4, 6.4, 11.3
[Mei98]
Christoph Meinel. Effiziente Algorithmen. Carl Hanser Verlag, München, 1998. 1.4
[OSW83] Thomas Ottmann, Michael Schrapp, and Peter Widmayer. PASCAL in 100 Beispielen.
Teubner Verlag, Stuttgart, 1983. 2.4
LITERATURVERZEICHNIS
315
[OV98]
Walter Oberschelp and Gottfried Vossen. Rechneraufbau und Rechnerstrukturen. Oldenburg Verlag, München, 7 edition, 1998. 12.4
[OW82]
T. Ottmann and P. Widmayer. Programmierung mit PASCAL. Teubner Verlag, Stuttgart,
1982. 8.3
[OW02]
Thomas Ottmann and Peter Widmayer. Algorithmen und Datenstrukturen. Spektrum
Akademischer Verlag, 2002. 4. Auflage. 1.4, 6.4, 11.3
[PM88]
S. Park and K. Miller. Random number generators: Good ones are hard to find. Comm.
ACM, 31:1192–1201, 1988. 7.5
[Pre00]
Bruno R. Preiss. Data Structures and Algorithms with Object-Oriented Design Patterns
in Java. John Wiley & Sons, New York, 2000. 1.4
[Ric93]
John R. Rice. Numerical Methods, Software and Analysis. Academic Press, New York,
second edition, 1993. 12.4
[Sed03]
Robert Sedgewick. Algorithms in Java. Addison-Wesley, Reading, NY, 3rd edition, 2003.
1.4
[SS02]
Gunter Saake and Kai-Uwe Sattler. Algorithmen und Datenstrukturen: eine Einfürung mit
Java. dpunkt.verlag, Heidelberg, 2002. 1.4
[Tar83]
Robert Endre Tarjan. Data Structures and Network Algorithms. CBMS-NSF Regional
Conference Series in Applied Mathematics. SIAM, Philadelphia, PA, 1983. 6.4
[Van85]
R. Vandergraft. Introduction to Numerical Computation. Academic Press, New York,
1985. 12.4
[vL90a]
Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, A: Algorithms and
Complexity Theory. North-Holland, Amsterdam, 1990. 1.4
[vL90b]
Jan van Leeuwen, editor. Handbook of Theoretical Computer Science, B: Formal Models
and Semantics. North-Holland, Amsterdam, 1990. 1.4
[Wii87]
Stephen A. Wiitala. Discrete Mathematics: A Unified Approach. Mc Graw-Hill, New
York, 1987. 1.4, 3.5, 4.5
[Wir78]
N. Wirth. Systematisches Programmieren. Teubner Verlag, Stuttgart, 1978. 12.4
[Wir86]
N. Wirth. Algorithmen und Datenstrukturen. Teubner Verlag, Stuttgart, 1986. 8.3