Journal and Conference Papers and Book Chapters

Here is a list of my papers. Coauthors who were Butler undergraduates at the time we did the work are in blue.

My CS-Education stuff is at the bottom.

Don't hesitate the contact me if you would like a reprint.

1. Eric Bach, Dominic Klyve, and Jonathan P. Sorenson,
   Computing Prime Harmonic Sums,
   Mathematics of Computation 78:2283-2305, 2009. Poster appeared at ANTS VII. [find it here] [PDF]
2. Ankur Gupta, Anna Kispert, and Jonathan P. Sorenson,
   Online Sorting via Searching and Selection,
   Draft - in preparation.. [find it here]
3. Jonathan P. Sorenson,
   A Sublinear Time Parallel GCD Algorithm for the EREW PRAM,
   Draft - in preparation.. [find it here]
4. Daniel J. Bernstein and Jonathan P. Sorenson,
   Modular Exponentiation via the Explicit Chinese Remainder Theorem,
   Mathematics of Computation 76,257:443-454, 2007.
   AMS Math Review Number 2261030. [find it here] [PDF]
5. Scott Parsell and Jonathan P. Sorenson,
   Fast Bounds on the Distribution of Smooth Numbers,
   Proceedings of the 7th International Symposium on Algorithmic Number Theory (ANTS-VII),
   Florian Hess, Sebastian Pauli, and Michael Pohst ed., Berlin, Germany, pages 168-181, 2006. LNCS 4076, ISBN 3-540-36075-1.
   AMS Math Review Number 2282923. [find it here] [PDF]
6. Jonathan P. Sorenson,
   The Pseudosquares Prime Sieve,
   Proceedings of the 7th International Symposium on Algorithmic Number Theory (ANTS-VII),
   Florian Hess, Sebastian Pauli, and Michael Pohst ed., Berlin, Germany, pages 193-207, 2006. LNCS 4076, ISBN 3-540-36075-1.
   AMS Math Review Number 2282925. [find it here] [PDF]
7. Jonathan P. Sorenson,
   Lehmer's algorithm for very large numbers,
   ANTS VI poster presentation; abstract appeared in SIGSAM Bulletin 38,3:102-104,2004. [find it here] [PS]
8. Jonathan P. Sorenson,
   An Analysis of the Generalized Binary GCD Algorithm,
   High Primes and Misdemeanors: Lectures in Honour of the 60th Birthday of Hugh Cowie Williams,
   Alf van der Poorten and Andreas Stein ed., Banff, Alberta, Canada, 2004.
   AMS Math Review Number 2005h:11279. [find it here] [PDF]
9. Valerie Piehl, Jonathan P. Sorenson, and Neil Tiedeman,
   Genetic algorithms for the extended GCD problem,
   [PS]
10. Jonathan P. Sorenson,
    A fast algorithm for approximately counting smooth numbers,
    Proceedings of the Fourth International Algorithmic Number Theory Symposium (ANTS IV),
    W. Bosma ed., Leiden, The Netherlands, pages 539-549, 2000. LNCS 1838.
    AMS Math Review Number 2002e:11123.
11. Jonathan P. Sorenson,
    A sublinear-time parallel algorithm for integer modular exponentiation,
    Proceedings of The Conference on The Mathematics of Public-Key Cryptography,
    A. Odlyzko, G. Walsh, and H. Williams ed., The Fields Institute, Toronto, Ontario, 1999. [PS]
12. Shawna M. Meyer Eikenberry and Jonathan P. Sorenson,
    Efficient algorithms for computing the Jacobi symbol,
    Journal of Symbolic Computation 26,4:509-523, 1998.
    AMS Math Review Number 99h:11146. [find it here]
13. Jonathan P. Sorenson,
    Trading time for space in prime number sieves,
    Proceedings of the Third International Algorithmic Number Theory Symposium (ANTS III),
    Joe Buhler ed., Portland, Oregon, pages 179-195, 1998. LNCS 1423.
    AMS Math Review Number 2000i:11191. [find it here]
14. Simon Hunter and Jonathan P. Sorenson,
    Approximating the number of integers free of large prime factors,
    Mathematics of Computation 66,220:1729-1741, 1997.
    AMS Math Review Number 98c:11093. [PDF]
15. Eric Bach and Jonathan P. Sorenson,
    Explicit bounds for primes in residue classes,
    Mathematics of Computation 65,216:1717-1735, 1996.
    AMS Math Review Number 97a:11143. [PDF]
16. Brian Dunten, Julie Jones, and Jonathan P. Sorenson,
    A space-efficient fast prime number sieve,
    Information Processing Letters 59:79-84, 1996.
    AMS Math Review Number 97g:11141. [find it here]
17. Shawna M. Meyer and Jonathan P. Sorenson,
    Efficient algorithms for computing the Jacobi symbol (extended abstract),
    Proceedings of the Second International Algorithmic Number Theory Syposium (ANTS II),
    H. Cohen ed., Talence, France, pages 225-239, 1996. LNCS 1122.
    AMS Math Review Number 97m:11157.
18. Carl Pomerance and Jonathan P. Sorenson,
    Counting the integers factorable via cyclotomic methods,
    Journal of Algorithms 19:250-265, 1995.
    AMS Math Review Number 96e:11163. [find it here]
19. Jonathan P. Sorenson,
    An analysis of Lehmer's Euclidean GCD algorithm,
    1995 ACM International Symposium on Symbolic and Algebraic Computation,
    A. H. M. Levelt ed., Montreal, Canada, pages 254-258, 1995. [find it here] [PDF]
20. Jonathan P. Sorenson and Ian Parberry,
    Two Fast Parallel Prime Number Sieves,
    Information and Computation 144,1:115-130, 1994.
    AMS Math Review Number 95h:11097. [find it here]
21. Jeffrey O. Shallit and Jonathan P. Sorenson,
    Analysis of a Left-Shift Binary GCD Algorithm,
    Journal of Symbolic Computation 17:473-486, 1994.
    AMS Math Review Number 95g:68057. [find it here]
22. Jeffrey O. Shallit and Jonathan P. Sorenson,
    Analysis of a Left-Shift Binary GCD Algorithm (extended abstract),
    Proceedings of the First International Algorithmic Number Theory Symposium (ANTS I),
    L. M. Adleman and M.-D. Huang ed., Ithaca, New York, pages 169-183, 1994. LNCS 877.
    AMS Math Review Number 96f:11168.
23. Jonathan P. Sorenson,
    Two Fast GCD Algorithms,
    Journal of Algorithms 16:110-144, 1994.
    AMS Math Review Number 94k:11135. [find it here]
24. Jonathan P. Sorenson,
    Polylog Depth Circuits for Integer Factoring and Discrete Logarithms,
    Information and Computation 110,1:1-18, 1994.
    AMS Math Review Number 95j:11120. [find it here]
25. Eric Bach and Jonathan P. Sorenson,
    Sieve Algorithms for Perfect Power Testing,
    Algorithmica 9,4:313-328, 1993.
    AMS Math Review Number 94d:11103.
26. Eric Bach and Jonathan P. Sorenson,
    Explicit bounds for primes in residue classes (short version),
    Mathematics of Computation 1943-1993: a half-century of computational mathematics,
    W. Gautschi ed., Vancouver, British Columbia, pages 535-539, 1993. PSAPM 48.
    AMS Math Review Number 96e:11152.
27. Jeffrey O. Shallit and Jonathan P. Sorenson,
    A Binary Algorithm for the Jacobi Symbol,
    SIGSAM Bulletin 27,1:4-11, 1993.
28. Jonathan P. Sorenson,
    Algorithms in Number Theory,
    PhD Thesis, University of Wisconsin-Madison, 1991. Available as Computer Sciences Technical Report #1027.
29. Jonathan P. Sorenson,
    Poster Abstracts ANTS-8,
    SIGSAM Bulletin 164,2:48-66, 2008.
30. Jonathan P. Sorenson and Panagiotis K. Linos,
    EPICS: A Service Learning Program at Butler University,
    Proceedings of the 35th Annual IEEE Frontiers in Education Conference,
    Indianapolis, Indiana USA, pages F2F-21--F2F-25, 2005. ISBN 0-7803-9077-6. [find it here] [PDF]
31. Jonathan P. Sorenson,
    An honors course on Alan M. Turing,
    SIGCSE Bulletin Inroads 37,4:103-106, 2005. [PDF]
32. Jonathan P. Sorenson,
    Experiences with Writing Assignments in Upper-Division Computer Science Courses,
    Teaching in the 21st Century: Adapting Writing Pedagogies to the College Curriculum,
    Alice Robertson and Barbara Smith ed., pages 49-66, 1999. ISBN 0-8153-3152-5. [find it here] [PS]