1. ANTS 1994: Ithaca, NY, USA

• W. R. Alford, Andrew Granville, Carl Pomerance:
  On the difficulty of finding reliable witnesses. 1-16
  
• Wieb Bosma, Peter Stevenhagen:
  Density computations for real quadratic 2-class groups. 17
  
• Roger A. Golliver, Arjen K. Lenstra, Kevin S. McCurley:
  Lattice sieving and trial division. 18-27
  
• Leonard M. Adleman, Jonathan DeMarrais, Ming-Deh A. Huang:
  A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields. 28-40
  
• Bruce Dodson, Matthew Haines:
  Computing rates of growth of division fields on CM abelian varieties. 41
  
• Sachar Paulus:
  Algorithms for CM-fields. 42
  
• Jean Marc Couveignes, François Morain:
  Schoof's algorithm and isogeny cycles. 43-58
  
• Nelson Stephens:
  Integer points on rational elliptic curves. 59
  
• Frank Lehmann, Markus Maurer, Volker Müller, Victor Shoup:
  Counting the number of points on elliptic curves over finite fields of characteristic greater than three. 60-70
  
• Richard J. Lipton:
  Straight-line complexity and integer factorization. 71-79
  
• Dexter Kozen, Susan Landau, Richard Zippel:
  Decomposition of algebraic functions. 80-92
  
• Ronitt Rubinfeld, Richard Zippel:
  A new modular interpolation algorithm for factoring multivariate polynominals. 93-107
  
• Leonard M. Adleman:
  The function field sieve. 108-121
  
• Noam D. Elkies:
  Heegner point computations. 122-133
  
• John Cremona:
  Computing the degree of a modular parametrization. 134-142
  
• Mark McConnell:
  Galois representations from the cohomology of SL(3, Z). 143
  
• Hervé Daudé, Philippe Flajolet, Brigitte Vallée:
  An analysis of the Gaussian algorithm for lattice reduction. 144-158
  
• Michael Kaib:
  A fast variant of the Gaussian reduction algorithm. 159
  
• Johannes Buchmann:
  Reducing lattice bases by means of approximations. 160-168
  
• Jeffrey Shallit, Jonathan P. Sorenson:
  Analysis of a left-shift binary GCD algorithm. 169-183
  
• Bohdan S. Majewski, George Havas:
  The complexity of greatest common divisor computations. 184-193
  
• Alfred J. van der Poorten:
  Explicit formulas for units in certain quadratic number fields. 194-208
  
• Sergei Evdokimov:
  Factorization of polynominals over finite fields in subexponential time under GRH. 209-219
  
• Shuhong Gao, Scott A. Vanstone:
  On orders of optimal normal basis generators. 220
  
• Emil Volcheck:
  Computing in the jacobian of a plane algebraic curve. 221-233
  
• Christoph Thiel:
  Under the assumption of the generalized Riemann Hyothesis verifying the class number belongs to NPcapCo-NP. 234-247
  
• Farshid Hajir:
  Calculating the class number of certain Hilbert class fields. 248
  
• Leonard M. Adleman, Ming-Deh A. Huang, Kireeti Kompella:
  Efficient checking of computations in number theory. 249
  
• Georg-Johann Lay, Horst Günter Zimmer:
  Constructing elliptic curves with given group order over large finite fields. 250-263
  
• Marc Deléglise, Joël Rivat: Computing pi(x), M(x) and Psi(x). 264
• Igor Shparlinski:
  On some applications of finitely generated semi-groups. 265-279
  
• Paul Pritchard:
  Improved incremental prime number sieves. 280-288
  
• Peter W. Shor:
  Polynominal time algorithms for discrete logarithms and factoring on a quantum computer. 289
  
• Guangheng Ji, Hongwen Lu:
  On dispersion and Markov constants. 290
  
• Leonard M. Adleman, Kevin S. McCurley:
  Open problems in number theoretic complexity, II. 291-322
  

Last update Fri May 24 00:03:38 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page