BIBLIOGRAFA Y REFERENCIAS

[ABE90]

M. Abellanas y D. Lodares. Anlisis de Algoritmos y Teora de Grafos. RA-MA, 1990. [AHO74] A. Aho, J. Hopcrof y J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. [AHO88] A. Aho, J. Hopcrof y J. Ullman. Estructuras de Datos y Algoritmos. Addison-Wesley, 1988. [AZM90] M. Azmoodeh. Abstract Data Types and Algorithms. Second Edition. MacMillan, 1990. [BAA88] S. Baase. Computer Algorithms: Introduction to Design and Analysis. Addison-Wesley, 1988. [BAR91] C. Barry. TopSpeed Modula-2. Addison-Wesley, 1991. [BEL68] M. Bellmore y G. Nemhauser. The Travelling Salesman Problem: a Survey. Operation Research, Vol. 16, n3, 538558, 1968. [BEN80a] J.L. Bentley. Multidimensional Divide and Conquer. Comms. of the ACM, Vol. 23, n4, 214229,1980. [BEN80b] J.L. Bentley. A General Method for Solving Divide and Conquer Recurrences. SIGACT News ACM, Vol. 12, n3, 3644, 1980. [BEN84] J.L. Bentley. Programming Pearls: Algorithm Design Techniques. Comms. of the ACM, Vol. 27, n9, 865871, 1984. [BEN89] J.L. Bentley. Programming Pearls. Addison-Wesley, 1989. [BIR77] R.S. Bird. Notes on Recursion Elimination. Comms. of the ACM, Vol. 20, n 6, 434439, 1977. [BRA97] G. Brassard y P. Bratley. Fundamentos de Algoritmia. Prentice Hall, 1997. [CHA76] L. Chang y J. Korsh. Canonical Coin Changing and Greedy Solutions. Journal of the ACM, Vol. 23, n 3, 418422, 1976. [COR89] T.H. Cormen, C.E. Leiserson y R.L. Rivest. Introduction to Algorithms. MIT Press, 1989. [FOR85] G. Ford y R. Wienes. Modula-2, A Software Development Approach. John Wiley & Sons, NewYork, 1985. [GAL93] J. Glve, J.C. Gonzlez, A. Snchez y J.A. Velzquez. Algortmica: Diseo y Anlisis de Algoritmos Funcionales e Imperativos. RA-MA, 1993. [GAR79] M.R. Garey y D. Johnson. Computers and Intractability. W.H. Freeman and Company, New York, 1979.

316

TCNICAS DE DISEO DE ALGORITMOS

[GON91] [GRI80] [GRI81] [GUE96] [HAR87] [HOR78] [JEN91] [JOY85] [KIN90] [KIN91] [KNU85] [KNU87] [MAN89] [MEH84] [MER85] [OLI93] [PAR95] [PEA84] [PE97] [PIP78] [SED78] [SED88] [SED93]

G.H. Gonnet y R. Baeza-Yates. Handbook of Algorithms and Data Structures. Second Edition. Addison-Wesley, 1991. D. Gries. A Note on the Standard Strategy for Developing Loop Invariants and Loops. Science of Computer Programming, n 2, 207 214, 1980. D. Gries. The Science of Programming. Springer-Verlag, 1981. R. Guerequeta. Tcnicas de Diseo Greedy en la Exploracin de Grafos. Informe Tcnico LCC-ITD 96/1. Dpto. Lenguajes y Ciencias de la Computacin, Universidad de Mlaga, 1996. D. Harey. Algorithmics. The Spirit of Computing. Addison-Wesley, 1987. E. Horowitz y S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, 1978. Jensen & Partners International. TopSpeed Modula-2 Language and Library Reference. Jensen & Partners International, 1991. E.J. Joyce. Modula-2 A Seafarers Manual and Shipyard Guide. Addison-Wesley, 1985. J.H. Kingston. Algorithms and Data Structures. Desing, Correctnes, Analysis. Addison-Wesley, 1990. K.N. King. TopSpeed Modula-2. Language Tutorial. Jensen & Partners International, 1991. D.E. Knuth. El Arte de Programar Ordenadores. Algoritmos Fundamentales.Vol 1. Revert, 1985. D.E. Knuth. El Arte de Programar Ordenadores. Clasificacin y Bsqueda.Vol 3. Revert, 1987. U. Manber. Introduction to Algorithms. Addison-Wesley, 1989. K. Melhorn. Data Structures and Algorithms: Vol I : Sorting and Searching. Vol II : Graph Algorithms and NP-Completeness. Springer Verlag, 1984. S. Merritt. An Inverted Taxonomy of Sorting Algorithms. Comms. of the ACM, Vol. 28, n 1, 9699, 1985. I. Oliver. Programming Classics. Implementing the Worlds Best Algorithms. Prentice Hall, 1993. I. Parberry. Problems on Algorithms. Prentice Hall, 1995. J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Adisson-Wesley, 1984. R. Pea. Diseo de Programas. Formalismo y Abstraccin. Segunda Edicin. Prentice Hall, 1997. N. Pippenger. Complexity theory. Scientific American, Vol. 238, n 6, 14124, 1978. R. Sedgewick. Implementing Quicksort Programs. Comms. of the ACM, Vol.21, n 10, 1978. R. Sedgewick. Algorithms. Second edition. Addison-Wesley, 1988. R. Sedgewick. Algorithms in MODULA-3. Addison-Wesley, 1993.

BIBLIOGRAFA Y REFERENCIAS

317

[SED97]

R. Sedgewick y P. Flajolet. An Introduction to Analysis of Algorithms. Addison-Wesley, 1997. [TAR87] R.E. Tarjan. Algorithm Design. Comms. of the ACM, Vol.30, n 3, 205212, 1987. [TOR92a] C. Torres. Diseo y Anlisis de Algoritmos. Paraninfo, 1992. [TOR92b] C. Torres. Algoritmos. Problemas Resueltos y Comentados. Paraninfo, 1992. [TRA95] K. Traunmller. The Checkers Problem. A Solution with Linear Time Complexity. ACM SIGPLAN Notices, Vol.30, n. 9, 2532, 1995. [TUC88] A.B. Tucker. Computer Science. A Second Course Using Modula-2. McGraw-Hill, 1988. [WEI92] M.A. Weiss. Data Structures and Algorithm Analysis. The Benjamin/Cummings Publishing Company Inc., 1992. [WEI95] M.A. Weiss. Estructuras de Datos y Algoritmos. Addison-Wesley, 1995. [WEI96] M.A. Weiss. Data Structures and Algorihm Analysis in C. AddisonWesley, 1996. [WIR82] N. Wirth. Programming in Modula-2. Fourth edition. Springer Verlag, 1982. [WIR87] N. Wirth. Algoritmos y Estructuras de Datos. Prentice Hall, 1987.