Searching for authors named "Jonathan Sorenson" – sorted by Relevance.
-
An Analysis of Lehmer's Euclidean GCD Algorithm
- An Analysis of Lehmer's Euclidean GCD Algorithm Jonathan Sorenson Department of Mathematics
- Cited by 7 (3 self) – Add To MetaCart
-
A Sublinear-Time Parallel Algorithm for Integer Modular Exponentiation
- A Sublinear-Time Parallel Algorithm for Integer Modular Exponentiation Jonathan P. Sorenson
- Cited by 5 (0 self) – Add To MetaCart
-
An analysis of the generalized binary GCD algorithm
- Algorithm Jonathan P. Sorenson Department of Computer Science and Software Engineering Butler University
- Cited by 2 (0 self) – Add To MetaCart
-
Approximating The Number Of Integers Free Of Large Prime Factors
- -5718(97)00874-0 APPROXIMATING THE NUMBER OF INTEGERS FREE OF LARGE PRIME FACTORS SIMON HUNTER AND JONATHAN SORENSON Abstract
- Cited by 5 (1 self) – Add To MetaCart
-
A Binary Algorithm for the Jacobi Symbol
- University of Waterloo Waterloo, Ontario, Canada N2L 3G1 shallit@(email omitted); Jonathan Sorenson
- Cited by 4 (1 self) – Add To MetaCart
-
Trading Time for Space in Prime Number Sieves
- Trading Time for Space in Prime Number Sieves Jonathan P. Sorenson ? Department of Mathematics
- Cited by 1 (1 self) – Add To MetaCart
-
Explicit bounds for primes in residue classes
- FOR PRIMES IN RESIDUE CLASSES ERIC BACH AND JONATHAN SORENSON Abstract. Let E/K be an abelian extension
- Cited by 12 (1 self) – Add To MetaCart
-
A Space-Efficient Fast Prime Number Sieve
- A Space-Efficient Fast Prime Number Sieve Brian Dunten Julie Jones Jonathan Sorenson Department
- Cited by 3 (2 self) – Add To MetaCart
-
Efficient Algorithms for Computing the Jacobi Symbol (Extended Abstract)
- ?? and Jonathan P. Sorenson ??? Department of Mathematics and Computer Science Butler University Indianapolis
- Cited by 1 (0 self) – Add To MetaCart

