Erich Kaltofen

ORCID

Publication Activity (10 Years)

Years Active: 1981-2020
Publications (10 Years): 8

Top Venues

CoRR

ISSAC

J. Symb. Comput.

ACM Commun. Comput. Algebra

Publications

Jean-Guillaume Dumas, Erich Kaltofen, David Lucas, Clément Pernet
Elimination-based certificates for triangular equivalence and rank profiles. J. Symb. Comput. 98 (2020)
Mark Giesbrecht, Joseph Haraldson, Erich Kaltofen
Computing Approximate Greatest Common Right Divisors of Differential Polynomials. Found. Comput. Math. 20 (2) (2020)
Jean-Guillaume Dumas, Erich Kaltofen, David Lucas, Clément Pernet
Elimination-based certificates for triangular equivalence and rank profiles. CoRR (2019)
Mark Giesbrecht, Joseph Haraldson, Erich Kaltofen
Computing Approximate Greatest Common Right Divisors of Differential Polynomials. CoRR (2017)
Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé, Gilles Villard
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. CoRR (2016)
Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé, Gilles Villard
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. ISSAC (2016)
Erich Kaltofen
Jenks prize 2015 award citation. ACM Commun. Comput. Algebra 49 (4) (2015)
Jean-Guillaume Dumas, Erich Kaltofen, Emmanuel Thomé
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. CoRR (2015)
Jean-Guillaume Dumas, Erich Kaltofen
Essentially optimal interactive certificates in linear algebra. ISSAC (2014)
Jean-Guillaume Dumas, Erich Kaltofen
Essentially optimal interactive certificates in linear algebra. CoRR (2014)
Erich Kaltofen, Clément Pernet
Sparse Polynomial Interpolation Codes and their decoding beyond half the minimal distance. CoRR (2014)
Erich Kaltofen, Alexey Ovchinnikov
NSF funding opportunities for symbolic computation. ACM Commun. Comput. Algebra 47 (3/4) (2013)
Erich Kaltofen, Zhengfeng Yang
Sparse multivariate function recovery from values with noise and outlier errors. ISSAC (2013)
Erich Kaltofen, George Yuhasz
On the matrix berlekamp-massey algorithm. ACM Trans. Algorithms 9 (4) (2013)
Erich Kaltofen
Jenks prize 2013 award citation. ACM Commun. Comput. Algebra 47 (3/4) (2013)
Erich Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. J. Symb. Comput. 47 (1) (2012)
Feng Guo, Erich Kaltofen, Lihong Zhi
Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. ISSAC (2012)
Jeremy R. Johnson, Erich Kaltofen, Hyungju Park
Special Issue on Symbolic and Algebraic Computation Foundations, Algorithmics and Applications: ISSAC 2009. J. Symb. Comput. 47 (7) (2012)
Matthew T. Comer, Erich Kaltofen, Clément Pernet
Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values. ISSAC (2012)
Matthew T. Comer, Erich Kaltofen
On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field. J. Symb. Comput. 47 (4) (2012)
Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier
Symmetric Determinantal Representation of Weakly-Skew Circuits. STACS (2011)
Erich Kaltofen
What is Hybrid Symbolic-Numeric Computation? SYNASC (2011)
Erich Kaltofen, Michael Nehring, B. David Saunders
Quadratic-time certificates in linear algebra. ISSAC (2011)
Erich Kaltofen, Michael Nehring
Supersparse black box rational function interpolation. ISSAC (2011)
Erich Kaltofen, Mark Lavin
Efficiently Certifying Non-Integer Powers. Comput. Complex. 19 (3) (2010)
Sharon Hutton, Erich Kaltofen, Lihong Zhi
Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method. ISSAC (2010)
Erich Kaltofen
Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010. PASCO (2010)
Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits CoRR (2010)
B. Malcolm Brown, Erich Kaltofen, Shin'ichi Oishi, Siegfried M. Rump
09471 Abstracts Collection - Computer-assisted proofs - tools, methods and applications. Computer-assisted proofs - tools, methods and applications (2009)
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions. SNC (2009)
B. Malcolm Brown, Erich Kaltofen, Shin'ichi Oishi, Siegfried M. Rump
09471 Executive Summary - Computer-assisted proofs - tools, methods and applications. Computer-assisted proofs - tools, methods and applications (2009)
George Yuhasz, Erich Kaltofen
Computing minimal generators of integer matrix sequences (abstract only). ACM Commun. Comput. Algebra 42 (1-2) (2008)
Erich Kaltofen, Pascal Koiran
Expressing a fraction of two determinants as a determinant. ISSAC (2008)
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi
Approximate factorization of multivariate polynomials using singular value decomposition. J. Symb. Comput. 43 (5) (2008)
Erich Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. ISSAC (2008)
Erich Kaltofen, Zhengfeng Yang
On exact and approximate interpolation of sparse rational functions. ISSAC (2007)
Erich Kaltofen, Bin Li, Kartik Sivaramakrishnan, Zhengfeng Yang, Lihong Zhi
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). SNC (2007)
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. SNC (2007)
Peter B. Borwein, Erich Kaltofen, Michael J. Mossinghoff
Irreducible polynomials and barker sequences. ACM Commun. Comput. Algebra 41 (4) (2007)
Wolfram Decker, Mike Dewar, Erich Kaltofen, Stephen M. Watt
06271 Executive Summary - Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software (2006)
Erich Kaltofen, Pascal Koiran
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. ISSAC (2006)
Wolfram Decker, Mike Dewar, Erich Kaltofen, Stephen M. Watt
06271 Abstracts Collection -- Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software (2006)
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. ISSAC (2006)
Erich Kaltofen, Lihong Zhi
Hybrid symbolic-numeric computation. ISSAC (2006)
Erich Kaltofen, Dmitriy Morozov, George Yuhasz
Generic matrix multiplication and memory management in linBox. ISSAC (2005)
Erich Kaltofen, Pascal Koiran
On the complexity of factoring bivariate supersparse (Lacunary) polynomials. ISSAC (2005)
Erich Kaltofen, Gilles Villard
On the complexity of computing determinants. Comput. Complex. 13 (3-4) (2005)
Shuhong Gao, Erich Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi
Approximate factorization of multivariate polynomials via differential equations. ISSAC (2004)
Shuhong Gao, Erich Kaltofen, Alan G. B. Lauder
Deterministic distinct-degree factorization of polynomials over finite fields. J. Symb. Comput. 38 (6) (2004)
Erich Kaltofen, John P. May
On approximate irreducibility of polynomials in several variables. ISSAC (2003)
Erich Kaltofen
Polynomial factorization: a success story. ISSAC (2003)
Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases. J. Symb. Comput. 36 (3-4) (2003)
Erich Kaltofen, Wen-shin Lee
Early termination in sparse interpolation algorithms. J. Symb. Comput. 36 (3-4) (2003)
Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. ISSAC (2002)
Erich Kaltofen
An output-sensitive variant of the baby steps/giant steps determinant algorithm. ISSAC (2002)
Erich Kaltofen
Challenges of Symbolic Computation: My Favorite Open Problems. J. Symb. Comput. 29 (6) (2000)
Erich Kaltofen, Wen-shin Lee, Austin Lobo
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. ISSAC (2000)
Markus A. Hitz, Erich Kaltofen, Yagati N. Lakshman
Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. ISSAC (1999)
Laurent Bernardin, Bruce W. Char, Erich Kaltofen
Symbolic Computation in Java: An Appraisement. ISSAC (1999)
Erich Kaltofen, Michael B. Monagan
On the Genericity of the Modular Polynomial GCD Algorithm. ISSAC (1999)
Hoon Hong, Erich Kaltofen, Michael F. Singer
East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters. SIGSAM Bull. 33 (2) (1999)
Erich Kaltofen, Austin Lobo
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields. Algorithmica 24 (3-4) (1999)
Erich Kaltofen, Victor Shoup
Subquadratic-time factoring of polynomials over finite fields. Math. Comput. 67 (223) (1998)
Markus A. Hitz, Erich Kaltofen
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots. ISSAC (1998)
Angel Díaz, Erich Kaltofen
FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation. ISSAC (1998)
Erich Kaltofen
Teaching Computational Abstract Algebra. J. Symb. Comput. 23 (5/6) (1997)
Erich Kaltofen, Victor Shoup
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields. ISSAC (1997)
Wayne Eberly, Erich Kaltofen
On Randomized Lanczos Algorithms. ISSAC (1997)
Úlfar Erlingsson, Erich Kaltofen, David R. Musser
Generic Gram-Schmidt Orthogonalization by Exact Division. ISSAC (1996)
Erich Kaltofen, Austin Lobo
On Rank Properties of Toeplitz Matrices over Finite Fields. ISSAC (1996)
Angel Díaz, Erich Kaltofen
On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations. ISSAC (1995)
Mehrdad Samadani, Erich Kaltofen
Prediction Based Task Scheduling in Distributed Computing. LCR (1995)
Markus A. Hitz, Erich Kaltofen
Integer Division in Residue Number Systems. IEEE Trans. Computers 44 (8) (1995)
Angel Díaz, Markus A. Hitz, Erich Kaltofen, Austin Lobo, Thomas Valente
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. J. Symb. Comput. 19 (1-3) (1995)
Erich Kaltofen, Victor Shoup
Subquadratic-time factoring of polynomials over finite fields. STOC (1995)
Mehrdad Samadani, Erich Kaltofen
Prediction Based Task Scheduling in Distributed Computing (Abstract). PODC (1995)
Erich Kaltofen
Effective Noether Irreducibility Forms and Applications. J. Comput. Syst. Sci. 50 (2) (1995)
Erich Kaltofen
Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems. ISSAC (1994)
Erich Kaltofen, Austin Lobo
Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm. ISSAC (1994)
Erich Kaltofen
Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems. AAECC (1993)
Erich Kaltofen
Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor. SIGSAM Bull. 27 (4) (1993)
Angel Díaz, Markus A. Hitz, Erich Kaltofen, Austin Lobo, Thomas Valente
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. DISCO (1993)
Erich Kaltofen
Polynomial Factorization 1987-1991. LATIN (1992)
Erich Kaltofen, Victor Y. Pan
Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract) FOCS (1992)
Erich Kaltofen
On Computing Determinants of Matrices without Divisions. ISSAC (1992)
Erich Kaltofen, B. David Saunders
On Wiedemann's Method of Solving Sparse Linear Systems. AAECC (1991)
Angel Díaz, Erich Kaltofen, Kurt Schmitz, Thomas Valente
DSC: A System for Distributed Symbolic Computation. ISSAC (1991)
Erich Kaltofen
Effective Noether Irreducibility Forms and Applications (Extended Abstract) STOC (1991)
David G. Cantor, Erich Kaltofen
On Fast Multiplication of Polynomials over Arbitrary Algebras. Acta Informatica 28 (7) (1991)
Erich Kaltofen, Victor Y. Pan
Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. SPAA (1991)
Erich Kaltofen, Barry M. Trager
Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators. J. Symb. Comput. 9 (3) (1990)
Erich Kaltofen, Yagati N. Lakshman, J.-M. Wiley
Modular Rational Sparse Multivariate Polynomial Interpolation. ISSAC (1990)
Erich Kaltofen, Bruno Buchberger
Special Issue Computational Algebraic Complexity Editorial. J. Symb. Comput. 9 (3) (1990)
Erich Kaltofen
Computing the Irreducible Real Factors and Components of an Algebraic Curve. Appl. Algebra Eng. Commun. Comput. 1 (1990)
Erich Kaltofen
Factorization of Polynomials Given by Straight-Line Programs. Adv. Comput. Res. 5 (1989)
Erich Kaltofen, Thomas Valente, Norika Yui
An Improved Las Vegas Primality Test. ISSAC (1989)
John F. Canny, Erich Kaltofen, Yagati N. Lakshman
Solving Systems of Nonlinear Polynomial Equations Faster. ISSAC (1989)
Erich Kaltofen
Computing the Irreducible Real Factors and Components of an Algebraic Curve. SCG (1989)
Erich Kaltofen
Greatest common divisors of polynomials given by straight-line programs. J. ACM 35 (1) (1988)
Erich Kaltofen, Barry M. Trager
Computing with Polynomials Given By Black Boxes for Their Evaluation: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators FOCS (1988)

Erich Kaltofen.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Erich Kaltofen