World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
54
Citations
8080
World Ranking
861
National Ranking
414

Research.com Recognitions

  • 2009 - ACM Fellow For contributions to symbolic and algebraic computation, algebraic algorithms and complexity theory.

Overview

Erich Kaltofen is affiliated with North Carolina State University in the United States and has contributed to the fields of Computer Science and Mathematics. Their research encompasses several subfields, including Computational Theory and Mathematics, Artificial Intelligence, Signal Processing, Information Systems, and Electrical and Electronic Engineering.

The scientist's work addresses topics such as Coding theory and cryptography, Polynomial and algebraic computation, Digital Filter Design and Implementation, Numerical Methods and Algorithms, Cryptography and Residue Arithmetic, Low-power high-performance VLSI design, and Analytic Number Theory Research.

Frequent co-authors collaborating with Erich Kaltofen include Erdal Imamoglu, Clément Pernet, Zhihong Yang, and Zonghang Yang.

Publications by Erich Kaltofen appear predominantly in the Journal of Symbolic Computation, ACM Communications in Computer Algebra, and arXiv (Cornell University).

Notable recent papers authored by Erich Kaltofen include:

  • Foreword, 2020, Journal of Symbolic Computation
  • A note on the van der Waerden conjecture on random polynomials with symmetric Galois group for function fields, 2022, arXiv (Cornell University)
  • Early termination for sparse interpolation of polynomials in Chebyshev bases, 2025, Journal of Symbolic Computation

Additionally, Erich Kaltofen has co-authored papers with Erdal Imamoglu, such as:

  • On computing the degree of a Chebyshev Polynomial from its value, 2020, Journal of Symbolic Computation
  • A note on sparse polynomial interpolation in Dickson polynomial basis, 2020, ACM Communications in Computer Algebra

Erich Kaltofen was named an ACM Fellow in 2009 for contributions to symbolic and algebraic computation, algebraic algorithms, and complexity theory.

Best Publications

  • On fast multiplication of polynomials over arbitrary algebras

    David G. Cantor;Erich Kaltofen

  • Subquadratic-time factoring of polynomials over finite fields

    Erich Kaltofen;Victor Shoup

  • Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators

    Erich Kaltofen;Barry M. Trager

  • On Wiedemann's Method of Solving Sparse Linear Systems

    Erich Kaltofen;B. David Saunders

  • On the complexity of computing determinants

    Erich Kaltofen;Gilles Villard

  • Solving systems of nonlinear polynomial equations faster

    J. F. Canny;E. Kaltofen;L. Yagati

  • Computer Algebra Handbook : Foundations · Applications · Systems

    Johannes Grabmeier;Erich Kaltofen;Volker Weispfenning

  • Improved Sparse Multivariate Polynomial Interpolation Algorithms

    Erich Kaltofen;Yagati N. Lakshman

  • Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems

    Erich Kaltofen

  • Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization

    Erich Kaltofen

  • Computer algebra handbook

    Johannes Grabmeier;Erich Kaltofen;Volker Weispfenning

  • Factorization of Polynomials Given by Straight-Line Programs.

    Erich Kaltofen

  • Greatest common divisors of polynomials given by straight-line programs

    Erich Kaltofen

  • Early termination in sparse interpolation algorithms

    Erich Kaltofen;Wen-shin Lee

  • Polynomial Factorization 1987-1991

    Erich Kaltofen

  • Efficient parallel evaluation of straight-line code and arithmetic circuits

    Gary L. Miller;Vijaya Ramachandran;Erich Kaltofen

  • Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

    Erich Kaltofen;Zhengfeng Yang;Lihong Zhi

  • Processor efficient parallel solution of linear systems over an abstract field

    Erich Kaltofen;Victor Pan

  • Factoring sparse multivariate polynomials

    Joachim von zur Gathen;Erich Kaltofen

  • LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA

    J.-G. Dumas;T. Gautier;M. Giesbrecht;P. Giorgi

  • In Computer Algebra Handbook

    Robert M. Corless;Erich Kaltofen;Stephen M. Watt

Frequent Co-Authors

Victor Y. Pan
Victor Y. Pan City University of New York
Siegfried M. Rump
Siegfried M. Rump Hamburg University of Technology
Victor Shoup
Victor Shoup New York University
Joachim von zur Gathen
Joachim von zur Gathen University of Bonn
Vijaya Ramachandran
Vijaya Ramachandran The University of Texas at Austin
Gary L. Miller
Gary L. Miller Carnegie Mellon University
Peter Borwein
Peter Borwein Simon Fraser University
John Canny
John Canny University of California, Berkeley
Robert M. Corless
Robert M. Corless University of Western Ontario

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, exploring related online degrees can open multiple career pathways in fields like finance, technology, and analytics. Many professionals complement their math background with an MBA to develop strong business acumen.

If you want to accelerate your business education, consider 12 month mba programs, which offer a fast track to gaining leadership skills.

Online MBA options often provide flexibility through transfer credits for online mba programs, allowing students to apply previously earned credits and customize their learning pace.

Additionally, math graduates can leverage their quantitative skills by pursuing specialized areas like data science. Top data analysis programs equip students with the ability to transform data into actionable insights, a highly sought-after expertise.

For those seeking accessible options, exploring the easiest mba programs can provide a practical route to earning a degree with less competitive admission requirements.

Best Scientists Citing Erich Kaltofen

Trending Scientists