Showing papers by "Edward M. Reingold published in 2004"
TL;DR: Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization.
Abstract: Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, explicate the pattern, and discuss the connection of the leap year/line pattern with integer division and Euclid's algorithm for computing the greatest common divisor.
26 citations
TL;DR: In this article, a probabilistic analysis of the output of Quicksort when comparisons can err is presented, showing that comparisons can be easily corrupted by comparison errors, which is not the case here.
Abstract: We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
10 citations
TL;DR: The chip problem is closely related to a modified majority problem in the worst case and this fact is used to obtain upper and lower bounds on algorithms for the chip problem.
8 citations