Periodic oscillations in the analysis of algorithms and their cancellations
zbMATH Open1491.68279MaRDI QIDQ2834337FDOQ2834337
Authors: Helmut Prodinger 
Publication date: 28 November 2016
Published in: Journal of the Iranian Statistical Society JIRSS (Search for Journal in Brave)
Full work available at URL: http://jirss.irstat.ir/browse.php?a_id=112&slc_lang=en&sid=1&ftxt=1
Recommendations
Mellin transformanalysis of algorithmsapproximate countingDedekind's eta functionmodular functionsperiodic oscillationsresiduesgeometric random variablestries
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms (68W40)
Cited In (16)
- The largest missing value in a composition of an integer
- The oscillatory distribution of distances in random tries
- A binomial splitting process in connection with corner parking problems
- Approximate counting with \(m\) counters: a probabilistic analysis
- The asymmetric leader election algorithm: another approach
- Approximate counting with \(m\) counters: A detailed analysis
- Achieving perfect coordination amongst agents in the co-action minority game
- Distributional asymptotics in the analysis of algorithms: periodicities and discretization
- On gaps and unoccupied urns in sequences of geometrically distributed random variables
- Local limit theorems for finite and infinite urn models
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Imbalance in random digital trees
- Interview with Helmut Prodinger
- Enumerating lambda terms by weighted length of their de Bruijn representation
- Etude des interruptions dans l'algorithme de Jacobi–Perron
- Protection number in plane trees
This page was built for publication: Periodic oscillations in the analysis of algorithms and their cancellations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2834337)
