Periodic oscillations in the analysis of algorithms and their cancellations
From MaRDI portal
Publication:2834337
Recommendations
Cited in
(16)- Imbalance in random digital trees
- The oscillatory distribution of distances in random tries
- Local limit theorems for finite and infinite urn models
- A binomial splitting process in connection with corner parking problems
- Achieving perfect coordination amongst agents in the co-action minority game
- Etude des interruptions dans l'algorithme de Jacobi–Perron
- Approximate counting with \(m\) counters: a probabilistic analysis
- Approximate counting with \(m\) counters: A detailed analysis
- On gaps and unoccupied urns in sequences of geometrically distributed random variables
- Distributional asymptotics in the analysis of algorithms: periodicities and discretization
- The asymmetric leader election algorithm: another approach
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Protection number in plane trees
- The largest missing value in a composition of an integer
- Interview with Helmut Prodinger
- Enumerating lambda terms by weighted length of their de Bruijn representation
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)