Abstract is missing.
- On the difficulty of finding reliable witnessesW. R. Alford, Andrew Granville, Carl Pomerance. 1-16
- Density computations for real quadratic 2-class groupsWieb Bosma, Peter Stevenhagen. 17
- Lattice sieving and trial divisionRoger A. Golliver, Arjen K. Lenstra, Kevin S. McCurley. 18-27
- A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fieldsLeonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang. 28-40
- Computing rates of growth of division fields on CM abelian varietiesBruce Dodson, Matthew Haines. 41
- Algorithms for CM-fieldsSachar Paulus. 42
- Schoof s algorithm and isogeny cyclesJean Marc Couveignes, François Morain. 43-58
- Integer points on rational elliptic curvesNelson Stephens. 59
- Counting the number of points on elliptic curves over finite fields of characteristic greater than threeFrank Lehmann, Markus Maurer, Volker Müller, Victor Shoup. 60-70
- Straight-line complexity and integer factorizationRichard J. Lipton. 71-79
- Decomposition of algebraic functionsDexter Kozen, Susan Landau, Richard Zippel. 80-92
- A new modular interpolation algorithm for factoring multivariate polynominalsRonitt Rubinfeld, Richard Zippel. 93-107
- The function field sieveLeonard M. Adleman. 108-121
- Heegner point computationsNoam D. Elkies. 122-133
- Computing the degree of a modular parametrizationJohn Cremona. 134-142
- Galois representations from the cohomology of SL(3, Z)Mark McConnell. 143
- An analysis of the Gaussian algorithm for lattice reductionHervé Daudé, Philippe Flajolet, Brigitte Vallée. 144-158
- A fast variant of the Gaussian reduction algorithmMichael Kaib. 159
- Reducing lattice bases by means of approximationsJohannes Buchmann. 160-168
- Analysis of a left-shift binary GCD algorithmJeffrey Shallit, Jonathan Sorenson. 169-183
- The complexity of greatest common divisor computationsBohdan S. Majewski, George Havas. 184-193
- Explicit formulas for units in certain quadratic number fieldsAlfred J. van der Poorten. 194-208
- Factorization of polynominals over finite fields in subexponential time under GRHSergei Evdokimov. 209-219
- On orders of optimal normal basis generatorsShuhong Gao, Scott A. Vanstone. 220
- Computing in the jacobian of a plane algebraic curveEmil Volcheck. 221-233
- Under the assumption of the generalized Riemann Hyothesis verifying the class number belongs to NPcapCo-NPChristoph Thiel. 234-247
- Calculating the class number of certain Hilbert class fieldsFarshid Hajir. 248
- Efficient checking of computations in number theoryLeonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella. 249
- Constructing elliptic curves with given group order over large finite fieldsGeorg-Johann Lay, Horst Günter Zimmer. 250-263
- Computing pi(x), M(x) and Psi(x)Marc Deléglise, Joël Rivat. 264
- On some applications of finitely generated semi-groupsIgor Shparlinski. 265-279
- Improved incremental prime number sievesPaul Pritchard. 280-288
- Polynominal time algorithms for discrete logarithms and factoring on a quantum computerPeter W. Shor. 289
- On dispersion and Markov constantsGuangheng Ji, Hongwen Lu. 290
- Open problems in number theoretic complexity, IILeonard M. Adleman, Kevin S. McCurley. 291-322