An improved master theorem for divide-and-conquer recurrences (1997)
Cached
Download Links
- [www.lsi.upc.edu]
- [www-lsi.upc.es]
- [www-lsi.upc.es]
- [www.lsi.upc.es]
- [www.lsi.upc.es]
- DBLP
Other Repositories/Bibliography
by
Salvador Roura
| Venue: | In Automata, languages and programming |
| Citations: | 11 - 2 self |
BibTeX
@INPROCEEDINGS{Roura97animproved,
author = {Salvador Roura},
title = {An improved master theorem for divide-and-conquer recurrences},
booktitle = {In Automata, languages and programming},
year = {1997},
pages = {449--459},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This paper presents new theorems to analyze divide-and-conquer recurrences, which improve other similar ones in several aspects. In particular, these theorems provide more information, free us almost completely from technicalities like floors and ceilings, and cover a wider set of toll functions and weight distributions, stochastic recurrences included.
