Part of the Mathematics Commons

Works by Jonathan Sorenson in Mathematics

2020

An algorithm and estimates for the Erdős–Selfridge function, Brianna Sorenson, Jonathan Sorenson, Jonathan Webster
Scholarship and Professional Work - LAS

Two Algorithms to Find Primes in Patterns, Jonathan Sorenson, Jonathan Webster
Scholarship and Professional Work - LAS

2017

Strong pseudoprimes to twelve bases, Jonathan Sorenson, Jonathan Webster
Scholarship and Professional Work - LAS

2013

Approximately Counting Semismooth Integers, Eric Bach, Jonathan Sorenson
Scholarship and Professional Work - LAS

2010

Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumera- tion and Wheel Datastructures, Jonathan Sorenson
Scholarship and Professional Work - LAS

2004

An Analysis of the Generalized Binary GCD Algorithm, Jonathan Sorenson
Scholarship and Professional Work - LAS

2000

A fast algorithm for approximately counting smooth numbers, Jonathan Sorenson
Scholarship and Professional Work - LAS

1998

Trading time for space in prime number sieves, Jonathan Sorenson
Scholarship and Professional Work - LAS

Efficient algorithms for computing the Jacobi symbol, Shawna Meyer Eikenberry, Jonathan Sorenson
Scholarship and Professional Work - LAS

1997

Approximating the number of integers with small prime factors, Simon Hunter, Jonathan Sorenson
Scholarship and Professional Work - LAS

1996

A space-efficient fast prime number sieve, Brian Dunten, Julie Jones, Jonathan Sorenson
Scholarship and Professional Work - LAS

Explicit Bounds for Primes in Residue Classes, Eric Bach, Jonathan Sorenson
Scholarship and Professional Work - LAS

1995

Counting the Integers Factorable via Cyclotomic Methods, Carl Pomerance, Jonathan Sorenson
Scholarship and Professional Work - LAS

Analysis of Lehmer’s Euclidean GCD algorithm, Jonathan Sorenson
Scholarship and Professional Work - LAS

1994

Two Fast Parallel Prime Number Sieves, Jonathan Sorenson, Ian Parberry
Scholarship and Professional Work - LAS

Analysis of the left-shift binary GCD algorithm, Jeffrey Shallit, Jonathan Sorenson
Scholarship and Professional Work - LAS

Two Fast GCD Algorithms, Jonathan Sorenson
Scholarship and Professional Work - LAS

1993

Sieve Algorithms for Perfect Power Testing, Eric Bach, Jonathan Sorenson
Scholarship and Professional Work - LAS

A Binary Algorithm for the Jacobi Symbol, Jeffrey Shallit, Jonathan Sorenson
Scholarship and Professional Work - LAS

1991

Algorithms in Number Theory, Jonathan Sorenson
Scholarship and Professional Work - LAS

1990

An Introduction to Prime Number Sieves, Jonathan Sorenson
Scholarship and Professional Work - LAS