Back to Results
First PageMeta Content
Recurrence relations / Number theory / Analytic number theory / Analysis of algorithms / Master theorem / Riemann hypothesis / Dirichlet series / Wiener–Ikehara theorem / Generating function / Mathematics / Mathematical analysis / Asymptotic analysis


A Master Theorem for Discrete Divide and Conquer Recurrences∗ Michael Drmota† Abstract Wojciech Szpankowski‡ 1
Add to Reading List

Document Date: 2010-10-21 08:10:15

Open Document

File Size: 349,42 KB

Share Result on Facebook

City

Wien / /

Country

Austria / United States / /

/

Facility

Purdue University / /

IndustryTerm

final solution / data compression algorithm / asymptotic solutions / main analytic tools / precise asymptotic solutions / variable-to-fixed compression algorithm / precise solution / arithmetic coding algorithm / real solution / asymptotic solution / data compression algorithms / non-zero integer solution / /

Movie

Divide and Conquer / /

Organization

National Science Foundation / Department of Computer Science / Purdue University / /

Person

Michael Drmota† Abstract Wojciech / /

Position

recurrence Pm / log pm / Prime Minister / /

ProgrammingLanguage

C / /

ProvinceOrState

Indiana / /

SportsEvent

Formula One / /

Technology

data compression algorithm / Karatsuba algorithm / Tunstall algorithm / data compression algorithms / Boncelet algorithm / arithmetic coding algorithm / variable-to-fixed compression algorithm / /

SocialTag