The following pages link to (Q3489457):
Displaying 15 items.
- Approximate counting with \(m\) counters: a probabilistic analysis (Q307930) (← links)
- The number of distinct values in a geometrically distributed sample (Q852697) (← links)
- An analysis of Monte Carlo algorithms for counting problems (Q1083200) (← links)
- Hypothetical analyses: Approximate counting in the style of Knuth, path length in the style of Flajolet (Q1193635) (← links)
- Philippe Flajolet's research in analysis of algorithms and combinatorics (Q1277370) (← links)
- A result in order statistics related to probabilistic counting (Q1308501) (← links)
- Combinatorics of geometrically distributed random variables: Run statistics (Q1401302) (← links)
- Gap-free compositions and gap-free samples of geometric random variables (Q1781973) (← links)
- Combinatorics of geometrically distributed random variables: Left-to-right maxima (Q1917529) (← links)
- Descents following maximal values in samples of geometric random variables (Q2343660) (← links)
- Periodic oscillations in the analysis of algorithms and their cancellations (Q2834337) (← links)
- Approximate counting via the Poisson-Laplace-Mellin method (Q2920841) (← links)
- Probabilistic analysis of adaptative sampling (Q3122911) (← links)
- Analysis of a splitting process arising in probabilistic counting and other related algorithms (Q3123119) (← links)
- How to count quickly and accurately: A unified analysis of probabilistic counting and other related problems (Q5204318) (← links)