Jonathan P. Sorenson

Inf. Process. Lett., 2025

2022

An Algorithm for Ennola's Second Theorem and Counting Smooth Numbers in Practice.

[BibT_eX]

[DOI]

Chloe Makdad

CoRR, 2022

An Algorithm to Find Sums of Consecutive Powers of Primes.

[BibT_eX]

[DOI]

Cathal O'Sullivan

Aryn Stahl

CoRR, 2022

2020

Two algorithms to find primes in patterns.

[BibT_eX]

[DOI]

Jonathan E. Webster

Math. Comput., 2020

2019

An Algorithm and Estimates for the Erdős-Selfridge Function (work in progress).

[BibT_eX]

[DOI]

Brianna Sorenson

Jonathan E. Webster

CoRR, 2019

2017

Strong pseudoprimes to twelve prime bases.

[BibT_eX]

[DOI]

Jonathan E. Webster

Math. Comput., 2017

2016

Near-optimal online multiselection in internal and external memory.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2016

2015

Two compact incremental prime sieves.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2015

Dynamic Online Multiselection in Internal and External Memory.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2013

Approximately counting semismooth integers.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Theory and Implementation of Online Multiselection Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2013, 2013

2012

Competitive Online Selection in Main and External Memory

[BibT_eX]

[DOI]

CoRR, 2012

2010

A randomized sublinear time parallel GCD algorithm for the EREW PRAM.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

2009

Computing prime harmonic sums.

[BibT_eX]

[DOI]

Dominic Klyve

Math. Comput., 2009

Online Sorting via Searching and Selection

[BibT_eX]

[DOI]

Ankur Gupta

Anna Kispert

CoRR, 2009

A Sublinear Time Parallel GCD Algorithm for the EREW PRAM

[BibT_eX]

[DOI]

CoRR, 2009

2007

Modular exponentiation via the explicit Chinese remainder theorem.

[BibT_eX]

[DOI]

Daniel J. Bernstein

Math. Comput., 2007

2006

The Pseudosquares Prime Sieve.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

Fast Bounds on the Distribution of Smooth Numbers.

[BibT_eX]

[DOI]

Scott T. Parsell

Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2005

An honors course on Alan M. Turing.

[BibT_eX]

[DOI]

ACM SIGCSE Bull., 2005

2000

A Fast Algorithm for Appoximately Counting Smooth Numbers.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1998

Efficient Algorithms for Computing the Jacobi Symbol.

[BibT_eX]

[DOI]

Shawna Meyer Eikenberry

J. Symb. Comput., 1998

Trading Time for Space in Prime Number Sieves.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997

Approximating the number of integers free of large prime factors.

[BibT_eX]

[DOI]

Simon Hunter

Math. Comput., 1997

Genetic algorithms for the extended GCD problem (work in progress).

[BibT_eX]

[DOI]

Valerie Piehl

Neil Tiedeman

SIGSAM Bull., 1997

1996

Explicit bounds for primes in residue classes.

[BibT_eX]

[DOI]

Math. Comput., 1996

A Space-Efficient Fast Prime Number Sieve.

[BibT_eX]

[DOI]

Brian Dunten

Julie Jones

Inf. Process. Lett., 1996

1995

Counting the Integers Factorable via Cyclotomic Methods.

[BibT_eX]

[DOI]

Carl Pomerance

J. Algorithms, 1995

An Analysis of Lehmer's Euclidean GCD Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

1994

Two Fast Parallel Prime Number Sieves

[BibT_eX]

[DOI]

Ian Parberry

Inf. Comput., October, 1994

Polylog Depth Circuits for Integer Factoring and Discrete Logarithms

[BibT_eX]

[DOI]

Inf. Comput., April, 1994

Analysis of a Left-Shift Binary GCD Algorithm.

[BibT_eX]

[DOI]

Jeffrey O. Shallit

J. Symb. Comput., 1994

Two Fast GCD Algorithms.

[BibT_eX]

[DOI]

J. Algorithms, 1994

1993

A binary algorithm for the Jacobi symbol.

[BibT_eX]

[DOI]

Jeffrey O. Shallit

SIGSAM Bull., 1993

Sieve Algorithms for Perfect Power Testing.

[BibT_eX]

[DOI]