default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJonathan P. Sorenson
Person information
- affiliation: Butler University, Indianapolis, IN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Samuel Hartman, Jonathan P. Sorenson:
Reducing the Space Used by the Sieve of Eratosthenes When Factoring. CoRR abs/2406.09150 (2024)- 2022
- [i10]Cathal O'Sullivan, Jonathan P. Sorenson, Aryn Stahl:
An Algorithm to Find Sums of Consecutive Powers of Primes. CoRR abs/2204.10930 (2022) - [i9]Chloe Makdad, Jonathan P. Sorenson:
An Algorithm for Ennola's Second Theorem and Counting Smooth Numbers in Practice. CoRR abs/2208.01725 (2022) - 2020
- [j20]Jonathan P. Sorenson
, Jonathan E. Webster:
Two algorithms to find primes in patterns. Math. Comput. 89(324): 1953-1968 (2020)
2010 – 2019
- 2019
- [i8]Brianna Sorenson, Jonathan P. Sorenson, Jonathan E. Webster:
An Algorithm and Estimates for the Erdős-Selfridge Function (work in progress). CoRR abs/1907.08559 (2019) - 2018
- [i7]Jonathan P. Sorenson, Jonathan E. Webster:
Two Algorithms to Find Primes in Patterns. CoRR abs/1807.08777 (2018) - 2017
- [j19]Jonathan Sorenson, Jonathan E. Webster:
Strong pseudoprimes to twelve prime bases. Math. Comput. 86(304): 985-1003 (2017) - 2016
- [j18]Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan Sorenson:
Near-optimal online multiselection in internal and external memory. J. Discrete Algorithms 36: 3-17 (2016) - 2015
- [j17]Jonathan P. Sorenson:
Two compact incremental prime sieves. LMS J. Comput. Math. 18(1): 675-683 (2015) - [c11]Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson:
Dynamic Online Multiselection in Internal and External Memory. WALCOM 2015: 199-209 - [i6]Jonathan P. Sorenson:
Two Compact Incremental Prime Sieves. CoRR abs/1503.02592 (2015) - [i5]Jonathan P. Sorenson, Jonathan E. Webster:
Strong Pseudoprimes to Twelve Prime Bases. CoRR abs/1509.00864 (2015) - 2013
- [c10]Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson:
Theory and Implementation of Online Multiselection Algorithms. ESA 2013: 109-120 - [c9]Eric Bach, Jonathan P. Sorenson:
Approximately counting semismooth integers. ISSAC 2013: 23-30 - [i4]Eric Bach, Jonathan P. Sorenson:
Approximately counting semismooth integers. CoRR abs/1301.5293 (2013) - 2012
- [i3]Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao, Jonathan P. Sorenson:
Competitive Online Selection in Main and External Memory. CoRR abs/1206.5336 (2012) - 2010
- [j16]Jonathan P. Sorenson:
A randomized sublinear time parallel GCD algorithm for the EREW PRAM. Inf. Process. Lett. 110(5): 198-201 (2010) - [c8]Jonathan P. Sorenson:
Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures. ANTS 2010: 331-339
2000 – 2009
- 2009
- [j15]Eric Bach, Dominic Klyve, Jonathan P. Sorenson:
Computing prime harmonic sums. Math. Comput. 78(268): 2283-2305 (2009) - [i2]Jonathan P. Sorenson:
A Sublinear Time Parallel GCD Algorithm for the EREW PRAM. CoRR abs/0907.0718 (2009) - [i1]Ankur Gupta, Anna Kispert, Jonathan P. Sorenson:
Online Sorting via Searching and Selection. CoRR abs/0907.1295 (2009) - 2007
- [j14]Daniel J. Bernstein, Jonathan P. Sorenson:
Modular exponentiation via the explicit Chinese remainder theorem. Math. Comput. 76(257): 443-454 (2007) - 2006
- [c7]Scott T. Parsell, Jonathan Sorenson:
Fast Bounds on the Distribution of Smooth Numbers. ANTS 2006: 168-181 - [c6]Jonathan Sorenson:
The Pseudosquares Prime Sieve. ANTS 2006: 193-207 - 2005
- [j13]Jonathan P. Sorenson:
An honors course on Alan M. Turing. ACM SIGCSE Bull. 37(4): 103-106 (2005) - 2000
- [c5]Jonathan Sorenson:
A Fast Algorithm for Appoximately Counting Smooth Numbers. ANTS 2000: 539-550
1990 – 1999
- 1998
- [j12]Shawna Meyer Eikenberry, Jonathan Sorenson:
Efficient Algorithms for Computing the Jacobi Symbol. J. Symb. Comput. 26(4): 509-523 (1998) - [c4]Jonathan Sorenson:
Trading Time for Space in Prime Number Sieves. ANTS 1998: 179-195 - 1997
- [j11]Valerie Piehl, Jonathan Sorenson, Neil Tiedeman:
Genetic algorithms for the extended GCD problem (work in progress). SIGSAM Bull. 31(3): 34-35 (1997) - [j10]Simon Hunter, Jonathan Sorenson:
Approximating the number of integers free of large prime factors. Math. Comput. 66(220): 1729-1741 (1997) - 1996
- [j9]Brian Dunten, Julie Jones, Jonathan Sorenson:
A Space-Efficient Fast Prime Number Sieve. Inf. Process. Lett. 59(2): 79-84 (1996) - [j8]Eric Bach, Jonathan P. Sorenson:
Explicit bounds for primes in residue classes. Math. Comput. 65(216): 1717-1735 (1996) - [c3]Shawna Meyer Eikenberry, Jonathan Sorenson:
Efficient Algorithms for Computing the Jacobi Symbol. ANTS 1996: 225-239 - 1995
- [j7]Carl Pomerance, Jonathan P. Sorenson:
Counting the Integers Factorable via Cyclotomic Methods. J. Algorithms 19(2): 250-265 (1995) - [c2]Jonathan Sorenson:
An Analysis of Lehmer's Euclidean GCD Algorithm. ISSAC 1995: 254-258 - 1994
- [j6]Jonathan Sorenson:
Polylog Depth Circuits for Integer Factoring and Discrete Logarithms. Inf. Comput. 110(1): 1-18 (1994) - [j5]Jonathan Sorenson, Ian Parberry:
Two Fast Parallel Prime Number Sieves. Inf. Comput. 114(1): 115-130 (1994) - [j4]Jonathan Sorenson:
Two Fast GCD Algorithms. J. Algorithms 16(1): 110-144 (1994) - [j3]Jeffrey O. Shallit, Jonathan P. Sorenson:
Analysis of a Left-Shift Binary GCD Algorithm. J. Symb. Comput. 17(6): 473-486 (1994) - [c1]Jeffrey O. Shallit, Jonathan P. Sorenson:
Analysis of a left-shift binary GCD algorithm. ANTS 1994: 169-183 - 1993
- [j2]Eric Bach, Jonathan P. Sorenson:
Sieve Algorithms for Perfect Power Testing. Algorithmica 9(4): 313-328 (1993) - [j1]Jeffrey O. Shallit, Jonathan Sorenson:
A binary algorithm for the Jacobi symbol. SIGSAM Bull. 27(1): 4-11 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-10 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
