We give an algorithm that can be used to sample from any discrete log-
concave distribution (e.g. the binomial and hypergeometric distributio
ns). It is based on rejection from a discrete dominating distribution
that consists of parts of the geometric distribution. The algorithm is
uniformly fast for all discrete log-concave distributions and not muc
h slower than algorithms designed for a single distribution.