A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization - Erich L. Kaltofen (FOCS, 1982)

Polynomial reduction from multivariate to bivariate integral polynomial factorization. - Erich L. Kaltofen (SIGSAM Bull., 1982)

On the complexity of finding short vectors in integer lattices. - Erich L. Kaltofen (EUROCAL, 1983)

Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. - Joachim von zur Gathen; Erich L. Kaltofen (ICALP, 1983)

A Generalized Class of Polynomials that are Hard to Factor. - Erich L. Kaltofen; David R. Musser; B. David Saunders (SIAM J. Comput., 1983)

A Note on the Risch Differential Equation. - Erich L. Kaltofen (EUROSAM, 1984)

Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields with Class Numbers 7 and 11. - Erich L. Kaltofen; Noriko Yui (EUROSAM, 1984)

Sparse Hensel Lifting. - Erich L. Kaltofen (European Conference on Computer Algebra (2), 1985)

Arithmetic in Quadratic Fields with Unique Factorization. - Erich L. Kaltofen; Heinrich Rolletschek (European Conference on Computer Algebra (2), 1985)

Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization - Erich L. Kaltofen (FOCS, 1985)

Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors - Erich L. Kaltofen (STOC, 1985)

Factoring Sparse Multivariate Polynomials. - Joachim von zur Gathen; Erich L. Kaltofen (J. Comput. Syst. Sci., 1985)

Fast Parallel Absolute Irreducibility Testing. - Erich L. Kaltofen (J. Symb. Comput., 1985)

Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization. - Erich L. Kaltofen (SIAM J. Comput., 1985)

Effective Hilbert Irreducibility - Erich L. Kaltofen (Inf. Control., 1985)

Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. - Gary L. Miller; Vijaya Ramachandran; Erich L. Kaltofen (Aegean Workshop on Computing, 1986)

A system for manipulating polynomials given by straight-line programs. - Timothy S. Freeman; Gregory M. Imirzian; Erich L. Kaltofen (SYMSAC, 1986)

Fast parallel algorithms for similarity of matrices. - Erich L. Kaltofen; Mukkai S. Krishnamoorthy; B. David Saunders (SYMSAC, 1986)

Uniform Closure Properties of P-Computable Functions - Erich L. Kaltofen (STOC, 1986)

Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices. - Erich L. Kaltofen; Mukkai S. Krishnamoorthy; B. David Saunders (EUROCAL, 1987)

Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials - Erich L. Kaltofen (STOC, 1987)

Deterministic Irreducibility Testing of Polynomials over Large Finite Fields. - Erich L. Kaltofen (J. Symb. Comput., 1987)

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 (FOCS, 1988)

Improved Sparse Multivariate Polynomial Interpolation Algorithms. - Erich L. Kaltofen; Yagati N. Lakshman (ISSAC, 1988)

Analysis of the binary complexity of asymptotically fast algorithms for linear system solving. - Brent Gregory; Erich L. Kaltofen (SIGSAM Bull., 1988)

Greatest common divisors of polynomials given by straight-line programs. - Erich L. Kaltofen (J. ACM, 1988)

Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. - Gary L. Miller; Vijaya Ramachandran; Erich L. Kaltofen (SIAM J. Comput., 1988)

Dagwood: a system for manipulating polynomials given by straight-line programs. - Timothy S. Freeman; Gregory M. Imirzian; Erich L. Kaltofen; Yagati N. Lakshman (ACM Trans. Math. Softw., 1988)

Computers and mathematics. - Erich L. Kaltofen (Springer, 1989)

Solving Systems of Nonlinear Polynomial Equations Faster. - John F. Canny; Erich L. Kaltofen; Yagati N. Lakshman (ISSAC, 1989)

An Improved Las Vegas Primality Test. - Erich L. Kaltofen; Thomas Valente; Norika Yui (ISSAC, 1989)

Factorization of Polynomials Given by Straight-Line Programs. - Erich L. Kaltofen (Adv. Comput. Res., 1989)

Modular Rational Sparse Multivariate Polynomial Interpolation. - Erich L. Kaltofen; Yagati N. Lakshman; J.-M. Wiley (ISSAC, 1990)

Computing the Irreducible Real Factors and Components of an Algebraic Curve. - Erich L. Kaltofen (Appl. Algebra Eng. Commun. Comput., 1990)

Special Issue Computational Algebraic Complexity Editorial. - Erich L. Kaltofen; Bruno Buchberger (J. Symb. Comput., 1990)

Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators. - Erich L. Kaltofen; Barry M. Trager (J. Symb. Comput., 1990)

On Wiedemann's Method of Solving Sparse Linear Systems. - Erich L. Kaltofen; B. David Saunders (AAECC, 1991)

DSC: A System for Distributed Symbolic Computation. - Angel Díaz; Erich L. Kaltofen; Kurt Schmitz; Thomas Valente (ISSAC, 1991)

Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. - Erich L. Kaltofen; Victor Y. Pan (SPAA, 1991)

Effective Noether Irreducibility Forms and Applications (Extended Abstract) - Erich L. Kaltofen (STOC, 1991)

On Fast Multiplication of Polynomials over Arbitrary Algebras. - David G. Cantor; Erich L. Kaltofen (Acta Informatica, 1991)

Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract) - Erich L. Kaltofen; Victor Y. Pan (FOCS, 1992)

On Computing Determinants of Matrices without Divisions. - Erich L. Kaltofen (ISSAC, 1992)

Polynomial Factorization 1987-1991. - Erich L. Kaltofen (LATIN, 1992)

Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems. - Erich L. Kaltofen (AAECC, 1993)

Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor. - Erich L. Kaltofen (SIGSAM Bull., 1993)

Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems. - Erich L. Kaltofen (ISSAC, 1994)

Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm. - Erich L. Kaltofen; Austin Lobo (ISSAC, 1994)

Parallel Solution of Toeplitz and Toeplitz-Like Linear Systems Over Fields of Small Positive Characteristic. - Erich L. Kaltofen; Victor Y. Pan (PASCO, 1994)

On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations. - Angel Díaz; Erich L. Kaltofen (ISSAC, 1995)

Prediction Based Task Scheduling in Distributed Computing. - Mehrdad Samadani; Erich L. Kaltofen (LCR, 1995)

Prediction Based Task Scheduling in Distributed Computing (Abstract). - Mehrdad Samadani; Erich L. Kaltofen (PODC, 1995)

Effective Noether Irreducibility Forms and Applications. - Erich L. Kaltofen (J. Comput. Syst. Sci., 1995)

Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. - Angel Díaz; Markus A. Hitz; Erich L. Kaltofen; Austin Lobo; Thomas Valente (J. Symb. Comput., 1995)

Integer Division in Residue Number Systems. - Markus A. Hitz; Erich L. Kaltofen (IEEE Trans. Computers, 1995)

Generic Gram-Schmidt Orthogonalization by Exact Division. - Úlfar Erlingsson; Erich L. Kaltofen; David R. Musser (ISSAC, 1996)

On Rank Properties of Toeplitz Matrices over Finite Fields. - Erich L. Kaltofen; Austin Lobo (ISSAC, 1996)

Algebraic Algorithms. - Angel Díaz; Erich L. Kaltofen; Victor Y. Pan (The Computer Science and Engineering Handbook, 1997)

On Randomized Lanczos Algorithms. - Wayne Eberly; Erich L. Kaltofen (ISSAC, 1997)

Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields. - Erich L. Kaltofen; Victor Shoup (ISSAC, 1997)

Teaching Computational Abstract Algebra. - Erich L. Kaltofen (J. Symb. Comput., 1997)

FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation. - Angel Díaz; Erich L. Kaltofen (ISSAC, 1998)

Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots. - Markus A. Hitz; Erich L. Kaltofen (ISSAC, 1998)

Subquadratic-time factoring of polynomials over finite fields. - Erich L. Kaltofen; Victor Shoup (Math. Comput., 1998)

Algebraic Algorithms. - Angel Díaz; Ioannis Z. Emiris; Erich L. Kaltofen; Victor Y. Pan (Algorithms and Theory of Computation Handbook, 1999)

Symbolic Computation in Java: An Appraisement. - Laurent Bernardin; Bruce W. Char; Erich L. Kaltofen (ISSAC, 1999)

Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. - Markus A. Hitz; Erich L. Kaltofen; Yagati N. Lakshman (ISSAC, 1999)

On the Genericity of the Modular Polynomial GCD Algorithm. - Erich L. Kaltofen; Michael B. Monagan (ISSAC, 1999)

Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields. - Erich L. Kaltofen; Austin Lobo (Algorithmica, 1999)

East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters. - Hoon Hong; Erich L. Kaltofen; Michael F. Singer (SIGSAM Bull., 1999)

Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. - Erich L. Kaltofen; Wen-shin Lee; Austin Lobo (ISSAC, 2000)

Challenges of Symbolic Computation: My Favorite Open Problems. - Erich L. Kaltofen (J. Symb. Comput., 2000)

Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. - Mark Giesbrecht; Erich L. Kaltofen; Wen-shin Lee (ISSAC, 2002)

An output-sensitive variant of the baby steps/giant steps determinant algorithm. - Erich L. Kaltofen (ISSAC, 2002)

Polynomial factorization: a success story. - Erich L. Kaltofen (ISSAC, 2003)

On approximate irreducibility of polynomials in several variables. - Erich L. Kaltofen; John P. May (ISSAC, 2003)

Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases. - Mark Giesbrecht; Erich L. Kaltofen; Wen-shin Lee (J. Symb. Comput., 2003)

Early termination in sparse interpolation algorithms. - Erich L. Kaltofen; Wen-shin Lee (J. Symb. Comput., 2003)

Approximate factorization of multivariate polynomials via differential equations. - Shuhong Gao; Erich L. Kaltofen; John P. May; Zhengfeng Yang; Lihong Zhi (ISSAC, 2004)

Deterministic distinct-degree factorization of polynomials over finite fields. - Shuhong Gao; Erich L. Kaltofen; Alan G. B. Lauder (J. Symb. Comput., 2004)

On the complexity of factoring bivariate supersparse (Lacunary) polynomials. - Erich L. Kaltofen; Pascal Koiran (ISSAC, 2005)

Generic matrix multiplication and memory management in linBox. - Erich L. Kaltofen; Dmitriy Morozov; George Yuhasz (ISSAC, 2005)

On the complexity of computing determinants. - Erich L. Kaltofen; Gilles Villard (Comput. Complex., 2005)

06271 Executive Summary - Challenges in Symbolic Computation Software. - Wolfram Decker; Mike Dewar; Erich L. Kaltofen; Stephen M. Watt (Challenges in Symbolic Computation Software, 2006)

06271 Abstracts Collection – Challenges in Symbolic Computation Software. - Wolfram Decker; Mike Dewar; Erich L. Kaltofen; Stephen M. Watt (Challenges in Symbolic Computation Software, 2006)

Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. - Erich L. Kaltofen; Pascal Koiran (ISSAC, 2006)

Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. - Erich L. Kaltofen; Zhengfeng Yang; Lihong Zhi (ISSAC, 2006)

Hybrid symbolic-numeric computation. - Erich L. Kaltofen; Lihong Zhi (ISSAC, 2006)

Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). - Erich L. Kaltofen; Bin Li; Kartik Sivaramakrishnan; Zhengfeng Yang; Lihong Zhi (SNC, 2007)

On exact and approximate interpolation of sparse rational functions. - Erich L. Kaltofen; Zhengfeng Yang (ISSAC, 2007)

On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. - Erich L. Kaltofen; Zhengfeng Yang; Lihong Zhi (SNC, 2007)

Irreducible polynomials and barker sequences. - Peter B. Borwein; Erich L. Kaltofen; Michael J. Mossinghoff (ACM Commun. Comput. Algebra, 2007)

Expressing a fraction of two determinants as a determinant. - Erich L. Kaltofen; Pascal Koiran (ISSAC, 2008)

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 (ISSAC, 2008)

Computing minimal generators of integer matrix sequences (abstract only). - George Yuhasz; Erich L. Kaltofen (ACM Commun. Comput. Algebra, 2008)

Approximate factorization of multivariate polynomials using singular value decomposition. - Erich L. Kaltofen; John P. May; Zhengfeng Yang; Lihong Zhi (J. Symb. Comput., 2008)

09471 Abstracts Collection - Computer-assisted proofs - tools, methods and applications. - B. Malcolm Brown; Erich L. Kaltofen; Shin'ichi Oishi; Siegfried M. Rump (Computer-assisted proofs - tools, methods and applications, 2009)

09471 Executive Summary - Computer-assisted proofs - tools, methods and applications. - B. Malcolm Brown; Erich L. Kaltofen; Shin'ichi Oishi; Siegfried M. Rump (Computer-assisted proofs - tools, methods and applications, 2009)

A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions. - Erich L. Kaltofen; Zhengfeng Yang; Lihong Zhi (SNC, 2009)

Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010. - Erich L. Kaltofen (PASCO, 2010)

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 (ISSAC, 2010)

Efficiently Certifying Non-Integer Powers. - Erich L. Kaltofen; Mark Lavin (Comput. Complex., 2010)

Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits - Bruno Grenet; Erich L. Kaltofen; Pascal Koiran; Natacha Portier (CoRR, 2010)

Supersparse black box rational function interpolation. - Erich L. Kaltofen; Michael Nehring (ISSAC, 2011)

Quadratic-time certificates in linear algebra. - Erich L. Kaltofen; Michael Nehring; B. David Saunders (ISSAC, 2011)

Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation. - Erich L. Kaltofen; Wen-shin Lee; Zhengfeng Yang (SNC, 2011)

Symmetric Determinantal Representation of Weakly-Skew Circuits. - Bruno Grenet; Erich L. Kaltofen; Pascal Koiran; Natacha Portier (STACS, 2011)

What is Hybrid Symbolic-Numeric Computation? - Erich L. Kaltofen (SYNASC, 2011)

Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations. - Brice Boyer; Matthew T. Comer; Erich L. Kaltofen (ASCM, 2012)

Symbolic Computation and Complexity Theory Transcript of My Talk. - Erich L. Kaltofen (ASCM, 2012)

Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values. - Matthew T. Comer; Erich L. Kaltofen; Clément Pernet (ISSAC, 2012)

Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. - Feng Guo 007; Erich L. Kaltofen; Lihong Zhi (ISSAC, 2012)

On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field. - Matthew T. Comer; Erich L. Kaltofen (J. Symb. Comput., 2012)

Special Issue on Symbolic and Algebraic Computation Foundations, Algorithmics and Applications: ISSAC 2009. - Jeremy R. Johnson; Erich L. Kaltofen; Hyungju Park (J. Symb. Comput., 2012)

Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. - Erich L. Kaltofen; Bin Li; Zhengfeng Yang; Lihong Zhi (J. Symb. Comput., 2012)

Factorization of multivariate polynomials. - Erich L. Kaltofen; Grégoire Lecerf (Handbook of Finite Fields, 2013)

Sparse multivariate function recovery from values with noise and outlier errors. - Erich L. Kaltofen; Zhengfeng Yang (ISSAC, 2013)

Jenks prize 2013 award citation. - Erich L. Kaltofen (ACM Commun. Comput. Algebra, 2013)

NSF funding opportunities for symbolic computation. - Erich L. Kaltofen; Alexey Ovchinnikov (ACM Commun. Comput. Algebra, 2013)

On the matrix berlekamp-massey algorithm. - Erich L. Kaltofen; George Yuhasz (ACM Trans. Algorithms, 2013)

Essentially optimal interactive certificates in linear algebra. - Jean-Guillaume Dumas; Erich L. Kaltofen (ISSAC, 2014)

Sparse polynomial interpolation codes and their decoding beyond half the minimum distance. - Erich L. Kaltofen; Clément Pernet (ISSAC, 2014)

Sparse multivariate function recovery with a high error rate in the evaluations. - Erich L. Kaltofen; Zhengfeng Yang (ISSAC, 2014)

Cleaning-up data for sparse model synthesis: when symbolic-numeric computation meets error-correcting codes. - Erich L. Kaltofen (SNC, 2014)

Numerical Linear System Solving with Parametric Entries by Error Correction. - Brice Boyer; Erich L. Kaltofen (ACM Commun. Comput. Algebra, 2014)

Sparse Polynomial Interpolation Codes and their decoding beyond half the minimal distance. - Erich L. Kaltofen; Clément Pernet (CoRR, 2014)

Error-Correcting Sparse Interpolation in the Chebyshev Basis. - Andrew Arnold; Erich L. Kaltofen (ISSAC, 2015)

Jenks prize 2015 award citation. - Erich L. Kaltofen (ACM Commun. Comput. Algebra, 2015)

Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices. - Jean-Guillaume Dumas; Erich L. Kaltofen; Emmanuel Thomé (CoRR, 2015)

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 (ISSAC, 2016)

Numerical Sparsity Determination and Early Termination. - Zhiwei Hao; Erich L. Kaltofen; Lihong Zhi (ISSAC, 2016)

Sparse multivariate function recovery with a small number of evaluations. - Erich L. Kaltofen; Zhengfeng Yang (J. Symb. Comput., 2016)

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 (ISSAC, 2017)

Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction. - Erich L. Kaltofen; Clément Pernet; Arne Storjohann; Cleveland Waddell (ISSAC, 2017)

Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases. - Erdal Imamoglu; Erich L. Kaltofen; Zhengfeng Yang (ISSAC, 2018)

Hermite Rational Function Interpolation with Error Correction. - Erich L. Kaltofen; Clément Pernet; Zhi-Hong Yang (CASC, 2020)

A note on sparse polynomial interpolation in Dickson polynomial basis. - Erdal Imamoglu; Erich L. Kaltofen (ACM Commun. Comput. Algebra, 2020)

Computing Approximate Greatest Common Right Divisors of Differential Polynomials. - Mark Giesbrecht; Joseph Haraldson; Erich L. Kaltofen (Found. Comput. Math., 2020)

Elimination-based certificates for triangular equivalence and rank profiles. - Jean-Guillaume Dumas; Erich L. Kaltofen; David Lucas 001; Clément Pernet (J. Symb. Comput., 2020)

Computing Higher Polynomial Discriminants. - Erich L. Kaltofen (ISSAC, 2021)

Hermite Interpolation With Error Correction: Fields of Zero or Large Characteristic and Large Error Rate. - Erich L. Kaltofen; Clément Pernet; Zhi-Hong Yang (ISSAC, 2021)

On computing the degree of a Chebyshev Polynomial from its value. - Erdal Imamoglu; Erich L. Kaltofen (J. Symb. Comput., 2021)

Foreword. - Erich L. Kaltofen (J. Symb. Comput., 2021)

Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding. - Erich L. Kaltofen; Zhi-Hong Yang (IEEE Trans. Inf. Theory, 2021)

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 (ISSAC, 2022)

Sparse Polynomial Hermite Interpolation. - Erich L. Kaltofen (ISSAC, 2022)

A note on the van der Waerden conjecture on random polynomials with symmetric Galois group for function fields. - Erich L. Kaltofen (CoRR, 2022)

Encounters in Symbolic Computation: Ideas for the Ages. - Erich L. Kaltofen (ISSAC, 2024)

Sparse Polynomial Interpolation With Error Correction: Higher Error Capacity by Randomization. - Erich L. Kaltofen; Zhi-Hong Yang (ISSAC, 2024)