Jonathan Sorenson

Cited by

	All	Since 2019
Citations	937	290
h-index	17	9
i10-index	27	8

199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320246 15 11 21 18 18 9 30 13 15 14 33 26 39 30 24 34 35 20 28 37 18 25 31 36 41 67 67 45 45 28 38

Public access

View all

1 article

0 articles

available

not available

Based on funding mandates

Co-authors

Srinivasa Rao SattiProfessor, NTNUVerified email at ntnu.no
Jeffrey ShallitProfessor of Computer Science, University of WaterlooVerified email at cs.uwaterloo.ca
Jérémy BarbayUniversidad de ConcepciónVerified email at barbay.cl
Daniel J. BernsteinUniversity of Illinois at Chicago and Technische Universiteit EindhovenVerified email at box.cr.yp.to
Panagiotis K. LinosProfessor of Computer Science and Software Engineering, Butler UniversityVerified email at butler.edu
Ian ParberryProfessor Emeritus of Computer Science & Engineering, University of North TexasVerified email at unt.edu
Carl PomeranceDartmouth College, University of GeorgiaVerified email at dartmouth.edu
Dominic KlyveCentral Washington UniversityVerified email at cwu.edu
Seungbum JoVerified email at cnu.ac.kr
Zhi-hong ChenProfessor of Mathematics and Computer Science, Butler UniversityVerified email at butler.edu
Renate ScheidlerDepartment of Mathematics & Statistics and Department of Computer Science, University of CalgaryVerified email at ucalgary.ca
Chloe MakdadVerified email at butler.edu

Jonathan Sorenson

Professor of Computer Science and Software Engineering, Butler University

Verified email at butler.edu - Homepage

Algorithms Number Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Two fast GCD algorithms J Sorenson Journal of Algorithms 16 (1), 110-144, 1994	166	1994
Explicit bounds for primes in residue classes E Bach, J Sorenson Mathematics of Computation 65 (216), 1717-1735, 1996	109	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
Modular exponentiation via the explicit Chinese remainder theorem D Bernstein, J Sorenson Mathematics of Computation 76 (257), 443-454, 2007	41	2007
Efficient algorithms for computing the Jacobi symbol SM Eikenberry, JP Sorenson Journal of Symbolic Computation 26 (4), 509-523, 1998	39	1998
An introduction to prime number sieves J Sorenson University of Wisconsin-Madison Department of Computer Sciences, 1990	38	1990
A binary algorithm for the Jacobi symbol J Shallit, J Sorenson ACM SIGSAM Bulletin 27 (1), 4-11, 1993	37	1993
Approximating the number of integers free of large prime factors S Hunter, J Sorenson Mathematics of Computation 66 (220), 1729-1741, 1997	35	1997
The k-ary GCD Algorithm J Sorenson University of Wisconsin-Madison Department of Computer Sciences, 1990	31	1990
2 Fast Parallel Prime Number Sieves J Sorenson, I Parberry Information and Computation 114 (1), 115-130, 1994	29	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
Trading time for space in prime number sieves JP Sorenson Algorithmic Number Theory: Third International Symposiun, ANTS-III Portland …, 1998	18	1998
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
Analysis of a left-shift binary GCD algorithm J Shallit, J Sorenson Journal of Symbolic Computation 17 (6), 473-486, 1994	16	1994
Counting the integers factorable via cyclotomic methods C Pomerance, J Sorenson Journal of Algorithms 19 (2), 250-265, 1995	15	1995

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors