The SCEAS System
Navigation Menu

Conferences in DBLP

Algorithmic Number Theory Symposium (ANTS) (ants)
1996 (conf/ants/1996)

  1. Leonard M. Adleman, Ming-Deh A. Huang
    Counting Rational Points on Curves and Abelian Varieties over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:1-16 [Conf]
  2. Karim Belabas
    Computing Cubic Fields in Quasi-Linear Time. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:17-25 [Conf]
  3. Daniel J. Bernstein
    Fast Ideal Artithmetic via Lazy Localization. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:27-34 [Conf]
  4. Richard P. Brent, Alfred J. van der Poorten, Herman J. J. te Riele
    A Comparative Study of Algorithms for Computing Continued Fractions of Algebraic Numbers. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:35-47 [Conf]
  5. Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
    Computing Ray Class Groups, Conductors and Discriminants. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:49-57 [Conf]
  6. Jean Marc Couveignes
    Computing l-Isogenies Using the p-Torsion. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:59-65 [Conf]
  7. Mario Daberkow, Michael Pohst
    On Computing Hilbert Class Fields of Prime Degree. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:67-74 [Conf]
  8. Thomas F. Denny, Volker Müller
    On the Reduction of Composes Relations from the Number Field Sieve. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:75-90 [Conf]
  9. David S. Dummit, David R. Hayes
    Checking the p-adic Stark Conjecture When p Is Archimedean. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:91-97 [Conf]
  10. R. Marije Elkenbracht-Huizing
    A Multiple Polynominal General Number Field Sieve. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:99-114 [Conf]
  11. Stéfane Fermigier
    Construction of High-Rank Elliptic Curves over Q and Q(t) with Non-Trivial 2-Torsion. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:115-120 [Conf]
  12. Bríd ní Fhlathúin
    The Height on an Abelian Variety. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:121-131 [Conf]
  13. Claus Fieker, Michael Pohst
    On Lattices over Number Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:133-139 [Conf]
  14. David Ford
    Minimum Discriminants of Primitive Sextic Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:141-143 [Conf]
  15. David Ford, George Havas
    A New Algorithm and Refined Bounds for Extended Gcd Computation. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:145-150 [Conf]
  16. István Gaál
    Application ot Thue Equations to Computing Power Integral Bases in Algebraic Number Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:151-155 [Conf]
  17. Josef Gebel, Attila Pethö, Horst Günter Zimmer
    Computing S-Integral Points on Elliptic Curves. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:157-171 [Conf]
  18. Mark Giesbrecht
    Probabilistic Computation of the Smith Normal Form of a Sparse Integer Matrix. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:173-186 [Conf]
  19. Kristin Lauter
    Ray Class Field Constructions of Curves over Finite Fields with Many Rational Points. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:187-195 [Conf]
  20. Reynald Lercier
    Computing Isogenies in F2n. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:197-212 [Conf]
  21. Stéphane Louboutin
    A Computational Technique for Determining Relative Class Numbers of CM-Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:213-216 [Conf]
  22. James McKee, Richard Pinch
    Old and New Deterministic Factoring Algorithms. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:217-224 [Conf]
  23. Shawna Meyer Eikenberry, Jonathan Sorenson
    Efficient Algorithms for Computing the Jacobi Symbol. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:225-239 [Conf]
  24. Gerhard Niklasch
    The Number Field Database on the World Wide Web Server. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:241-242 [Conf]
  25. Sachar Paulus
    An Algorithm of Subexponential Type Computing the Class Group of Quadratic Orders over Principal Ideal Domains. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:243-257 [Conf]
  26. Michael Pohst
    Computational Aspects of Kummer Theory. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:259-272 [Conf]
  27. Michael Pohst, M. Schörnig
    On Integral Basis Reduction in Global Function Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:273-282 [Conf]
  28. Bjorn Poonen
    Computational Aspects of Curves of Genus at Least 2. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:283-306 [Conf]
  29. Carsten Rössner, Jean-Pierre Seifert
    The Complexity of Approximate Optima for Greatest Common Divisor Computations. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:307-322 [Conf]
  30. Renate Scheidler
    Compact Representation in Real Quadratic Congruence Function Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:323-336 [Conf]
  31. Oliver Schirokauer, Damian Weber, Thomas F. Denny
    Discrete Logarithms: The Effectiveness of the Index Calculus Method. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:337-361 [Conf]
  32. Nigel P. Smart
    How Difficult Is It to Solve a Thue Equation? [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:363-373 [Conf]
  33. Andreas Stein
    Elliptic Congruence Function Fields. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:375-384 [Conf]
  34. Michael A. Tsfasman
    Algebraic Geometry Lattices and Codes. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:385-389 [Conf]
  35. Damian Weber
    Computing Discrete Logarithms with the General Number Field Sieve. [Citation Graph (0, 0)][DBLP]
    ANTS, 1996, pp:391-403 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002