Kevin S. McCurley

Generating author description...

All published works

Action	Title	Year	Authors
+	LaTeX, metadata, and publishing workflows	2023	Joppe W. Bos Kevin S. McCurley
+	Abductive Matching in Question Answering	2017	Kedar Dhamdhere Kevin S. McCurley Mukund Sundararajan Ankur Taly
+	Breaking the Ong-Schnorr-Shamir Signature Scheme for Quadratic Number Fields	2007	Dennis R. Estes Leonard M. Adleman Kireeti Kompella Kevin S. McCurley Gary L. Miller
+	Open problems in number theoretic complexity, II	1994	Leonard M. Adleman Kevin S. McCurley
+	Fast Exponentiation with Precomputation: Algorithms and Lower Bounds	1993	David A. Wilson Daniel M. Gordon Ernest F. Brickell Kevin S. McCurley
+ PDF	Irregularities in the distribution of irreducible polynomials	1993	Kevin S. McCurley
+	Relatively prime values of polynomials	1993	James Lee Hafner Peter Sarnak Kevin S. McCurley
+ PDF	Irregularities in the Distribution of Irreducible Polynomials	1993	Kevin S. McCurley
+	Fast Exponentiation with Precomputation (Extended Abstract).	1992	Ernest F. Brickell Daniel M. Gordon Kevin S. McCurley David B. Wilson
+	Asymptotically Fast Triangularization of Matrices over Rings	1991	James Lee Hafner Kevin S. McCurley
+	On the distribution of running times of certain integer factoring algorithms	1989	James Lee Hafner Kevin S. McCurley
+ PDF	A Rigorous Subexponential Algorithm For Computation of Class Groups	1989	James Lee Hafner Kevin S. McCurley
+ PDF	A rigorous subexponential algorithm for computation of class groups	1989	James Lee Hafner Kevin S. McCurley
+ PDF	Sieving the Positive Integers by Small Primes	1988	D. A. Goldston Kevin S. McCurley
+ PDF	Sieving the positive integers by small primes	1988	D. A. Goldston Kevin S. McCurley
+	Sieving the positive integers by large primes	1988	D. A. Goldston Kevin S. McCurley
+	Solving bivariate quadratic congruences in random polynomial time	1987	Leonard M. Adleman Dennis R. Estes Kevin S. McCurley
+ PDF	Solving Bivariate Quadratic Congruences in Random Polynomial Time	1987	Leonard M. Adleman Dennis R. Estes Kevin S. McCurley
+	Open Problems in Number Theoretic Complexity	1987	Leonard M. Adleman Kevin S. McCurley
+ PDF	The smallest Prime Value of <i>x<sup>n</sup></i> + <i>a</i>	1986	Kevin S. McCurley
+ PDF	Polynomials with no Small Prime Values	1986	Kevin S. McCurley
+	The Least r-Free Number in an Arithmetic Progression	1986	Kevin S. McCurley
+ PDF	Polynomials with no small prime values	1986	Kevin S. McCurley
+ PDF	The least 𝑟-free number in an arithmetic progression	1986	Kevin S. McCurley
+	An effective seven cube theorem	1984	Kevin S. McCurley
+	Explicit zero-free regions for Dirichlet L-functions	1984	Kevin S. McCurley
+ PDF	Explicit estimates for 𝜃(𝑥;3,𝑙) and 𝜓(𝑥;3,𝑙)	1984	Kevin S. McCurley
+ PDF	Explicit estimates for the error term in the prime number theorem for arithmetic progressions	1984	Kevin S. McCurley
+ PDF	Prime values of polynomials and irreducibility testing	1984	Kevin S. McCurley
+	Explicit Estimates for θ (x; 3, l) and ψ(x; 3, l)	1984	Kevin S. McCurley
+ PDF	Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions	1984	Kevin S. McCurley
+	Constructive elementary estimates for M(x)	1981	Harold G. Diamond Kevin S. McCurley
+	Explicit Estimates for Functions of Primes in Arithmetic Progressions	1981	Kevin S. McCurley
+	Optimization of functions by quasi-random search methods	1979	Harald Niederreiter Kevin S. McCurley

Common Coauthors

Coauthor	Papers Together
James Lee Hafner	5
Leonard M. Adleman	5
Dennis R. Estes	3
Ernest F. Brickell	2
D. A. Goldston	2
Daniel M. Gordon	2
Peter Sarnak	1
Gary L. Miller	1
Ankur Taly	1
D. A. Goldston	1
Harald Niederreiter	1
David A. Wilson	1
Mukund Sundararajan	1
Kireeti Kompella	1
David B. Wilson	1
Harold G. Diamond	1
Joppe W. Bos	1
Kedar Dhamdhere	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	Explicit zero-free regions for Dirichlet L-functions	1984	Kevin S. McCurley	5
+ PDF	The Distribution of Prime Numbers	1933	A. E. Ingham	5
+ PDF	Gauss’ class number problem for imaginary quadratic fields	1985	Dorian Goldfeld	4
+	An exposition of Pollard''s algorithm for quadratic congruences	1984	Jeffrey Shallit	4
+	On Distinguishing Prime Numbers from Composite Numbers	1983	Leonard M. Adleman Carl Pomerance Robert Rumely	4
+ PDF	Sharper bounds for the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥). II	1976	Lowell Schoenfeld	3
+ PDF	Sharper bounds for the Chebyshev functions 𝜃(𝑥) and 𝜓(𝑥)	1975	J. Barkley Rosser Lowell Schoenfeld	3
+	Hermite Normal Form Computation Using Modulo Determinant Arithmetic	1987	Paul D. Domich Ramachandran Kannan L. E. Trotter	3
+ PDF	Prime Numbers and Computer Methods for Factorization	1985	Hans Riesel	3
+	On The Number of Positive Integers ≤ x and Free of Prime Factors > y	1951	N.G. de Bruijn	3
+	Sharper Bounds for the Chebyshev Functions θ(x) and ψ(x)	1975	J. Barkley Rosser Lowell Schoenfeld	3
+ PDF	A probabilistic factorization algorithm with quadratic forms of negative discriminant	1987	Martin Seysen	3
+ PDF	Factoring Integers with Elliptic Curves	1987	H. W. Lenstra	3
+	Complexity questions in number theory	1985	Michael Frumkin	3
+	On the number of positive integers ≦ x and free of prime factors > y	1986	Adolf Hildebrand	3
+ PDF	Factoring polynomials with rational coefficients	1982	A. K. Lenstra H. W. Lenstra László Lovász	3
+	Almost all primes can be quickly certified	1986	S. Goldwasser Joe Kilian	3
+	Multiplicative Number Theory	1980	H. Davenport	3
+ PDF	Asymptotically fast factorization of integers	1981	John D. Dixon	2
+ PDF	On the order of magnitude of the difference between consecutive prime numbers	1936	Harald Cramér	2
+	Explicit Bounds for Some Functions of Prime Numbers	1941	Barkley Rosser	2
+	How to Generate Cryptographically Strong Sequences of Pseudorandom Bits	1984	Manuel Blum Silvio Micali	2
+	On the number of uncancelled elements in the sieve of Eratosthenes	1950	de Ng Dick Bruijn	2
+ PDF	Prime values of polynomials and irreducibility testing	1984	Kevin S. McCurley	2
+ PDF	Polynomial-time algorithms for finding elements of prime order and sylow subgroups	1985	William M. Kantor	2
+	Almost-primes in arithmetic progressions and short intervals	1978	D. R. Heath‐Brown	2
+	The Computational Complexity of Simultaneous Diophantine Approximation Problems	1985	Jeffrey C. Lagarias	2
+	Distribution of Prime Numbers	1972	A. E. Ingham	2
+	Analysis of a simple factorization algorithm	1976	Donald E. Knuth Luis Trabb Pardo	2
+ PDF	A rigorous subexponential algorithm for computation of class groups	1989	James Lee Hafner Kevin S. McCurley	2
+	Asymptotics and Special Functions	1997	F. W. J. Olver	2
+	The Least Quadratic Non Residue	1952	N. C. Ankeny	2
+	Factoring on a Computer	1984	Hywel C Williams	2
+	A miller algorithm for an incomplete bessel function	1981	Riho Terras	2
+	Number-theoretic functions which are equivalent to number of divisors	1985	Jeffrey Shallit Adi Shamir	2
+	Sums of divisors, perfect numbers, and factoring	1984	Eric Bach Gary L. Miller Jeffrey Shallit	2
+	On the calculation of regulators and class numbers of quadratic fields	1982	H. W. Lenstra	2
+	Riemann hypothesis and finding roots over finite fields	1985	M-D A Huang	2
+	Le grand crible dans la théorie analytique des nombres	1974	Enrico Bombieri	2
+	Matrix multiplication via arithmetic progressions	1990	Don Coppersmith S. Winograd	2
+	A note on the least prime in an arithmetic progression	1980	Carl Pomerance	2
+ PDF	A method of factoring and the factorization of 𝐹₇	1975	Michael A. Morrison John Brillhart	2
+	Sieving the positive integers by large primes	1988	D. A. Goldston Kevin S. McCurley	2
+	Über die Zahlen, deren Primteiler einer gegebenen Menge angehören	1956	Eduard Wirsing	2
+ PDF	On integers free of large prime factors	1986	Adolf Hildebrand Gérald Tenenbaum	2
+ PDF	Real roots of Dirichlet 𝐿-series	1949	J. Barkley Rosser	2
+ PDF	Explicit estimates for the error term in the prime number theorem for arithmetic progressions	1984	Kevin S. McCurley	2
+	Solvability by radicals is in polynomial time	1985	Susan Landau Gary L. Miller	2
+	Fast verification, testing, and generation of large primes	1979	David A. Plaisted	2
+	Fast evaluation of logarithms in fields of characteristic two	1984	Don Coppersmith	2