ABELSON Harold, SUSSMAN Gerald J., Structure and Interpretation of Computer Programs, MIT Press, 1985.

ADOBE SYSTEMS INC., PostScript Language, Tutorial and Cookbook, Addison Wesley, 1985.

AHO A., ULLMAN J., Concepts fondamentaux de l'informatique, Dunod, 1998.

AHO Al V., SETHI Ravi, ULLMAN Jeff D., Compilers: Principles, Techniques, and Tools, Addison Wesley, 1986.

BALCAZAR J.L., DIAZ J., and GABARRO J., Structural Complexity I.

BARENDREGT Henk, The Lambda Calculus, Its Syntax and Semantics, North Holland, 1981.

BEAUQUIER Danièle, BERSTEL Jean, CHRETIENNE Philippe, Eléments d'algorithmique, Masson, Paris, 1992.

BENTLEY Jon, Programming Pearls, Addison Wesley, 1986.

BERGE Claude, La théorie des graphes et ses applications, Dunod, Paris, 1966.

BERSTEL Jean, PIN Jean-Eric, POCCHIOLA Michel, Mathématiques et Informatique, McGraw-Hill, 1991.

BOISSONNAT & YOINEC, Algorithmic Geometry.

BONDY & MURTY, Graph Theory with Applications.

BRAQUELAIRE J.P., Méthodologie de la programmation en langage C, Masson, 1994.

BRUALDI A., Introductory Combinations.

CHARTRAND & LESNIAK, Graphs and Digraphs.

CHOMSKY Noam, SCHÜTZENBERGER Marcel Paul, The algebraic theory of context free languages dans Computer Programming and Formal Languages, P. Braffort, D. Hirschberg ed. North Holland, Amsterdam, 1963.

CHVATAL V., Linear Programming, Freeman, 1983.

CONTE & DE BOUR, Elementary Numberical Analysis.

CORMEN T.H., LEISERSON C.E. and RIVEST R.L., Introduction to algorithms, 1990.

CORMEN, LEISERSON, & RIVEST, Introduction to Algorithms.

CORMEN Thomas H., LEISERSON Charles E., RIVEST Ronald L., Algorithms, MIT Press, 1990.

COUSOT Patrick, Introduction à l'algorithmique et à la programmation, Ecole Polytechnique, Cours d'Informatique, 1986.

DALEY, Atmospheric Data Analysis.

DE BERG & VANKREVELD & SCHWARGLEOFF & OVERNESS, Computational Geometry: Algorithms and Applications.

EVEN Shimon, Graph Algorithms, Computer Science Press, Potomac, Md, 1979.

FLOUDAS C.A., Nonlinear & Mixed integer Optimization.

GAREY M.R. and JOHNSON D.S., Computers and Intractability: A guide to the theory of NP-Completeness.

GOLDBERG Adele, Smalltalk-80: the language and its implementation, Addison-Wesley, 1983.

GOLDBERG David, What Every Computer Scientist Should Know About Floating-Point Arithmeticc, Computing Surveys, 23(1), Mars 1991.

GOLUB G. & VAN LOAN C., Matrix Computations.

GONNET Gaston H., BAEZA-YATES Riccardo, Handbook of Algorithms and Data Structures, In Pascal and C, Addison Wesley, 1991.

GOODAIRE Edgar G. and PARMENTER Michael M., Discrete Mathematics with Graph Theory, Prentice Hall, Upper Saddle River, NJ, 1998.

GOOSSENS M., RAHTZ S., MITTELBACH F., LaTeX graphics companion.

GOOSENS M., RAHTZ S., LateX Web Companion.

GORDON Mike J.C., MILNER Robin, MORRIS Lockwood, NEWEY Malcolm C., GRAHAM R., KNUTH D., and PATASHNIK O., Concrete Mathematics.

GRAHAM Ron L., KNUTH Donald E., PATASHNIK Oren, Concrete mathematics: a foundation for computer science, Addison Wesley, 1989.

HALTINER & WILLIAMS, Numerical Prediction and Dynamic Meteorology.

HARBISON Samuel P., Modula-3, Prentice Hall, 1992.

HEARN D. & BAKER M.P., Computer Graphics.

HENNESSY John H., PATTERSON David A., Computer Architecture, A Quantitative Approach, Morgan Kaufmann Publishers, Inc., 1990.

HOENIG A., UNBOUND TeX, LaTeX and TeX strategies for fonts, graphics and more.

JENSEN Kathleen, WIRTH Niklaus, PASCAL user manual and report : ISO PASCAL standard, Springer, 1991.

JOHNSON David, Handbook of Computer Science, vol A.

KAGAN, Ocean-Atmosphere Interaction.

KALDEWAIJ Anne, Programming: the derivation of algorithms, Prentice-Hall International, 1990.

KANE Gerry, Mips, RISC Architecture, MIPS Computer Systems, Inc., Prentice Hall, 1987.

KERNIGHAN and PIKE, The Unix Programming environment.

KERNIGHAN and PIKE, The Practice of programming.

KERNIGHAN Brian W., RITCHIE Dennis M., The C programming language, Prentice Hall, 1978.

KERNIGHAN Brian W., PIC--a language for typesetting graphics, Software Practice & Experience 12. 1982, 1-20.

KIEBURTZ Dick B., Structured Programming And Problem Solving With Algol W, Prentice Hall, 1975.

KING K.N., C Programming.

KLEENE Stephen C., Introduction to Metamathematics, North Holland, 6ème édition, 1971.

KNUTH Donald E., The TeXbook, Addison Wesley, 1984.

KNUTH Donald E., The Metafont book, Addison Wesley, 1986.

KNUTH Donald E., Fundamental Algorithms. The Art of Computer Programming, vol 1, Addison Wesley, 1968.

KNUTH Donald E., Seminumerical algorithms, The Art of Computer Programming, vol 2, Addison Wesley, 1969.

KNUTH Donald E., Sorting and Searching. The Art of Computer Programming, vol 3, Addison Wesley, 1973.

KOPRA H. and DALY P.W., A guide to LaTeX.

KOZEN D.C., The Design and Analysis of Algorithms.

LIPPMAN S.B., L'essentiel du C++, Addison-Wesley, 1992.

LAMPORT Leslie, LATEX, User's guide & Reference Manual, Addison Wesley, 1986.

LEEUWEN Jan van, Handbook of theoretical computer science, volumes A et B, MIT press, 1990.

LOTHAIRE M., Combinatorics on Words, Encyclopedia of Mathematics, Cambridge University Press, 1983.

LUENBERGER D. G., Linear and Nonlinear Programming, Addison-Wesley, 1984.

MANBER Udi, Introduction to Algorithms, A creative approach, Addison Wesley, 1989.

MILNER Robin, A proposal for Standard ML, In ACM Symposium on LISP and Functional Programming, pp 184-197, ACM Press, New York, 1984.

MILNER Robin, TOFTE Mads, HARPER Robert, The definiton of Standard ML, The MIT Press, 1990.

MORGAN C.C., Programming from specifications, Prentice-Hall International. (Out of print, but available on web).

NELSON Greg, Systems Programming with Modula-3, Prentice Hall, 1991.

PAPADIMITRIOU C.H., Computational Complexity.

PREPARATA & SHAMOS, Computational Geometry: An Introduction.

PRESS W., FLANNERY, TEUKOLSKY & VETTERLING, Numerical Recipes : The Art of Scientific Computing.

RANDELL Brian, RUSSEL L. J., Algol 60 Implementation, Academic Press, New York, 1964.

RAYMOND Eric, The New Hacker's Dictionary, dessins de Guy L. Steele Jr., MIT Press 1991.

RICHARDS Martin, The portability of the BCPL compiler, Software Practice and Experience 1:2, pp. 135-146, 1971.

RICHARDS Martin, WHITBY-STREVENS Colin, BCPL : The Language and its Compiler, Cambride University Press, 1979.

RITCHIE Denis M. et THOMPSON Ken, The UNIX Time-Sharing System, Communications of the ACM, 17, 7, Juillet 1974, pp 365--375 (aussi dans The Bell System Technical Journal, 57,6, Juillet-Aout 1978).

ROGERS Hartley, Theory of recursive functions and effective computability, MIT press, 1987, (édition originale McGraw-Hill, 1967).

ROLLETT J.S., Linear Programming for Paper A1, Computing Laboratory Notes, 1990, (revised 1992).

ROSEN Kenneth H., Discrete Mathematics and its Applications, Fourth Edition, McGraw-Hill, Inc., New York, 1999.

SAVAGE John E., Models of Computation.

SEDGEWICK R. and FLAJOLET P., An Introduction to the Analysis of Algorithms.

SIPSER Michael, Introduction to the Theory of Computation, PWS Publishing Co., Boston, 396 pp., 1997.

SAINTE-LAGUË A., Les réseaux (ou graphes), Mémoire des Sciences Mathématiques (18), 1926.

SEDGEWICK Bob, Algorithms, 2nd edition, Addison-Wesley, 1988.

SETHI Ravi, Programming Languages, Concepts and Constructs, Addison Wesley, 1989.

STROUSTRUP B., Le langage C++, Addison-Wesley, 1992.

TARJAN Robert E., Depth First Search and linear graph algorithms, Siam Journal of Computing, 1, pages 146-160, 1972.

TRUSTRUM K., Linear Programming, RKP, 1971 (out of print).

VAN LOAN, Introduction to Scientific Computing.

VELLEMAN Daniel J., How To Prove It: A Structured Approach, Cambridge University Press,Cambridge, England, 1994.

WADSWORTH Chris P., A metalanguage for interactive proof in LCF, In 5th ACM Symposium on Principles of Programming Languages, ACM Press, New York, 1978.

WEST D., Introduction to Graph Theory.