Butler University

output

19942026

most citedNatural Wormholes as Gravitational Lenses

270 citations

Showing cs.DSShow all

6 papers · 1 filter

cs.DS2024

Reducing the Space Used by the Sieve of Eratosthenes When Factoring

Samuel Hartman, Jonathan P. Sorenson

We present a version of the sieve of Eratosthenes that can factor all integers $\leq x$ in $O (x lo g lo g x)$ arithmetic operations using at most $O (x / lo g lo g x)$ bits of spa…

cs.DS2015★ 7 cited

Two Compact Incremental Prime Sieves

Jonathan P. Sorenson

A prime sieve is an algorithm that finds the primes up to a bound $n$ . We say that a prime sieve is incremental, if it can quickly determine if $n + 1$ is prime after having found al…

cs.DS2013★ 2 cited

Approximately counting semismooth integers

Eric Bach, Jonathan Sorenson

An integer $n$ is $(y, z)$ -semismooth if $n = p m$ where $m$ is an integer with all prime divisors $\leq y$ and $p$ is 1 or a prime $\leq z$ . arge quantities of semismooth integers are u…

cs.DS2012★ 7 cited

Near-Optimal Online Multiselection in Internal and External Memory

Jérémy Barbay, Ankur Gupta, S. Srinivasa Rao +1

We introduce an online version of the multiselection problem, in which q selection queries are requested on an unsorted array of n elements. We provide the first online algorithm t…

cs.DS2009

Online Sorting via Searching and Selection

Ankur Gupta, Anna Kispert, Jonathan P. Sorenson

In this paper, we present a framework based on a simple data structure and parameterized algorithms for the problems of finding items in an unsorted list of linearly ordered items…

cs.DS2009★ 3 cited

A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM

Jonathan P. Sorenson

We present a randomized parallel algorithm that computes the greatest common divisor of two integers of n bits in length with probability 1-o(1) that takes O(n loglog n / log n) ex…