Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarErich Kaltofen
Erich L. Kaltofen
Person information
- affiliation: North Carolina State University, Raleigh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[c87]Erdal Imamoglu, Erich L. Kaltofen, Zhengfeng Yang:
Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases. ISSAC 2018: 223-230- 2017
- [c86]Jean-Guillaume Dumas, Erich L. Kaltofen, Gilles Villard, Lihong Zhi:
Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. ISSAC 2017: 125-132 - [c85]Erich L. Kaltofen, Clément Pernet, Arne Storjohann, Cleveland Waddell:
Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction. ISSAC 2017: 237-244 - [i10]Mark Giesbrecht, Joseph Haraldson, Erich Kaltofen:
Computing Approximate Greatest Common Right Divisors of Differential Polynomials. CoRR abs/1701.01994 (2017) - 2016
- [j42]Erich L. Kaltofen, Zhengfeng Yang:
Sparse multivariate function recovery with a small number of evaluations. J. Symb. Comput. 75: 209-218 (2016) - [c84]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: 199-206 - [c83]Zhiwei Hao, Erich L. Kaltofen, Lihong Zhi:
Numerical Sparsity Determination and Early Termination. ISSAC 2016: 247-254 - [i9]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 abs/1602.00810 (2016) - 2015
- [j41]
- [c82]Andrew Arnold, Erich L. Kaltofen:
Error-Correcting Sparse Interpolation in the Chebyshev Basis. ISSAC 2015: 21-28 - [e6]Jean-Guillaume Dumas, Erich L. Kaltofen, Clément Pernet:
Proceedings of the 2015 International Workshop on Parallel Symbolic Computation, PASCO 2015, Bath, United Kingdom, July 10-12, 2015. ACM 2015, ISBN 978-1-4503-3599-7 [contents] - [i8]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 abs/1507.01083 (2015) - 2014
- [j40]Brice Boyer, Erich L. Kaltofen:
Numerical Linear System Solving with Parametric Entries by Error Correction. ACM Comm. Computer Algebra 48(3/4): 103-105 (2014) - [c81]Jean-Guillaume Dumas, Erich Kaltofen:
Essentially optimal interactive certificates in linear algebra. ISSAC 2014: 146-153 - [c80]Erich L. Kaltofen, Clément Pernet:
Sparse polynomial interpolation codes and their decoding beyond half the minimum distance. ISSAC 2014: 272-279 - [c79]Erich L. Kaltofen, Zhengfeng Yang:
Sparse multivariate function recovery with a high error rate in the evaluations. ISSAC 2014: 280-287 - [c78]Erich L. Kaltofen:
Cleaning-up data for sparse model synthesis: when symbolic-numeric computation meets error-correcting codes. SNC 2014: 1-2 - [c77]Brice Boyer, Erich L. Kaltofen:
Numerical linear system solving with parametric entries by error correction. SNC 2014: 33-38 - [i7]Jean-Guillaume Dumas, Erich Kaltofen:
Essentially optimal interactive certificates in linear algebra. CoRR abs/1401.4567 (2014) - [i6]Erich Kaltofen, Clément Pernet:
Sparse Polynomial Interpolation Codes and their decoding beyond half the minimal distance. CoRR abs/1403.3594 (2014) - 2013
- [j39]Erich Kaltofen, Alexey Ovchinnikov:
NSF funding opportunities for symbolic computation. ACM Comm. Computer Algebra 47(3/4): 84 (2013) - [j38]
- [j37]Erich Kaltofen, George Yuhasz:
On the matrix berlekamp-massey algorithm. ACM Trans. Algorithms 9(4): 33:1-33:24 (2013) - [c76]Erich Kaltofen, Zhengfeng Yang:
Sparse multivariate function recovery from values with noise and outlier errors. ISSAC 2013: 219-226 - 2012
- [j36]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): 1-15 (2012) - [j35]Matthew T. Comer, Erich Kaltofen:
On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field. J. Symb. Comput. 47(4): 480-491 (2012) - [j34]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): 751 (2012) - [c75]
- [c74]Brice Boyer, Matthew T. Comer, Erich L. Kaltofen:
Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations. ASCM 2012: 183-197 - [c73]Matthew T. Comer, Erich Kaltofen, Clément Pernet:
Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values. ISSAC 2012: 138-145 - [c72]Feng Guo, Erich Kaltofen, Lihong Zhi:
Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. ISSAC 2012: 195-202 - 2011
- [c71]Erich Kaltofen, Michael Nehring, B. David Saunders:
Quadratic-time certificates in linear algebra. ISSAC 2011: 171-176 - [c70]Erich Kaltofen, Michael Nehring:
Supersparse black box rational function interpolation. ISSAC 2011: 177-186 - [c69]Erich L. Kaltofen, Wen-shin Lee, Zhengfeng Yang:
Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation. SNC 2011: 130-136 - [c68]Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier:
Symmetric Determinantal Representation of Weakly-Skew Circuits. STACS 2011: 543-554 - [c67]
- 2010
- [j33]Erich Kaltofen, Mark Lavin:
Efficiently Certifying Non-Integer Powers. Computational Complexity 19(3): 355-366 (2010) - [c66]Erich Kaltofen:
Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010. PASCO 2010: 10-17 - [c65]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: 227-234 - [i5]Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier:
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits. CoRR abs/1007.3804 (2010)
2000 – 2009
- 2009
- [c64]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: 65-70 - [e5]B. Malcolm Brown, Erich Kaltofen, Shin'ichi Oishi, Siegfried M. Rump:
Computer-assisted proofs - tools, methods and applications, 15.11. - 20.11.2009. Dagstuhl Seminar Proceedings 09471, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [e4]Jeremy R. Johnson, Hyungju Park, Erich Kaltofen:
Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings. ACM 2009, ISBN 978-1-60558-609-0 [contents] - [i4]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 - [i3]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 - 2008
- [j32]George Yuhasz, Erich Kaltofen:
Computing minimal generators of integer matrix sequences (abstract only). ACM Comm. Computer Algebra 42(1-2): 91 (2008) - [j31]Erich Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi:
Approximate factorization of multivariate polynomials using singular value decomposition. J. Symb. Comput. 43(5): 359-376 (2008) - [c63]Erich Kaltofen, Pascal Koiran:
Expressing a fraction of two determinants as a determinant. ISSAC 2008: 141-146 - [c62]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: 155-164 - 2007
- [j30]Peter B. Borwein, Erich Kaltofen, Michael J. Mossinghoff:
Irreducible polynomials and barker sequences. ACM Comm. Computer Algebra 41(4): 118-121 (2007) - [c61]Erich Kaltofen, Zhengfeng Yang, Lihong Zhi:
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. SNC 2007: 11-17 - [c60]Erich Kaltofen, Bin Li, Kartik Sivaramakrishnan, Zhengfeng Yang, Lihong Zhi:
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). SNC 2007: 203-204 - [c59]Erich Kaltofen, Zhengfeng Yang:
On exact and approximate interpolation of sparse rational functions. ISSAC 2007: 203-210 - 2006
- [c58]
- [c57]Erich Kaltofen, Pascal Koiran:
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. ISSAC 2006: 162-168 - [c56]Erich Kaltofen, Zhengfeng Yang, Lihong Zhi:
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. ISSAC 2006: 169-176 - [e3]Wolfram Decker, Mike Dewar, Erich Kaltofen, Stephen M. Watt:
Challenges in Symbolic Computation Software, 02.07. - 07.07.2006. Dagstuhl Seminar Proceedings 06271, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 [contents] - [i2]Wolfram Decker, Mike Dewar, Erich Kaltofen, Stephen M. Watt:
06271 Executive Summary - Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software 2006 - [i1]Wolfram Decker, Mike Dewar, Erich Kaltofen, Stephen M. Watt:
06271 Abstracts Collection -- Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software 2006 - 2005
- [j29]Erich Kaltofen, Gilles Villard:
On the complexity of computing determinants. Computational Complexity 13(3-4): 91-130 (2005) - [c55]Erich Kaltofen, Pascal Koiran:
On the complexity of factoring bivariate supersparse (Lacunary) polynomials. ISSAC 2005: 208-215 - [c54]Erich Kaltofen, Dmitriy Morozov, George Yuhasz:
Generic matrix multiplication and memory management in linBox. ISSAC 2005: 216-223 - 2004
- [j28]Shuhong Gao, Erich Kaltofen, Alan G. B. Lauder:
Deterministic distinct-degree factorization of polynomials over finite fields. J. Symb. Comput. 38(6): 1461-1470 (2004) - [c53]Shuhong Gao, Erich Kaltofen, John May, Zhengfeng Yang, Lihong Zhi:
Approximate factorization of multivariate polynomials via differential equations. ISSAC 2004: 167-174 - 2003
- [j27]Erich Kaltofen, Wen-shin Lee:
Early termination in sparse interpolation algorithms. J. Symb. Comput. 36(3-4): 365-400 (2003) - [j26]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): 401-424 (2003) - [c52]
- [c51]Erich Kaltofen, John May:
On approximate irreducibility of polynomials in several variables. ISSAC 2003: 161-168 - 2002
- [c50]Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee:
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. ISSAC 2002: 101-108 - [c49]Erich Kaltofen:
An output-sensitive variant of the baby steps/giant steps determinant algorithm. ISSAC 2002: 138-144 - 2001
- [e2]Erich Kaltofen, Gilles Villard:
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. ACM 2001, ISBN 1-58113-417-7 [contents] - 2000
- [j25]Erich Kaltofen:
Challenges of Symbolic Computation: My Favorite Open Problems. J. Symb. Comput. 29(6): 891-919 (2000) - [c48]Erich Kaltofen, Wen-shin Lee, Austin Lobo:
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. ISSAC 2000: 192-201
1990 – 1999
- 1999
- [j24]Erich Kaltofen, Austin Lobo:
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields. Algorithmica 24(3-4): 331-348 (1999) - [j23]Hoon Hong, Erich Kaltofen, Michael F. Singer:
East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters. ACM SIGSAM Bulletin 33(2): 43-52 (1999) - [c47]Erich Kaltofen, Michael B. Monagan:
On the Genericity of the Modular Polynomial GCD Algorithm. ISSAC 1999: 59-66 - [c46]Markus A. Hitz, Erich Kaltofen, Yagati N. Lakshman:
Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. ISSAC 1999: 205-212 - [c45]Laurent Bernardin, Bruce W. Char, Erich Kaltofen:
Symbolic Computation in Java: An Appraisement. ISSAC 1999: 237-244 - 1998
- [j22]Erich Kaltofen, Victor Shoup:
Subquadratic-time factoring of polynomials over finite fields. Math. Comput. 67(223): 1179-1197 (1998) - [c44]Angel Díaz, Erich Kaltofen:
FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation. ISSAC 1998: 30-37 - [c43]Markus A. Hitz, Erich Kaltofen:
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots. ISSAC 1998: 236-243 - 1997
- [j21]
- [c42]
- [c41]Erich Kaltofen, Victor Shoup:
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields. ISSAC 1997: 184-188 - [e1]Hoon Hong, Erich Kaltofen, Markus A. Hitz:
Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, PASCO 1997, July 20-22, 1997, Kihei, Hawaii, USA. ACM 1997, ISBN 0-89791-951-3 [contents] - [r1]Angel Díaz, Erich Kaltofen, Victor Y. Pan:
Algebraic Algorithms. The Computer Science and Engineering Handbook 1997: 226-249 - 1996
- [c40]Erich Kaltofen, Austin Lobo:
On Rank Properties of Toeplitz Matrices over Finite Fields. ISSAC 1996: 241-249 - [c39]Úlfar Erlingsson, Erich Kaltofen, David R. Musser:
Generic Gram-Schmidt Orthogonalization by Exact Division. ISSAC 1996: 275-282 - 1995
- [j20]Erich Kaltofen:
Effective Noether Irreducibility Forms and Applications. J. Comput. Syst. Sci. 50(2): 274-295 (1995) - [j19]Angel Díaz, Markus A. Hitz, Erich Kaltofen, Austin Lobo, T. Valente:
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. J. Symb. Comput. 19(1-3): 269-282 (1995) - [j18]Markus A. Hitz, Erich Kaltofen:
Integer Division in Residue Number Systems. IEEE Trans. Computers 44(8): 983-989 (1995) - [c38]Angel Díaz, Erich Kaltofen:
On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations. ISSAC 1995: 232-239 - [c37]Mehrdad Samadani, Erich Kaltofen:
Prediction Based Task Scheduling in Distributed Computing (Abstract). PODC 1995: 261 - [c36]Erich Kaltofen, Victor Shoup:
Subquadratic-time factoring of polynomials over finite fields. STOC 1995: 398-406 - 1994
- [c35]Erich Kaltofen, Austin Lobo:
Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm. ISSAC 1994: 90-98 - [c34]Erich Kaltofen:
Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems. ISSAC 1994: 297-304 - 1993
- [j17]Erich Kaltofen:
Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor. ACM SIGSAM Bulletin 27(4): 2 (1993) - [c33]Erich Kaltofen:
Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems. AAECC 1993: 195-212 - [c32]Angel Díaz, Markus A. Hitz, Erich Kaltofen, Austin Lobo, T. Valente:
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. DISCO 1993: 66-80 - 1992
- [c31]Erich Kaltofen, Victor Y. Pan:
Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract). FOCS 1992: 714-723 - [c30]
- [c29]
- 1991
- [j16]David G. Cantor, Erich Kaltofen:
On Fast Multiplication of Polynomials over Arbitrary Algebras. Acta Inf. 28(7): 693-701 (1991) - [c28]Erich Kaltofen, B. David Saunders:
On Wiedemann's Method of Solving Sparse Linear Systems. AAECC 1991: 29-38 - [c27]Angel Díaz, Erich Kaltofen, K. Schmitz, T. Valente:
DSC: A System for Distributed Symbolic Computation. ISSAC 1991: 323-332 - [c26]Erich Kaltofen, Victor Y. Pan:
Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. SPAA 1991: 180-191 - [c25]Erich Kaltofen:
Effective Noether Irreducibility Forms and Applications (Extended Abstract). STOC 1991: 54-63 - 1990
- [j15]Erich Kaltofen:
Computing the Irreducible Real Factors and Components of an Algebraic Curve. Appl. Algebra Eng. Commun. Comput. 1: 135-148 (1990) - [j14]Erich Kaltofen, Bruno Buchberger:
Special Issue Computational Algebraic Complexity Editorial. J. Symb. Comput. 9(3): 225-228 (1990) - [j13]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): 301-320 (1990) - [c24]Erich Kaltofen, Yagati N. Lakshman, J.-M. Wiley:
Modular Rational Sparse Multivariate Polynomial Interpolation. ISSAC 1990: 135-139
1980 – 1989
- 1989
- [b1]Erich Kaltofen:
Computers and mathematics. Springer 1989, ISBN 0387970193, pp. I-XI, 1-326 - [j12]Erich Kaltofen:
Factorization of Polynomials Given by Straight-Line Programs. Advances in Computing Research 5: 375-412 (1989) - [c23]Erich Kaltofen:
Computing the Irreducible Real Factors and Components of an Algebraic Curve. Symposium on Computational Geometry 1989: 79-87 - [c22]
- [c21]John F. Canny, Erich Kaltofen, Yagati N. Lakshman:
Solving Systems of Nonlinear Polynomial Equations Faster. ISSAC 1989: 121-128 - 1988
- [j11]Brent Gregory, Erich Kaltofen:
Analysis of the binary complexity of asymptotically fast algorithms for linear system solving. ACM SIGSAM Bulletin 22(2): 41-49 (1988) - [j10]Erich Kaltofen:
Greatest common divisors of polynomials given by straight-line programs. J. ACM 35(1): 231-264 (1988) - [j9]Gary L. Miller, Vijaya Ramachandran, Erich Kaltofen:
Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. SIAM J. Comput. 17(4): 687-695 (1988) - [j8]Timothy S. Freeman, Gregory M. Imirzian, Erich Kaltofen, Yagati N. Lakshman:
Dagwood: a system for manipulating polynomials given by straight-line programs. ACM Trans. Math. Softw. 14(3): 218-240 (1988) - [c20]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: 296-305 - [c19]Erich Kaltofen, Yagati N. Lakshman:
Improved Sparse Multivariate Polynomial Interpolation Algorithms. ISSAC 1988: 467-474 - 1987
- [j7]Erich Kaltofen:
Deterministic Irreducibility Testing of Polynomials over Large Finite Fields. J. Symb. Comput. 4(1): 77-82 (1987) - [c18]Erich Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders:
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices. EUROCAL 1987: 317-322 - [c17]Erich Kaltofen:
Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials. STOC 1987: 443-452 - 1986
- [c16]Gary L. Miller, Vijaya Ramachandran, Erich Kaltofen:
Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. Aegean Workshop on Computing 1986: 236-245 - [c15]Erich Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders:
Fast parallel algorithms for similarity of matrices. SYMSAC 1986: 65-70 - [c14]