We consider the following one- and two-dimensional bucketing problems: Given a set 5 of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size buckets so that the maximum number of points in a bucket is minimized. Suppose at most (n/b) + Δ points lie in each bucket in an optimal solution. We present algorithms whose time complexities depend on b and Δ No prior knowledge of Δ is necessary for our algorithms. For the one-dimensional problem, we give a deterministic algorithm that achieves a running time of O(b4(Δ2 + logn) + n). For the two-dimensional problem, we present a Monte Carlo algorithm that runs in subquadratic time for small values of b and Δ. The previous algorithms, by Asano and Tokuyama , searched the entire parameterized space and required Ω (n2) time in the worst case even for constant values of b and Δ. We also present a subquadratic algorithm for the special case of the two-dimensional problem when b = 2.