Jonathan P. Sorenson

29 papers A 1B 2Journal 24Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Analysis of Algorithms for Moser's Problems on Sums of Consecutive Primes.
CoRR
Jonathan P. Sorenson, Eleanor Waiss
2025 J jnl
Explicit Bounds and Parallel Algorithms for Counting Multiply Gleeful Numbers.
CoRR
Sara Moore, Jonathan P. Sorenson
2025 J jnl
Reducing the space used by the sieve of Eratosthenes when factoring.
Inf. Process. Lett.
Samuel Hartman, Jonathan P. Sorenson
2024 J jnl
Reducing the Space Used by the Sieve of Eratosthenes When Factoring.
CoRR
Samuel Hartman, Jonathan P. Sorenson
2022 J jnl
An Algorithm for Ennola's Second Theorem and Counting Smooth Numbers in Practice.
CoRR
Chloe Makdad, Jonathan P. Sorenson
2022 J jnl
An Algorithm to Find Sums of Consecutive Powers of Primes.
CoRR
Cathal O'Sullivan, Jonathan P. Sorenson, Aryn Stahl
2020 J jnl
Two algorithms to find primes in patterns.
Math. Comput.
Jonathan P. Sorenson, Jonathan E. Webster
2019 J jnl
An Algorithm and Estimates for the Erdős-Selfridge Function (work in progress).
CoRR
Brianna Sorenson, Jonathan P. Sorenson, Jonathan E. Webster
2018 J jnl
Two Algorithms to Find Primes in Patterns.
CoRR
Jonathan P. Sorenson, Jonathan E. Webster
2015 B conf
Dynamic Online Multiselection in Internal and External Memory.
WALCOM
Jérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan P. Sorenson
2015 J jnl
Strong Pseudoprimes to Twelve Prime Bases.
CoRR
Jonathan P. Sorenson, Jonathan E. Webster
2015 J jnl
Two Compact Incremental Prime Sieves.
CoRR
Jonathan P. Sorenson
2015 J jnl
Two compact incremental prime sieves.
LMS J. Comput. Math.
Jonathan P. Sorenson
2013 J jnl
Approximately counting semismooth integers
CoRR
Eric Bach, Jonathan P. Sorenson
2013 B conf
Approximately counting semismooth integers.
ISSAC
Eric Bach, Jonathan P. Sorenson
2013 A conf
Theory and Implementation of Online Multiselection Algorithms.
ESA
Jérémy Barbay, Ankur Gupta, Seungbum Jo, Srinivasa Rao Satti, Jonathan P. Sorenson
2012 J jnl
Competitive Online Selection in Main and External Memory
CoRR
Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao, Jonathan P. Sorenson
2010 J jnl
A randomized sublinear time parallel GCD algorithm for the EREW PRAM.
Inf. Process. Lett.
Jonathan P. Sorenson
2010 — conf
Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures.
ANTS
Jonathan P. Sorenson
2009 J jnl
A Sublinear Time Parallel GCD Algorithm for the EREW PRAM
CoRR
Jonathan P. Sorenson
2009 J jnl
Computing prime harmonic sums.
Math. Comput.
Eric Bach, Dominic Klyve, Jonathan P. Sorenson
2009 J jnl
Online Sorting via Searching and Selection
CoRR
Ankur Gupta, Anna Kispert, Jonathan P. Sorenson
2007 J jnl
Modular exponentiation via the explicit Chinese remainder theorem.
Math. Comput.
Daniel J. Bernstein, Jonathan P. Sorenson
2005 J jnl
An honors course on Alan M. Turing.
ACM SIGCSE Bull.
Jonathan P. Sorenson
1996 J jnl
Explicit bounds for primes in residue classes.
Math. Comput.
Eric Bach, Jonathan P. Sorenson
1995 J jnl
Counting the Integers Factorable via Cyclotomic Methods.
J. Algorithms
Carl Pomerance, Jonathan P. Sorenson
1994 J jnl
Analysis of a Left-Shift Binary GCD Algorithm.
J. Symb. Comput.
Jeffrey O. Shallit, Jonathan P. Sorenson
1994 — conf
Analysis of a left-shift binary GCD algorithm.
ANTS
Jeffrey O. Shallit, Jonathan P. Sorenson
1993 J jnl
Sieve Algorithms for Perfect Power Testing.
Algorithmica
Eric Bach, Jonathan P. Sorenson