Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Within this website:
External resources:
Within this website:
External resources:
  • the dblp Computer Science Bibliography

Dagstuhl Seminar 04211

Algorithms and Number Theory

( May 16 – May 21, 2004 )

(Click in the middle of the image to enlarge)

Please use the following short url to reference this page:



This seminar on number-theoretical algorithms and their applications was the fifth on this topic at Dagstuhl over a period of more than 10 years. This time we attracted a record number of 54 participants from 14 countries.

One of the major goals of these seminars has been to broaden interactions between number theory and other areas. For instance, there has been an effort to bring together people developing the theory of efficient algorithms with people actually writing software. There has also been continuing interest in cryptography, and almost a third of the talks were on algebraic curves, most with an eye to applications in cryptography. Since elliptic curves in cryptography seem to be mainly objects of hardware implementations, nowadays, the focus is on higher genus curves and related more sophisticated mathematical objects.

This time we also had a major new topic: algorithmic K-theory which has been rapidly developing over the last few years. Not surprisingly seven talks were given on this subject, several alone on (algorithmic aspects of) logarithmic class groups.

Most of the other talks focused on more classical topics of algorithmic algebraic number theory, with half a dozen on various aspects of solving Diophantine equations. Among the variety of problems considered we just mention the computation of Picard groups and Drinfeld modules, but also quantum computing of unit groups. Several talks were on problems related to the development of number theoretical software.

The variety of topics was stimulating to the audience. The reaction of the participants was very positive and we believe that we succeeded in having an effective meeting that was able to appeal to a broad audience. We made sure to allow for adequate breaks between sessions, and there were many opportunities for discussions that the participants took advantage of. The pleasant atmosphere of Schloss Dagstuhl once again contributed to a very productive meeting.

  • Wieb Bosma (Radboud University Nijmegen, NL)
  • Nils Bruin (Simon Fraser University - Burnaby, CA)
  • Henri Cohen (University of Bordeaux, FR)
  • Jean-Marc Couveignes (University III of Toulouse, FR)
  • John Cremona (University of Nottingham, GB)
  • Rob de Jeu (Durham University, GB)
  • Christophe Delaunay (EPFL - Lausanne, CH)
  • Francisco Diaz y Diaz (University of Bordeaux, FR)
  • Claus Diem (Universität Duisburg-Essen, DE)
  • Stephen Donnelly (Jacobs Universität - Bremen, DE)
  • Neil Dummigan (University of Sheffield, GB)
  • Sylvain Duquesne (University of Montpellier 2, FR)
  • Andreas Enge (Ecole Polytechnique - Palaiseau, FR) [dblp]
  • Claus Fieker (University of Sydney, AU)
  • Tom Fisher (University of Cambridge, GB)
  • David Ford (Concordia University - Montreal, CA)
  • Gerhard Frey (Universität Duisburg-Essen, DE)
  • Istvan Gaal (University of Debrecen, HU)
  • Herbert Gangl (MPI für Mathematik, DE)
  • William B. Hart (Leiden University, NL)
  • Florian Hess (TU Berlin, DE)
  • Clemens Heuberger (TU Graz, AT)
  • Everett Howe (Center for Communications Research - La Jolla, US)
  • Istvan Jarasi (University of Debrecen, HU)
  • Jürgen Klüners (Universität Kassel, DE)
  • David R. Kohel (University of Sydney, AU)
  • Tanja Lange (Ruhr-Universität Bochum, DE) [dblp]
  • Alan Lauder (University of Oxford, GB)
  • Franz Lemmermeyer (Bilkent University - Ankara, TR)
  • Hendrik W. Lenstra (Leiden University, NL)
  • Franck Leprevost (University of Luxembourg, LU)
  • Mark Lingham (University of Nottingham, GB)
  • Pieter Moree (MPI für Mathematik, DE)
  • Ken Nakamula (Tokyo Metropolitan University, JP)
  • Catherine O'Neil (MIT - Cambridge, US)
  • Michel Olivier (University of Bordeaux, FR)
  • Sebastian Pauli (TU Berlin, DE)
  • Attila Pethö (University of Debrecen, HU)
  • Michael E. Pohst (TU Berlin, DE)
  • Jordi Quer Bosor (UPC - Barcelona, ES)
  • Reinhard Schertz (Universität Augsburg, DE)
  • René Schoof (University of Rome "Tor Vergata", IT)
  • Andreas Schöpp (TU Berlin, DE)
  • Romyar Sharifi (MPI für Mathematik, DE)
  • Samir Siksek (Sultan Qaboos University - Oman, OM)
  • Denis Simon (Caen University, FR)
  • Florence Soriano-Gafiuk (University of Metz, FR)
  • Peter Stevenhagen (Leiden University, NL)
  • Michael Stoll (Jacobs Universität - Bremen, DE)
  • Herman te Riele (CWI - Amsterdam, NL)
  • Ulrich Vollmer (TU Darmstadt, DE)
  • Mark Watkins (Pennsylvania State University - University Park, US)
  • Annegret Weng (Universität Mainz, DE)
  • Horst Günter Zimmer (Universität des Saarlandes, DE)

Related Seminars
  • Dagstuhl Seminar 01201: Algorithms and Number Theory (2001-05-13 - 2001-05-18) (Details)
  • Dagstuhl Seminar 09221: Algorithms and Number Theory (2009-05-24 - 2009-05-29) (Details)