Joachim von zur Gathen

from Wikipedia, the free encyclopedia

Joachim von zur Gathen (born February 14, 1950 in Solingen ) is a German mathematician and computer scientist who deals with computer algebra .

Joachim von zur Gathen studied mathematics at the ETH Zurich with a diploma and received his doctorate in 1980 from the University of Zurich under Volker Strassen ( secant spaces of curves ). From 1981 he was an assistant professor at the University of Toronto , where he became an associate professor in 1986 and a professor of computer science in 1991. From 1994 he was professor at the University of Paderborn and from 2004 at the University of Bonn and at the Bonn-Aachen International Center for Information Technology (B-IT).

He deals with computer algebra (e.g. factorization of polynomials), finite fields , cryptography , complexity theory and parallel computer algorithms.

Joachim von zur Gathen is the founding editor of Computational Complexity (Birkhäuser / Springer). In 1994 he received the Association for Computing Machinery’s Distinguished Service Award .

Fonts

  • with Jürgen Gerhard: Modern Computer Algebra, Cambridge University Press, 1999, 3rd edition 2013 ,. ISBN 9781107039032
  • Factorization and Decomposition of Polynomials: in: Alexander V. Mikhalev, Günter Pilz (Ed.), The Concise Handbook of Algebra, Kluwer 2002, pp. 159–161
  • Factorization of Polynomials, in: Johannes Grabmeier, Erich Kaltofen, Volker Weispfenning (Eds.), Computer Algebra Handbook, Springer 2003
  • Ed. With José Luis Imaña, Çetin Kaya Koç: Arithmetic of Finite Fields, Proc. 2nd International Workshop, WAIFI 2008 Siena, Lecture Notes in Computer Science 5130, Springer, 2008
  • CryptoSchool, Springer 2015, ISBN 978-3-662-48425-8

Web links

Individual evidence

  1. ↑ The dates of birth of Kürschner's Scholars Calendar 2009, under "zur Gathen"
  2. Joachim von zur Gathen in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used