316
[GON91] [GRI80] [GRI81] [GUE96] [HAR87] [HOR78] [JEN91] [JOY85] [KIN90] [KIN91] [KNU85] [KNU87] [MAN89] [MEH84] [MER85] [OLI93] [PAR95] [PEA84] [PEÑ97] [PIP78] [SED78] [SED88] [SED93]
TÉCNICAS DE DISEÑO DE ALGORITMOS
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. Técnicas de Diseño Greedy en la Exploración de Grafos. Informe Técnico LCC-ITD 96/1. Dpto. Lenguajes y Ciencias de la Computación, Universidad de Málaga, 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 Seafarer’s 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. Clasificación y Búsqueda.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, 96–99, 1985. I. Oliver. Programming Classics. Implementing the World’s 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. Peña. Diseño de Programas. Formalismo y Abstracción. Segunda Edición. Prentice Hall, 1997. N. Pippenger. Complexity theory. Scientific American, Vol. 238, nº 6, 14–124, 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.