| 2024 | ISSAC | Encounters in Symbolic Computation: Ideas for the Ages. | Erich L. Kaltofen |
| 2024 | ISSAC | Sparse Polynomial Interpolation With Error Correction: Higher Error Capacity by Randomization. | Erich L. Kaltofen, Zhi-Hong Yang |
| 2022 | ISSAC | The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds. | Erich L. Kaltofen |
| 2022 | ISSAC | Sparse Polynomial Hermite Interpolation. | Erich L. Kaltofen |
| 2021 | ISSAC | Computing Higher Polynomial Discriminants. | Erich L. Kaltofen |
| 2021 | ISSAC | Hermite Interpolation With Error Correction: Fields of Zero or Large Characteristic and Large Error Rate. | Erich L. Kaltofen, Clment Pernet, Zhi-Hong Yang |
| 2020 | CASC | Hermite Rational Function Interpolation with Error Correction. | Erich L. Kaltofen, Clment Pernet, Zhi-Hong Yang |
| 2018 | ISSAC | Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases. | Erdal Imamoglu, Erich L. Kaltofen, Zhengfeng Yang |
| 2017 | ISSAC | Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. | Jean-Guillaume Dumas, Erich L. Kaltofen, Gilles Villard, Lihong Zhi |
| 2017 | ISSAC | Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction. | Erich L. Kaltofen, Clment Pernet, Arne Storjohann, Cleveland Waddell |
| 2016 | ISSAC | Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. | Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thom, Gilles Villard |
| 2016 | ISSAC | Numerical Sparsity Determination and Early Termination. | Zhiwei Hao, Erich L. Kaltofen, Lihong Zhi |
| 2015 | ISSAC | Error-Correcting Sparse Interpolation in the Chebyshev Basis. | Andrew Arnold, Erich L. Kaltofen |
| 2014 | ISSAC | Essentially optimal interactive certificates in linear algebra. | Jean-Guillaume Dumas, Erich L. Kaltofen |
| 2014 | ISSAC | Sparse polynomial interpolation codes and their decoding beyond half the minimum distance. | Erich L. Kaltofen, Clment Pernet |
| 2014 | ISSAC | Sparse multivariate function recovery with a high error rate in the evaluations. | Erich L. Kaltofen, Zhengfeng Yang |
| 2013 | ISSAC | Sparse multivariate function recovery from values with noise and outlier errors. | Erich L. Kaltofen, Zhengfeng Yang |
| 2012 | ISSAC | Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values. | Matthew T. Comer, Erich L. Kaltofen, Clment Pernet |
| 2012 | ISSAC | Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. | Feng Guo, Erich L. Kaltofen, Lihong Zhi |
| 2011 | ISSAC | Supersparse black box rational function interpolation. | Erich L. Kaltofen, Michael Nehring |
| 2011 | ISSAC | Quadratic-time certificates in linear algebra. | Erich L. Kaltofen, Michael Nehring, B. David Saunders |
| 2011 | STACS | Symmetric Determinantal Representation of Weakly-Skew Circuits. | Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier |
| 2011 | SYNASC | What is Hybrid Symbolic-Numeric Computation? | Erich L. Kaltofen |
| 2010 | ISSAC | Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method. | Sharon Hutton, Erich L. Kaltofen, Lihong Zhi |
| 2008 | ISSAC | Expressing a fraction of two determinants as a determinant. | Erich L. Kaltofen, Pascal Koiran |
| 2008 | ISSAC | Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. | Erich L. Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi |
| 2007 | ISSAC | Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). | Erich L. Kaltofen, Bin Li, Kartik Sivaramakrishnan, Zhengfeng Yang, Lihong Zhi |
| 2007 | ISSAC | On exact and approximate interpolation of sparse rational functions. | Erich L. Kaltofen, Zhengfeng Yang |
| 2007 | ISSAC | On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. | Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi |
| 2006 | ISSAC | Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. | Erich L. Kaltofen, Pascal Koiran |
| 2006 | ISSAC | Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. | Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi |
| 2006 | ISSAC | Hybrid symbolic-numeric computation. | Erich L. Kaltofen, Lihong Zhi |
| 2005 | ISSAC | On the complexity of factoring bivariate supersparse (Lacunary) polynomials. | Erich L. Kaltofen, Pascal Koiran |
| 2005 | ISSAC | Generic matrix multiplication and memory management in linBox. | Erich L. Kaltofen, Dmitriy Morozov, George Yuhasz |
| 2004 | ISSAC | Approximate factorization of multivariate polynomials via differential equations. | Shuhong Gao, Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi |
| 2003 | ISSAC | Polynomial factorization: a success story. | Erich L. Kaltofen |
| 2003 | ISSAC | On approximate irreducibility of polynomials in several variables. | Erich L. Kaltofen, John P. May |
| 2002 | ISSAC | Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. | Mark Giesbrecht, Erich L. Kaltofen, Wen-shin Lee |
| 2002 | ISSAC | An output-sensitive variant of the baby steps/giant steps determinant algorithm. | Erich L. Kaltofen |
| 2000 | ISSAC | Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. | Erich L. Kaltofen, Wen-shin Lee, Austin Lobo |
| 1999 | ISSAC | Symbolic Computation in Java: An Appraisement. | Laurent Bernardin, Bruce W. Char, Erich L. Kaltofen |
| 1999 | ISSAC | Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. | Markus A. Hitz, Erich L. Kaltofen, Yagati N. Lakshman |
| 1999 | ISSAC | On the Genericity of the Modular Polynomial GCD Algorithm. | Erich L. Kaltofen, Michael B. Monagan |
| 1998 | ISSAC | FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation. | Angel Daz, Erich L. Kaltofen |
| 1998 | ISSAC | Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots. | Markus A. Hitz, Erich L. Kaltofen |
| 1997 | ISSAC | On Randomized Lanczos Algorithms. | Wayne Eberly, Erich L. Kaltofen |
| 1997 | ISSAC | Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields. | Erich L. Kaltofen, Victor Shoup |
| 1996 | ISSAC | Generic Gram-Schmidt Orthogonalization by Exact Division. | lfar Erlingsson, Erich L. Kaltofen, David R. Musser |
| 1996 | ISSAC | On Rank Properties of Toeplitz Matrices over Finite Fields. | Erich L. Kaltofen, Austin Lobo |
| 1995 | ISSAC | On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations. | Angel Daz, Erich L. Kaltofen |
| 1995 | PODC | Prediction Based Task Scheduling in Distributed Computing (Abstract). | Mehrdad Samadani, Erich L. Kaltofen |
| 1995 | STOC | Subquadratic-time factoring of polynomials over finite fields. | Erich L. Kaltofen, Victor Shoup |
| 1994 | ISSAC | Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems. | Erich L. Kaltofen |
| 1994 | ISSAC | Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm. | Erich L. Kaltofen, Austin Lobo |
| 1992 | FOCS | Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract) | Erich L. Kaltofen, Victor Y. Pan |
| 1992 | ISSAC | On Computing Determinants of Matrices without Divisions. | Erich L. Kaltofen |
| 1992 | LATIN | Polynomial Factorization 1987-1991. | Erich L. Kaltofen |
| 1991 | ISSAC | DSC: A System for Distributed Symbolic Computation. | Angel Daz, Erich L. Kaltofen, Kurt Schmitz, Thomas Valente |
| 1991 | STOC | Effective Noether Irreducibility Forms and Applications (Extended Abstract) | Erich L. Kaltofen |
| 1991 | SPAA | Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. | Erich L. Kaltofen, Victor Y. Pan |
| 1990 | ISSAC | Modular Rational Sparse Multivariate Polynomial Interpolation. | Erich L. Kaltofen, Yagati N. Lakshman, J.-M. Wiley |
| 1989 | ISSAC | Solving Systems of Nonlinear Polynomial Equations Faster. | John F. Canny, Erich L. Kaltofen, Yagati N. Lakshman |
| 1989 | ISSAC | An Improved Las Vegas Primality Test. | Erich L. Kaltofen, Thomas Valente, Norika Yui |
| 1988 | FOCS | Computing with Polynomials Given By Black Boxes for Their Evaluation: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators | Erich L. Kaltofen, Barry M. Trager |
| 1988 | ISSAC | Improved Sparse Multivariate Polynomial Interpolation Algorithms. | Erich L. Kaltofen, Yagati N. Lakshman |
| 1987 | STOC | Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials | Erich L. Kaltofen |
| 1986 | ISSAC | A system for manipulating polynomials given by straight-line programs. | Timothy S. Freeman, Gregory M. Imirzian, Erich L. Kaltofen |
| 1986 | ISSAC | Fast parallel algorithms for similarity of matrices. | Erich L. Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders |
| 1986 | STOC | Uniform Closure Properties of P-Computable Functions | Erich L. Kaltofen |
| 1985 | FOCS | Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization | Erich L. Kaltofen |
| 1985 | STOC | Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors | Erich L. Kaltofen |
| 1983 | ICALP | Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. | Joachim von zur Gathen, Erich L. Kaltofen |
| 1982 | FOCS | A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization | Erich L. Kaltofen |
| 1982 | STOC | A Polynomial Reduction from Multivariate to Bivariate Integral Polynomial Factorization | Erich L. Kaltofen |
| 1981 | ISSAC | A generalized class of polynomials that are hard to factor. | Erich L. Kaltofen, David R. Musser, B. David Saunders |