Erich Kaltofen

发表

Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars

Bin Li, Erich Kaltofen, Zhengfeng Yang, 2008, ISSAC '08.

A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization

Erich Kaltofen, 1982, FOCS.

On Wiedemann's Method of Solving Sparse Linear Systems

Erich Kaltofen, B. David Saunders, B. D. Saunders, 1991, AAECC.

LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA

Erich Kaltofen, Jean-Guillaume Dumas, Gilles Villard, 2002 .

Error-Correcting Sparse Interpolation in the Chebyshev Basis

Erich Kaltofen, Andrew Arnold, 2015, ISSAC.

Factorization of Polynomials Given by Straight-Line Programs

Erich Kaltofen, E. Kaltofen, 1989, Adv. Comput. Res..

Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm

Erich Kaltofen, Mark Giesbrecht, Wen-shin Lee, 2002, ISSAC '02.

Computers and Mathematics

Erich Kaltofen, E. Kaltofen, 1989, Springer US.

Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings

Erich Kaltofen, Jeremy Johnson, Hyungju Park, 2009, ISSAC.

Approximate factorization of multivariate polynomials via differential equations

Erich Kaltofen, Zhengfeng Yang, Lihong Zhi, 2004, ISSAC '04.

Symmetric Determinantal Representation of Weakly-Skew Circuits

Erich Kaltofen, Bruno Grenet, Pascal Koiran, 2011, STACS.

Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor

Erich Kaltofen, 1993, SIGS.

Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values

Erich Kaltofen, Clément Pernet, Matthew T. Comer, 2012, ISSAC.

Special Issue on Symbolic and Algebraic Computation Foundations, Algorithmics and Applications: ISSAC 2009

Erich Kaltofen, Hyungju Park, Jeremy R. Johnson, 2012, J. Symb. Comput..

An improved Las Vegas primality test

Erich Kaltofen, Thomas Valente, Norika Yui, 1989, ISSAC '89.

Polynomial factorization: a success story

Erich Kaltofen, E. Kaltofen, 2003, ISSAC '03.

Effective Noether Irreducibility Forms and Applications (Extended Abstract)

Erich Kaltofen, 1991, STOC 1991.

Numerical Linear System Solving with Parametric Entries by Error Correction

Erich Kaltofen, Brice Boyer, 2015, ACCA.

East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters

Erich Kaltofen, Michael F. Singer, Hoon Hong, 1999, SIGS.

Approximate factorization of multivariate polynomials using singular value decomposition

Erich Kaltofen, Zhengfeng Yang, Lihong Zhi, 2008, J. Symb. Comput..

Prediction Based Task Scheduling in Distributed Computing (Abstract).

Erich Kaltofen, Mehrdad Samadani, 1995, PODC 1995.

Qualifying Examination Topics August 2007 Computer Algebra (MA 522-MA792K)

Erich Kaltofen, E. Kaltofen, 2007 .

On exact and approximate interpolation of sparse rational functions

Erich Kaltofen, Zhengfeng Yang, E. Kaltofen, 2007, ISSAC '07.

Sparse multivariate function recovery with a small number of evaluations

Erich Kaltofen, Zhengfeng Yang, 2016, J. Symb. Comput..

Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation

Erich Kaltofen, Jeremy Johnson, Hyungju Park, 2019, ISSAC.

On computing determinants of matrices without divisions

Erich Kaltofen, E. Kaltofen, 1992, ISSAC '92.

Elimination-based certificates for triangular equivalence and rank profiles

Erich Kaltofen, Jean-Guillaume Dumas, Clément Pernet, 2019, J. Symb. Comput..

Uniform closure properties of P-computable functions

Erich Kaltofen, E. Kaltofen, 1986, STOC '86.

Process Scheduling in DSC and the Large Sparse Linear Systems Challenge

Erich Kaltofen, Markus A. Hitz, Thomas Valente, 1995, J. Symb. Comput..

Teaching Computational Abstract Algebra

Erich Kaltofen, E. Kaltofen, 1997, J. Symb. Comput..

Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions

Erich Kaltofen, Lihong Zhi, Feng Guo, 2012, ISSAC.

Early termination in sparse interpolation algorithms

Erich Kaltofen, Wen-shin Lee, 2003, J. Symb. Comput..

Polynomial Factorization 1987-1991

Erich Kaltofen, E. Kaltofen, 1992, LATIN.

Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases

Erich Kaltofen, Mark Giesbrecht, Wen-shin Lee, 2003, J. Symb. Comput..

Computing the irreducible real factors and components of an algebraic curve

Erich Kaltofen, E. Kaltofen, 1989, SCG '89.

A system for manipulating polynomials given by straight-line programs

Erich Kaltofen, Timothy S. Freeman, Gregory M. Imirzian, 1986, SYMSAC '86.

A Note on the Risch Differential Equation

Erich Kaltofen, 1984, EUROSAM.

Dagwood: a system for manipulating polynomials given by straight-line programs

Erich Kaltofen, Y. N. Lakshman, Yagati N. Lakshman, 1988, TOMS.

Sparse multivariate function recovery from values with noise and outlier errors

Erich Kaltofen, Zhengfeng Yang, 2013, ISSAC '13.

What is Hybrid Symbolic-Numeric Computation?

Erich Kaltofen, Lihong Zhi, 2011, 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001

Erich Kaltofen, Gilles Villard, E. Kaltofen, 2001, ISSAC.

On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field

Erich Kaltofen, Matthew T. Comer, 2012, J. Symb. Comput..

Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010

Erich Kaltofen, E. Kaltofen, 2010, PASCO.

Computational algebraic complexity

Erich Kaltofen, E. Kaltofen, 1990 .

Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators

Erich Kaltofen, Barry M. Trager, 1990, J. Symb. Comput..

Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields

Erich Kaltofen, Joachim von zur Gathen, J. Gathen, 1983, ICALP.

Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations

Erich Kaltofen, Matthew T. Comer, Brice Boyer, 2012, ASCM.

Computer algebra handbook

Erich Kaltofen, Volker Weispfenning, Johannes Grabmeier, 2002 .

Efficiently Certifying Non-Integer Powers

Erich Kaltofen, Mark Lavin, 2010, computational complexity.

Fast polynomial factorization over high algebraic extensions of finite fields

Erich Kaltofen, Victor Shoup, V. Shoup, 1997, ISSAC.

Subquadratic-time factoring of polynomials over finite fields

Erich Kaltofen, Victor Shoup, 1998, Math. Comput..

Sparse polynomial interpolation codes and their decoding beyond half the minimum distance pdf

Erich Kaltofen, Clément Pernet, E. Kaltofen, 2014, ISSAC.

Essentially optimal interactive certificates in linear algebra

Erich Kaltofen, Jean-Guillaume Dumas, 2014, ISSAC.

Fast Parallel Absolute Irreducibility Testing

Erich Kaltofen, E. Kaltofen, 1985, J. Symb. Comput..

The Complexity of Computational Problems in Exact Linear Algebra

Erich Kaltofen, Arne Storjohann, 2011 .

Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method

Erich Kaltofen, Lihong Zhi, Sharon Hutton, 2010, ISSAC.

On approximate irreducibility of polynomials in several variables

Erich Kaltofen, John P. May, 2003, ISSAC '03.

Effective Noether irreducibility forms and applications

Erich Kaltofen, E. Kaltofen, 1991, STOC '91.

Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields with Class Numbers 7 and 11

Erich Kaltofen, Noriko Yui, E. Kaltofen, 1984, EUROSAM.

Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation

Erich Kaltofen, Zhengfeng Yang, Wen-shin Lee, 2012, SNC '11.

Efficient algorithms for computing the nearest polynomial with a real root and related problems

Erich Kaltofen, Markus A. Hitz, Y. N. Lakshman, 1999, ISSAC '99.

Numerical linear system solving with parametric entries by error correction

Erich Kaltofen, Brice Boyer, 2014, SNC.

A generalized class of polynomials that are hard to factor

Erich Kaltofen, David R. Musser, B. David Saunders, 1981, SYMSAC '81.

Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices

Erich Kaltofen, B. David Saunders, Mukkai S. Krishnamoorthy, 1987, EUROCAL.

Generic matrix multiplication and memory management in linBox

Erich Kaltofen, Dmitriy Morozov, George Yuhasz, 2005, ISSAC '05.

Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators

Erich Kaltofen, Barry M. Trager, E. Kaltofen, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

Prediction based task scheduling in distributed computing

Erich Kaltofen, Mehrdad Samadani, 1995, PODC '95.

On randomized Lanczos algorithms

Erich Kaltofen, Wayne Eberly, E. Kaltofen, 1997, ISSAC.

Foreword

Erich Kaltofen, E. Kaltofen, 2021, J. Symb. Comput..

On computing greatest common divisors with polynomials given by black boxes for their evaluations

Erich Kaltofen, Angel Díaz, 1995, ISSAC '95.

A polynomial reduction from multivariate to bivariate integral polynomial factorization.

Erich Kaltofen, E. Kaltofen, 1982, STOC '82.

On fast multiplication of polynomials over arbitrary algebras

Erich Kaltofen, David G. Cantor, D. Cantor, 1991, Acta Informatica.

Solving systems of nonlinear polynomial equations faster

Erich Kaltofen, John F. Canny, Y. N. Lakshman, 1989, ISSAC '89.

Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm

Erich Kaltofen, Wen-shin Lee, Austin Lobo, 2000, ISSAC.

Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients

Bin Li, Erich Kaltofen, Zhengfeng Yang, 2012, J. Symb. Comput..

Computing the irreducible real factors and components of an algebraicf curve

Erich Kaltofen, 1989, SCG '89.

Subquadratic-time factoring of polynomials over finite fields

Erich Kaltofen, Victor Shoup, V. Shoup, 1995, STOC '95.

Numerical Sparsity Determination and Early Termination

Erich Kaltofen, Lihong Zhi, Zhiwei Hao, 2016, ISSAC.

On the genericity of the modular polynomial GCD algorithm

Erich Kaltofen, Michael B. Monagan, 1999, ISSAC '99.

Challenges in Symbolic Computation Software, 02.07. - 07.07.2006

Stephen M. Watt, Erich Kaltofen, Mike Dewar, 2006, Challenges in Symbolic Computation Software.

Factorization of multivariate polynomials

Erich Kaltofen, Grégoire Lecerf, 2013, Handbook of Finite Fields.

Proceedings of the second international symposium on Parallel symbolic computation

Erich Kaltofen, Markus A. Hitz, Hoon Hong, 1997 .

Special Issue Computational Algebraic Complexity Editorial

Bruno Buchberger, Erich Kaltofen, 1990, J. Symb. Comput..

Lower bounds for approximate factorizations via semidefinite programming: (extended abstract)

Bin Li, Erich Kaltofen, Zhengfeng Yang, 2007, SNC '07.

Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases

Erich Kaltofen, Zhengfeng Yang, Erdal Imamoglu, 2018, ISSAC.

Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields

Erich Kaltofen, Pascal Koiran, 2006, ISSAC '06.

On the complexity of finding short vectors in integer lattices

Erich Kaltofen, E. Kaltofen, 1983, EUROCAL.

Computing Approximate Greatest Common Right Divisors of Differential Polynomials

Erich Kaltofen, Mark Giesbrecht, Joseph Haraldson, 2017, Found. Comput. Math..

Topics of computer algebra

Erich Kaltofen, Volker Weispfenning, Johannes Grabmeier, 2003 .

A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions

Erich Kaltofen, Zhengfeng Yang, Lihong Zhi, 2009, SNC '09.

Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction

Erich Kaltofen, Clément Pernet, Arne Storjohann, 2017, ISSAC.

DSC: a system for distributed symbolic computation

Erich Kaltofen, Thomas Valente, Angel Díaz, 1991, ISSAC '91.

Expressing a fraction of two determinants as a determinant

Erich Kaltofen, Pascal Koiran, P. Koiran, 2008, ISSAC '08.

09471 Executive Summary - Computer-assisted proofs - tools, methods and applications

Erich Kaltofen, Siegfried M. Rump, Shin'ichi Oishi, 2009, Computer-assisted proofs - tools, methods and applications.

Supersparse black box rational function interpolation

Erich Kaltofen, Michael Nehring, E. Kaltofen, 2011, ISSAC '11.

Generic Gram-Schmidt orthogonalization by exact division

Úlfar Erlingsson, Erich Kaltofen, David R. Musser, 1996, ISSAC '96.

Arithmetic in Quadratic Fields with Unique Factorization

Erich Kaltofen, Heinrich Rolletschek, H. Rolletschek, 1985, European Conference on Computer Algebra.

Applications of computer algebra

Erich Kaltofen, Volker Weispfenning, Johannes Grabmeier, 2003 .

Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits

Erich Kaltofen, Lihong Zhi, Jean-Guillaume Dumas, 2017, ISSAC.

Quadratic-time certificates in linear algebra

Erich Kaltofen, B. David Saunders, Michael Nehring, 2011, ISSAC '11.

A Generalized Class of Polynomials that are Hard to Factor

Erich Kaltofen, David R. Musser, B. David Saunders, 1983, SIAM J. Comput..

On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms

Erich Kaltofen, Zhengfeng Yang, Lihong Zhi, 2007, SNC '07.

Effective Hilbert Irreducibility

Erich Kaltofen, 1985, Inf. Control..

Computer Algebra Handbook : Foundations · Applications · Systems

Erich Kaltofen, Volker Weispfenning, Johannes Grabmeier, 2003 .

Effective Noether irreducibility forms and applications

Erich Kaltofen, 1991, STOC '91.

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 pdf

Erich Kaltofen, Jean-Guillaume Dumas, Emmanuel Thomé, 2015, ArXiv.

Symbolic computation in Java: an appraisement

Bruce W. Char, Erich Kaltofen, Laurent Bernardin, 1999, ISSAC '99.

Modular rational sparse multivariate polynomial interpolation

Erich Kaltofen, Yagati N. Lakshman, J.-M. Wiley, 1990, ISSAC '90.

A Distributed Approach to Problem Solving in Maple

Erich Kaltofen, Angel Díaz, K. C. Chan, 1994 .

Proceedings of the 2015 International Workshop on Parallel Symbolic Computation

Erich Kaltofen, Jean-Guillaume Dumas, Clément Pernet, 2015, PASCO.

Irreducible polynomials and barker sequences

Erich Kaltofen, Peter B. Borwein, Michael J. Mossinghoff, 2007, ACCA.

Factoring Sparse Multivariate Polynomials

Erich Kaltofen, Joachim von zur Gathen, J. Gathen, 1983, J. Comput. Syst. Sci..

An Attributed LL(1) Compilation of PASCAL into the Lambda-Calculus.

Erich Kaltofen, S Kamal Abdali, 1981 .

Efficient algorithms for computing the nearest polynomial with constrained roots

Erich Kaltofen, Markus A. Hitz, E. Kaltofen, 1998, ISSAC '98.

Computer algebra systems

Erich Kaltofen, Volker Weispfenning, Johannes Grabmeier, 2003 .

09471 Abstracts Collection - Computer-assisted proofs - tools, methods and applications

Erich Kaltofen, Siegfried M. Rump, Shin'ichi Oishi, 2009, Computer-assisted proofs - tools, methods and applications.

Sparse Hensel Lifting

Erich Kaltofen, 1985, European Conference on Computer Algebra.

Computing minimal generators of integer matrix sequences (abstract only)

Erich Kaltofen, George Yuhasz, 2008, ACCA.

Cleaning-up data for sparse model synthesis: when symbolic-numeric computation meets error-correcting codes

Erich Kaltofen, 2014, SNC.

Sparse multivariate function recovery with a high error rate in the evaluations

Erich Kaltofen, Zhengfeng Yang, 2014, ISSAC.

Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases

Victor Y. Pan, Erich Kaltofen, V. Pan, 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

NSF funding opportunities for symbolic computation

Erich Kaltofen, Alexey Ovchinnikov, 2014, ACCA.

Effective Hilbert Irreducibility

Erich Kaltofen, E. Kaltofen, 1984, Inf. Control..

Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields

Erich Kaltofen, Austin Lobo, E. Kaltofen, 1999, Algorithmica.

Process Scheduling in DSC and the Large Sparse Linear Systems Challenge

Erich Kaltofen, Markus A. Hitz, Thomas Valente, 1993, DISCO.

On the matrix berlekamp-massey algorithm

Erich Kaltofen, George Yuhasz, E. Kaltofen, 2013, TALG.

Computing with polynomials given by straight-line programs II sparse factorization

Erich Kaltofen, E. Kaltofen, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Asymptotically fast solution of Toeplitz-like singular linear systems

Erich Kaltofen, 1994, ISSAC '94.

06271 Executive Summary - Challenges in Symbolic Computation Software

Stephen M. Watt, Erich Kaltofen, Mike Dewar, 2006, Challenges in Symbolic Computation Software.

Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits pdf

Erich Kaltofen, Bruno Grenet, Pascal Koiran, 2010, ArXiv.

Improved Sparse Multivariate Polynomial Interpolation Algorithms

Erich Kaltofen, Yagati N. Lakshman, 1988, ISSAC.

Analysis of the binary complexity of asymptotically fast algorithms for linear system solving

Erich Kaltofen, Brent Gregory, 1988, SIGS.

Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits

Gary L. Miller, Erich Kaltofen, Vijaya Ramachandran, 1988, SIAM J. Comput..

A polynomial-time reduction from bivariate to univariate integral polynomial factorization

Erich Kaltofen, E. Kaltofen, 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

Factoring high-degree polynomials by the black box Berlekamp algorithm

Erich Kaltofen, Austin Lobo, E. Kaltofen, 1994, ISSAC '94.

Jenks prize 2015 award citation

Erich Kaltofen, 2016, ACCA.

Computing with polynomials given by straight-line programs I: greatest common divisors

Erich Kaltofen, 1985, STOC '85.

FOXBOX: a system for manipulating symbolic objects in black box representation

Erich Kaltofen, Angel Díaz, E. Kaltofen, 1998, ISSAC '98.

06271 Abstracts Collection -- Challenges in Symbolic Computation Software

Stephen M. Watt, Erich Kaltofen, Mike Dewar, 2006, Challenges in Symbolic Computation Software.

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

Erich Kaltofen, Zhengfeng Yang, Lihong Zhi, 2006, ISSAC '06.

On the complexity of computing determinants

Erich Kaltofen, Gilles Villard, E. Kaltofen, 2001, computational complexity.

Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits

Gary L. Miller, Erich Kaltofen, Vijaya Ramachandran, 1986, SIAM J. Comput..

Deterministic Irreducibility Testing of Polynomials over Large Finite Fields

Erich Kaltofen, E. Kaltofen, 1987, J. Symb. Comput..

Deterministic distinct-degree factorization of polynomials over finite fields

Erich Kaltofen, Shuhong Gao, Alan G. B. Lauder, 2004, J. Symb. Comput..

Symbolic Computation and Complexity Theory Transcript of My Talk

Erich Kaltofen, E. Kaltofen, 2012, ASCM.

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

Erich Kaltofen, E. Kaltofen, 1985, SIAM J. Comput..

Challenges of Symbolic Computation: My Favorite Open Problems

Erich Kaltofen, E. Kaltofen, 2000, J. Symb. Comput..

Meetings and Publications

Erich Kaltofen, Volker Weispfenning, Johannes Grabmeier, 2003 .

Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials

Erich Kaltofen, 1987, STOC '87.

Jenks prize 2013 award citation

Erich Kaltofen, 2014, ACCA.

Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems

Erich Kaltofen, E. Kaltofen, 1993, AAECC.

Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix

Erich Kaltofen, Jean-Guillaume Dumas, Gilles Villard, 2016, ISSAC.

On the complexity of factoring bivariate supersparse (Lacunary) polynomials

Erich Kaltofen, Pascal Koiran, P. Koiran, 2005, ISSAC.

An output-sensitive variant of the baby steps/giant steps determinant algorithm

Erich Kaltofen, 2002, ISSAC '02.

Algebraic Algorithms

Victor Y. Pan, Erich Kaltofen, Elias P. Tsigaridas, 1999, Computing Handbook, 3rd ed..

Integer Division in Residue Number Systems

Erich Kaltofen, Markus A. Hitz, E. Kaltofen, 1995, IEEE Trans. Computers.

Fast parallel algorithms for similarity of matrices

Erich Kaltofen, B. David Saunders, B. D. Saunders, 1986, SYMSAC '86.

On rank properties of Toeplitz matrices over finite fields

Erich Kaltofen, Austin Lobo, E. Kaltofen, 1996, ISSAC '96.

Greatest common divisors of polynomials given by straight-line programs

Erich Kaltofen, E. Kaltofen, 1988, JACM.

Processor efficient parallel solution of linear systems over an abstract field

Victor Y. Pan, Erich Kaltofen, V. Pan, 1991, SPAA '91.

Hermite Interpolation With Error Correction: Fields of Zero or Large Characteristic and Large Error Rate

Erich Kaltofen, Clément Pernet, Zhi-Hong Yang, 2021, ISSAC.

Computing Higher Polynomial Discriminants

Erich Kaltofen, E. Kaltofen, 2021, ISSAC.

Factorization of Polynomials

Erich Kaltofen, E. Kaltofen, 1983 .

A fraction free Matrix Berlekamp/Massey algorithm

Erich Kaltofen, George Yuhasz, 2013 .

Parallel Solution of Toeplitz and Toeplitz-Like Linear Systems Over Fields of Small Positive Characteristic

Victor Y. Pan, Erich Kaltofen, V. Pan, 1994, PASCO.

On the complexity of factoring polynomials with integer coefficients

Erich Kaltofen, E. Kaltofen, 1982 .

Proceedings of the third conference on Computers and mathematics

Stephen M. Watt, Erich Kaltofen, E. Kaltofen, 1989 .

Early termination strategies in sparse interpolation algorithms

Erich Kaltofen, Wen-shin Lee, 2001 .

On the complexity of computing grobner bases for zero-dimensional polynomial ideals

Erich Kaltofen, Lakshman N. Yagati, 1990 .

Black box linear algebra with the linbox library

Erich Kaltofen, William J. Turner, E. Kaltofen, 2002 .

Berlekamp/massey algorithms for linearly generated matrix sequences

Erich Kaltofen, George Yuhasz, E. Kaltofen, 2009 .

Computing greatest common divisors and factorizations in quadratic number fields

Erich Kaltofen, Heinrich Rolletschek, H. Rolletschek, 1989 .

ON THE COMPLEXITY OF COMPUTING DETERMINANTS

Erich Kaltofen, Gilles Villard, 2001 .

Parallel algorithms for matrix normal forms

Erich Kaltofen, B. David Saunders, B. D. Saunders, 1990 .

Computational Differentiation and Algebraic Complexity Theory *

Erich Kaltofen, .

The Kharitonov theorem and its applications in symbolic mathematical computation

Erich Kaltofen, Markus A. Hitz, 1997 .