default search action
2nd ANTS 1996: Talence, France
- Henri Cohen:
Algorithmic Number Theory, Second International Symposium, ANTS-II, Talence, France, May 18-23, 1996, Proceedings. Lecture Notes in Computer Science 1122, Springer 1996, ISBN 3-540-61581-4 - Leonard M. Adleman, Ming-Deh A. Huang:
Counting Rational Points on Curves and Abelian Varieties over Finite Fields. 1-16 - Karim Belabas:
Computing Cubic Fields in Quasi-Linear Time. 17-25 - Daniel J. Bernstein:
Fast Ideal Artithmetic via Lazy Localization. 27-34 - 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. 35-47 - Henri Cohen, Francisco Diaz y Diaz, Michel Olivier:
Computing Ray Class Groups, Conductors and Discriminants. 49-57 - Jean Marc Couveignes
:
Computing l-Isogenies Using the p-Torsion. 59-65 - Mario Daberkow, Michael Pohst:
On Computing Hilbert Class Fields of Prime Degree. 67-74 - Thomas F. Denny, Volker Müller:
On the Reduction of Composes Relations from the Number Field Sieve. 75-90 - David S. Dummit, David R. Hayes:
Checking the p-adic Stark Conjecture When p Is Archimedean. 91-97 - R. Marije Elkenbracht-Huizing:
A Multiple Polynominal General Number Field Sieve. 99-114 - Stéfane Fermigier
Construction of High-Rank Elliptic Curves over Q and Q(t) with Non-Trivial 2-Torsion. 115-120 - Bríd ní Fhlathúin:
The Height on an Abelian Variety. 121-131 - Claus Fieker, Michael Pohst:
On Lattices over Number Fields. 133-139 - David Ford:
Minimum Discriminants of Primitive Sextic Fields. 141-143 - David Ford, George Havas:
A New Algorithm and Refined Bounds for Extended Gcd Computation. 145-150 - István Gaál:
Application ot Thue Equations to Computing Power Integral Bases in Algebraic Number Fields. 151-155 - Josef Gebel, Attila Pethö, Horst Günter Zimmer:
Computing S-Integral Points on Elliptic Curves. 157-171 - Mark Giesbrecht:
Probabilistic Computation of the Smith Normal Form of a Sparse Integer Matrix. 173-186 - Kristin E. Lauter:
Ray Class Field Constructions of Curves over Finite Fields with Many Rational Points. 187-195 - Reynald Lercier:
Computing Isogenies in F2n. 197-212 - Stéphane Louboutin:
A Computational Technique for Determining Relative Class Numbers of CM-Fields. 213-216 - James McKee, Richard Pinch:
Old and New Deterministic Factoring Algorithms. 217-224 - Shawna Meyer Eikenberry, Jonathan Sorenson
Efficient Algorithms for Computing the Jacobi Symbol. 225-239 - Gerhard Niklasch:
The Number Field Database on the World Wide Web Server. 241-242 - Sachar Paulus:
An Algorithm of Subexponential Type Computing the Class Group of Quadratic Orders over Principal Ideal Domains. 243-257 - Michael Pohst:
Computational Aspects of Kummer Theory. 259-272 - Michael Pohst, Martin Schörnig:
On Integral Basis Reduction in Global Function Fields. 273-282 - Bjorn Poonen
Computational Aspects of Curves of Genus at Least 2. 283-306 - Carsten Rössner, Jean-Pierre Seifert:
The Complexity of Approximate Optima for Greatest Common Divisor Computations. 307-322 - Renate Scheidler
Compact Representation in Real Quadratic Congruence Function Fields. 323-336 - Oliver Schirokauer, Damian Weber, Thomas F. Denny:
Discrete Logarithms: The Effectiveness of the Index Calculus Method. 337-361 - Nigel P. Smart:
How Difficult Is It to Solve a Thue Equation? 363-373 - Andreas Stein:
Elliptic Congruence Function Fields. 375-384 - Michael A. Tsfasman:
Algebraic Geometry Lattices and Codes. 385-389 - Damian Weber:
Computing Discrete Logarithms with the General Number Field Sieve. 391-403
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: