Arithmetic and Factorization of Polynomial Over F2 (extended abstract). - Joachim von zur Gathen; Jürgen Gerhard (ISSAC, 1996)

Fast Algorithms for Taylor Shifts and Certain Difference Equations. - Joachim von zur Gathen; Jürgen Gerhard (ISSAC, 1997)

High Degree Solutions of Low Degree Equations (extended abstract). - Jürgen Gerhard (ISSAC, 1998)

Fast Modular Algorithms for Squarefree Factorization and Hermite Integration. - Jürgen Gerhard (Appl. Algebra Eng. Commun. Comput., 2001)

Factoring a binary polynomial of degree over one million. - Olaf Bonorden; Joachim von zur Gathen; Jürgen Gerhard; Olaf Müller (SIGSAM Bull., 2001)

Polynomial factorization over F2. - Joachim von zur Gathen; Jürgen Gerhard (Math. Comput., 2002)

Modern computer algebra (2. ed.). - Joachim von zur Gathen; Jürgen Gerhard (Cambridge University Press, 2003)

Shiftless decomposition and polynomial-time rational summation. - Jürgen Gerhard; Mark Giesbrecht; Arne Storjohann; Eugene V. Zima (ISSAC, 2003)

Modular Algorithms in Symbolic Summation and Symbolic Integration - Jürgen Gerhard (Springer, 2004)

A package for solving parametric polynomial systems. - Jürgen Gerhard; D. J. Jeffrey; Guillaume Moroz (ACM Commun. Comput. Algebra, 2009)

Asymptotically fast algorithms for modern computer algebra. - Jürgen Gerhard (ISSAC, 2010)

Equation-Based Model Data Structure for High Level Physical Modelling, Model Simplification and Modelica-Export. - Hisahiro Ito; Akira Ohata; Kenneth R. Butts; Jürgen Gerhard; Masoud Abbaszadeh; David Linder; Erik Postman; Elena Shmoylova (EOOLT, 2011)

Modern Computer Algebra (3. ed.). - Joachim von zur Gathen; Jürgen Gerhard (Cambridge University Press, 2013)

Simplification of Differential Algebraic Equations by the Projection Method. - Elena Shmoylova; Jürgen Gerhard; Erik Postman; Austin Roche (EOOLT, 2013)

Piecewise-Affine Approximations for a Powertrain Control Verification Benchmark. - Jyotirmoy V. Deshmukh; Hisahiro Ito; Xiaoqing Jin; James Kapinski; Kenneth R. Butts; Jürgen Gerhard; Behzad Samadi; Kevin Walker; Yuzhen Xie (ARCH@CPSWeek, 2015)

Semantic Preserving Bijective Mappings of Mathematical Formulae Between Document Preparation Systems and Computer Algebra Systems. - Howard S. Cohl; Moritz Schubotz; Abdou Youssef; André Greiner-Petter; Jürgen Gerhard; Bonita V. Saunders; Marjorie A. McClain; Joon Bang; Kevin Chen (CICM, 2017)

Effective Problem Solving Using SAT Solvers. - Curtis Bright; Jürgen Gerhard; Ilias S. Kotsireas; Vijay Ganesh 001 (MC, 2019)

Maple Conference 2019. - Jürgen Gerhard; Ilias S. Kotsireas (ACM Commun. Comput. Algebra, 2019)

Semantic Preserving Bijective Mappings of Mathematical Formulae between Document Preparation Systems and Computer Algebra Systems. - Howard S. Cohl; Moritz Schubotz; Abdou Youssef; André Greiner-Petter; Jürgen Gerhard; Bonita V. Saunders; Marjorie A. McClain (CoRR, 2021)

How to use Fibonacci numbers to teach recursive programming. - Jürgen Gerhard (Maple Trans., 2021)

Reflections on the Maple Conference 2020. - Jürgen Gerhard (Maple Trans., 2021)

Computing Intersection Multiplicities with Regular Chains. - Ryan Sandford; Jürgen Gerhard; Marc Moreno Maza (Maple Trans., 2022)

Generating Elementary Integrable Expressions. - Rashid Barket; Matthew England 001; Jürgen Gerhard (CASC, 2023)

What's New in Maple 2022: Formal Power Series. - Jürgen Gerhard (Maple Trans., 2023)

The Liouville Generator for Producing Integrable Expressions. - Rashid Barket; Matthew England 001; Jürgen Gerhard (CASC, 2024)

Symbolic Integration Algorithm Selection with Machine Learning: LSTMs Vs Tree LSTMs. - Rashid Barket; Matthew England 001; Jürgen Gerhard (ICMS, 2024)

Transformers to Predict the Applicability of Symbolic Integration Routines. - Rashid Barket; Uzma Shafiq; Matthew England 001; Jürgen Gerhard (CoRR, 2024)