Articles

PDF

A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM, Information Processing Letters (2010)
 

PDF

Computing Prime Harmonic Sums (with Eric Bach and Dominic Klyve), Mathematics of Computation (2009)

We discuss a method for computing Σ 𝑝≤𝑥 1/𝑝, using time about 𝑥2/3 and space...

 

PDF

Modular exponentiation via the explicit Chinese remainder theorem (with Daniel J. Bernstein), Mathematics of Computaion (2007)

In this paper we consider the problem of computing xe mod m for large integers...

 

PDF

EPICS: A Service Learning Program at Butler University (with Panos K. Linos), Proceedings of the Frontiers of Education Conference (2005)

In this paper we present our experiences teaching EPICS (Engineering Projects In Community Service) at...

 

PDF

Genetic Algorithms for the Extended GCD Problem, Journal of Symbolic Computation (1997)

We present several genetic algorithms for solving the extended greatest common divisor problem. After de...

 

Contributions to Books

PDF

Fast Bounds on the Distribution of Smooth Numbers (with Scott T. Parsell), Proceedings of the 7th International Symposium on Algorithmic Number Theory (2006)

In this paper we present improvements to Bernstein’s algorithm, which finds rigorous upper and lower...

 

PDF

The Pseudosquares Prime Sieve, Proceedings of the 7th International Symposium on Algorithmic Number Theory (2006)

We present the pseudosquares prime sieve, which finds all primes up to n.