Jonathan Sorenson

Publication Activity (10 Years)

Years Active: 1993-2017
Publications (10 Years): 2

Top Topics

Online Services

Search Algorithm

Top Venues

J. Discrete Algorithms

Publications

Jonathan Sorenson, Jonathan Webster
Strong pseudoprimes to twelve prime bases. Math. Comput. 86 (304) (2017)
Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan Sorenson
Near-optimal online multiselection in internal and external memory. J. Discrete Algorithms 36 (2016)
Jonathan Sorenson
The Pseudosquares Prime Sieve. ANTS (2006)
Scott T. Parsell, Jonathan Sorenson
Fast Bounds on the Distribution of Smooth Numbers. ANTS (2006)
Jonathan Sorenson
A Fast Algorithm for Appoximately Counting Smooth Numbers. ANTS (2000)
Shawna Meyer Eikenberry, Jonathan Sorenson
Efficient Algorithms for Computing the Jacobi Symbol. J. Symb. Comput. 26 (4) (1998)
Jonathan Sorenson
Trading Time for Space in Prime Number Sieves. ANTS (1998)
Valerie Piehl, Jonathan Sorenson, Neil Tiedeman
Genetic algorithms for the extended GCD problem (work in progress). SIGSAM Bull. 31 (3) (1997)
Simon Hunter, Jonathan Sorenson
Approximating the number of integers free of large prime factors. Math. Comput. 66 (220) (1997)
Shawna Meyer Eikenberry, Jonathan Sorenson
Efficient Algorithms for Computing the Jacobi Symbol. ANTS (1996)
Brian Dunten, Julie Jones, Jonathan Sorenson
A Space-Efficient Fast Prime Number Sieve. Inf. Process. Lett. 59 (2) (1996)
Jonathan Sorenson
An Analysis of Lehmer's Euclidean GCD Algorithm. ISSAC (1995)
Jonathan Sorenson, Ian Parberry
Two Fast Parallel Prime Number Sieves Inf. Comput. 114 (1) (1994)
Jonathan Sorenson
Polylog Depth Circuits for Integer Factoring and Discrete Logarithms Inf. Comput. 110 (1) (1994)
Jonathan Sorenson
Two Fast GCD Algorithms. J. Algorithms 16 (1) (1994)
Jeffrey O. Shallit, Jonathan Sorenson
A binary algorithm for the Jacobi symbol. SIGSAM Bull. 27 (1) (1993)