Jonathan Sorenson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2017

Strong pseudoprimes to twelve prime basesJonathan Sorenson, Jonathan Webster. moc, 86(304):985-1003, 2017. [doi]

2016

Near-optimal online multiselection in internal and external memoryJérémy Barbay, Ankur Gupta, Srinivasa Rao Satti, Jonathan Sorenson. jda, 36:3-17, 2016. [doi]

2006

Fast Bounds on the Distribution of Smooth NumbersScott T. Parsell, Jonathan Sorenson. antsw 2006: 168-181 [doi]

The Pseudosquares Prime SieveJonathan Sorenson. antsw 2006: 193-207 [doi]

2000

A Fast Algorithm for Appoximately Counting Smooth NumbersJonathan Sorenson. antsw 2000: 539-550

1998

Efficient Algorithms for Computing the Jacobi SymbolShawna Meyer Eikenberry, Jonathan Sorenson. JSC, 26(4):509-523, 1998.

Trading Time for Space in Prime Number SievesJonathan Sorenson. antsw 1998: 179-195 [doi]

1997

Approximating the number of integers free of large prime factorsSimon Hunter, Jonathan Sorenson. moc, 66(220):1729-1741, 1997.

Genetic algorithms for the extended GCD problem (work in progress)Valerie Piehl, Jonathan Sorenson, Neil Tiedeman. cca, 31(3):34-35, 1997. [doi]

1996

Explicit bounds for primes in residue classesEric Bach, Jonathan Sorenson. moc, 65(216):1717-1735, 1996.

A Space-Efficient Fast Prime Number SieveBrian Dunten, Julie Jones, Jonathan Sorenson. ipl, 59(2):79-84, 1996. [doi]

Efficient Algorithms for Computing the Jacobi SymbolShawna Meyer Eikenberry, Jonathan Sorenson. antsw 1996: 225-239

1995

Counting the Integers Factorable via Cyclotomic MethodsCarl Pomerance, Jonathan Sorenson. jal, 19(2):250-265, 1995.

An Analysis of Lehmer s Euclidean GCD AlgorithmJonathan Sorenson. issac 1995: 254-258 [doi]

1994

Analysis of a Left-Shift Binary GCD AlgorithmJeffrey Shallit, Jonathan Sorenson. JSC, 17(6):473-486, 1994.

Analysis of a left-shift binary GCD algorithmJeffrey Shallit, Jonathan Sorenson. antsw 1994: 169-183

Polylog Depth Circuits for Integer Factoring and Discrete LogarithmsJonathan Sorenson. iandc, 110(1):1-18, April 1994.

Two Fast Parallel Prime Number SievesJonathan Sorenson, Ian Parberry. iandc, 114(1):115-130, October 1994.

Two Fast GCD AlgorithmsJonathan Sorenson. jal, 16(1):110-144, 1994.

1993

Sieve Algorithms for Perfect Power TestingEric Bach, Jonathan Sorenson. algorithmica, 9(4):313-328, 1993.

A binary algorithm for the Jacobi symbolJeffrey Shallit, Jonathan Sorenson. cca, 27(1):4-11, 1993. [doi]

Sign in or sign up to see more results.

runs on WebDSL