Jürgen Gerhard

Welcome to my homepage!

Former member of the Research Group Algorithmic Mathematics and of the MuPAD Research Group at University of Paderborn, Germany

Current position: Team Lead Mathematical Software at Maplesoft, Canada

Member of the ISSAC 2007 organizing committee

Contact:

Jürgen likes: Mercedes Cappuccino, Monte Cervino, ballroom dancing, music, movies.

Research interests:

• Computational problems in symbolic summation and integration
• Polynomial factorization over finite fields and over Q
• Cryptography
• Computational aspects of finite fields
• Computing Laurent and asymptotic series expansions

Publications:

• J. Gerhard, Modular algorithms in symbolic summation and symbolic integration (PhD thesis), LNCS 3218, Springer Verlag, 2004.

• M. P. Barnett, J. F. Capitani, J. von zur Gathen, and J. Gerhard, Symbolic calculation in chemistry: selected examples, International Journal of Quantum Chemistry 100(2) (2004), pp. 80-104.

• J. von zur Gathen and J. Gerhard, Modern Computer Algebra, Cambridge University Press, 2nd edition, 2003, xiv+786 pages. (First edition 1999.)

• J. Gerhard, M. Giesbrecht, A. Storjohann, and E. Zima, Shiftless decomposition and polynomial time rational summation, Proc. ISSAC 2003, Philadelphia PA, ACM press, pp. 119-126.

• J. Gerhard and A. Sorgatz, MuPAD, Section 4.1.8 in Compurter Algebra Handbook - Foundations, Applications, Systems, ed. J. Grabmeier, E. Kaltofen, and V. Weispfenning, Springer Verlag, 2002, pp. 321-332.

• J. von zur Gathen and J. Gerhard, Polynomial factorization over F_2, Mathematics of Computation 71(240) (2002), pp. 1677-1698.

• O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, and M. Nöcker, Factoring a binary polynomial of degree over one million, ACM SIGSAM Bulletin 35(1) (2001), pp. 16-18.

• J. Gerhard, Fast Modular Algorithms for Squarefree Factorization and Hermite Integration, AAECC 11(3) (2001), pp. 203-226. Preliminary version: Technical Report tr-ri-99-206, University of Paderborn, Germany, 1999, 22 pages. Abstract Postscript (ZIP file)

• J. Gerhard, W. Oevel, F. Postel, and S. Wehmeier, MuPAD Tutorial - English Edition, Springer Verlag, 2000.

• J. Gerhard, Modular algorithms for polynomial basis conversion and greatest factorial factorization. Proceedings of the Seventh Rhine Workshop on Computer Algebra (RWCA'00), Bregenz, 2000, pp. 125--141. Abstract Postscript (ZIP file)

• J. Gerhard, High degree solutions of low degree equations, Proc. ISSAC 98, Rostock, Germany, ACM press, pp 284-289. Abstract Postscript (ZIP file)

• J. von zur Gathen and J. Gerhard, Fast algorithms for Taylor shifts and certain difference equations, Proc. ISSAC 97, Maui HI, ACM press, pp 40-47. Abstract Postscript

• J. von zur Gathen and J. Gerhard, Arithmetic and Factorization of Polynomials over F_2, Proc. ISSAC 96, Zürich, Switzerland, ACM press, 1-9. Abstract Postscript

• J. von zur Gathen and J. Gerhard, Arithmetic and Factorization of Polynomials over F_2, Technical Report tr-rsfb-96-018, University of Paderborn, Germany, 1996, 43 pages. Abstract Postscript

Other available documents:

• J. Gerhard, Faktorisierung von Polynomen über GF(q), Diplomarbeit, University of Erlangen-Nürnberg, Germany, 1994, 87 pages (in German). Postscript (ZIP file)

• J. Gerhard, Elliptische Kurven - Theorie und Anwendungen, Studienarbeit, University of Erlangen-Nürnberg, Germany, 1993, 101 pages (in German). Postscript (ZIP file) (only for printing, does not show well in ghostview)