Pages that link to "Item:Q1057061"
From MaRDI portal
The following pages link to Approximate counting: a detailed analysis (Q1057061):
Displaying 43 items.
- Approximate counting with \(m\) counters: a probabilistic analysis (Q307930) (← links)
- Accurate and precise aggregation counting (Q414868) (← links)
- Approximate counting with \(m\) counters: A detailed analysis (Q441872) (← links)
- Mellin transforms and asymptotics: Harmonic sums (Q672981) (← links)
- Rounding of continuous random variables and oscillatory asymptotics (Q858983) (← links)
- Discrete \(q\)-distributions on Bernoulli trials with a geometrically varying success probability (Q974477) (← links)
- Probabilistic counting algorithms for data base applications (Q1069325) (← links)
- An improved algorithm for transitive closure on acyclic digraphs (Q1110330) (← links)
- On counting and approximation (Q1114675) (← links)
- A flexible way of counting large numbers approximately in small registers (Q1175630) (← links)
- Hypothetical analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet (Q1193635) (← links)
- The space complexity of approximating the frequency moments (Q1305928) (← links)
- \(q\)-distributions and Markov processes (Q1363655) (← links)
- Ascending runs of sequences of geometrically distributed random variables: A probabilistic analysis (Q1401391) (← links)
- Non-central generalized \(q\)-factorial coefficients and \(q\)-Stirling numbers (Q1420586) (← links)
- Runs of geometrically distributed random variables: A probabilistic analysis (Q1612301) (← links)
- Consecutive records in geometrically distributed words (Q1945310) (← links)
- The \(m\)-version of binary search trees: an average case analysis (Q1952717) (← links)
- Learned sketches for frequency estimation (Q1999028) (← links)
- Applying approximate counting for computing the frequency moments of long data streams (Q2272207) (← links)
- An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
- Renewals for exponentially increasing lifetimes, with an application to digital search trees (Q2455061) (← links)
- Generalized approximate counting revisited (Q2474230) (← links)
- Moments of a class of discrete \(q\)-distributions (Q2568421) (← links)
- Monotone runs of uniformly distributed integer random variables: A probabilistic analysis (Q2581352) (← links)
- Distinctness of compositions of an integer: A probabilistic analysis (Q2772926) (← links)
- The Big Match in Small Space (Q2819448) (← links)
- Approximate counting via the Poisson-Laplace-Mellin method (Q2920841) (← links)
- Fragments of approximate counting (Q2921008) (← links)
- Approximate counting : an alternative approach (Q3358234) (← links)
- On Space and Time Complexity of Loosely-Stabilizing Leader Election (Q3460723) (← links)
- Exact and asymptotic distributions in digital and binary search trees (Q3785960) (← links)
- (Q4034179) (← links)
- (Q4327100) (← links)
- A bit-counting algorithm using the frequency division principle (Q4791045) (← links)
- (Q5009587) (← links)
- Counting to Ten with Two Fingers: Compressed Counting with Spiking Neurons. (Q5075802) (← links)
- Advancing in the presence of a demon (Q5387003) (← links)
- Counting as integration in feasible analysis (Q5485404) (← links)
- Towards Optimal Moment Estimation in Streaming and Distributed Models (Q5875483) (← links)
- Philippe Flajolet's early work in combinatorics (Q6097991) (← links)
- Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space (Q6140352) (← links)
- Intermediate value linearizability: a quantitative correctness criterion (Q6534999) (← links)