An Algorithm for Ennola’s Second Theorem and Counting Smooth Numbers in Practice, Chloe Makdad, Jonathan P. Sorenson
Jonathan P. Sorenson

Computation of the least primitive root, Kevin J. McGown, Jonathan P. Sorenson
Jonathan P. Sorenson

An Algorithm to Find Sums of Consecutive Powers of Primes, Cathal O'Sullivan, Jonathan P. Sorenson, Aryn Stahl
Jonathan P. Sorenson

An algorithm and estimates for the Erdős–Selfridge function, Brianna Sorenson, Jonathan P. Sorenson, Jonathan Webster
Jonathan P. Sorenson

An Algorithm to Generate Random Factored Smooth Integers, Jonathan P. Sorenson, Eric Bach
Jonathan P. Sorenson

Two Algorithms to Find Primes in Patterns, Jonathan P. Sorenson, Jonathan Webster
Jonathan P. Sorenson

Strong pseudoprimes to twelve bases, Jonathan P. Sorenson, Jonathan Webster
Jonathan P. Sorenson

Approximately Counting Semismooth Integers, Eric Bach, Jonathan P. Sorenson
Jonathan P. Sorenson

Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumera- tion and Wheel Datastructures, Jonathan P. Sorenson
Jonathan P. Sorenson

Efficient algorithms for computing the Jacobi symbol, Shawna Meyer Eikenberry, Jonathan P. Sorenson
Jonathan P. Sorenson

Trading time for space in prime number sieves, Jonathan P. Sorenson
Jonathan P. Sorenson

Approximating the number of integers with small prime factors, Simon Hunter, Jonathan P. Sorenson
Jonathan P. Sorenson

Explicit Bounds for Primes in Residue Classes, Eric Bach, Jonathan P. Sorenson
Jonathan P. Sorenson

A space-efficient fast prime number sieve, Brian Dunten, Julie Jones, Jonathan P. Sorenson
Jonathan P. Sorenson

Counting the Integers Factorable via Cyclotomic Methods, Carl Pomerance, Jonathan P. Sorenson
Jonathan P. Sorenson

Analysis of Lehmer’s Euclidean GCD algorithm, Jonathan P. Sorenson
Jonathan P. Sorenson

Two Fast Parallel Prime Number Sieves, Jonathan P. Sorenson, Ian Parberry
Jonathan P. Sorenson

Polylog Depth Circuits for Integer Factoring and Discrete Logarithms, Jonathan P. Sorenson
Jonathan P. Sorenson

Two Fast GCD Algorithms, Jonathan P. Sorenson
Jonathan P. Sorenson

Analysis of the left-shift binary GCD algorithm, Jeffrey O. Shallit, Jonathan P. Sorenson
Jonathan P. Sorenson

Sieve Algorithms for Perfect Power Testing, Eric Bach, Jonathan P. Sorenson
Jonathan P. Sorenson

A Binary Algorithm for the Jacobi Symbol, Jeffrey O. Shallit, Jonathan P. Sorenson
Jonathan P. Sorenson

Algorithms in Number Theory, Jonathan P. Sorenson
Jonathan P. Sorenson

An Introduction to Prime Number Sieves, Jonathan P. Sorenson
Jonathan P. Sorenson