Exact asymptotics of divide-and-conquer recurrences

DOI10.1007/3-540-56939-1_68zbMath1418.68252OpenAlexW1535772777MaRDI QIDQ4630256

Mordecai J. Golin, Philippe Flajolet

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_68

zbMATH Keywords

Riemann zeta-functionDirichlet seriesperiodic functionexact asymptoticsanalytic number theory

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) (zeta (s)) and (L(s, chi)) (11M06) Recurrences (11B37)

Related Items (3)

Asymptotics of Mahler recurrences: The cyclotomic case ⋮ Maxima-finding algorithms for multidimensional samples: A two-phase approach ⋮ Mellin transforms and asymptotics: Harmonic sums

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dirichlet series related to the Riemann zeta function
• Finite automata in number theory
• Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
• Moment inequalities for random variables in computational geometry
• The ring of \(k\)-regular sequences
• Sur la fonction sommatoire de la fonction 'somme des chiffres'
• Mellin transforms and asymptotics: Digital sums
• Mellin transforms and asymptotics. The mergesort recurrence
• On the average number of maximal in a set of vectors
• Dirichlet Series and Curious infinite Products
• Power and Exponential Sums of Digital Sums Related to Binomial Coefficient Parity
• On the Average Number of Maxima in a Set of Vectors and Applications

This page was built for publication: Exact asymptotics of divide-and-conquer recurrences