On some applications of formulae of Ramanujan in the analysis of algorithms

DOI10.1112/S0025579300006409zbMath0765.68051MaRDI QIDQ4005444

Prodinger, Helmut, Peter Kirschenhofer

Publication date: 27 September 1992

Published in: Mathematika (Search for Journal in Brave)

zbMATH Keywords

trietransformation formulae

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (16)

An elementary proof of Ramanujan's identity for odd zeta values ⋮ GENERALIZED LAMBERT SERIES, RAABE’S COSINE TRANSFORM AND A GENERALIZATION OF RAMANUJAN’S FORMULA FOR ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ On the variance of a class of inductive valuations of data structures for digital search ⋮ A note on binomial recurrences arising in the analysis of algorithms ⋮ D?E?K=(1000)8 ⋮ Dependence between path-length and size in random digital trees ⋮ Analytic analysis of algorithms ⋮ On The variance of the extremal path length in a symmetric digital trie ⋮ Generalized Lambert series and arithmetic nature of odd zeta values ⋮ The number of winners in a discrete geometrically distributed sample ⋮ Maximum likelihood analysis of algorithms and data structures ⋮ On squares of odd zeta values and analogues of Eisenstein series ⋮ Dirichlet series under standard convolutions: variations on Ramanujan's identity for odd zeta values ⋮ A result in order statistics related to probabilistic counting

Cites Work

• Unnamed Item
• Modular transformations and generalizations of several formulae of Ramanujan
• The number of registers required for evaluating arithmetic expressions
• Digital Search Trees Revisited
• A Note on Gray Code and Odd-Even Merge

This page was built for publication: On some applications of formulae of Ramanujan in the analysis of algorithms