Referencias

1

A.V. Aho, J.E. Hopcroft, and J.D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Ma., 1974.

2

G. Dahlquist and Åke Björck. Numerical Methods. Prentice Hall, Englewood Cliffs, N.J., 1974.

3

L. Devroye. Non-uniform random variate generation. Springer-Verlag, 1986.

4

G.S. Fishman. Conceptos y métodos en la simulación digital de eventos discretos. Limusa, México, 1978.

5

J.H. Grafe. Matemáticas Universitarias. MacGraw-Hill, Madrid, 1985.

6

B.W. Kernighan and D.M. Ritchie. The C Programming Language (ANSI C). Prentice Hall, Englewood Cliffs, second edition, 1978.

7

D.E. Knuth. Seminumerical algorithms. In The Art of Computer Programming, volume 2. Addison-Wesley, Reading, Ma., 1969.

8

D.E. Knuth. Sorting and searching. In The Art of Computer Programming, volume 3. Addison-Wesley, Reading, Ma., 1973.

9

L. Kronsjö. Algorithms: Their Complexity and Efficiency. Wiley, Chichester, 1986.

10

S. Madnick. Understanding the computer (Little Man Computer), MIT course 15.564, notas mimeografiadas, 1980.

11

R.A. Thisted. Elements of Statistical Computing. Chapman & Hall, New York, 1988.