An improved master theorem for divide-and-conquer recurrences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1256, Issue , 1997, Pages 449-459

  Roura, Salvador ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; STOCHASTIC SYSTEMS;

DIVIDE AND CONQUER; RECURSIVE DEFINITIONS; WEIGHT DISTRIBUTIONS;

ROBOTS;

EID: 84951189828     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63165-8_201     Document Type: Conference Paper

References (8)

1. T.H. Cormen, O.E. Leiserson, and R.L. Rivest. Introduction to Algorithms. The MIT Press, Cambridge, MA, 1990.
2. Philippe Flajolet, Gaston Gönnet, Claude Puech, and J.M. Robson. Analytic variations on quadtrees. Algorithmica, 10:473-500, 1993.
3. C. A. R. Hoare. Find (Algorithm 65). Communications of the ACM, 4:321-322, 1961.
4. C. A. R. Hoare. Quicksort. Computer Journal, 5:10-15, 1962.
5. Robert Sedgewick and Philippe Flajolet. An Introduction to the Analysis of Algorithms. Addison-Wesley, 1996.
6. M.H. van Emden. Increasing the efficiency of quicksort. Communications of the ACM, 13:563-567, 1970.
7. Rakesh M. Verma. A general method and a master theorem for divide-and-conquer recurrences with applications. Journal of Algorithms, 16:67-79, 1994.
8. Rakesh M. Verma. General techniques for analyzing recursive algorithms with applications. SIAM Journal on Computing, 26(2):568-581, 1997.