| Two fast GCD algorithms J Sorenson Journal of Algorithms 16 (1), 110-144, 1994 | 167 | 1994 |
| Explicit bounds for primes in residue classes E Bach, J Sorenson Mathematics of Computation 65 (216), 1717-1735, 1996 | 105 | 1996 |
| Sieve algorithms for perfect power testing E Bach, J Sorenson Algorithmica 9, 313-328, 1993 | 51 | 1993 |
| An analysis of Lehmer's Euclidean GCD algorithm J Sorenson Proceedings of the 1995 international symposium on Symbolic and algebraic …, 1995 | 43 | 1995 |
| Efficient algorithms for computing the Jacobi symbol SM Eikenberry, JP Sorenson Journal of Symbolic Computation 26 (4), 509-523, 1998 | 40 | 1998 |
| A binary algorithm for the Jacobi symbol J Shallit, J Sorenson ACM SIGSAM Bulletin 27 (1), 4-11, 1993 | 38 | 1993 |
| An introduction to prime number sieves J Sorenson University of Wisconsin-Madison Department of Computer Sciences, 1990 | 37 | 1990 |
| Modular exponentiation via the explicit Chinese remainder theorem D Bernstein, J Sorenson Mathematics of Computation 76 (257), 443-454, 2007 | 36 | 2007 |
| Approximating the number of integers free of large prime factors S Hunter, J Sorenson Mathematics of Computation 66 (220), 1729-1741, 1997 | 34 | 1997 |
| The k-ary GCD Algorithm J Sorenson University of Wisconsin-Madison Department of Computer Sciences, 1990 | 30 | 1990 |
| 2 Fast Parallel Prime Number Sieves J Sorenson, I Parberry Information and Computation 114 (1), 115-130, 1994 | 28 | 1994 |
| Strong pseudoprimes to twelve prime bases J Sorenson, J Webster Mathematics of Computation 86 (304), 985-1003, 2017 | 27 | 2017 |
| The pseudosquares prime sieve JP Sorenson International Algorithmic Number Theory Symposium, 193-207, 2006 | 24 | 2006 |
| A space-efficient fast prime number sieve B Dunten, J Jones, J Sorenson Information Processing Letters 59 (2), 79-84, 1996 | 24 | 1996 |
| Sieving for pseudosquares and pseudocubes in parallel using doubly-focused enumeration and wheel datastructures JP Sorenson Algorithmic Number Theory: 9th International Symposium, ANTS-IX, Nancy …, 2010 | 17 | 2010 |
| An analysis of the generalized binary GCD algorithm J Sorenson High Primes and Misdemeanors, Lectures in Honour of Hugh Cowie Williams …, 2004 | 17 | 2004 |
| A sublinear-time parallel algorithm for integer modular exponentiation JP Sorenson Proceedings of the conference on the mathematics of public-key cryptography …, 1999 | 16 | 1999 |
| Counting the integers factorable via cyclotomic methods C Pomerance, J Sorenson Journal of Algorithms 19 (2), 250-265, 1995 | 16 | 1995 |
| Analysis of a left-shift binary GCD algorithm J Shallit, J Sorenson Journal of Symbolic Computation 17 (6), 473-486, 1994 | 16 | 1994 |
| Trading time for space in prime number sieves JP Sorenson Algorithmic Number Theory: Third International Symposiun, ANTS-III Portland …, 1998 | 14 | 1998 |
Srinivasa Rao SattiProfessor, NTNUVerified email at ntnu.no
