Module 1: Algorithms and Datastructures (Supplement)
|
[Deutsch] |
| Books | Articles | Journals | Links | Hands-On:
Experiments | Themes for Debate |
|
Books
|
- Aho, A. V. ; Hopcroft, J. E.; Ullman, J. D. (1974) : The Design
and Analysis of Computer Algorithms. Reading (MA): Addison-Wesley.
- Ahuja, Ravindra K.; Magnanti,
Thomas L.; Orlin, James B.
(1993): Network Flows: Theory, Algorithms, and Applications.
Englewood Cliffs (NJ):
Prentice Hall.
- Cormen, Thomas H.; Leiserson,
Charles E. ; Rivest, Ronald L.
(1990): Introduction to Algorithms.
Boston (MA): MIT Press.
- Dahl, O.-J.; Dijkstra, E. W.; Hoare, C. A. R. (1972): Structured
Programming. London, New York: Academic Press.
- Goodrich, M. T.; Tamassia,
R. (1998): Data Structures and Algorithms in Java.
New York: Wiley.
- Horowitz, Ellis; Sahni,
Sartaj (1983): Fundamentals of Data
Structures. Computer Science Press.
- Knuth, D. E.
(1973): The Art of Computer Programming:
Volume 1:
Fundamental Algorithms. Reading (MA): Addison
Wesley.
- Knuth.
D. E. (1981): The Art of Computer Programming:
Volume 2: Seminumerical
algorithms. Reading (MA): Addison
Wesley.
- Kozen, Dexter C.
(1991): The design and analysis of algorithms (Texts
and Monographs in Computer Science). Berlin et al.:
Springer.
- Mehlhorn, Kurt (1984):
Data structures and algorithms 1: Sorting and searching
(EATCS Monographs on Theoretical Computer
Science). Berlin et al.: Springer.
- Mehlhorn, Kurt (1984):
Data structures and algorithms 2: Graph algorithms and NP-Completeness
(EATCS Monographs on Theoretical Computer Science).
Berlin et al.: Springer.
- Papadimitriou,
Christos H.; Steiglitz, Kenneth
(1982): Combinatorial optimization: Algorithms and complexity.
Englewood Cliffs (NJ):
Prentice-Hall.
- Sedgewick, Robert (1997): Algorithms in C.
Reading (MA): Addison-Wesley.
- Shaffer, Clifford A. (1997):
A Practical Introduction to Data Structures and
Algorithm Analysis: C++ Version.
London: Prentice Hall.
- Shaffer, Clifford A. (1998):
A Practical Introduction to Data Structures and
Algorithm Analysis: Java Edition.
London: Prentice Hall.
- Standish, Thomas (1998): Data Structures in Java.
Reading (MA): Addison-Wesley.
|
| Articles |
|
- Agarwal, Pankaj K.; Sharir,
Micha (1998): Efficient Algorithms for
Geometric Optimization. ACM Computing Surveys, 30
(4), 412-458.
- Boyer, R. S.; Moore, J. S. (1977): A fast string searching algorithm.
Communcations of the ACM. 20 (10).
- Floyd, F. W. (1964). Algorithm 245: Treesort 3. Communications of
the ACM, 7/64, 701.
- Gaede, Volker; Günther,
Oliver (1998): Multidimensional Access
Methods. ACM Computing Surveys,
30 (2):170-231.
- Gupta, P.; Chakrabarti,
P. P.; Ghose, S. (1992): The Towers of
Hanoi: Generalizations, Specializations, and Algorithms, International Journal
of
Computer Mathematics, 46,
149-161.
- Hoare, C. A. R.
(1961):
Algorithm 64: Quicksort.
Communications of the ACM, Vol.
4 , Iss. 7, 321.
- Hoare, C. A. R. (1971):
Proof of a program: FIND.
Communications of the ACM, Vol. 14, Iss. 1, 39 -
45.
- Hoare ,C. A. R.; Hayes ,I. J.;
Jifeng He; Morgan, C.
C; Roscoe, A.
W.; Sanders, J. W.;
Sorensen, I. H.; Spivey,
J. M.; Sufrin, B. A.
(1987): Laws of programming.
Communications of the ACM, Vol.
30 Iss. 8, 672 - 686.
- Scanlan, D. A. (1989):
Structured flowcharts outperform pseudocode: An experimental comparison.
IEEE Software, 6, 28-36.
- Wieringa, Roel (1998): A Survey of Structured and Object-Oriented
Software Specification Methods and Techniques. ACM Computing Surveys,
30 (4), 459-527.
|
|
| Journals |
|
-
Algorithmica (ISSN: 0178-4617 printed version; ISSN: 1432-0541
electronic version) | Springer
- Theory
of Computing Systems (vorher: Mathematical Systems Theory)
ISSN: | Springer
- Acta
Informatica ISSN: 0001-5903 (printed version) ISSN: 1432-0525
(electronic version) | Springer
- Discrete Applied
Mathematics ISSN: 0166-218X | Elsevier
- Information
Processing Letters ISSN: 0020-0190 | Elsevier
- Informatik
Forschung und Entwicklung Berlin, Heidelberg : Springer ISSN
0178-3564
|
|
| Links |
|
|
|
|
|
|
|