@InProceedings{   vollmer:2000,
  author =	  "Ulrich Vollmer",
  title =		  "Asymptotically Fast Discrete Logarithms in Quadratic
                  Number Fields",
  booktitle =	  {Algorithmic Number Theory, {ANTS}-{IV}},
  editor =	  {Bosma, Wieb},
  year =		  2000,
  volume =	  1838,
  series =	  Lecture Notes in Computer Science,
  publisher =	  Springer-Verlag,
  pages =		  "581--594",
}

@InProceedings{   vollmer:2002,
  author =	  {Ulrich Vollmer},
  title =		  {An accelerated {B}uchmann algorithm for regulator
                  computation in real quadratic fields},
  booktitle =	  {Algorithmic Number Theory, {ANTS}-{V}},
  editor =	  {Fieker, Claus and Kohel, David R.},
  year =		  2002,
  volume =	  2369,
  series =	  Lecture Notes in Computer Science,
  publisher =	  Springer-Verlag,
  pages =		  "148--162",
}

@InProceedings{vollmer:2003,
  author =	  {Ulrich Vollmer},
  title =		  {A note on the {H}ermite Basis Computation of Large
                  Integer Matrices},
  booktitle =	  {International Symposium on Symbolic and Algebraic
                  Computation, {ISSAC} '03},
  year =		  2003,
  editor =	  {J. Rafael Sendra},
  publisher =	  {{ACM} Press},
  pages =		  "255--257"
}

@PhdThesis{vollmer-thesis:2003,
  author =	  {Ulrich Vollmer},
  title =		  {Rigorously Analyzed Algorithms for the Discrete
                  Logarithm Problem in Quadratic Number Fields},
  school =	  cdc:institution,
  year =		  2003,
  url=           {\url{http://elib.tu-darmstadt.de/diss/000494/}}
}

@InProceedings{buchmann/takagi/vollmer:2003,
  author =	  {Johannes Buchmann and Tsuyoshi Takagi and Ulrich
                  Vollmer},
  title =		  {Number Field Cryptography},
  booktitle =	  {High Primes and Misdemeanours: Lectures in Honour of
                  the 60th Birthday of Hugh Cowie Williams},
  year =		  2004,
  editor =	  {van der Poorten, Alf and Stein, Andreas},
  volume =	  41,
  series =	  {Fields Institute Communications},
  organization = {Fields Institute},
  publisher =	  {American Mathematical Society},
  pages =		  {111--125},
}

@InProceedings{schmidt/vollmer:2005,
  author =	  {Arthur Schmidt and Ulrich Vollmer},
  title =		  {Polynomial Time Quantum Algorithm for the Computation
                  of the Unit Group of a Number Field},
  editor =	  {Harold N. Gabow and Ronald Fagin},
  year =		  2005,
  booktitle =	  {Proceedings of the 37th annual ACM Symposium on Theory
                  of Computing},
  location =	  {Baltimore, MD, USA},
  isbn =		  {1-58113-960-8},
  publisher =	  {ACM Press},
  pages =		  {475--480}
}

@Article{buchmann/vollmer:2006,
  author =	  {Johannes Buchmann and Ulrich Vollmer},
  title =		  {A Terr algorithm for computations in the
                  infrastructure of real-quadratic number fields},
  journal =	  {Journal de Th\'{e}orie des Nombres de Bordeaux},
  year =		  2006,
  volume =	  18,
  number =       3,
  pages =		  {559--572}
}

@Article{buchmann/may/vollmer:2006,
  author =	  {Johannes Buchmann and Alexander May and Ulrich
                  Vollmer},
  title =		  {Perspectives for Cryptographic Long-Term Security},
  journal =	  {Communications of the ACM},
  year =		  2006,
  volume =	  49,
  number =	  9,
  pages =		  {50--56},
  month =		  {September}
}

@Article{buchmann/dahmen/may/vollmer:2006,
  author =	  {Johannes Buchmann and Erik Dahmen and Alexander May
                  and Ulrich Vollmer},
  title =		  {Krypto 2020},
  journal =	  {{KES} -- The Information Security Journal},
  year =		  2006,
  number =	  5,
  pages =		  {74--77}
}

@Book{buchmann/vollmer:2007,
  author =	  {Johannes Buchmann and Ulrich Vollmer},
  title =		  {Binary Quadratic Forms: An Algorithmic Approach},
  publisher =	  Springer-Verlag,
  year =		  2007,
  volume =	  20,
  series =	  {Algorithms and Computation in Mathematics}
}