An Algorithm for Ennola’s Second Theorem and Counting Smooth Numbers in Practice, Chloe Makdad, 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

Near-Optimal Online Multiselection in Internal and External Memory, Jonathan P. Sorenson, Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao
Ankur Gupta

Two Compact Incremental Prime Sieves, Jonathan P. Sorenson
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

Near-optimal online multiselection in internal and external memory, Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson
Ankur Gupta

Near-optimal online multiselection in internal and external memory, Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson
Jonathan P. Sorenson

Two Compact Incremental Prime Sieves, Jonathan P. Sorenson
Scholarship and Professional Work - LAS

Near-Optimal Online Multiselection in Internal and External Memory, Jonathan P. Sorenson, Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao
Scholarship and Professional Work - LAS

Theory and Implementation of Online Multiselection Algorithms, Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson
Ankur Gupta

Theory and Implementation of Online Multiselection Algorithms, Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson
Jonathan P. Sorenson

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

Genetic Algorithms for the Extended GCD Problem, Jonathan P. Sorenson
Jonathan P. Sorenson

Fast Bounds on the Distribution of Smooth Numbers, Scott T. Parsell, Jonathan P. Sorenson
Jonathan P. Sorenson

The Pseudosquares Prime Sieve, Jonathan P. Sorenson
Jonathan P. Sorenson

Modular exponentiation via the explicit Chinese remainder theorem, Daniel J. Bernstein, Jonathan P. Sorenson
Jonathan P. Sorenson

Modular exponentiation via the explicit Chinese remainder theorem, Daniel J. Bernstein, Jonathan P. Sorenson
Jonathan P. Sorenson

A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM, Jonathan P. Sorenson
Scholarship and Professional Work - LAS

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

A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM, Jonathan P. Sorenson
Jonathan P. Sorenson

Online Sorting via Searching and Selection, Ankur Gupta, Anna Kispert, Jonathan P. Sorenson
Ankur Gupta

Online Sorting via Searching and Selection, Ankur Gupta, Anna Kispert, Jonathan P. Sorenson
Jonathan P. Sorenson

Modular exponentiation via the explicit Chinese remainder theorem, Daniel J. Bernstein, Jonathan P. Sorenson
Scholarship and Professional Work - LAS

The Pseudosquares Prime Sieve, Jonathan P. Sorenson
Scholarship and Professional Work - LAS

Fast Bounds on the Distribution of Smooth Numbers, Scott T. Parsell, Jonathan P. Sorenson
Scholarship and Professional Work - LAS

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

Genetic Algorithms for the Extended GCD Problem, Jonathan P. Sorenson
Scholarship and Professional Work - LAS

Approximating the number of integers with small prime factors, Simon Hunter, 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
Scholarship and Professional Work - LAS

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