Sieve Algorithms for Perfect Power Testing. - Eric Bach 001; Jonathan P. Sorenson (Algorithmica, 1993)

A binary algorithm for the Jacobi symbol. - Jeffrey O. Shallit; Jonathan Sorenson (SIGSAM Bull., 1993)

Two Fast GCD Algorithms. - Jonathan Sorenson (J. Algorithms, 1994)

Analysis of a Left-Shift Binary GCD Algorithm. - Jeffrey O. Shallit; Jonathan P. Sorenson (J. Symb. Comput., 1994)

Polylog Depth Circuits for Integer Factoring and Discrete Logarithms - Jonathan Sorenson (Inf. Comput., 1994)

Two Fast Parallel Prime Number Sieves - Jonathan Sorenson; Ian Parberry (Inf. Comput., 1994)

An Analysis of Lehmer's Euclidean GCD Algorithm. - Jonathan Sorenson (ISSAC, 1995)

Counting the Integers Factorable via Cyclotomic Methods. - Carl Pomerance; Jonathan P. Sorenson (J. Algorithms, 1995)

A Space-Efficient Fast Prime Number Sieve. - Brian Dunten; Julie Jones; Jonathan Sorenson (Inf. Process. Lett., 1996)

Explicit bounds for primes in residue classes. - Eric Bach 001; Jonathan P. Sorenson (Math. Comput., 1996)

Genetic algorithms for the extended GCD problem (work in progress). - Valerie Piehl; Jonathan Sorenson; Neil Tiedeman (SIGSAM Bull., 1997)

Approximating the number of integers free of large prime factors. - Simon Hunter; Jonathan Sorenson (Math. Comput., 1997)

Trading Time for Space in Prime Number Sieves. - Jonathan Sorenson (ANTS, 1998)

Efficient Algorithms for Computing the Jacobi Symbol. - Shawna Meyer Eikenberry; Jonathan Sorenson (J. Symb. Comput., 1998)

A Fast Algorithm for Appoximately Counting Smooth Numbers. - Jonathan Sorenson (ANTS, 2000)

An honors course on Alan M. Turing. - Jonathan P. Sorenson (ACM SIGCSE Bull., 2005)

Fast Bounds on the Distribution of Smooth Numbers. - Scott T. Parsell; Jonathan Sorenson (ANTS, 2006)

The Pseudosquares Prime Sieve. - Jonathan Sorenson (ANTS, 2006)

Modular exponentiation via the explicit Chinese remainder theorem. - Daniel J. Bernstein; Jonathan P. Sorenson (Math. Comput., 2007)

A Sublinear Time Parallel GCD Algorithm for the EREW PRAM - Jonathan P. Sorenson (CoRR, 2009)

Online Sorting via Searching and Selection - Ankur Gupta 003; Anna Kispert; Jonathan P. Sorenson (CoRR, 2009)

Computing prime harmonic sums. - Eric Bach 001; Dominic Klyve; Jonathan P. Sorenson (Math. Comput., 2009)

Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures. - Jonathan P. Sorenson (ANTS, 2010)

A randomized sublinear time parallel GCD algorithm for the EREW PRAM. - Jonathan P. Sorenson (Inf. Process. Lett., 2010)

Competitive Online Selection in Main and External Memory - Jérémy Barbay; Ankur Gupta 003; S. Srinivasa Rao 001; Jonathan P. Sorenson (CoRR, 2012)

Theory and Implementation of Online Multiselection Algorithms. - Jérémy Barbay; Ankur Gupta 003; Seungbum Jo; Srinivasa Rao Satti; Jonathan P. Sorenson (ESA, 2013)

Approximately counting semismooth integers. - Eric Bach 001; Jonathan P. Sorenson (ISSAC, 2013)

Dynamic Online Multiselection in Internal and External Memory. - Jérémy Barbay; Ankur Gupta 003; Srinivasa Rao Satti; Jonathan P. Sorenson (WALCOM, 2015)

Two compact incremental prime sieves. - Jonathan P. Sorenson (LMS J. Comput. Math., 2015)

Near-optimal online multiselection in internal and external memory. - Jérémy Barbay; Ankur Gupta 003; Srinivasa Rao Satti; Jonathan Sorenson (J. Discrete Algorithms, 2016)

Strong pseudoprimes to twelve prime bases. - Jonathan Sorenson; Jonathan E. Webster (Math. Comput., 2017)

An Algorithm and Estimates for the Erdős-Selfridge Function (work in progress). - Brianna Sorenson; Jonathan P. Sorenson; Jonathan E. Webster (CoRR, 2019)

Two algorithms to find primes in patterns. - Jonathan P. Sorenson; Jonathan E. Webster (Math. Comput., 2020)

An Algorithm to Find Sums of Consecutive Powers of Primes. - Cathal O'Sullivan; Jonathan P. Sorenson; Aryn Stahl (CoRR, 2022)

An Algorithm for Ennola's Second Theorem and Counting Smooth Numbers in Practice. - Chloe Makdad; Jonathan P. Sorenson (CoRR, 2022)

Reducing the space used by the sieve of Eratosthenes when factoring. - Samuel Hartman; Jonathan P. Sorenson (Inf. Process. Lett., 2025)

Explicit Bounds and Parallel Algorithms for Counting Multiply Gleeful Numbers. - Sara Moore; Jonathan P. Sorenson (CoRR, 2025)