| 2006 |
|---|
| 17 | EE | Scott T. Parsell,
Jonathan Sorenson:
Fast Bounds on the Distribution of Smooth Numbers.
ANTS 2006: 168-181 |
| 16 | EE | Jonathan Sorenson:
The Pseudosquares Prime Sieve.
ANTS 2006: 193-207 |
| 2000 |
|---|
| 15 | | Jonathan Sorenson:
A Fast Algorithm for Appoximately Counting Smooth Numbers.
ANTS 2000: 539-550 |
| 1998 |
|---|
| 14 | EE | Jonathan Sorenson:
Trading Time for Space in Prime Number Sieves.
ANTS 1998: 179-195 |
| 13 | | Shawna Meyer Eikenberry,
Jonathan Sorenson:
Efficient Algorithms for Computing the Jacobi Symbol.
J. Symb. Comput. 26(4): 509-523 (1998) |
| 1997 |
|---|
| 12 | | Simon Hunter,
Jonathan Sorenson:
Approximating the number of integers free of large prime factors.
Math. Comput. 66(220): 1729-1741 (1997) |
| 1996 |
|---|
| 11 | | Shawna Meyer Eikenberry,
Jonathan Sorenson:
Efficient Algorithms for Computing the Jacobi Symbol.
ANTS 1996: 225-239 |
| 10 | EE | Brian Dunten,
Julie Jones,
Jonathan Sorenson:
A Space-Efficient Fast Prime Number Sieve.
Inf. Process. Lett. 59(2): 79-84 (1996) |
| 9 | | Eric Bach,
Jonathan Sorenson:
Explicit bounds for primes in residue classes.
Math. Comput. 65(216): 1717-1735 (1996) |
| 1995 |
|---|
| 8 | EE | Jonathan Sorenson:
An Analysis of Lehmer's Euclidean GCD Algorithm.
ISSAC 1995: 254-258 |
| 7 | | Carl Pomerance,
Jonathan Sorenson:
Counting the Integers Factorable via Cyclotomic Methods.
J. Algorithms 19(2): 250-265 (1995) |
| 1994 |
|---|
| 6 | | Jeffrey Shallit,
Jonathan Sorenson:
Analysis of a left-shift binary GCD algorithm.
ANTS 1994: 169-183 |
| 5 | | Jonathan Sorenson:
Polylog Depth Circuits for Integer Factoring and Discrete Logarithms
Inf. Comput. 110(1): 1-18 (1994) |
| 4 | | Jonathan Sorenson,
Ian Parberry:
Two Fast Parallel Prime Number Sieves
Inf. Comput. 114(1): 115-130 (1994) |
| 3 | | Jonathan Sorenson:
Two Fast GCD Algorithms.
J. Algorithms 16(1): 110-144 (1994) |
| 2 | | Jeffrey Shallit,
Jonathan Sorenson:
Analysis of a Left-Shift Binary GCD Algorithm.
J. Symb. Comput. 17(6): 473-486 (1994) |
| 1993 |
|---|
| 1 | | Eric Bach,
Jonathan Sorenson:
Sieve Algorithms for Perfect Power Testing.
Algorithmica 9(4): 313-328 (1993) |
