The following pages link to Jonathan P. Sorenson (Q991751):
Displaying 46 items.
- (Q671384) (redirect page) (← links)
- A space-efficient fast prime number sieve (Q671385) (← links)
- A randomized sublinear time parallel GCD algorithm for the EREW PRAM (Q991752) (← links)
- (Q1126835) (redirect page) (← links)
- Worst-case complexity, average-case complexity and lattice problems (Q1126836) (← links)
- Efficient algorithms for computing the Jacobi symbol (Q1269754) (← links)
- Polylog depth circuits for integer factoring and discrete logarithms (Q1322462) (← links)
- Two fast parallel prime number sieves (Q1336051) (← links)
- Analysis of a left-shift binary GCD algorithm (Q1338738) (← links)
- Factorization properties of lattices over the integers (Q1345515) (← links)
- A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers (Q1895406) (← links)
- Building pseudoprimes with a large number of prime factors (Q1919698) (← links)
- Sieve algorithms for perfect power testing (Q2366224) (← links)
- Near-optimal online multiselection in internal and external memory (Q2634712) (← links)
- (Q2739472) (← links)
- An Implementation of the Number Field Sieve (Q2785383) (← links)
- On primes recognizable in deterministic polynomial time (Q2785582) (← links)
- Theory and Implementation of Online Multiselection Algorithms (Q2849301) (← links)
- Strong pseudoprimes to twelve prime bases (Q2953216) (← links)
- Approximately counting semismooth integers (Q2963209) (← links)
- Computing prime harmonic sums (Q3055200) (← links)
- Modular exponentiation via the explicit Chinese remainder theorem (Q3420440) (← links)
- Two compact incremental prime sieves (Q3449789) (← links)
- (Q3840160) (← links)
- (Q4227305) (← links)
- Two Fast GCD Algorithms (Q4289843) (← links)
- (Q4325958) (← links)
- Approximating the number of integers free of large prime factors (Q4372649) (← links)
- (Q4375616) (← links)
- (Q4664856) (← links)
- Explicit bounds for primes in residue classes (Q4718418) (← links)
- Counting the Integers Factorable via Cyclotomic Methods (Q4845851) (← links)
- (Q4847927) (← links)
- Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures (Q4931658) (← links)
- Two algorithms to find primes in patterns (Q4960081) (← links)
- Dynamic Online Multiselection in Internal and External Memory (Q5176584) (← links)
- An algorithm and estimates for the Erdős–Selfridge function (Q5853810) (← links)
- Algorithmic Number Theory (Q5899249) (← links)
- Algorithmic Number Theory (Q5899251) (← links)
- Preface (Q6165851) (← links)
- An Algorithm to Find Sums of Powers of Consecutive Primes (Q6507812) (← links)
- An algorithm and computation to verify Legendre's Conjecture up to $3.33\cdot10^{13}$ (Q6518787) (← links)
- Algorithms and bounds on the sums of powers of consecutive primes (Q6542789) (← links)
- An algorithm and computation to verify Legendre's conjecture up to \(7\cdot 10^{13}\) (Q6653358) (← links)
- Computation of the least primitive root (Q6657195) (← links)
- Reducing the space used by the sieve of Eratosthenes when factoring (Q6663527) (← links)
