[Aig02]

Martin Aigner, Günter M. Ziegler, Das BUCH der Beweise, Springer Verlag, 2002.

[Ban83]

Horia Banea, Probleme de matematică traduse din revista sovietică KVANT, Editura Didactică şi Pedagogică, Bucureşti, 1983.

[Bar93]

Barnsley, M. F., Fractals everywhere. Second edition, Academic Press Inc., Boston, 1993.

[Bur94]

Stan, M., Burleson, W., Limited-weight codes for low-power I/O, in Int’l Workshop on Low Power Design, 1994.

[Coo71]

Cook. S., A., The complexity of theorem-proving procedures, Proc. 3^rd Annual ACM Symp. Theory of Computing, S. 151-158.

[Cor04]

Th. H. Cormen, C. E. Leiserson, R. Rivest, C. Stein, Algorithmen-Eine Einführung, Oldenbourg Wissenschaftsverlag, München, 2004.

[Die00]

Reinhard Diestel, Graphentheorie, Springer-Verlag, Heidelberg, 2000.

[Dre99]

Drechsler, N., Drechsler, R., Exploiting don’t cares during data sequencing using genetic algorithms, in ASP Design Automation Conf., pp. 303-306, 1999

[Fla02]

David Flanagan, JAVA in a nutshell. A desktop quick reference, O’ Reilly, Sebastopol, 2002.

[For96]

Otto Forster, Algorithmische Zahlentheorie, Vieweg Verlag, Wiesbaden, 1996.

[Gan91]

Mircea Ganga, Teme şi probleme de matematică, Editura Tehnică, Bucureşti, 1991.

[Gar79]

Garey, M. R.,  Johnson, D. S.,  Computers and Intractability: a Guide to the Theory of NP-Completeness,  W. H. Freeman, New  York.

[GM]

Gazeta Matematică, mathematisches Magazin, Sammlung

[Gra94]

Graham R. L., Knuth D. E., Patashnik O., Concrete Mathematics, Addison-Wesley, 1994.

[Heu03]

Volker Heun, Grundlegende Algorithmen. Einführung in den Entwurf und die Analyse effizienter Algorithmen, 2. Auflage, Vieweg Verlag, Wiesbaden, 2003.

[Iva02]

Cornelia Ivaşc, Mona Prună, Luminiţa Condurache, Doina Logofătu, Informatica C++. Manual pentru clasa a XI-a, Editura Petrion, Bucureşti, 2002.

[Knu97]

Donald E. Knuth, The Art of Computer Programming, Volume I: Fundamental Algorithms, Addison-Wesley Longman, Amsterdam; Auflage: 3. A., 1997.

[Kre99]

Donald L. Kreher, Douglas R. Stinson, Combinatorial algorithms. Generation, Enumeration, and Search., CRC Press, 1999.

[Krü06]

Guido Krüger, Hanbuch der Java-Programmierung, 4., aktualisierte Auflage, Addison-Wesley, München, 2006.

[Log01]

Doina Logofătu, C++. Probleme rezolvate şi algoritmi, Editura Polirom, Iaşi, 2001.

[Log05a]

Doina Logofătu, Suma puterilor asemenea, GInfo, 15/2 2005, S. 40-43, WWW: http://www.ginfo.ro/revista/15_2/focus2.pdf.

[Log05b]

Doina Logofătu, Şirul lui Catalan, GInfo, 15/5, 2005, S. 36-41,  WWW: http://www.ginfo.ro/revista/15_5/mate1.pdf.

[Log05c]

Doina Logofătu, De la problema cutiilor speciale la elemente POO cu C++, GInfo, 15/5, S. 27-30, WWW: http://www.ginfo.ro/revista/15_5/focus1.pdf.

[Log06]

Doina Logofătu, Bazele programării în C. Aplicaţii, Editura Polirom, Iaşi, 2006.

[Log06a]

Doina Logofătu, Rolf Drechsler, Efficient Evolutionary Approaches for the Data Ordering Problem with Inversion, 3rd European Workshop on Hardware Optimisation Techniques (EvoHOT), LNCS 3907, S. 320-331, Budapest, 2006.

[Log06b]

Doina Logofătu, Greedy Approaches for the Data Ordering Problem with and without Inversion, Proceedings of the ROSYCS 2006, Romanian Symposium on Computer Scrience, S. 65-80, Iaşi.

[Log06c]

Doina Logofătu, Algorithmen und Problemlösungen mit C++, Vieweg-Verlag, Wiesbaden, 2006.

[Log07]

Doina Logofătu, Algoritmi fundamentali în C++. Aplicaţii, Polirom, Iaşi, 2007.

[Mär01]

Das große Märchenbuch, Droemersche Verlagsanstalt Th. Knaur Nachf., München, 2001.

[Mat02]

J. Matoušek, J. Nešetřil, Diskrete Mathematik. Eine Entdeckungsreise, Springer Verlag, 2002.

[Mur95]

Murgai, R., Fujita, M., Krishnan, S. C., Data sequencing for minimum transition, in Int’l Workshop on Logic Synth., 1995.

[Mur97]

Murgai, R., Fujita, M., Krishnan, S. C., Data sequencing for minimum-transition transmission, in IFIP Int’l Conf. on VLSI, 1997.

[Mur98]

Murgai, R., Fujita, M., Oliveira, A., Using complementation and resequencing to minimize transitions, in Design Automation Conf., S. 694-697, 1998.

[Năs83]

C. Năstăsescu, C. Niţă, M. Brandiburu, D. Joiţa, Exerciţii şi probleme de algebră, Editura Didactică şi Pedagogică, Bucureşti, 1983.

[Nit04]

Manfred Nitzsche, Graphen für Einsteiger. Rund um das Haus von Nikolaus, Vieweg Verlag, Wiesbaden, 2004.

[Pei98]

Heinz-Otto Peitgen, Hartmut Jürgens, Dietmar Saupe, Bausteine der Chaos. Fraktale, Rowohlt Taschenbuch Verlag GmbH, 1998

[Ran97]

Doina Rancea, Limbajul Pascal. Manual clasa a IX-a, Computer Libris Agora, Cluj, 1997.

[Ran99]

Doina Rancea, Limbajul Pascal. Algoritmi fundamentali, Computer Libris Agora, Cluj, 1999.

[Ski03]

Steven S. Skiena, Miguel A. Revilla, Programming Challenges. The Programming Contest Training Manual, Springer-Verlag, New York, 2003.

[Sip97]

Sipser, M., Introduction to the Theory of Computation, PWS-Kent, Belmont, California.

[Sta86]

D. Stanton, D. White, Constructive Combinatorics, Springer-Verlag, New-York, 1986.

[Str66]

Karl Strubecker, Einführung in die höhere Mathematik, Band I: Grundlagen, R. Oldenbourg, München-Wien, 1966.

[Str67]

Karl Strubecker, Einführung in die höhere Mathematik, Band II:  Differentialrechnung einer reellen Veränderlichen, R. Oldenbourg, München-Wien, 1967.

[Sun06]

Java™ Platform, Standard Edition 6 API Specification, Online Referenz:

http://java.sun.com/javase/6/docs/api/, Sun Microsystems, Inc, 2006.

[Tom81]

Ioan Tomescu, Probleme de combinatorică şi teoria grafurilor, Editura Didactică şi Pedagogică, Bucureşti, 1981.

 Online Referenzen

 http://de.wikipedia.org/wiki/Hauptseite

 http://acm.uva.es/problemset/

 http://ceoi.inf.elte.hu/

 http://mathworld.wolfram.com/

 http://microscopy.fsu.edu/optics/timeline/people/

 http://olympiads.win.tue.nl/ioi/

 http://www.acm.org/

 http://www.answers.com/

 http://www.cut-the-knot.org

 http://www.erichfried.de/

 http://home.cogeco.ca/~ve3ll/jatutor0.htm

 http://leepoint.net/notes-java/

 http://www.math.utah.edu/mathcircle/notes/mladen2.pdf

 http://www.matheboard.de

 http://www.mathematische-basteleien.de

 http://www.mathe-online.at/galerie.html

 http://www.nserc.gc.ca/news/2006/p060214_cook.htm

 http://www-i1.informatik.rwth-aachen.de/~algorithmus