The following pages link to Jonathan P. Sorenson (Q991751):
Displaying 8 items.
- A randomized sublinear time parallel GCD algorithm for the EREW PRAM (Q991752) (← 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)
- Two Fast GCD Algorithms (Q4289843) (← 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)
