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