16 citations · 43 across the 10 of their papers we have counts for
5 papers · 1 filter
Two Compact Incremental Prime Sieves
Jonathan P. Sorenson
A prime sieve is an algorithm that finds the primes up to a bound . We say that a prime sieve is incremental, if it can quickly determine if is prime after having found al…
Approximately counting semismooth integers
Eric Bach, Jonathan Sorenson
An integer is -semismooth if where is an integer with all prime divisors and is 1 or a prime . arge quantities of semismooth integers are u…
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…
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…
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…