Average Case Analysis of Algorithms on Sequences

548 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Testing Properties of Collections of Distributions (2013, methodology): “To this end we define a slightly different process for generating the samples that involves Poissonization [Szp01].”
Analytic Combinatorics (2009, methodology): “Applications are to be found in classical probability theory and statistics [139] (the so-called Bernoul li trial models), as well as in computer science [564] and mathematical models of biology [ 603].”
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem (2007, unknown): “The proofs use a technique called Poissonization [15], in which one modifies a probability experiment to replace a fixed quantity (e.”
Convergence properties of functional estimates for discrete distributions (2001, unknown): “, [20, 16], or [24].”
Extremal Properties of Random Structures (2003, unknown): “Random graphs are fundamental in theoretical computer science [9,14,10,15].”
HyperLogLog: the analysis of a near-optimal cardinality estimation algorithm (2007, unknown): “We then find K(x) = x2 (∫ ∞ 0 uf(u)m du + ǫ′m(x) + o(1) ) , (25) where ǫ′(x) is a small oscillating function, implying VP(λ)(Z) = λ 2 (∫ ∞ 0 uf(u)m du − (∫ ∞ 0 f(u)m du )2 + ǫ′′(λ) + o(1) ) (26) (with ǫ′′ small), which constitutes the analogue of Proposition 2.”