Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Erich Kaltofen
2010 – today
- 2013
[c74]Erich Kaltofen, Zhengfeng Yang: Sparse multivariate function recovery from values with noise and outlier errors. ISSAC 2013: 219-226- 2012
- [j29]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)
- [j28]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)
- [j27]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)
- [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]Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier: Symmetric Determinantal Representation of Weakly-Skew Circuits. STACS 2011: 543-554
- [c68]
- 2010
- [j26]Erich Kaltofen, Mark Lavin: Efficiently Certifying Non-Integer Powers. Computational Complexity 19(3): 355-366 (2010)
- [c67]Erich Kaltofen: Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010. PASCO 2010: 10-17
- [c66]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
- [i1]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
- [e4]Jeremy R. Johnson, Hyungju Park, Erich Kaltofen (Eds.): 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
- 2008
- [j25]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)
- [c65]Erich Kaltofen, Pascal Koiran: Expressing a fraction of two determinants as a determinant. ISSAC 2008: 141-146
- [c64]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
- [c63]Erich Kaltofen, Zhengfeng Yang, Lihong Zhi: On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. SNC 2007: 11-17
- [c62]Erich 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 Kaltofen, Zhengfeng Yang: On exact and approximate interpolation of sparse rational functions. ISSAC 2007: 203-210
- 2006
- [c60]Wolfram Decker, Mike Dewar, Erich Kaltofen, Stephen M. Watt: 06271 Executive Summary - Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software 2006
- [c59]Wolfram Decker, Mike Dewar, Erich Kaltofen, Stephen M. Watt: 06271 Abstracts Collection -- Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software 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 (Eds.): 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
- 2005
- [j24]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
- [j23]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
- [j22]Erich Kaltofen, Wen-shin Lee: Early termination in sparse interpolation algorithms. J. Symb. Comput. 36(3-4): 365-400 (2003)
- [j21]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 (Eds.): 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
- 2000
- [j20]Erich Kaltofen: Challenges of Symbolic Computation: My Favorite Open Problems. J. Symb. Comput. 29(6): 891-919 (2000)
- [c48]Erich Kaltofen, Wen-shin Lee, A. Lobo: Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. ISSAC 2000: 192-201
1990 – 1999
- 1999
- [j19]Erich Kaltofen, A. Lobo: Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields. Algorithmica 24(3-4): 331-348 (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
- [j18]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
- [j17]
- [c42]
- [c41]Erich Kaltofen, Victor Shoup: Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields. ISSAC 1997: 184-188
- [p1]Angel Díaz, Erich Kaltofen, Victor Y. Pan: Algebraic Algorithms. The Computer Science and Engineering Handbook 1997: 226-249
- [e1]Hoon Hong, Erich Kaltofen, Markus A. Hitz (Eds.): 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
- 1996
- [c40]Erich Kaltofen, A. 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
- [j16]Erich Kaltofen: Effective Noether Irreducibility Forms and Applications. J. Comput. Syst. Sci. 50(2): 274-295 (1995)
- [j15]Angel Díaz, Markus A. Hitz, Erich Kaltofen, A. Lobo, T. Valente: Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. J. Symb. Comput. 19(1-3): 269-282 (1995)
- [j14]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, A. 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
- [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, A. 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
- [j13]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
- [j12]Erich Kaltofen: Computing the Irreducible Real Factors and Components of an Algebraic Curve. Appl. Algebra Eng. Commun. Comput. 1: 135-148 (1990)
- [j11]Erich Kaltofen, Bruno Buchberger: Special Issue Computational Algebraic Complexity Editorial. J. Symb. Comput. 9(3): 225-228 (1990)
- [j10]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
- [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
- [j9]Erich Kaltofen: Greatest common divisors of polynomials given by straight-line programs. J. ACM 35(1): 231-264 (1988)
- [j8]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)
- [j7]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
- [j6]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]Timothy S. Freeman, Gregory M. Imirzian, Erich Kaltofen: A system for manipulating polynomials given by straight-line programs. SYMSAC 1986: 169-175
- [c13]
- 1985
- [j5]
- [j4]Joachim von zur Gathen, Erich Kaltofen: Factoring Sparse Multivariate Polynomials. J. Comput. Syst. Sci. 31(2): 265-287 (1985)
- [j3]
- [j2]Erich Kaltofen: Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization. SIAM J. Comput. 14(2): 469-489 (1985)
- [c12]
- [c11]Erich Kaltofen, Heinrich Rolletschek: Arithmetic in Quadratic Fields with Unique Factorization. European Conference on Computer Algebra (2) 1985: 279-288
- [c10]Erich Kaltofen: Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization. FOCS 1985: 451-458
- [c9]Erich Kaltofen: Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors. STOC 1985: 131-142
- 1984
- [c8]
- [c7]Erich 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]
- 1983
- [j1]Erich 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 Kaltofen: On the complexity of finding short vectors in integer lattices. EUROCAL 1983: 236-244
- [c4]Joachim von zur Gathen, Erich Kaltofen: Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. ICALP 1983: 250-263
- 1982
- [c3]Erich Kaltofen: A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization. FOCS 1982: 57-64
- [c2]Erich Kaltofen: A Polynomial Reduction from Multivariate to Bivariate Integral Polynomial Factorization. STOC 1982: 261-266
- 1981
- [c1]Erich Kaltofen, David R. Musser, B. David Saunders: A generalized class of polynomials that are hard to factor. SYMSACC 1981: 188-194
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:07 CEST by the dblp team