Jonathan Sorenson

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