Publication:2834337
From MaRDI portal
zbMath1491.68279MaRDI QIDQ2834337
Publication date: 28 November 2016
Full work available at URL: http://jirss.irstat.ir/browse.php?a_id=112&slc_lang=en&sid=1&ftxt=1
Mellin transformmodular functionsanalysis of algorithmsperiodic oscillationsDedekind's eta functiontriesapproximate countingresiduesgeometric random variables
Analysis of algorithms (68W40) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Protection number in plane trees, Approximate counting with \(m\) counters: a probabilistic analysis, Achieving perfect coordination amongst agents in the co-action minority game, Interview with Helmut Prodinger, Local limit theorems for finite and infinite urn models, Enumerating lambda terms by weighted length of their de Bruijn representation, Approximate counting with \(m\) counters: A detailed analysis, An analytic approach to the asymptotic variance of trie statistics and related structures, The asymmetric leader election algorithm: another approach, On gaps and unoccupied urns in sequences of geometrically distributed random variables, The largest missing value in a composition of an integer, The oscillatory distribution of distances in random tries, Imbalance in random digital trees, A binomial splitting process in connection with corner parking problems
