default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJürgen Gerhard
Person information
- affiliation: Maplesoft, Waterloo, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
[b3]Joachim von zur Gathen, Jürgen Gerhard:
Modern Computer Algebra (3. ed.). Cambridge University Press 2013, ISBN 978-1-107-03903-2, pp. I-XIII, 1-795- 2004
- [b2]Jürgen Gerhard:
Modular Algorithms in Symbolic Summation and Symbolic Integration. Lecture Notes in Computer Science 3218, Springer 2004, ISBN 3-540-24061-6 - 2003
- [b1]Joachim von zur Gathen, Jürgen Gerhard:
Modern computer algebra (2. ed.). Cambridge University Press 2003, ISBN 978-0-521-82646-4, pp. I-XIII, 1-785
Journal Articles
- 2023
- [j9]Jürgen Gerhard:
What's New in Maple 2022: Formal Power Series. Maple Trans. 3(1) (2023) - 2022
- [j8]Ryan Sandford, Jürgen Gerhard, Marc Moreno Maza:
Computing Intersection Multiplicities with Regular Chains. Maple Trans. 2(1) (2022) - 2021
- [j7]Jürgen Gerhard:
How to use Fibonacci numbers to teach recursive programming. Maple Trans. 1(1) (2021) - [j6]Jürgen Gerhard:
Reflections on the Maple Conference 2020. Maple Trans. 1(1) (2021) - 2019
- [j5]Jürgen Gerhard, Ilias S. Kotsireas:
Maple Conference 2019. ACM Commun. Comput. Algebra 53(4): 182 (2019) - 2009
- [j4]Jürgen Gerhard, D. J. Jeffrey, Guillaume Moroz:
A package for solving parametric polynomial systems. ACM Commun. Comput. Algebra 43(3/4): 61-72 (2009) - 2002
- [j3]Joachim von zur Gathen, Jürgen Gerhard:
Polynomial factorization over F2. Math. Comput. 71(240): 1677-1698 (2002) - 2001
- [j2]Jürgen Gerhard:
Fast Modular Algorithms for Squarefree Factorization and Hermite Integration. Appl. Algebra Eng. Commun. Comput. 11(3): 203-226 (2001) - [j1]Olaf Bonorden, Joachim von zur Gathen, Jürgen Gerhard, Olaf Müller:
Factoring a binary polynomial of degree over one million. SIGSAM Bull. 35(1): 16-18 (2001)
Conference and Workshop Papers
- 2024
- [c13]Rashid Barket
, Matthew England, Jürgen Gerhard:
The Liouville Generator for Producing Integrable Expressions. CASC 2024: 47-62 - [c12]Rashid Barket, Matthew England, Jürgen Gerhard:
Symbolic Integration Algorithm Selection with Machine Learning: LSTMs Vs Tree LSTMs. ICMS 2024: 167-175 - 2023
- [c11]Rashid Barket, Matthew England, Jürgen Gerhard:
Generating Elementary Integrable Expressions. CASC 2023: 21-38 - 2019
- [c10]Curtis Bright, Jürgen Gerhard, Ilias S. Kotsireas, Vijay Ganesh:
Effective Problem Solving Using SAT Solvers. MC 2019: 205-219 - 2017
- [c9]Howard S. Cohl, Moritz Schubotz, Abdou Youssef, André Greiner-Petter, Jürgen Gerhard, Bonita V. Saunders, Marjorie A. McClain, Joon Bang, Kevin Chen:
Semantic Preserving Bijective Mappings of Mathematical Formulae Between Document Preparation Systems and Computer Algebra Systems. CICM 2017: 115-131 - 2015
- [c8]Jyotirmoy V. Deshmukh, Hisahiro Ito, Xiaoqing Jin, James Kapinski, Kenneth R. Butts, Jürgen Gerhard, Behzad Samadi, Kevin Walker, Yuzhen Xie:
Piecewise-Affine Approximations for a Powertrain Control Verification Benchmark. ARCH@CPSWeek 2015: 98-112 - 2013
- [c7]Elena Shmoylova, Jürgen Gerhard, Erik Postman, Austin Roche:
Simplification of Differential Algebraic Equations by the Projection Method. EOOLT 2013: 87-96 - 2011
- [c6]Hisahiro Ito, Akira Ohata, Kenneth R. Butts, Jürgen Gerhard, Masoud Abbaszadeh, David Linder, Erik Postman, Elena Shmoylova:
Equation-Based Model Data Structure for High Level Physical Modelling, Model Simplification and Modelica-Export. EOOLT 2011: 27-34 - 2010
- [c5]Jürgen Gerhard:
Asymptotically fast algorithms for modern computer algebra. ISSAC 2010: 9-10 - 2003
- [c4]Jürgen Gerhard, Mark Giesbrecht, Arne Storjohann, Eugene V. Zima:
Shiftless decomposition and polynomial-time rational summation. ISSAC 2003: 119-126 - 1998
- [c3]Jürgen Gerhard:
High Degree Solutions of Low Degree Equations (extended abstract). ISSAC 1998: 284-289 - 1997
- [c2]Joachim von zur Gathen, Jürgen Gerhard:
Fast Algorithms for Taylor Shifts and Certain Difference Equations. ISSAC 1997: 40-47 - 1996
- [c1]Joachim von zur Gathen, Jürgen Gerhard:
Arithmetic and Factorization of Polynomial Over F2 (extended abstract). ISSAC 1996: 1-9
Editorship
- 2021
- [e2]Robert M. Corless, Jürgen Gerhard, Ilias S. Kotsireas:
Maple in Mathematics Education and Research - 4th Maple Conference, MC 2020, Waterloo, Ontario, Canada, November 2-6, 2020, Revised Selected Papers. Communications in Computer and Information Science 1414, Springer 2021, ISBN 978-3-030-81697-1 [contents] - 2020
- [e1]Jürgen Gerhard, Ilias S. Kotsireas:
Maple in Mathematics Education and Research - Third Maple Conference, MC 2019, Waterloo, Ontario, Canada, October 15-17, 2019, Proceedings. Communications in Computer and Information Science 1125, Springer 2020, ISBN 978-3-030-41257-9 [contents]
Informal and Other Publications
- 2025
- [i7]Rashid Barket, Matthew England, Jürgen Gerhard:
Tree-Based Deep Learning for Ranking Symbolic Integration Algorithms. CoRR abs/2508.06383 (2025) - 2024
- [i6]Rashid Barket, Matthew England, Jürgen Gerhard:
Symbolic Integration Algorithm Selection with Machine Learning: LSTMs vs Tree LSTMs. CoRR abs/2404.14973 (2024) - [i5]Rashid Barket, Matthew England, Jürgen Gerhard:
The Liouville Generator for Producing Integrable Expressions. CoRR abs/2406.11631 (2024) - [i4]Rashid Barket, Uzma Shafiq, Matthew England, Jürgen Gerhard:
Transformers to Predict the Applicability of Symbolic Integration Routines. CoRR abs/2410.23948 (2024) - 2023
- [i3]Rashid Barket, Matthew England, Jürgen Gerhard:
Generating Elementary Integrable Expressions. CoRR abs/2306.15572 (2023) - 2021
- [i2]Howard S. Cohl, Moritz Schubotz, Abdou Youssef, André Greiner-Petter, Jürgen Gerhard, Bonita V. Saunders, Marjorie A. McClain:
Semantic Preserving Bijective Mappings of Mathematical Formulae between Document Preparation Systems and Computer Algebra Systems. CoRR abs/2109.08655 (2021) - 2019
- [i1]Curtis Bright, Jürgen Gerhard, Ilias S. Kotsireas, Vijay Ganesh:
Effective problem solving using SAT solvers. CoRR abs/1906.06251 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-11-22 05:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
