Jonathan P. Sorenson

According to our database1, Jonathan P. Sorenson authored at least 33 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

2018
Two Algorithms to Find Primes in Patterns.
CoRR, 2018

2017
Strong pseudoprimes to twelve prime bases.
Math. Comput., 2017

2016
Near-optimal online multiselection in internal and external memory.
J. Discrete Algorithms, 2016

2015
Two Compact Incremental Prime Sieves.
CoRR, 2015

Dynamic Online Multiselection in Internal and External Memory.
Proceedings of the WALCOM: Algorithms and Computation - 9th International Workshop, 2015

2013
Approximately counting semismooth integers.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Theory and Implementation of Online Multiselection Algorithms.
Proceedings of the Algorithms - ESA 2013, 2013

2012
Competitive Online Selection in Main and External Memory
CoRR, 2012

2010
A randomized sublinear time parallel GCD algorithm for the EREW PRAM.
Inf. Process. Lett., 2010

Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures.
Proceedings of the Algorithmic Number Theory, 9th International Symposium, 2010

2009
Computing prime harmonic sums.
Math. Comput., 2009

Online Sorting via Searching and Selection
CoRR, 2009

A Sublinear Time Parallel GCD Algorithm for the EREW PRAM
CoRR, 2009

2007
Modular exponentiation via the explicit Chinese remainder theorem.
Math. Comput., 2007

2006
The Pseudosquares Prime Sieve.
Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

Fast Bounds on the Distribution of Smooth Numbers.
Proceedings of the Algorithmic Number Theory, 7th International Symposium, 2006

2005
An honors course on Alan M. Turing.
SIGCSE Bulletin, 2005

2000
A Fast Algorithm for Appoximately Counting Smooth Numbers.
Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1998
Efficient Algorithms for Computing the Jacobi Symbol.
J. Symb. Comput., 1998

Trading Time for Space in Prime Number Sieves.
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1997
Approximating the number of integers free of large prime factors.
Math. Comput., 1997

Genetic algorithms for the extended GCD problem (work in progress).
ACM SIGSAM Bulletin, 1997

1996
Explicit bounds for primes in residue classes.
Math. Comput., 1996

A Space-Efficient Fast Prime Number Sieve.
Inf. Process. Lett., 1996

1995
Counting the Integers Factorable via Cyclotomic Methods.
J. Algorithms, 1995

An Analysis of Lehmer's Euclidean GCD Algorithm.
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

1994
Two Fast Parallel Prime Number Sieves
Inf. Comput., October, 1994

Polylog Depth Circuits for Integer Factoring and Discrete Logarithms
Inf. Comput., April, 1994

Analysis of a Left-Shift Binary GCD Algorithm.
J. Symb. Comput., 1994

Two Fast GCD Algorithms.
J. Algorithms, 1994

1993
A binary algorithm for the Jacobi symbol.
ACM SIGSAM Bulletin, 1993

Sieve Algorithms for Perfect Power Testing.
Algorithmica, 1993


  Loading...