I'm no longer at Simon Fraser University. Please see my other home page for further information on how to reach me.
Please send me mail if you have problems picking up the files below. As a rule of thumb, these materials are available in (uncompressed) PDF format, and in compressed (gzipped) postscript format. In some cases the PDF files have clickable links.
My Ph.D. thesis: Analytic Computation of the Prime-Counting Function
From a lecture for the SFU Number Theory Study Group, a survey talk on Computations related to the Riemann Hypothesis.
Expanding on some lectures given for the SFU Number Theory Study Group. Notes on Donald Newman's ``First Proof'' of the Prime Number Theorem.
For a talk at the 2001 AMS/MAA Joint Meetings, New Orleans. The Density of Pseudoprimes with Two Prime Factors
Presented several times--this version was given at the REU Number Theory Seminar, University of Illinois at Urbana-Champaign, July 17, 2001. Memory-efficient sieving, Dirichlet's divisor problem, and related problems:
From a talk for the special session on Dynamical, Spectral, and Arithmetic Zeta-Functions at the January 1999 AMS Joint Mathematics Meeting, San Antonio TX -- on Fast Computation of the Riemann Zeta Function to Arbitrary Accuracy (slightly revised and expanded):
From a talk at the 1998 Algorithmic Number Theory Symposium III on Robert Bennion's Hopping Sieve:
You can also get source files for programs.From a talk at the 1998 meeting of the Illinois Number Theory Association, giving a survey of my thesis research on Implementing the Lagarias-Odlyzko Analytic Algorithm for $\pi(x)$:
From a talk at the 5th conference of the Canadian Number Theory Association, on An Asymptotic Expansion of Ramanujan:
You can also get a preprint of the full paper that will appear in the conference proceedings.Go back to the CECM home page.