Algorithmic Number Theory Symposium

Algorithmic Number Theory Symposium

Algorithmic Number Theory Symposium (ANTS) is an academic conference.

Since their inception in Cornell in 1994, the biennial ANTS meetings have become the premier international forums for the presentation of new research in computational number theory. They are devoted to algorithmic aspects of number theory, including elementary number theory, algebraic number theory, analytic number theory, geometry of numbers, algebraic geometry, finite fields, and cryptography.

Current events

ANTS IX will be held in Nancy, France in 2010 [] .

elfridge Prize

In honour of the many contributions of John Selfridge to mathematics, the Number Theory Foundation has established a prize to be awarded to those individuals who have authored the best paper accepted for presentation at ANTS. The prize, called the Selfridge Prize, will normally be awarded every two years in an even numbered year. The prize winner(s) will receive a cash award and a certificate. The successful paper will be selected by the ANTS Program Committee.

The Selfridge Prize at the ANTS VII meeting was awarded to Werner Bley and Robert Boltje for their paper "Computation of locally free class groups". The Prize at ANTS VIII was awarded to Juliana Belding, Reinier Bröker, Andreas Enge and Kristin Lauter for their paper "Computing Hilbert Class Polynomials".


The refereed Proceedings of ANTS are published in the Springer series Lecture Notes in Computer Science. The Lecture Notes in Computer Science are now also published [ electronically] .


ANTS VIII (2008)

:Dates: 17 - 22 May 2008:Location: Banff Centre (Alberta, Canada):Organizers: Mark Bauer (University of Calgary), Josh Holden (Rose-Hulman Institute of Technology), Mike Jacobson (University of Calgary), Renate Scheidler (University of Calgary) and Jon Sorenson (Butler University):Proceedings: [ LNCS 5011] :Web site: []

ANTS VII (2006)

:Dates: 23 - 28 July 2006:Location: Technische Universität Berlin (Berlin, Germany):Organizers: Florian Heß, Sebastian Pauli, Michael Pohst:Proceedings: [ LNCS 4076] :Web site:

ANTS VI (2004)

:Dates: 13 - 18 June 2004:Location: University of Vermont (Burlington, Vermont, USA):Organizers: Duncan Buell, Jonathan W. Sands, David S. Dummit:Proceedings: [ LNCS 3076] ; [ Poster Abstracts] :Web site:

ANTS V (2002)

:Dates: 7-12 July 2002:Location: University of Sydney (Sydney, Australia):Organizers: John Cannon, Claus Fieker, David Kohel:Proceedings: [ LNCS 2369] :Web site:

ANTS IV (2000)

:Dates: 2-7 July 2000:Location: University of Leiden (Leiden, Netherlands):Organizers: Peter Stevenhagen, Wieb Bosma:Proceedings: [ LNCS 1838] :Web site:

ANTS III (1998)

:Dates: 21-25 June 1998:Location: Reed College (Portland, Oregon, USA):Organizer: Joe Buhler:Proceedings: [ LNCS 1423] :Web site:

ANTS II (1996)

:Dates: 18-23 May 1996:Location: University of Bordeaux (Bordeaux, France):Organizers: Henri Cohen, Michel Olivier:Proceedings: [ LNCS 1122]

ANTS I (1994)

:Dates: 6-9 May 1994:Location: Cornell University (Ithaca, New York, USA):Organizers: Len Adleman, Ming-Deh Huang:Proceedings: LNCS 877 (out of print)

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Discriminant of an algebraic number field — A fundamental domain of the ring of integers of the field K obtained from Q by adjoining a root of x3 − x2 − 2x + 1. This fundamental domain sits inside K ⊗QR. The discriminant of K is 49 = 72.… …   Wikipedia

  • Computational learning theory — In theoretical computer science, computational learning theory is a mathematical field related to the analysis of machine learning algorithms. Contents 1 Overview 2 See also 3 References 3.1 Surveys …   Wikipedia

  • Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… …   Wikipedia

  • Geometric group theory — is an area in mathematics devoted to the study of finitely generated groups via exploring the connections between algebraic properties of such groups and topological and geometric properties of spaces on which these groups act (that is, when the… …   Wikipedia

  • Algorithmische Zahlentheorie — Die algorithmische Zahlentheorie ist ein Teilgebiet der Zahlentheorie, welche wiederum ein Teilgebiet der Mathematik ist. Sie beschäftigt sich mit der Frage nach effizienten algorithmischen Lösungen für zahlentheoretische Fragestellungen.… …   Deutsch Wikipedia

  • List of mathematics articles (A) — NOTOC A A Beautiful Mind A Beautiful Mind (book) A Beautiful Mind (film) A Brief History of Time (film) A Course of Pure Mathematics A curious identity involving binomial coefficients A derivation of the discrete Fourier transform A equivalence A …   Wikipedia

  • Elliptic curve cryptography — (ECC) is an approach to public key cryptography based on the algebraic structure of elliptic curves over finite fields. The use of elliptic curves in cryptography was suggested independently by Neal Koblitz[1] and Victor S. Miller[2] in 1985.… …   Wikipedia

  • Mertens conjecture — In mathematics, the Mertens conjecture is the incorrect statement that the Mertens function M(n) is bounded by √n, which implies the Riemann hypothesis. It was conjectured by Stieltjes in a 1885 letter to Hermite (reprinted in Stieltjes 1905) and …   Wikipedia

  • Generating primes — In mathematics, a variety of algorithms make it possible to generate prime numbers efficiently. These are used in various applications, for example hashing, public key cryptography, and search of prime factors in large numbers.For relatively… …   Wikipedia

  • Paul Leyland — is a number theorist who has studied integer factorization and primality testing.He has contributed to the factorization of RSA 129, RSA 140, and RSA 155, as well as potential factorial primes as large as 400! + 1. He has also studied Cunningham… …   Wikipedia