default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDErich L. Kaltofen
Person information
- affiliation: North Carolina State University, Raleigh, NC, USA
- affiliation (former): Rensselaer Polytechnic Institute, Troy, NY, USa
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c96]Erich L. Kaltofen
:
Encounters in Symbolic Computation: Ideas for the Ages. ISSAC 2024: 1-7- [c95]Erich L. Kaltofen, Zhi-Hong Yang:
Sparse Polynomial Interpolation With Error Correction: Higher Error Capacity by Randomization. ISSAC 2024: 264-273 - 2022
- [c94]Erich L. Kaltofen:
The GKR Protocol Revisited: Nearly Optimal Prover-Complexity for Polynomial-Time Wiring Algorithms and for Primality Testing in n1/2+o(1) Rounds. ISSAC 2022: 177-186 - [c93]Erich L. Kaltofen:
Sparse Polynomial Hermite Interpolation. ISSAC 2022: 469-478 - [i13]Erich L. Kaltofen:
A note on the van der Waerden conjecture on random polynomials with symmetric Galois group for function fields. CoRR abs/2204.02836 (2022) - 2021
- [j48]Erdal Imamoglu, Erich L. Kaltofen:
On computing the degree of a Chebyshev Polynomial from its value. J. Symb. Comput. 104: 159-167 (2021) - [j47]Erich L. Kaltofen:
Foreword. J. Symb. Comput. 105: 1-3 (2021) - [j46]Erich L. Kaltofen, Zhi-Hong Yang:
Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding. IEEE Trans. Inf. Theory 67(1): 232-243 (2021) - [c92]Erich L. Kaltofen:
Computing Higher Polynomial Discriminants. ISSAC 2021: 233-239 - [c91]Erich L. Kaltofen, Clément Pernet, Zhi-Hong Yang:
Hermite Interpolation With Error Correction: Fields of Zero or Large Characteristic and Large Error Rate. ISSAC 2021: 241-247 - 2020
- [j45]Erdal Imamoglu, Erich L. Kaltofen:
A note on sparse polynomial interpolation in Dickson polynomial basis. ACM Commun. Comput. Algebra 54(4): 125-128 (2020) - [j44]Mark Giesbrecht, Joseph Haraldson, Erich L. Kaltofen:
Computing Approximate Greatest Common Right Divisors of Differential Polynomials. Found. Comput. Math. 20(2): 331-366 (2020) - [j43]Jean-Guillaume Dumas, Erich L. Kaltofen, David Lucas, Clément Pernet:
Elimination-based certificates for triangular equivalence and rank profiles. J. Symb. Comput. 98: 246-269 (2020) - [c90]Erich L. Kaltofen, Clément Pernet, Zhi-Hong Yang:
Hermite Rational Function Interpolation with Error Correction. CASC 2020: 335-357
2010 – 2019
- 2019
- [i12]Jean-Guillaume Dumas, Erich L. Kaltofen, David Lucas, Clément Pernet:
Elimination-based certificates for triangular equivalence and rank profiles. CoRR abs/1909.05692 (2019) - [i11]Erich L. Kaltofen, Zhi-Hong Yang:
Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding. CoRR abs/1912.05719 (2019) - 2018
- [c89]Erdal Imamoglu, Erich L. Kaltofen, Zhengfeng Yang:
Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases. ISSAC 2018: 223-230 - 2017
- [c88]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 - [c87]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 L. 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) - [c86]Jean-Guillaume Dumas, Erich L. Kaltofen, Emmanuel Thomé, Gilles Villard:
Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. ISSAC 2016: 199-206 - [c85]Zhiwei Hao, Erich L. Kaltofen, Lihong Zhi:
Numerical Sparsity Determination and Early Termination. ISSAC 2016: 247-254 - [i9]Jean-Guillaume Dumas, Erich L. 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]Erich L. Kaltofen:
Jenks prize 2015 award citation. ACM Commun. Comput. Algebra 49(4): 112 (2015) - [c84]Andrew Arnold, Erich L. Kaltofen:
Error-Correcting Sparse Interpolation in the Chebyshev Basis. ISSAC 2015: 21-28 - [e7]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 L. 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 Commun. Comput. Algebra 48(3/4): 103-105 (2014) - [c83]Jean-Guillaume Dumas, Erich L. Kaltofen:
Essentially optimal interactive certificates in linear algebra. ISSAC 2014: 146-153 - [c82]Erich L. Kaltofen, Clément Pernet:
Sparse polynomial interpolation codes and their decoding beyond half the minimum distance. ISSAC 2014: 272-279 - [c81]Erich L. Kaltofen, Zhengfeng Yang:
Sparse multivariate function recovery with a high error rate in the evaluations. ISSAC 2014: 280-287 - [c80]Erich L. Kaltofen:
Cleaning-up data for sparse model synthesis: when symbolic-numeric computation meets error-correcting codes. SNC 2014: 1-2 - [c79]Brice Boyer, Erich L. Kaltofen:
Numerical linear system solving with parametric entries by error correction. SNC 2014: 33-38 - [i7]Jean-Guillaume Dumas, Erich L. Kaltofen:
Essentially optimal interactive certificates in linear algebra. CoRR abs/1401.4567 (2014) - [i6]Erich L. Kaltofen, Clément Pernet:
Sparse Polynomial Interpolation Codes and their decoding beyond half the minimal distance. CoRR abs/1403.3594 (2014) - 2013
- [j39]Erich L. Kaltofen, Alexey Ovchinnikov:
NSF funding opportunities for symbolic computation. ACM Commun. Comput. Algebra 47(3/4): 84 (2013) - [j38]Erich L. Kaltofen:
Jenks prize 2013 award citation. ACM Commun. Comput. Algebra 47(3/4): 187 (2013) - [j37]Erich L. Kaltofen, George Yuhasz:
On the matrix berlekamp-massey algorithm. ACM Trans. Algorithms 9(4): 33:1-33:24 (2013) - [c78]Erich L. Kaltofen, Zhengfeng Yang:
Sparse multivariate function recovery from values with noise and outlier errors. ISSAC 2013: 219-226 - [p2]Erich L. Kaltofen, Grégoire Lecerf:
Factorization of multivariate polynomials. Handbook of Finite Fields 2013: 382-392 - 2012
- [j36]Erich L. 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 L. 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 L. Kaltofen, Hyungju Park:
Special Issue on Symbolic and Algebraic Computation Foundations, Algorithmics and Applications: ISSAC 2009. J. Symb. Comput. 47(7): 751 (2012) - [c77]Erich L. Kaltofen:
Symbolic Computation and Complexity Theory Transcript of My Talk. ASCM 2012: 3-7 - [c76]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 - [c75]Matthew T. Comer, Erich L. Kaltofen, Clément Pernet:
Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values. ISSAC 2012: 138-145 - [c74]Feng Guo, Erich L. Kaltofen, Lihong Zhi:
Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. ISSAC 2012: 195-202 - 2011
- [c73]Erich L. Kaltofen, Michael Nehring, B. David Saunders:
Quadratic-time certificates in linear algebra. ISSAC 2011: 171-176 - [c72]Erich L. Kaltofen, Michael Nehring:
Supersparse black box rational function interpolation. ISSAC 2011: 177-186 - [c71]Erich L. Kaltofen, Wen-shin Lee, Zhengfeng Yang:
Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation. SNC 2011: 130-136 - [c70]Bruno Grenet, Erich L. Kaltofen, Pascal Koiran, Natacha Portier:
Symmetric Determinantal Representation of Weakly-Skew Circuits. STACS 2011: 543-554 - [c69]Erich L. Kaltofen:
What is Hybrid Symbolic-Numeric Computation? SYNASC 2011: 11 - 2010
- [j33]Erich L. Kaltofen, Mark Lavin:
Efficiently Certifying Non-Integer Powers. Comput. Complex. 19(3): 355-366 (2010) - [c68]Erich L. Kaltofen:
Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010. PASCO 2010: 10-17 - [c67]Sharon Hutton, Erich L. 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 L. Kaltofen, Pascal Koiran, Natacha Portier:
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits. CoRR abs/1007.3804 (2010)
2000 – 2009
- 2009
- [c66]Erich L. 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 - [e6]B. Malcolm Brown, Erich L. 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] - [e5]Jeremy R. Johnson, Hyungju Park, Erich L. 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 L. 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 L. 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 L. Kaltofen:
Computing minimal generators of integer matrix sequences (abstract only). ACM Commun. Comput. Algebra 42(1-2): 91 (2008) - [j31]Erich L. 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) - [c65]Erich L. Kaltofen, Pascal Koiran:
Expressing a fraction of two determinants as a determinant. ISSAC 2008: 141-146 - [c64]Erich L. 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 L. Kaltofen, Michael J. Mossinghoff:
Irreducible polynomials and barker sequences. ACM Commun. Comput. Algebra 41(4): 118-121 (2007) - [c63]Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi:
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. SNC 2007: 11-17 - [c62]Erich L. Kaltofen, Bin Li, Kartik Sivaramakrishnan, Zhengfeng Yang, Lihong Zhi:
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). SNC 2007: 203-204 - [c61]Erich L. Kaltofen, Zhengfeng Yang:
On exact and approximate interpolation of sparse rational functions. ISSAC 2007: 203-210 - 2006
- [c60]Erich L. Kaltofen, Lihong Zhi:
Hybrid symbolic-numeric computation. ISSAC 2006: 7 - [c59]Erich L. Kaltofen, Pascal Koiran:
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. ISSAC 2006: 162-168 - [c58]Erich L. Kaltofen, Zhengfeng Yang, Lihong Zhi:
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. ISSAC 2006: 169-176 - [e4]Wolfram Decker, Mike Dewar, Erich L. 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 L. Kaltofen, Stephen M. Watt:
06271 Executive Summary - Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software 2006 - [i1]Wolfram Decker, Mike Dewar, Erich L. Kaltofen, Stephen M. Watt:
06271 Abstracts Collection -- Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software 2006 - 2005
- [j29]Erich L. Kaltofen, Gilles Villard:
On the complexity of computing determinants. Comput. Complex. 13(3-4): 91-130 (2005) - [c57]Erich L. Kaltofen, Pascal Koiran:
On the complexity of factoring bivariate supersparse (Lacunary) polynomials. ISSAC 2005: 208-215 - [c56]Erich L. Kaltofen, Dmitriy Morozov, George Yuhasz:
Generic matrix multiplication and memory management in linBox. ISSAC 2005: 216-223 - 2004
- [j28]Shuhong Gao, Erich L. Kaltofen, Alan G. B. Lauder:
Deterministic distinct-degree factorization of polynomials over finite fields. J. Symb. Comput. 38(6): 1461-1470 (2004) - [c55]Shuhong Gao, Erich L. Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi:
Approximate factorization of multivariate polynomials via differential equations. ISSAC 2004: 167-174 - 2003
- [j27]Erich L. Kaltofen, Wen-shin Lee:
Early termination in sparse interpolation algorithms. J. Symb. Comput. 36(3-4): 365-400 (2003) - [j26]Mark Giesbrecht, Erich L. 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) - [c54]Erich L. Kaltofen:
Polynomial factorization: a success story. ISSAC 2003: 3-4 - [c53]Erich L. Kaltofen, John P. May:
On approximate irreducibility of polynomials in several variables. ISSAC 2003: 161-168 - 2002
- [c52]Mark Giesbrecht, Erich L. Kaltofen, Wen-shin Lee:
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. ISSAC 2002: 101-108 - [c51]Erich L. Kaltofen:
An output-sensitive variant of the baby steps/giant steps determinant algorithm. ISSAC 2002: 138-144 - 2001
- [e3]Erich L. 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 L. Kaltofen:
Challenges of Symbolic Computation: My Favorite Open Problems. J. Symb. Comput. 29(6): 891-919 (2000) - [c50]Erich L. 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 L. 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 L. Kaltofen, Michael F. Singer:
East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters. SIGSAM Bull. 33(2): 43-52 (1999) - [c49]Erich L. Kaltofen, Michael B. Monagan:
On the Genericity of the Modular Polynomial GCD Algorithm. ISSAC 1999: 59-66 - [c48]Markus A. Hitz, Erich L. Kaltofen, Yagati N. Lakshman:
Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. ISSAC 1999: 205-212 - [c47]Laurent Bernardin, Bruce W. Char, Erich L. Kaltofen:
Symbolic Computation in Java: An Appraisement. ISSAC 1999: 237-244 - [p1]Angel Díaz, Ioannis Z. Emiris, Erich L. Kaltofen, Victor Y. Pan:
Algebraic Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j22]Erich L. Kaltofen, Victor Shoup:
Subquadratic-time factoring of polynomials over finite fields. Math. Comput. 67(223): 1179-1197 (1998) - [c46]Angel Díaz, Erich L. Kaltofen:
FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation. ISSAC 1998: 30-37 - [c45]Markus A. Hitz, Erich L. Kaltofen:
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots. ISSAC 1998: 236-243 - 1997
- [j21]Erich L. Kaltofen:
Teaching Computational Abstract Algebra. J. Symb. Comput. 23(5/6): 503-515 (1997) - [c44]Wayne Eberly, Erich L. Kaltofen:
On Randomized Lanczos Algorithms. ISSAC 1997: 176-183 - [c43]Erich L. Kaltofen, Victor Shoup:
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields. ISSAC 1997: 184-188 - [e2]Hoon Hong, Erich L. 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 L. Kaltofen, Victor Y. Pan:
Algebraic Algorithms. The Computer Science and Engineering Handbook 1997: 226-249 - 1996
- [c42]Erich L. Kaltofen, Austin Lobo:
On Rank Properties of Toeplitz Matrices over Finite Fields. ISSAC 1996: 241-249 - [c41]Úlfar Erlingsson, Erich L. Kaltofen, David R. Musser:
Generic Gram-Schmidt Orthogonalization by Exact Division. ISSAC 1996: 275-282 - 1995
- [j20]Erich L. Kaltofen:
Effective Noether Irreducibility Forms and Applications. J. Comput. Syst. Sci. 50(2): 274-295 (1995) - [j19]Angel Díaz, Markus A. Hitz, Erich L. Kaltofen, Austin Lobo, Thomas 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 L. Kaltofen:
Integer Division in Residue Number Systems. IEEE Trans. Computers 44(8): 983-989 (1995) - [c40]Angel Díaz, Erich L. Kaltofen:
On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations. ISSAC 1995: 232-239 - [c39]Mehrdad Samadani, Erich L. Kaltofen:
Prediction Based Task Scheduling in Distributed Computing. LCR 1995: 317-320 - [c38]Mehrdad Samadani, Erich L. Kaltofen:
Prediction Based Task Scheduling in Distributed Computing (Abstract). PODC 1995: 261 - [c37]Erich L. Kaltofen, Victor Shoup:
Subquadratic-time factoring of polynomials over finite fields. STOC 1995: 398-406 - 1994
- [c36]Erich L. Kaltofen, Austin Lobo:
Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm. ISSAC 1994: 90-98 - [c35]Erich L. Kaltofen:
Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems. ISSAC 1994: 297-304 - [c34]Erich L. Kaltofen, Victor Y. Pan:
Parallel Solution of Toeplitz and Toeplitz-Like Linear Systems Over Fields of Small Positive Characteristic. PASCO 1994: 225-233 - 1993
- [j17]Erich L. Kaltofen:
Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor. SIGSAM Bull. 27(4): 2 (1993) - [c33]Erich L. 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 L. Kaltofen, Austin Lobo, Thomas Valente:
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. DISCO 1993: 66-80 - 1992
- [c31]Erich L. 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]Erich L. Kaltofen:
On Computing Determinants of Matrices without Divisions. ISSAC 1992: 342-349 - [c29]Erich L. Kaltofen:
Polynomial Factorization 1987-1991. LATIN 1992: 294-313 - 1991
- [j16]David G. Cantor, Erich L. Kaltofen:
On Fast Multiplication of Polynomials over Arbitrary Algebras. Acta Informatica 28(7): 693-701 (1991) - [c28]Erich L. Kaltofen, B. David Saunders:
On Wiedemann's Method of Solving Sparse Linear Systems. AAECC 1991: 29-38 - [c27]Angel Díaz, Erich L. Kaltofen, Kurt Schmitz, Thomas Valente:
DSC: A System for Distributed Symbolic Computation. ISSAC 1991: 323-332 - [c26]Erich L. Kaltofen, Victor Y. Pan:
Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. SPAA 1991: 180-191 - [c25]Erich L. Kaltofen:
Effective Noether Irreducibility Forms and Applications (Extended Abstract). STOC 1991: 54-63 - 1990
- [j15]Erich L. Kaltofen:
Computing the Irreducible Real Factors and Components of an Algebraic Curve. Appl. Algebra Eng. Commun. Comput. 1: 135-148 (1990) - [j14]Erich L. Kaltofen, Bruno Buchberger:
Special Issue Computational Algebraic Complexity Editorial. J. Symb. Comput. 9(3): 225-228 (1990) - [j13]Erich L. 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 L. Kaltofen, Yagati N. Lakshman, J.-M. Wiley:
Modular Rational Sparse Multivariate Polynomial Interpolation. ISSAC 1990: 135-139
1980 – 1989
- 1989
- [b1]Erich L. Kaltofen:
Computers and mathematics. Springer 1989, ISBN 0387970193, pp. I-XI, 1-326 - [j12]Erich L. Kaltofen:
Factorization of Polynomials Given by Straight-Line Programs. Adv. Comput. Res. 5: 375-412 (1989) - [c23]Erich L. Kaltofen:
Computing the Irreducible Real Factors and Components of an Algebraic Curve. SCG 1989: 79-87 - [c22]Erich L. Kaltofen, Thomas Valente, Norika Yui:
An Improved Las Vegas Primality Test. ISSAC 1989: 26-33 - [c21]John F. Canny, Erich L. Kaltofen, Yagati N. Lakshman:
Solving Systems of Nonlinear Polynomial Equations Faster. ISSAC 1989: 121-128 - [e1]Erich L. Kaltofen, Stephen M. Watt:
Computers and Mathematics, Third Computers and Mathematics Conference, MIT, Cambridge, Massachusetts, USA, June 13-17, 1989. Springer 1989, ISBN 978-0-387-97019-6 [contents] - 1988
- [j11]Brent Gregory, Erich L. Kaltofen:
Analysis of the binary complexity of asymptotically fast algorithms for linear system solving. SIGSAM Bull. 22(2): 41-49 (1988) - [j10]Erich L. 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 L. 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 L. 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 L. 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 L. Kaltofen, Yagati N. Lakshman:
Improved Sparse Multivariate Polynomial Interpolation Algorithms. ISSAC 1988: 467-474 - 1987
- [j7]Erich L. Kaltofen:
Deterministic Irreducibility Testing of Polynomials over Large Finite Fields. J. Symb. Comput. 4(1): 77-82 (1987) - [c18]Erich L. 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 L. 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 L. Kaltofen:
Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. Aegean Workshop on Computing 1986: 236-245 - [c15]Erich L. Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders:
Fast parallel algorithms for similarity of matrices. SYMSAC 1986: 65-70 - [c14]Timothy S. Freeman, Gregory M. Imirzian, Erich L. Kaltofen:
A system for manipulating polynomials given by straight-line programs. SYMSAC 1986: 169-175 - [c13]Erich L. Kaltofen:
Uniform Closure Properties of P-Computable Functions. STOC 1986: 330-337 - 1985
- [j6]Erich L. Kaltofen:
Effective Hilbert Irreducibility. Inf. Control. 66(3): 123-137 (1985) - [j5]Joachim von zur Gathen, Erich L. Kaltofen:
Factoring Sparse Multivariate Polynomials. J. Comput. Syst. Sci. 31(2): 265-287 (1985) - [j4]Erich L. Kaltofen:
Fast Parallel Absolute Irreducibility Testing. J. Symb. Comput. 1(1): 57-67 (1985) - [j3]Erich L. Kaltofen:
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization. SIAM J. Comput. 14(2): 469-489 (1985) - [c12]Erich L. Kaltofen:
Sparse Hensel Lifting. European Conference on Computer Algebra (2) 1985: 4-17 - [c11]Erich L. Kaltofen, Heinrich Rolletschek:
Arithmetic in Quadratic Fields with Unique Factorization. European Conference on Computer Algebra (2) 1985: 279-288 - [c10]Erich L. Kaltofen:
Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization. FOCS 1985: 451-458 - [c9]Erich L. Kaltofen:
Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors. STOC 1985: 131-142 - 1984
- [c8]Erich L. Kaltofen:
Effective Hilbert Irreducibility. EUROSAM 1984: 277-284 - [c7]Erich L. Kaltofen, Noriko Yui:
Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields with Class Numbers 7 and 11. EUROSAM 1984: 310-320 - [c6]Erich L. Kaltofen:
A Note on the Risch Differential Equation. EUROSAM 1984: 359-366 - 1983
- [j2]Erich L. Kaltofen, David R. Musser, B. David Saunders:
A Generalized Class of Polynomials that are Hard to Factor. SIAM J. Comput. 12(3): 473-483 (1983) - [c5]Erich L. Kaltofen:
On the complexity of finding short vectors in integer lattices. EUROCAL 1983: 236-244 - [c4]Joachim von zur Gathen, Erich L. Kaltofen:
Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. ICALP 1983: 250-263 - 1982
- [j1]Erich L. Kaltofen:
Polynomial reduction from multivariate to bivariate integral polynomial factorization. SIGSAM Bull. 16(4): 4 (1982) - [c3]Erich L. Kaltofen:
A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization. FOCS 1982: 57-64 - [c2]Erich L. Kaltofen:
A Polynomial Reduction from Multivariate to Bivariate Integral Polynomial Factorization. STOC 1982: 261-266 - 1981
- [c1]Erich L. Kaltofen, David R. Musser, B. David Saunders:
A generalized class of polynomials that are hard to factor. SYMSACC 1981: 188-194
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
