Home > Articles > Programming > Algorithms

  • Print
  • + Share This
This chapter is from the book


  1. M. ABRAMOWITZ AND I. STEGUN. Handbook of Mathematical Functions, Dover, New York, 1972.
  2. A. AHO, J. E. HOPCROFT, AND J. D. ULLMAN. The Design and Analysis of Algorithms, Addison-Wesley, Reading, MA, 1975.
  3. B. CHAR, K. GEDDES, G. GONNET, B. LEONG, M. MONAGAN, AND S. WATT. Maple VLibrary Reference Manual, Springer-Verlag, New York, 1991. Also Maple User Manual, Maplesoft, Waterloo, Ontario, 2012.
  4. J. CLÉMENT, J. A. FILL, P. FLAJOLET, AND B. VALÉE. “The number of symbol comparisons in quicksort and quickselect,” 36th International Colloquium on Automata, Languages, and Programming, 2009, 750-763.
  5. L. COMTET. Advanced Combinatorics, Reidel, Dordrecht, 1974.
  6. T. H. CORMEN, C. E. LEISERSON, R. L. RIVEST, AND C. STEIN. Introduction to Algorithms, MIT Press, New York, 3rd edition, 2009.
  7. S. DASGUPTA, C. PAPADIMITRIOU, AND U. VAZIRANI. Algorithms, McGraw-Hill, New York, 2008.
  8. M. DRMOTA. Random Trees: An Interplay Between Combinatorics and Probability, Springer Wein, New York, 2009.
  9. W. FELLER. An Introduction to Probability Theory and Its Applications, John Wiley, New York, 1957.
  10. P. FLAJOLET AND R. SEDGEWICK. Analytic Combinatorics, Cambridge University Press, 2009.
  11. G. H. GONNET AND R. BAEZA-YATES. Handbook of Algorithms and Data Structures in Pascal and C, 2nd edition, Addison-Wesley, Reading, MA, 1991.
  12. R. L. GRAHAM, D. E. KNUTH, AND O. PATASHNIK. Concrete Mathematics, 1st edition, Addison-Wesley, Reading, MA, 1989. Second edition, 1994.
  13. D. H. GREENE AND D. E. KNUTH. Mathematics for the Analysis of Algorithms, Birkhäuser, Boston, 3rd edition, 1991.
  14. P. HENRICI. Applied and Computational Complex Analysis, 3 volumes, John Wiley, New York, 1974 (volume 1), 1977 (volume 2), 1986 (volume 3).
  15. C. A. R. HOARE. “Quicksort,” Computer Journal 5, 1962, 10-15.
  16. J. KLEINBERG AND E. TARDOS. Algorithm Design, Addison-Wesley, Boston, 2005.
  17. D. E. KNUTH. The Art of Computer Programming. Volume 1: FundamentalAlgorithms, 1st edition, Addison-Wesley, Reading, MA, 1968. Third edition, 1997.
  18. D. E. KNUTH. The Art of Computer Programming. Volume 2: Seminumerical Algorithms, 1st edition, Addison-Wesley, Reading, MA, 1969. Third edition, 1997.
  19. D. E. KNUTH. The Art of Computer Programming. Volume 3: Sorting and Searching, 1st edition, Addison-Wesley, Reading, MA, 1973. Second edition, 1998.
  20. D. E. KNUTH. The Art of Computer Programming. Volume 4A: Combinatorial Algorithms, Part 1, Addison-Wesley, Boston, 2011.
  21. D. E. KNUTH. “Big omicron and big omega and big theta,” SIGACT News, April-June 1976, 18-24.
  22. D. E. KNUTH. “Mathematical analysis of algorithms,” Information Processing 71, Proceedings of the IFIP Congress, Ljubljana, 1971, 19-27.
  23. R. MOTWANI AND P. RAGHAVAN. Randomized Algorithms, Cambridge University Press, 1995.
  24. F. W. J. OLVER, D. W. LOZIER, R. F. BOISVERT, AND C. W. CLARK, ED., NIST Handbook of Mathematical Functions, Cambridge University Press, 2010. Also accessible as Digital Library of Mathematical Functions http://dlmf.nist.gov.
  25. M. O. RABIN. “Probabilistic algorithms,” in Algorithms and Complexity, J. F. Traub, ed., Academic Press, New York, 1976, 21-39.
  26. R. SEDGEWICK. Algorithms (3rd edition) in Java: Parts 1-4: Fundamentals, Data Structures, Sorting, and Searching, Addison-Wesley, Boston, 2003.
  27. R. SEDGEWICK. Quicksort, Garland Publishing, New York, 1980.
  28. R. SEDGEWICK. “Quicksort with equal keys,” SLAM Journal on Computing 6, 1977, 240-267.
  29. R. SEDGEWICK. “Implementing quicksort programs,” Communications of the ACM 21, 1978, 847-856.
  30. R. SEDGEWICK AND K. WAYNE. Algorithms, 4th edition, Addison-Wesley, Boston, 2011.
  31. N. SLOANE AND S. PLOUFFE. The Encyclopedia of Integer Sequences, Academic Press, San Diego, 1995. Also accessible as On-Line Encyclopedia of Integer Sequences, http://oeis.org.
  32. W. SZPANKOWSKI. Average-Case Analysis of Algorithms on Sequences, John Wiley and Sons, New York, 2001.
  33. E. TUFTE. The Visual Display of Quantitative Information, Graphics Press, Chesire, CT, 1987.
  34. J. S. VITTER AND P. FLAJOLET, “Analysis of algorithms and data structures,” in Handbook of Theoretical Computer Science A: Algorithms and Complexity,]. van Leeuwen, ed., Elsevier, Amsterdam, 1990, 431-524.
  35. E. W. WEISSTEIN, ED., MathWorld, mathworld.wolfram.com.
  • + Share This
  • 🔖 Save To Your Account