AMS Meeting Program by Special Session
Current as of Tuesday, April 12, 2005 15:08:35
1989 Summer Meeting
Boulder, CO, August 7-10, 1989
Meeting #850
Associate secretaries: Andy R Magid, AMS amagid@ou.edu
Kenneth A Ross, MAA ross@math.uoregon.edu
AMS Special Session on Computational Number Theory and Applications
-
Tuesday August 8, 1989, 7:00 a.m.-8:50 a.m.
AMS Special Session on Computational Number Theory and Applications, I
-
7:00 a.m.
The self-initializing quadratic sieve.
Carl Pomerance*, University of Georgia
(850-11-58) -
7:30 a.m.
Design of an FFT continuation to the ECM method of factorization.
Peter L. Montgomery*, University of California, Los Angeles
(850-11-25) -
8:00 a.m.
Factorization of integers.
Samuel S. Wagstaff, Jr.*, Purdue University, West Lafayette
(850-11-71) -
8:30 a.m.
Factoring by electronic mail.
Arjen K. Lenstra*, University of Chicago
(850-11-56)
-
7:00 a.m.
-
Wednesday August 9, 1989, 7:00 a.m.-8:50 a.m.
AMS Special Session on Computational Number Theory and Applications, II
-
7:00 a.m.
Some new computational results on Warings problem.
Marvin Wunderlich*, National Security Agency, Fort George G. Meade, Maryland
Jeffrey Kabina, National Security Agency, Fort George G. Meade, Maryland
(850-11-81) -
7:30 a.m.
Residual methods for computing the Hermite normal form.
Paul D. Domich*, National Institute of Standards & Technology, Boulder, Colorado
(850-11-57) -
8:00 a.m.
Construction of special points for the Riemann zeta function.
A. M. Odlyzko*, AT&T Bell Laboratories, Murray Hill, New Jersey
(850-11-60) -
8:30 a.m.
Computing the Mordell-Weil rank of curves of genus 2.
Dan Gordon*, University of Georgia
David Grant, University of Colorado, Boulder
(850-11-48)
-
7:00 a.m.
-
Wednesday August 9, 1989, 1:25 p.m.-3:15 p.m.
AMS Special Session on Computational Number Theory and Applications, III
-
1:25 p.m.
Figures of merit for digital multistep pseudorandom numbers.
Debra A. Andr\'e, Pennsylvania State University, University Park
Gary L. Mullen*, Pennsylvania State University, University Park
Harald Niederreiter, Austrian Academy of Sciences, Austria
(850-11-37) -
1:55 p.m.
Geodesic multidimensional continued fractions.
Jeffrey C. Lagarias*, AT&T Bell Laboratories, Murray Hill, New Jersey
(850-11-09) -
2:25 p.m.
On the worst-case complexity of three algorithms for computing the Jacobi symbol.
Jeffrey Shallit*, Dartmouth College
(850-11-59) -
2:55 p.m.
Dihedral cubic approximations and series for pi and Cohen-Lenstra heuristics for class groups.
Daniel Shanks*, University of Maryland, College Park
(850-11-44)
-
1:25 p.m.
-
Thursday August 10, 1989, 7:00 a.m.-8:50 a.m.
AMS Special Session on Computational Number Theory and Applications, IV
-
7:00 a.m.
Subexponential class number algorithms.
Johannes Buchmann*, Universit\"at des Saarlandes, Federal Republic of Germany
(850-11-78) -
7:30 a.m.
An open architecture number sieve.
H. C. Williams*, University of Manitoba
(850-11-07) -
8:00 a.m.
Program checkers for modular exponentiation.
Kireeti Kompella*, University of Southern California
(850-11-79) -
8:30 a.m.
Practical zero-knowledge proofs: Giving hints and using deficiencies.
Joan Boyar*, University of Chicago
Katalin Friedl, University of Chicago
Carsten Lund, University of Chicago
(850-68-08)
-
7:00 a.m.
-
Thursday August 10, 1989, 3:00 p.m.-4:50 p.m.
AMS Special Session on Computational Number Theory and Applications, V
-
3:00 p.m.
Simplification of nested radicals.
Susan Landau*, Wesleyan University
(850-12-06) -
3:30 p.m.
Deterministic factorization of polynomials over special finite fields.
Eric Bach*, University of Wisconsin, Madison
(850-12-70) -
4:00 p.m.
On the deterministic complexity of factoring polynomials over finite fields.
Victor Shoup*, University of Wisconsin, Madison
(850-12-55) -
4:30 p.m.
Some alternate strategies for generating irreducible polynomials over finite fields.
Gove Effinger*, Skidmore College
(850-12-05)
-
3:00 p.m.