☰

Erich L. Kaltofen - Publications

Affiliations: 
Applied Mathematics North Carolina State University, Raleigh, NC 
Area:
Applied Mathematics, Mathematics, Computer Science
Tree Info Similar researchers PubMed Report error

50 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Imamoglu E, Kaltofen EL. On computing the degree of a Chebyshev Polynomial from its value Journal of Symbolic Computation. DOI: 10.1016/J.Jsc.2020.04.011  0.491
2020 Dumas J, Kaltofen E, Lucas D, Pernet C. Elimination-based certificates for triangular equivalence and rank profiles Journal of Symbolic Computation. 98: 246-269. DOI: 10.1016/J.Jsc.2019.07.013  0.369
2020 Giesbrecht M, Haraldson J, Kaltofen E. Computing Approximate Greatest Common Right Divisors of Differential Polynomials Foundations of Computational Mathematics. 20: 331-366. DOI: 10.1007/S10208-019-09422-2  0.4
2016 Kaltofen EL, Yang Z. Sparse multivariate function recovery with a small number of evaluations Journal of Symbolic Computation. 75: 209-218. DOI: 10.1016/J.Jsc.2015.11.015  0.472
2014 Kaltofen EL, Pernet C. Sparse polynomial interpolation codes and their decoding beyond half the minimum distance Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 272-279. DOI: 10.1145/2608628.2608660  0.398
2014 Kaltofen E, Ovchinnikov A. NSF funding opportunities for symbolic computation Acm Communications in Computer Algebra. 47: 84-84. DOI: 10.1145/2576802.2576805  0.307
2013 Kaltofen E, Yuhasz G. On the matrix Berlekamp-Massey algorithm Acm Transactions On Algorithms. 9. DOI: 10.1145/2500122  0.751
2013 Kaltofen E, Yuhasz G. A fraction free Matrix Berlekamp/Massey algorithm Linear Algebra and Its Applications. 439: 2515-2526. DOI: 10.1016/J.Laa.2013.06.016  0.748
2012 Comer MT, Kaltofen EL, Pernet C. Sparse polynomial interpolation and berlekamp/massey algorithms that correct outlier errors in input values Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 138-145. DOI: 10.1145/2442829.2442852  0.763
2012 Johnson JR, Kaltofen E, Park H. Special Issue on Symbolic and Algebraic Computation Foundations, Algorithmics and Applications: ISSAC 2009 Journal of Symbolic Computation. 47: 751. DOI: 10.1016/J.Jsc.2011.12.006  0.564
2012 Comer MT, Kaltofen EL. On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field Journal of Symbolic Computation. 47: 480-491. DOI: 10.1016/J.Jsc.2011.09.008  0.716
2012 Kaltofen EL, Li B, Yang Z, Zhi L. Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients Journal of Symbolic Computation. 47: 1-15. DOI: 10.1016/J.Jsc.2011.08.002  0.582
2011 Kaltofen EL, Nehring M. Supersparse black box rational function interpolation Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 177-185. DOI: 10.1145/1993886.1993916  0.388
2011 Kaltofen EL, Nehring M, Saunders BD. Quadratic-time certificates in linear algebra Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 171-176. DOI: 10.1145/1993886.1993915  0.442
2011 Grenet B, Kaltofen E, Koiran P, Portier N. Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits Arxiv: Computational Complexity. 556: 61-96. DOI: 10.1090/Conm/556  0.348
2010 Kaltofen E, Lavin M. Efficiently Certifying Non-Integer Powers Computational Complexity. 19: 355-366. DOI: 10.1007/S00037-010-0297-X  0.374
2010 Hutton S, Kaltofen EL, Zhi L. Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method Proceedings of the International Symposium On Symbolic and Algebraic Computation, Issac. 227-234.  0.342
2008 Yuhasz G, Kaltofen E. Computing minimal generators of integer matrix sequences (abstract only) Acm Communications in Computer Algebra. 42: 91-91. DOI: 10.1145/1394042.1394101  0.751
2008 Kaltofen E, May JP, Yang Z, Zhi L. Approximate factorization of multivariate polynomials using singular value decomposition Journal of Symbolic Computation. 43: 359-376. DOI: 10.1016/J.Jsc.2007.11.005  0.531
2007 Borwein P, Kaltofen E, Mossinghoff MJ. Irreducible polynomials and barker sequences Acm Communications in Computer Algebra. 41: 118-121. DOI: 10.1145/1358183.1358185  0.359
2005 Kaltofen E, Villard G. On the complexity of computing determinants Computational Complexity. 13: 91-130. DOI: 10.1007/S00037-004-0185-3  0.437
2004 Gao S, Kaltofen E, Lauder AGB. Deterministic distinct-degree factorization of polynomials over finite fields Journal of Symbolic Computation. 38: 1461-1470. DOI: 10.1016/J.Jsc.2004.05.004  0.442
2004 Kaltofen E, Villard G. Computing the sign or the value of the determinant of an integer matrix, a complexity survey Journal of Computational and Applied Mathematics. 162: 133-146. DOI: 10.1016/J.Cam.2003.08.019  0.478
2002 Chen L, Eberly W, Kaltofen E, Saunders BD, Turner WJ, Villard G. Efficient matrix preconditioners for black box linear algebra Linear Algebra and Its Applications. 119-146. DOI: 10.1016/S0024-3795(01)00472-4  0.395
2000 Kaltofen E. Challenges of Symbolic Computation Journal of Symbolic Computation. 29: 891-919. DOI: 10.1006/Jsco.2000.0370  0.458
1999 Kaltofen E, Lobo A. Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields Algorithmica. 24: 331-348. DOI: 10.1007/Pl00008266  0.368
1998 Kaltofen E, Shoup V. Subquadratic-time factoring of polynomials over finite fields Mathematics of Computation. 67: 1179-1197. DOI: 10.1090/S0025-5718-98-00944-2  0.541
1995 Kaltofen E. Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems Mathematics of Computation. 64: 777-806. DOI: 10.2307/2153451  0.528
1995 Hitz MA, Kaltofen E. Integer division in residue number systems Ieee Transactions On Computers. 44: 983-989. DOI: 10.1109/12.403714  0.501
1995 Díaz A, Hitz M, Kaltofen E, Lobo A, Valente T. Process scheduling in DSC and the large sparse linear systems challenge Journal of Symbolic Computation. 19: 269-282. DOI: 10.1006/Jsco.1995.1015  0.426
1993 Kaltofen E. Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems Applicable Algebra in Engineering, Communication and Computing. 195-212. DOI: 10.1007/3-540-56686-4_44  0.521
1991 Cantor DG, Kaltofen E. On fast multiplication of polynomials over arbitrary algebras Acta Informatica. 28: 693-701. DOI: 10.1007/Bf01178683  0.39
1990 Kaltofen E, Trager BM. Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators Journal of Symbolic Computation. 9: 301-320. DOI: 10.1016/S0747-7171(08)80015-6  0.424
1990 Kaltofen E, Buchberger B. Special issue computational algebraic complexity editorial Journal of Symbolic Computation. 9: 225-228. DOI: 10.1016/S0747-7171(08)80010-7  0.327
1990 Kaltofen E, Krishnamoorthy MS, David Saunders B. Parallel algorithms for matrix normal forms Linear Algebra and Its Applications. 136: 189-208. DOI: 10.1016/0024-3795(90)90028-B  0.634
1990 Kaltofen E. Computing the irreducible real factors and components of an algebraic curve Applicable Algebra in Engineering, Communication and Computing. 1: 135-148. DOI: 10.1007/Bf01810297  0.457
1989 Kaltofen E, Rolletschek H. Computing greatest common divisors and factorizations in quadratic number fields Mathematics of Computation. 53: 697-720. DOI: 10.1090/S0025-5718-1989-0982367-2  0.539
1989 Kaltofen E, Watt SM. Computers and Mathematics Mathematics of Computation. 55: 876. DOI: 10.1007/978-1-4613-9647-5  0.357
1988 Gregory B, Kaltofen E. Analysis of the binary complexity of asymptotically fast algorithms for linear system solving Acm Sigsam Bulletin. 22: 41-49. DOI: 10.1145/43876.43880  0.598
1988 Kaltofen E. Greatest common divisors of polynomials given by straight-line programs Journal of the Acm. 35: 231-264. DOI: 10.1145/42267.45069  0.529
1988 Miller GL, Ramachandran V, Kaltofen E. Efficient parallel evaluation of straight-line code and arithmetic circuits Siam Journal On Computing. 17: 687-695. DOI: 10.1137/0217044  0.391
1987 Kaltofen E, Krishnamoorthy MS, Saunders BD. Fast parallel computation of hermite and smith forms of polynomial matrices Siam Journal On Algebraic and Discrete Methods. 8: 683-690. DOI: 10.1137/0608057  0.551
1987 Kaltofen E. Deterministic irreducibility testing of polynomials over large finite fields Journal of Symbolic Computation. 4: 77-82. DOI: 10.1016/S0747-7171(87)80055-X  0.575
1985 Kaltofen E. Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization Siam Journal On Computing. 14: 469-489. DOI: 10.1137/0214035  0.502
1985 Gathen Jvz, Kaltofen E. Factorization of multivariate polynomials over finite fields Mathematics of Computation. 45: 251-261. DOI: 10.1090/S0025-5718-1985-0790658-X  0.551
1985 Kaltofen E. Fast parallel absolute irreducibility testing Journal of Symbolic Computation. 1: 57-67. DOI: 10.1016/S0747-7171(85)80029-8  0.519
1985 Kaltofen E. Effective Hilbert irreducibility Information & Computation. 66: 123-137. DOI: 10.1016/S0019-9958(85)80056-5  0.343
1985 Gathen Jvz, Kaltofen E. Factoring sparse multivariate polynomials Journal of Computer and System Sciences. 31: 265-287. DOI: 10.1016/0022-0000(85)90044-3  0.384
1983 Kaltofen E, Musser DR, Saunders BD. A Generalized Class of Polynomials that are Hard to Factor Siam Journal On Computing. 12: 473-483. DOI: 10.1137/0212031  0.484
1982 Kaltofen E. Polynomial reduction from multivariate to bivariate integral polynomial factorization Acm Sigsam Bulletin. 16: 4-4. DOI: 10.1145/1089310.1089311  0.346
Show low-probability matches.