Erich L. Kaltofen

169 papers A* 12A 1B 58Misc 1Journal 58Unranked 30

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Early termination for sparse interpolation of polynomials in Chebyshev bases. J. Symb. Comput. Erich L. Kaltofen, Zhi-Hong Yang
2024	B	`conf`	Encounters in Symbolic Computation: Ideas for the Ages. ISSAC Erich L. Kaltofen
2024	B	`conf`	Sparse Polynomial Interpolation With Error Correction: Higher Error Capacity by Randomization. ISSAC Erich L. Kaltofen, Zhi-Hong Yang
2022	J	`jnl`	A note on the van der Waerden conjecture on random polynomials with symmetric Galois group for function fields. CoRR Erich L. Kaltofen
2022	B	`conf`	Sparse Polynomial Hermite Interpolation. ISSAC Erich L. Kaltofen
2022	B	`conf`	The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds. ISSAC Erich L. Kaltofen
2021	B	`conf`	Computing Higher Polynomial Discriminants. ISSAC Erich L. Kaltofen
2021	J	`jnl`	Foreword. J. Symb. Comput. Erich L. Kaltofen
2021	B	`conf`	Hermite Interpolation With Error Correction: Fields of Zero or Large Characteristic and Large Error Rate. ISSAC Erich L. Kaltofen, Clément Pernet, Zhi-Hong Yang
2021	J	`jnl`	On computing the degree of a Chebyshev Polynomial from its value. J. Symb. Comput. Erdal Imamoglu, Erich L. Kaltofen
2021	J	`jnl`	Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding. IEEE Trans. Inf. Theory Erich L. Kaltofen, Zhi-Hong Yang
2020	J	`jnl`	A note on sparse polynomial interpolation in Dickson polynomial basis. ACM Commun. Comput. Algebra Erdal Imamoglu, Erich L. Kaltofen
2020	J	`jnl`	Computing Approximate Greatest Common Right Divisors of Differential Polynomials. Found. Comput. Math. Mark Giesbrecht, Joseph Haraldson, Erich L. Kaltofen
2020	J	`jnl`	Elimination-based certificates for triangular equivalence and rank profiles. J. Symb. Comput. Jean-Guillaume Dumas, Erich L. Kaltofen, David Lucas, Clément Pernet
2020	B	`conf`	Hermite Rational Function Interpolation with Error Correction. CASC Erich L. Kaltofen, Clément Pernet, Zhi-Hong Yang
2019	J	`jnl`	Elimination-based certificates for triangular equivalence and rank profiles. CoRR Jean-Guillaume Dumas, Erich L. Kaltofen, David Lucas, Clément Pernet
2019	J	`jnl`	Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding. CoRR Erich L. Kaltofen, Zhi-Hong Yang
2018	B	`conf`	Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases. ISSAC Erdal Imamoglu, Erich L. Kaltofen, Zhengfeng Yang
2017	J	`jnl`	Computing Approximate Greatest Common Right Divisors of Differential Polynomials. CoRR Mark Giesbrecht, Joseph Haraldson, Erich L. Kaltofen
2017	B	`conf`	Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction. ISSAC Erich L. Kaltofen, Clément Pernet, Arne Storjohann, Cleveland Waddell
2017	B	`conf`	Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. ISSAC Jean-Guillaume Dumas, Erich L. Kaltofen, Gilles Villard, Lihong Zhi
2016	B	`conf`	Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. ISSAC Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé, Gilles Villard
2016	J	`jnl`	Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. CoRR Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé, Gilles Villard
2016	B	`conf`	Numerical Sparsity Determination and Early Termination. ISSAC Zhiwei Hao, Erich L. Kaltofen, Lihong Zhi
2016	J	`jnl`	Sparse multivariate function recovery with a small number of evaluations. J. Symb. Comput. Erich L. Kaltofen, Zhengfeng Yang
2015	B	`conf`	Error-Correcting Sparse Interpolation in the Chebyshev Basis. ISSAC Andrew Arnold, Erich L. Kaltofen
2015	J	`jnl`	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 Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé
2015	J	`jnl`	Jenks prize 2015 award citation. ACM Commun. Comput. Algebra Erich L. Kaltofen
2015	—	`ed.`	Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, PASCO 2015, Bath, United Kingdom, July 10-12, 2015 PASCO Jean-Guillaume Dumas, Erich L. Kaltofen, Clément Pernet
2014	—	`conf`	Cleaning-up data for sparse model synthesis: when symbolic-numeric computation meets error-correcting codes. SNC Erich L. Kaltofen
2014	B	`conf`	Essentially optimal interactive certificates in linear algebra. ISSAC Jean-Guillaume Dumas, Erich L. Kaltofen
2014	J	`jnl`	Essentially optimal interactive certificates in linear algebra. CoRR Jean-Guillaume Dumas, Erich L. Kaltofen
2014	J	`jnl`	Numerical Linear System Solving with Parametric Entries by Error Correction. ACM Commun. Comput. Algebra Brice Boyer, Erich L. Kaltofen
2014	—	`conf`	Numerical linear system solving with parametric entries by error correction. SNC Brice Boyer, Erich L. Kaltofen
2014	J	`jnl`	Sparse Polynomial Interpolation Codes and their decoding beyond half the minimal distance. CoRR Erich L. Kaltofen, Clément Pernet
2014	B	`conf`	Sparse multivariate function recovery with a high error rate in the evaluations. ISSAC Erich L. Kaltofen, Zhengfeng Yang
2014	B	`conf`	Sparse polynomial interpolation codes and their decoding beyond half the minimum distance. ISSAC Erich L. Kaltofen, Clément Pernet
2013	—	`ch.`	Factorization of multivariate polynomials. Handbook of Finite Fields Erich L. Kaltofen, Grégoire Lecerf
2013	J	`jnl`	Jenks prize 2013 award citation. ACM Commun. Comput. Algebra Erich L. Kaltofen
2013	J	`jnl`	NSF funding opportunities for symbolic computation. ACM Commun. Comput. Algebra Erich L. Kaltofen, Alexey Ovchinnikov
2013	J	`jnl`	On the matrix berlekamp-massey algorithm. ACM Trans. Algorithms Erich L. Kaltofen, George Yuhasz
2013	B	`conf`	Sparse multivariate function recovery from values with noise and outlier errors. ISSAC Erich L. Kaltofen, Zhengfeng Yang
2012	B	`conf`	Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. ISSAC Feng Guo, Erich L. Kaltofen, Lihong Zhi
2012	J	`jnl`	Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. J. Symb. Comput. Erich L. Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi
2012	J	`jnl`	On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field. J. Symb. Comput. Matthew T. Comer, Erich L. Kaltofen
2012	—	`conf`	Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations. ASCM Brice Boyer, Matthew T. Comer, Erich L. Kaltofen
2012	B	`conf`	Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values. ISSAC Matthew T. Comer, Erich L. Kaltofen, Clément Pernet
2012	J	`jnl`	Special Issue on Symbolic and Algebraic Computation Foundations, Algorithmics and Applications: ISSAC 2009. J. Symb. Comput. Jeremy R. Johnson, Erich L. Kaltofen, Hyungju Park
2012	—	`conf`	Symbolic Computation and Complexity Theory Transcript of My Talk. ASCM Erich L. Kaltofen
2011	—	`conf`	Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation. SNC Erich L. Kaltofen, Wen-shin Lee, Zhengfeng Yang
2011	B	`conf`	Quadratic-time certificates in linear algebra. ISSAC Erich L. Kaltofen, Michael Nehring, B. David Saunders
2011	B	`conf`	Supersparse black box rational function interpolation. ISSAC Erich L. Kaltofen, Michael Nehring
2011	A	`conf`	Symmetric Determinantal Representation of Weakly-Skew Circuits. STACS Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier
2011	Misc	`conf`	What is Hybrid Symbolic-Numeric Computation? SYNASC Erich L. Kaltofen
2010	B	`conf`	Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method. ISSAC Sharon Hutton, Erich L. Kaltofen, Lihong Zhi
2010	J	`jnl`	Efficiently Certifying Non-Integer Powers. Comput. Complex. Erich L. Kaltofen, Mark Lavin
2010	—	`conf`	Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010. PASCO Erich L. Kaltofen
2010	J	`jnl`	Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits CoRR Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier
2009	—	`conf`	09471 Abstracts Collection - Computer-assisted proofs - tools, methods and applications. Computer-assisted proofs - tools, methods and applications B. Malcolm Brown, Erich L. Kaltofen, Shin'ichi Oishi, Siegfried M. Rump
2009	—	`conf`	09471 Executive Summary - Computer-assisted proofs - tools, methods and applications. Computer-assisted proofs - tools, methods and applications B. Malcolm Brown, Erich L. Kaltofen, Shin'ichi Oishi, Siegfried M. Rump
2009	—	`conf`	A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions. SNC Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi
2009	—	`ed.`	Computer-assisted proofs - tools, methods and applications, 15.11. - 20.11.2009 Computer-assisted proofs - tools, methods and applications B. Malcolm Brown, Erich L. Kaltofen, Shin'ichi Oishi, Siegfried M. Rump
2009	B	`ed.`	Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings ISSAC Jeremy R. Johnson, Hyungju Park, Erich L. Kaltofen
2008	J	`jnl`	Approximate factorization of multivariate polynomials using singular value decomposition. J. Symb. Comput. Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi
2008	J	`jnl`	Computing minimal generators of integer matrix sequences (abstract only). ACM Commun. Comput. Algebra George Yuhasz, Erich L. Kaltofen
2008	B	`conf`	Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. ISSAC Erich L. Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi
2008	B	`conf`	Expressing a fraction of two determinants as a determinant. ISSAC Erich L. Kaltofen, Pascal Koiran
2007	J	`jnl`	Irreducible polynomials and barker sequences. ACM Commun. Comput. Algebra Peter B. Borwein, Erich L. Kaltofen, Michael J. Mossinghoff
2007	—	`conf`	Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). SNC Erich L. Kaltofen, Bin Li, Kartik Sivaramakrishnan, Zhengfeng Yang, Lihong Zhi
2007	B	`conf`	On exact and approximate interpolation of sparse rational functions. ISSAC Erich L. Kaltofen, Zhengfeng Yang
2007	—	`conf`	On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. SNC Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi
2006	—	`conf`	06271 Abstracts Collection -- Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software Wolfram Decker, Mike Dewar, Erich L. Kaltofen, Stephen M. Watt
2006	—	`conf`	06271 Executive Summary - Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software Wolfram Decker, Mike Dewar, Erich L. Kaltofen, Stephen M. Watt
2006	B	`conf`	Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. ISSAC Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi
2006	—	`ed.`	Challenges in Symbolic Computation Software, 02.07. - 07.07.2006 Challenges in Symbolic Computation Software Wolfram Decker, Mike Dewar, Erich L. Kaltofen, Stephen M. Watt
2006	B	`conf`	Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. ISSAC Erich L. Kaltofen, Pascal Koiran
2006	B	`conf`	Hybrid symbolic-numeric computation. ISSAC Erich L. Kaltofen, Lihong Zhi
2005	B	`conf`	Generic matrix multiplication and memory management in linBox. ISSAC Erich L. Kaltofen, Dmitriy Morozov, George Yuhasz
2005	J	`jnl`	On the complexity of computing determinants. Comput. Complex. Erich L. Kaltofen, Gilles Villard
2005	B	`conf`	On the complexity of factoring bivariate supersparse (Lacunary) polynomials. ISSAC Erich L. Kaltofen, Pascal Koiran
2004	B	`conf`	Approximate factorization of multivariate polynomials via differential equations. ISSAC Shuhong Gao, Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi
2004	J	`jnl`	Deterministic distinct-degree factorization of polynomials over finite fields. J. Symb. Comput. Shuhong Gao, Erich L. Kaltofen, Alan G. B. Lauder
2003	J	`jnl`	Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases. J. Symb. Comput. Mark Giesbrecht, Erich L. Kaltofen, Wen-shin Lee
2003	J	`jnl`	Early termination in sparse interpolation algorithms. J. Symb. Comput. Erich L. Kaltofen, Wen-shin Lee
2003	B	`conf`	On approximate irreducibility of polynomials in several variables. ISSAC Erich L. Kaltofen, John P. May
2003	B	`conf`	Polynomial factorization: a success story. ISSAC Erich L. Kaltofen
2002	B	`conf`	Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. ISSAC Mark Giesbrecht, Erich L. Kaltofen, Wen-shin Lee
2002	B	`conf`	An output-sensitive variant of the baby steps/giant steps determinant algorithm. ISSAC Erich L. Kaltofen
2001	B	`ed.`	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 ISSAC Erich L. Kaltofen, Gilles Villard
2000	J	`jnl`	Challenges of Symbolic Computation: My Favorite Open Problems. J. Symb. Comput. Erich L. Kaltofen
2000	B	`conf`	Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. ISSAC Erich L. Kaltofen, Wen-shin Lee, Austin Lobo
1999	—	`ch.`	Algebraic Algorithms. Algorithms and Theory of Computation Handbook Angel Díaz, Ioannis Z. Emiris, Erich L. Kaltofen, Victor Y. Pan
1999	J	`jnl`	Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields. Algorithmica Erich L. Kaltofen, Austin Lobo
1999	J	`jnl`	East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters. SIGSAM Bull. Hoon Hong, Erich L. Kaltofen, Michael F. Singer
1999	B	`conf`	Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. ISSAC Markus A. Hitz, Erich L. Kaltofen, Yagati N. Lakshman
1999	B	`conf`	On the Genericity of the Modular Polynomial GCD Algorithm. ISSAC Erich L. Kaltofen, Michael B. Monagan
1999	B	`conf`	Symbolic Computation in Java: An Appraisement. ISSAC Laurent Bernardin, Bruce W. Char, Erich L. Kaltofen
1998	B	`conf`	Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots. ISSAC Markus A. Hitz, Erich L. Kaltofen
1998	B	`conf`	FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation. ISSAC Angel Díaz, Erich L. Kaltofen
1998	J	`jnl`	Subquadratic-time factoring of polynomials over finite fields. Math. Comput. Erich L. Kaltofen, Victor Shoup
1997	—	`ch.`	Algebraic Algorithms. The Computer Science and Engineering Handbook Angel Díaz, Erich L. Kaltofen, Victor Y. Pan
1997	B	`conf`	Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields. ISSAC Erich L. Kaltofen, Victor Shoup
1997	B	`conf`	On Randomized Lanczos Algorithms. ISSAC Wayne Eberly, Erich L. Kaltofen
1997	—	`ed.`	Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, PASCO 1997, July 20-22, 1997, Kihei, Hawaii, USA PASCO Hoon Hong, Erich L. Kaltofen, Markus A. Hitz
1997	J	`jnl`	Teaching Computational Abstract Algebra. J. Symb. Comput. Erich L. Kaltofen
1996	B	`conf`	Generic Gram-Schmidt Orthogonalization by Exact Division. ISSAC Úlfar Erlingsson, Erich L. Kaltofen, David R. Musser
1996	B	`conf`	On Rank Properties of Toeplitz Matrices over Finite Fields. ISSAC Erich L. Kaltofen, Austin Lobo
1995	J	`jnl`	Effective Noether Irreducibility Forms and Applications. J. Comput. Syst. Sci. Erich L. Kaltofen
1995	J	`jnl`	Integer Division in Residue Number Systems. IEEE Trans. Computers Markus A. Hitz, Erich L. Kaltofen
1995	B	`conf`	On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations. ISSAC Angel Díaz, Erich L. Kaltofen
1995	A*	`conf`	Prediction Based Task Scheduling in Distributed Computing (Abstract). PODC Mehrdad Samadani, Erich L. Kaltofen
1995	—	`conf`	Prediction Based Task Scheduling in Distributed Computing. LCR Mehrdad Samadani, Erich L. Kaltofen
1995	J	`jnl`	Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. J. Symb. Comput. Angel Díaz, Markus A. Hitz, Erich L. Kaltofen, Austin Lobo, Thomas Valente
1995	A*	`conf`	Subquadratic-time factoring of polynomials over finite fields. STOC Erich L. Kaltofen, Victor Shoup
1994	B	`conf`	Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems. ISSAC Erich L. Kaltofen
1994	B	`conf`	Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm. ISSAC Erich L. Kaltofen, Austin Lobo
1994	—	`conf`	Parallel Solution of Toeplitz and Toeplitz-Like Linear Systems Over Fields of Small Positive Characteristic. PASCO Erich L. Kaltofen, Victor Y. Pan
1993	—	`conf`	Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems. AAECC Erich L. Kaltofen
1993	J	`jnl`	Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor. SIGSAM Bull. Erich L. Kaltofen
1993	—	`conf`	Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. DISCO Angel Díaz, Markus A. Hitz, Erich L. Kaltofen, Austin Lobo, Thomas Valente
1992	B	`conf`	On Computing Determinants of Matrices without Divisions. ISSAC Erich L. Kaltofen
1992	B	`conf`	Polynomial Factorization 1987-1991. LATIN Erich L. Kaltofen
1992	A*	`conf`	Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract) FOCS Erich L. Kaltofen, Victor Y. Pan
1991	B	`conf`	DSC: A System for Distributed Symbolic Computation. ISSAC Angel Díaz, Erich L. Kaltofen, Kurt Schmitz, Thomas Valente
1991	A*	`conf`	Effective Noether Irreducibility Forms and Applications (Extended Abstract) STOC Erich L. Kaltofen
1991	J	`jnl`	On Fast Multiplication of Polynomials over Arbitrary Algebras. Acta Informatica David G. Cantor, Erich L. Kaltofen
1991	—	`conf`	On Wiedemann's Method of Solving Sparse Linear Systems. AAECC Erich L. Kaltofen, B. David Saunders
1991	B	`conf`	Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. SPAA Erich L. Kaltofen, Victor Y. Pan
1990	J	`jnl`	Computing the Irreducible Real Factors and Components of an Algebraic Curve. Appl. Algebra Eng. Commun. Comput. Erich L. Kaltofen
1990	J	`jnl`	Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators. J. Symb. Comput. Erich L. Kaltofen, Barry M. Trager
1990	B	`conf`	Modular Rational Sparse Multivariate Polynomial Interpolation. ISSAC Erich L. Kaltofen, Yagati N. Lakshman, J.-M. Wiley
1990	J	`jnl`	Special Issue Computational Algebraic Complexity Editorial. J. Symb. Comput. Erich L. Kaltofen, Bruno Buchberger
1989	B	`conf`	An Improved Las Vegas Primality Test. ISSAC Erich L. Kaltofen, Thomas Valente, Norika Yui
1989	—	`ed.`	Computers and Mathematics, Third Computers and Mathematics Conference, MIT, Cambridge, Massachusetts, USA, June 13-17, 1989. Computers and Mathematics Erich L. Kaltofen, Stephen M. Watt
1989	—	`book`	Computers and mathematics. Erich L. Kaltofen
1989	—	`conf`	Computing the Irreducible Real Factors and Components of an Algebraic Curve. SCG Erich L. Kaltofen
1989	J	`jnl`	Factorization of Polynomials Given by Straight-Line Programs. Adv. Comput. Res. Erich L. Kaltofen
1989	B	`conf`	Solving Systems of Nonlinear Polynomial Equations Faster. ISSAC John F. Canny, Erich L. Kaltofen, Yagati N. Lakshman
1988	J	`jnl`	Analysis of the binary complexity of asymptotically fast algorithms for linear system solving. SIGSAM Bull. Brent Gregory, Erich L. Kaltofen
1988	A*	`conf`	Computing with Polynomials Given By Black Boxes for Their Evaluation: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators FOCS Erich L. Kaltofen, Barry M. Trager
1988	J	`jnl`	Dagwood: a system for manipulating polynomials given by straight-line programs. ACM Trans. Math. Softw. Timothy S. Freeman, Gregory M. Imirzian, Erich L. Kaltofen, Yagati N. Lakshman
1988	J	`jnl`	Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. SIAM J. Comput. Gary L. Miller, Vijaya Ramachandran, Erich L. Kaltofen
1988	J	`jnl`	Greatest common divisors of polynomials given by straight-line programs. J. ACM Erich L. Kaltofen
1988	B	`conf`	Improved Sparse Multivariate Polynomial Interpolation Algorithms. ISSAC Erich L. Kaltofen, Yagati N. Lakshman
1987	J	`jnl`	Deterministic Irreducibility Testing of Polynomials over Large Finite Fields. J. Symb. Comput. Erich L. Kaltofen
1987	—	`conf`	Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices. EUROCAL Erich L. Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders
1987	A*	`conf`	Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials STOC Erich L. Kaltofen
1986	—	`conf`	A system for manipulating polynomials given by straight-line programs. SYMSAC Timothy S. Freeman, Gregory M. Imirzian, Erich L. Kaltofen
1986	—	`conf`	Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. Aegean Workshop on Computing Gary L. Miller, Vijaya Ramachandran, Erich L. Kaltofen
1986	—	`conf`	Fast parallel algorithms for similarity of matrices. SYMSAC Erich L. Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders
1986	A*	`conf`	Uniform Closure Properties of P-Computable Functions STOC Erich L. Kaltofen
1985	—	`conf`	Arithmetic in Quadratic Fields with Unique Factorization. European Conference on Computer Algebra (2) Erich L. Kaltofen, Heinrich Rolletschek
1985	A*	`conf`	Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors STOC Erich L. Kaltofen
1985	A*	`conf`	Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization FOCS Erich L. Kaltofen
1985	J	`jnl`	Effective Hilbert Irreducibility Inf. Control. Erich L. Kaltofen
1985	J	`jnl`	Factoring Sparse Multivariate Polynomials. J. Comput. Syst. Sci. Joachim von zur Gathen, Erich L. Kaltofen
1985	J	`jnl`	Fast Parallel Absolute Irreducibility Testing. J. Symb. Comput. Erich L. Kaltofen
1985	J	`jnl`	Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization. SIAM J. Comput. Erich L. Kaltofen
1985	—	`conf`	Sparse Hensel Lifting. European Conference on Computer Algebra (2) Erich L. Kaltofen
1984	—	`conf`	A Note on the Risch Differential Equation. EUROSAM Erich L. Kaltofen
1984	—	`conf`	Effective Hilbert Irreducibility. EUROSAM Erich L. Kaltofen
1984	—	`conf`	Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields with Class Numbers 7 and 11. EUROSAM Erich L. Kaltofen, Noriko Yui
1983	J	`jnl`	A Generalized Class of Polynomials that are Hard to Factor. SIAM J. Comput. Erich L. Kaltofen, David R. Musser, B. David Saunders
1983	—	`conf`	On the complexity of finding short vectors in integer lattices. EUROCAL Erich L. Kaltofen
1983	A*	`conf`	Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. ICALP Joachim von zur Gathen, Erich L. Kaltofen
1982	A*	`conf`	A Polynomial Reduction from Multivariate to Bivariate Integral Polynomial Factorization STOC Erich L. Kaltofen
1982	A*	`conf`	A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization FOCS Erich L. Kaltofen
1982	J	`jnl`	Polynomial reduction from multivariate to bivariate integral polynomial factorization. SIGSAM Bull. Erich L. Kaltofen
1981	—	`conf`	A generalized class of polynomials that are hard to factor. SYMSACC Erich L. Kaltofen, David R. Musser, B. David Saunders