Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Flajolet, Philippe
1992.
Automata, Languages and Programming.
Vol. 623,
Issue. ,
p.
186.
Flajolet, Philippe
and
Richmond, Bruce
1992.
Generalized Digital Trees and Their Difference—Differential Equations.
Random Structures & Algorithms,
Vol. 3,
Issue. 3,
p.
305.
Kirschenhofer, P.
and
Prodinger, H.
1993.
A result in order statistics related to probabilistic counting.
Computing,
Vol. 51,
Issue. 1,
p.
15.
Prodinger, Helmut
and
Szpankowski, Wojciech
1993.
A note on binomial recurrences arising in the analysis of algorithms.
Information Processing Letters,
Vol. 46,
Issue. 6,
p.
309.
Kirschenhofer, Peter
Prodinger, Helmut
and
Szpankowski, Wojciech
1994.
Digital Search Trees Again Revisited: The Internal Path Length Perspective.
SIAM Journal on Computing,
Vol. 23,
Issue. 3,
p.
598.
Schachinger, Werner
1995.
On the variance of a class of inductive valuations of data structures for digital search.
Theoretical Computer Science,
Vol. 144,
Issue. 1-2,
p.
251.
Flajolet, Philippe
Gourdon, Xavier
and
Dumas, Philippe
1995.
Mellin transforms and asymptotics: Harmonic sums.
Theoretical Computer Science,
Vol. 144,
Issue. 1-2,
p.
3.
Kirschenhofer, Peter
and
Prodinger, Helmut
1996.
The number of winners in a discrete geometrically distributed sample.
The Annals of Applied Probability,
Vol. 6,
Issue. 2,
Flajolet, Philippe
2001.
D⋅E⋅K=(1000)8.
Random Structures & Algorithms,
Vol. 19,
Issue. 3-4,
p.
150.
Clément, J.
Flajolet, P.
and
Vallée, B.
2001.
Dynamical sources in information theory: A general analysis of trie structures.
Algorithmica,
Vol. 29,
Issue. 1-2,
p.
307.
2001.
Average Case Analysis of Algorithms on Sequences.
p.
520.
Flajolet, Philippe
2006.
STACS 2006.
Vol. 3884,
Issue. ,
p.
1.
Park, Gahyun
Hwang, Hsien-Kuei
Nicodème, Pierre
and
Szpankowski, Wojciech
2009.
Profiles of Tries.
SIAM Journal on Computing,
Vol. 38,
Issue. 5,
p.
1821.
Laube, Ulrich
and
Nebel, Markus E.
2010.
Maximum likelihood analysis of algorithms and data structures.
Theoretical Computer Science,
Vol. 411,
Issue. 1,
p.
188.
Fuchs, Michael
Hwang, Hsien-Kuei
and
Zacharovas, Vytas
2014.
An analytic approach to the asymptotic variance of trie statistics and related structures.
Theoretical Computer Science,
Vol. 527,
Issue. ,
p.
1.
Fuchs, Michael
and
Hwang, Hsien-Kuei
2017.
Dependence between path-length and size in random digital trees.
Journal of Applied Probability,
Vol. 54,
Issue. 4,
p.
1125.
Dixit, Atul
and
Gupta, Rajat
2019.
On squares of odd zeta values and analogues of Eisenstein series.
Advances in Applied Mathematics,
Vol. 110,
Issue. ,
p.
86.
Dixit, Atul
and
Maji, Bibekananda
2020.
Generalized Lambert series and arithmetic nature of odd zeta values.
Proceedings of the Royal Society of Edinburgh: Section A Mathematics,
Vol. 150,
Issue. 2,
p.
741.
DIXIT, ATUL
GUPTA, RAJAT
KUMAR, RAHUL
and
MAJI, BIBEKANANDA
2020.
GENERALIZED LAMBERT SERIES, RAABE’S COSINE TRANSFORM AND A GENERALIZATION OF RAMANUJAN’S FORMULA FOR.
Nagoya Mathematical Journal,
Vol. 239,
Issue. ,
p.
232.
Chavan, Parth
Chavan, Sarth
Vignat, Christophe
and
Wakhare, Tanay
2022.
Dirichlet series under standard convolutions: variations on Ramanujan’s identity for odd zeta values.
The Ramanujan Journal,
Vol. 59,
Issue. 4,
p.
1245.