Alfred Aho/J. Hopcroft/Jeffrey Ullman: The design and analysis of computer 
algorithms. Addison-Wesley 1974.

Alfred Aho/Jeffrey Ullman: Foundations of computer science in C.
Freeman 1995, 800p. 0-7167-8284-7. $29.

Vangalur Alagar: Fundamentals of computing. 
Prentice Hall 1989, 750p. 0-13-335324-9 (pbk). 
A very useful introductory course book.

M. Atallah (ed.): Algorithms and theory of computation handbook.
CRC 1998, 1300p. 0-8493-2649-4. DM 187.

6294 Giorgio Ausiello/Alberto Marchetti-Spaccamela/Marco Protasi: Teoria e
 progetto di algoritmi fondamentali. Franco Angeli 1994.

S. Baase: Computer algorithms. Introduction to design and analysis.
Addison-Wesley 1988.

J. Bentley: Programming pearls. Comm. ACM 27 (1984), 865-871.

J. Bentley: Programming pearls. Addison-Wesley 1985.

J. Bentley: More programming pearls. Addison-Wesley 1988.

Berman/Ramiyer: Improved approximations for the Steiner tree problem.
J. Algorithms 17 (1994), 381-408.

Andrew Binstock/John Rex: Practical algorithms for C programmers.
Addison-Wesley 1995, 500p. 0-201-63208-X. $30.

27063 Norbert Blum: A solution of the P versus NP problem. Arxiv: 1708.03486 (2017), 38p.

J. Chabert: A history of algorithms.
Springer 1998, 590p. 3-540-63369-3. DM 98.

6822 Blase Cindric: When the best algorithm isn't.
C/C++ Users Journal March 1995, 27-29. This may happen with Quicksort.

Stephen Cook: The complexity of theorem-proving procedures.
Proc. 3rd Annual ACM Symp. Theory of Computing (1971), 151-158.

27462 Thomas Cormen/Charles Leiserson/Ronald Rivest/Clifford Stein:
Introduction to algorithms. MIT Press 2009, 1290p. Eur 76.

Paul Cull: Analysis of algorithms. Lectures in applied mathematics and 
informatics (1990), 1-61. Zentralblatt 731.00027 and 772.68050. The author 
describes in a clear and concise manner the theory and task of the analysis 
of algorithms and problem complexity.

12883 Ingo Dittmer: Konstruktion guter Algorithmen.
Teubner 1996, 300p. 3-519-02990-1. DM 45.

8083 Dino Esposito: La nuova frontiera della computazione.
Computer Programming Giugno 1996, 99-101.

S. Even: Combinatorial algorithms. Macmillan 1973.

Bryan Flamig: Practical algorithms in C++.
Wiley 1995, 450p. 0-471-00955-5. $44.

M. Fredman/J. Komlos/E. Szemeredi: Storing a sparse table with O(1) worst
case access time. J. ACM 31/3 (1984), 538-544.

L. Goldberg: Efficient algorithms for listing combinatorial structures.
Cambridge UP 1993, 160p. 0-521-45021-7. Pds. 28.
"Das Buch ist in einem ansprechenden Stil verfasst, sehr uebersichtlich 
gestaltet und wird deshalb dem interessierten Leser waermstens empfohlen." 
(H. Fripertinger).

G. Gonnet: Handbook of algorithms and data structures. Addison-Wesley 1984.

1685 S. Goodman/S. Hedetniemi: Introduction to the design and analysis of 
algorithms. McGraw-Hill 1985.

Ronald Graham/Donald Knuth/Oren Patashnik: Concrete mathematics - a foundation
for computer science. Addison-Wesley 1994, 660p. 0-201-55802-5. DM 87.

5547 Robert Gray: Computer programs and mathematical proofs.
Math. Intell. 13/4 (1991), 45-48.

Daniel Greene/Donald Knuth: Mathematics for the analysis of algorithms.
Birkha''user 1990, 130p. 3-7643-3515-7. DM 68.

17945 Martin Grötschel: P = NP? Elem. Math. 57 (2002), 96-102.

18894 Rudolf Grübel: Zufällige binäre Bäume - von der average-case-
Analyse zur Verteilungsasymptomatik. Math. Sember. 53 (2006), 210-230.

Juerg Gutknecht: The tragedy of programming language development.
Software Concepts and Tools 15 (1994), 29-55.

6234 Sharam Hekmatpour: C++. Der Einstieg fuer den C-Programmierer.
Hanser 1993, 250p. 3-446-17324-2. DM 58. 
Enthaelt auch Algorithmen, vor allem fuer Baeume.

19040 Volker Heun: Grundlegende Algorithmen. Vieweg 2003, 370p. Eur 30.

2251 Ellis Horowitz/Sartaj Sahni: Algorithmen. Springer 1981.

Ellis Horowitz/Sartaj Sahni/Susan Anderson-Freed: Fundamentals of data 
structures in C++. Freeman 1995, 750p. 0-7167-8292-8. 

11069 David Johnson: A theoritician's guide to the experimental
analysis of algorithms. Internet 1996, 7p.

9870 Dieter Jungnickel: Graphen, Netzwerke und Algorithmen.
Bibl. Inst. 1994, 700p. 3-411-14263-4. DM 98.

3765 B. Kernighan/P. Plauger: Programmierwerkzeuge. Springer 1980.

2129 Donald Knuth: The art of computer programming. 3 volumes.
Addison-Wesley 1973.
[Volume 1: 1997. 0-201-189683-4. $50.
Volume 2: 1997. 0-201-89684-2. $50.]
Volume 3: 1998. 0-201-89685-0. $50.]

19728 Donald Knuth: The art of computer programming 4/0B.
A draft of section 7.1.1: Boolean basics. Internet 2007, 88p.

20829 Donald Knuth: The art of computer programming 4/0.
Introduction to combinatorial algorithms and boolean functions.
Addison-Wesley 2008, 220p. Eur 16.

21878 Donald Knuth: The art of computer programming 4/1.
Bitwise tricks and techniques. Binary decision diagrams.
Addison-Wesley 2009, 260p. Eur 16.

6028 Fred Kroeger: Einfuehrung in die Informatik. Algorithmenentwicklung.
Springer 1991.

22228 Doina Logofatu: Algorithmen und Problemlösungen mit C++.
Vieweg+Teubner 2010, 500p. Eur 34.

F. Luccio: La struttura degli algoritmi. Boringhieri 1982.

G. Megson: Introduction to systolic algorithm design.
Clarendon Press 1992, 350p. 0-19-853813-8. $77.

6691 Marco Mezzalama/Nicola Montefusco/Paolo Prinetto: Aritmetica degli 
elaboratori e codifica dell'informazione. Utet 1989.

Ali Mili/Fatma Mili: Computer program construction.
Oxford UP 1994, 400p. 0-19-509236-8. Pds. 43.

A. Nijenhuis/Herbert Wilf: Combinatorial algorithms. Academic Press 1978.

Jon Orwant/Jarkko Hietaniemi/John Macdonald: Mastering algorithms with
Perl. O'Reilly 1999, 690p. 1-56592-398-7. $35.

3757 Thomas Ottmann/Peter Widmayer: Algorithmen und Datenstrukturen.
Bibl. Inst. 1990. Das beste Lehrbuch fuer Programmierung und Algorithmen 
ueberhaupt.

E. Page/L. Wilson: Rappresentazione delle strutture informative e algoritmi 
di base. ISEDI 1982.

4711 Clifford Pickover: Mit den Augen des Computers. Markt & Technik 1992.

E. Roberts: Thinking recursively. Wiley 1986.

24667 Arnold Rosenberg: The pillars of computation theory.
Springer 2010, 330p. Eur 65 (Ebook).

J. Rosenblatt/P. Seymour: The structure of homometric sets.
SIAM J. Alg. Discr. Meth. 3 (1982), 343-350.

2095 Peter Schefe: Informatik - eine konstruktive Einfuehrung.
Bibl. Inst. 1985. 

6764 Arnold Schoenhage/Andreas Grotefeld/Ekkehard Vetter: Fast algorithms.
Bibl. Inst. 1994, 300p. 3-411-16891-9. DM 68. Etwa 160 Programme fuer ganze 
Zahlen und Polynome in beliebiger und garantierter Genauigkeit.

4707 Robert Sedgewick: Algoritmi in C. Addison-Wesley 1990.

Robert Sedgewick: Algoritmi in C++. Addison-Wesley 1994.

Robert Sedgewick/Philippe Flajolet: An introduction to the analysis of
algorithms. Addison-Wesley 1996, 510p. $45.

16893 Raymond Seroul: Programming for mathematicians. Springer 2000, 430p. Eur 37.

V. Strassen: Gaussian elimination is not optimal.
Num. Math. 13 (1969), 354-356.

R. Tarjan/A. Yao: Storing a sparse table. Comm. ACM 22/11 (1979), 606-611.

22227 Berthold Vöcking/.../Dorothea Wagner: Taschenbuch der Algorithmen.
Springer 2008, 450p. Eur 20.

23142 Oliver Vornberger: Algorithmen. Vorlesung Univ. Osnabrück 2010/11, 174p.

Dietmar Waetjen: Theoretische Informatik.
Oldenbourg 1994, 200p. 3-486-22742-4. DM 48.

6498 Ingo Wegener: Effiziente Algorithmen fuer grundlegende Funktionen.
Teubner 1989, 260p. 3-519-02276-1. DM 40.

7961 Ingo Wegener: Theoretische Informatik.
Teubner 1993, 240p. 3-519-02123-4. DM 34.

7592 Avi Widgerson: Lectures on the fusion method and derandomization.
Technical Report SOCS-95.2, School of Computer Science,
McGill University 1995.