Jonathan Sorenson
Jonathan Sorenson
Professor of Computer Science and Software Engineering, Butler University
Dirección de correo verificada de butler.edu - Página principal
TítuloCitado porAño
Two fast GCD algorithms
J Sorenson
Journal of Algorithms 16 (1), 110-144, 1994
1171994
Explicit bounds for primes in residue classes
E Bach, J Sorenson
Mathematics of Computation of the American Mathematical Society 65 (216 …, 1996
771996
Sieve algorithms for perfect power testing
E Bach, J Sorenson
Algorithmica 9 (4), 313-328, 1993
401993
Efficient algorithms for computing the Jacobi symbol
SM Eikenberry, JP Sorenson
Journal of Symbolic Computation 26 (4), 509-523, 1998
371998
An analysis of Lehmer's Euclidean GCD algorithm
J Sorenson
ISSAC 95, 254-258, 1995
341995
A binary algorithm for the Jacobi symbol
J Shallit, J Sorenson
ACM SIGSAM Bulletin, 1993
341993
Approximating the number of integers free of large prime factors
S Hunter, J Sorenson
Mathematics of Computation of the American Mathematical Society 66 (220 …, 1997
281997
Modular exponentiation via the explicit Chinese remainder theorem
D Bernstein, J Sorenson
Mathematics of Computation 76 (257), 443-454, 2007
232007
A space-efficient fast prime number sieve
B Dunten, J Jones, J Sorenson
Information Processing Letters 59 (2), 79-84, 1996
231996
2 Fast Parallel Prime Number Sieves
J Sorenson, I Parberry
Information and Computation 114 (1), 115-130, 1994
231994
The pseudosquares prime sieve
JP Sorenson
International Algorithmic Number Theory Symposium, 193-207, 2006
162006
An introduction to prime number sieves
J Sorenson
University of Wisconsin-Madison Department of Computer Sciences, 1990
161990
A sublinear-time parallel algorithm for integer modular exponentiation
JP Sorenson
Proceedings of the conference on the mathematics of public-key cryptography …, 1999
141999
Counting the integers factorable via cyclotomic methods
C Pomerance, J Sorenson
Journal of Algorithms 19 (2), 250-265, 1995
141995
Strong pseudoprimes to twelve prime bases
J Sorenson, J Webster
Mathematics of Computation 86 (304), 985-1003, 2017
132017
Analysis of a left-shift binary GCD algorithm
J Shallit, J Sorenson
Journal of Symbolic Computation 17 (6), 473-486, 1994
131994
An analysis of the generalized binary GCD algorithm
JP Sorenson
High Primes and Misdemeanors: Lectures in Honour of the 60th Birthday of …, 2004
122004
Computing prime harmonic sums
E Bach, D Klyve, J Sorenson
Mathematics of Computation 78 (268), 2283-2305, 2009
112009
Efficient algorithms for computing the jacobi symbol
SM Meyer, JP Sorenson
International Algorithmic Number Theory Symposium, 225-239, 1996
111996
Sieving for pseudosquares and pseudocubes in parallel using doubly-focused enumeration and wheel datastructures
JP Sorenson
International Algorithmic Number Theory Symposium, 331-339, 2010
102010
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20