Erich Kaltofen

Kaltofen, E. L. (2022). Sparse Polynomial Hermite Interpolation. PROCEEDINGS OF THE 2022 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, ISSAC 2022, pp. 469–478. https://doi.org/10.1145/3476446.3535501

Kaltofen, E. L. (2022). The GKR Protocol Revisited: Nearly Optimal Prover-Complexity For Polynomial-Time Wiring Algorithms and For Primality Testing in n(1/2+o(1)) Rounds. PROCEEDINGS OF THE 2022 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, ISSAC 2022, pp. 177–186. https://doi.org/10.1145/3476446.3536183

Kaltofen, E. L. (2021). Foreword. JOURNAL OF SYMBOLIC COMPUTATION, Vol. 105, pp. 1–3. https://doi.org/10.1016/j.jsc.2020.04.006

Imamoglu, E., & Kaltofen, E. L. (2021). On computing the degree of a Chebyshev Polynomial from its value. JOURNAL OF SYMBOLIC COMPUTATION, 104, 159–167. https://doi.org/10.1016/j.jsc.2020.04.011

Kaltofen, E. L., & Yang, Z.-H. (2021). Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding. IEEE TRANSACTIONS ON INFORMATION THEORY, 67(1), 232–243. https://doi.org/10.1109/TIT.2020.3027036

Imamoglu, E., & Kaltofen, E. L. (2020). A Note on Sparse Polynomial Interpolation in Dickson Polynomial Basis. ACM COMMUNICATIONS IN COMPUTER ALGEBRA, 54(4), 125–128. https://doi.org/10.1145/3465002.3465003

Giesbrecht, M., Haraldson, J., & Kaltofen, E. (2019). Computing Approximate Greatest Common Right Divisors of Differential Polynomials. Foundations of Computational Mathematics. https://doi.org/10.1007/s10208-019-09422-2

Dumas, J.-G., Kaltofen, E., Lucas, D., & Pernet, C. (2019). Elimination-based certificates for triangular equivalence and rank profiles. JOURNAL OF SYMBOLIC COMPUTATION, Vol. 98, pp. 246–269. https://doi.org/10.1016/j.jsc.2019.07.013

Imamoglu, E., Kaltofen, E. L., & Yang, Z. (2018). Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases. ISSAC'18: PROCEEDINGS OF THE 2018 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, pp. 223–230. https://doi.org/10.1145/3208976.3208999

Kaltofen, E. L., Pernet, C., Storjohann, A., & Waddell, C. (2017). Early Termination in Parametric Linear System Solving and Rational Function Vector Recovery with Error Correction. Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation  - ISSAC '17. Presented at the the 2017 ACM. https://doi.org/10.1145/3087604.3087645

Dumas, J.-G., Kaltofen, E. L., Villard, G., & Zhi, L. (2017). Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits. Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation  - ISSAC '17. Presented at the the 2017 ACM. https://doi.org/10.1145/3087604.3087640

Dumas, J.-G., Kaltofen, E., Thome, E., & Villard, G. (2016). Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix. PROCEEDINGS OF THE 2016 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC 2016), pp. 199–206. https://doi.org/10.1145/2930889.2930908

Hao, Z., Kaltofen, E. L., & Zhi, L. (2016). Numerical Sparsity Determination and Early Termination. Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '16. Presented at the the ACM. https://doi.org/10.1145/2930889.2930924

Kaltofen, E. L., & Yang, Z. (2016). Sparse multivariate function recovery with a small number of evaluations. JOURNAL OF SYMBOLIC COMPUTATION, 75, 209–218. https://doi.org/10.1016/j.jsc.2015.11.015

Arnold, A., & Kaltofen, E. L. (2015). Error-Correcting Sparse Interpolation in the Chebyshev Basis. Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation - ISSAC '15. Presented at the the 2015 ACM. https://doi.org/10.1145/2755996.2756652

Dumas, J.-G., Kaltofen, E. L., & Pernet, C. (Eds.). (2015). PASCO '15 Proceedings of the 2015 International Workshop on Parallel Symbolic Computation. New York, NY: Association for Computing Machinery.

Kaltofen, E. L. (2014). Cleaning-up data for sparse model synthesis. Proceedings of the 2014 Symposium on Symbolic-Numeric Computation - SNC '14. Presented at the the 2014 Symposium. https://doi.org/10.1145/2631948.2631949

Dumas, J.-G., & Kaltofen, E. (2014). Essentially optimal interactive certificates in linear algebra. Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation - ISSAC '14. Presented at the the 39th International Symposium. https://doi.org/10.1145/2608628.2608644

Boyer, B., & Kaltofen, E. L. (2014). Numerical linear system solving with parametric entries by error correction. Proceedings of the 2014 Symposium on Symbolic-Numeric Computation - SNC '14. Presented at the the 2014 Symposium. https://doi.org/10.1145/2631948.2631956

Boyer, B., Comer, M. T., & Kaltofen, E. L. (2014). Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations. In Computer Mathematics (pp. 183–197). https://doi.org/10.1007/978-3-662-43799-5_16

Kaltofen, E. L., & Yang, Z. (2014). Sparse multivariate function recovery with a high error rate in the evaluations. Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation - ISSAC '14. Presented at the the 39th International Symposium. https://doi.org/10.1145/2608628.2608637

Kaltofen, E. L., & Pernet, C. (2014). Sparse polynomial interpolation codes and their decoding beyond half the minimum distance. Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation - ISSAC '14. Presented at the the 39th International Symposium. https://doi.org/10.1145/2608628.2608660

Kaltofen, E. L. (2014). Symbolic Computation and Complexity Theory Transcript of My Talk. In Computer Mathematics (pp. 3–7). https://doi.org/10.1007/978-3-662-43799-5_1

Kaltofen, E., & Yuhasz, G. (2013). A fraction free Matrix Berlekamp/Massey algorithm. LINEAR ALGEBRA AND ITS APPLICATIONS, 439(9), 2515–2526. https://doi.org/10.1016/j.laa.2013.06.016

Kaltofen, E., & Lecerf, G. (2013). Factorization of multivariate polynomials. In G. L. Mullen & D. Panario (Eds.), Handbook of Finite Fields (pp. 382–392). Boca Raton, Florida: CRC Press, Taylor & Francis Group.

Kaltofen, E., & Yuhasz, G. (2013). On the Matrix Berlekamp-Massey Algorithm. ACM TRANSACTIONS ON ALGORITHMS, 9(4). https://doi.org/10.1145/2500122

Kaltofen, E. L., & Yang, Z. (2013). Sparse multivariate function recovery from values with noise and outlier errors. Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation - ISSAC '13. Presented at the the 38th international symposium. https://doi.org/10.1145/2465506.2465524

Guo, F., Kaltofen, E. L., & Zhi, L. (2012). Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation - ISSAC '12. Presented at the the 37th International Symposium. https://doi.org/10.1145/2442829.2442859

Kaltofen, E. L., Li, B., Yang, Z., & Zhi, L. (2012). Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. Journal of Symbolic Computation, 47(1), 1–15. https://doi.org/10.1016/j.jsc.2011.08.002

Comer, M. T., & Kaltofen, E. L. (2012). On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field. JOURNAL OF SYMBOLIC COMPUTATION, 47(4), 480–491. https://doi.org/10.1016/j.jsc.2011.09.008

Comer, M. T., Kaltofen, E. L., & Pernet, C. (2012). Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values. Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation - ISSAC '12. Presented at the the 37th International Symposium. https://doi.org/10.1145/2442829.2442852

Johnson, J. R., Kaltofen, E., & Park, H. (2012, July). Special Issue on Symbolic and Algebraic Computation Foundations, Algorithmics and Applications: ISSAC 2009. JOURNAL OF SYMBOLIC COMPUTATION, Vol. 47, pp. 751–751. https://doi.org/10.1016/j.jsc.2011.12.006

Kaltofen, E. L., Lee, W.-shin, & Yang, Z. (2011). Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation. Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation - SNC '11. Presented at the the 2011 International Workshop. https://doi.org/10.1145/2331684.2331704

Kaltofen, E. L., Nehring, M., & Saunders, B. D. (2011). Quadratic-time certificates in linear algebra. Proceedings of the 36th international symposium on Symbolic and algebraic computation - ISSAC '11. Presented at the the 36th international symposium. https://doi.org/10.1145/1993886.1993915

Kaltofen, E. L., & Nehring, M. (2011). Supersparse black box rational function interpolation. Proceedings of the 36th international symposium on Symbolic and algebraic computation - ISSAC '11. Presented at the the 36th international symposium. https://doi.org/10.1145/1993886.1993916

Grenet, B., Kaltofen, E., Koiran, P., & Portier, N. (2011). Symmetric determinantal representation of formulas and weakly skew circuits. https://doi.org/10.1090/conm/556/11008

Grenet, B., Kaltofen, E. L., Koiran, P., & Portier, N. (2011). Symmetric determinantal representation of weakly skew circuits. In C. Dürr & T. Schwentick (Eds.), Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS 2011) (pp. 543–554). Germany.

Kaltofen, E. L. (2011). The “Seven Dwarfs” of Symbolic Computation. In Texts & Monographs in Symbolic Computation (pp. 95–104). https://doi.org/10.1007/978-3-7091-0794-2_5

Hutton, S., Kaltofen, E. L., & Zhi, L. (2010). Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method. Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation - ISSAC '10. Presented at the the 2010 International Symposium. https://doi.org/10.1145/1837934.1837979

Kaltofen, E., & Lavin, M. (2010). Efficiently Certifying Non-Integer Powers. COMPUTATIONAL COMPLEXITY, 19(3), 355–366. https://doi.org/10.1007/s00037-010-0297-x

Kaltofen, E. L. (2010). Fifteen years after DSC and WLSS2 what parallel computations I do today. Proceedings of the 4th International Workshop on Parallel and Symbolic Computation - PASCO '10. Presented at the the 4th International Workshop. https://doi.org/10.1145/1837210.1837213

Kaltofen, E. L. (2010). The Role of Symbolic, Numeric and Algebraic Computation in Cyber-Enabled Discovery and Innovation (CDI). In Future Directions of Symbolic Computation Research And Their Applications to the Domain Sciences. University of Rhode Island.

Kaltofen, E., Yang, Z., & Zhi, L. (2009). A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions. Proceedings of the 2009 conference on Symbolic numeric computation - SNC '09. Presented at the the 2009 conference. https://doi.org/10.1145/1577190.1577204

Kaltofen, E., May, J. P., Yang, Z., & Zhi, L. (2008). Approximate factorization of multivariate polynomials using singular value decomposition. JOURNAL OF SYMBOLIC COMPUTATION, 43(5), 359–376. https://doi.org/10.1016/j.jsc.2007.11.005

Kaltofen, E., Li, B., Yang, Z., & Zhi, L. (2008). Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. Proceedings of the twenty-first international symposium on Symbolic and algebraic computation - ISSAC '08. Presented at the the twenty-first international symposium. https://doi.org/10.1145/1390768.1390792

Kaltofen, E., & Koiran, P. (2008). Expressing a fraction of two determinants as a determinant. Proceedings of the twenty-first international symposium on Symbolic and algebraic computation - ISSAC '08. Presented at the the twenty-first international symposium. https://doi.org/10.1145/1390768.1390790

Borwein, P., Kaltofen, E., & Mossinghoff, M. J. (2007). Irreducible polynomials and barker sequences. ACM Communications in Computer Algebra, 41(4), 118. https://doi.org/10.1145/1358183.1358185

Kaltofen, E., Li, B., Sivaramakrishnan, K., Yang, Z., & Zhi, L. (2007). Lower bounds for approximate factorizations via semidefinite programming. In J. Verschelde & S. M. Watt (Eds.), Proceedings of the 2007 International Workshop on Symbolic-Numeric Computation (SNC '07) (pp. 203–204). New York, NY: ACM Press.

Kaltofen, E., & Yang, Z.-F. (2007). On exact and approximate interpolation of sparse rational functions. ISSAC 2007: International Symposium for Symbolic and Algebraic Computation: Proceedings. https://doi.org/10.1145/1277548.1277577

Kaltofen, E., Yang, Z.-F., & Zhi, L.-H. (2007). On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. International Workshop on Symbolic-Numeric Computation: Proceedings. New York: ACM Press.

Kaltofen, E., Yang, Z., & Zhi, L. (2007). Structured Low Rank Approximation of a Sylvester Matrix. In Trends in Mathematics (pp. 69–83). https://doi.org/10.1007/978-3-7643-7984-1_5

Kaltofen, E., Yang, Z., & Zhi, L. (2006). Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. Proceedings of the 2006 international symposium on Symbolic and algebraic computation  - ISSAC '06. Presented at the the 2006 international symposium. https://doi.org/10.1145/1145768.1145799

Decker, W., Dewar, M., Kaltofen, E., & Watt, S. (Eds.). (2006). Challenges in Symbolic Computation Software, number 06271. In Dagstuhl Seminar Proceedings. Germany: Schloss Dagstuhl.

Kaltofen, E., & Koiran, P. (2006). Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. Proceedings of the 2006 international symposium on Symbolic and algebraic computation  - ISSAC '06. Presented at the the 2006 international symposium. https://doi.org/10.1145/1145768.1145798

Kaltofen, E., & Zhi, L. (2006). Hybrid symbolic-numeric computation. Proceedings of the 2006 international symposium on Symbolic and algebraic computation  - ISSAC '06. Presented at the the 2006 international symposium. https://doi.org/10.1145/1145768.1145775

Kaltofen, E., & Yui, N. (2005). Explicit construction of the hilbert class fields of imaginary quadratic fields with class numbers 7 and 11. In J. Fitch (Ed.), EUROSAM 84 (pp. 310–320). https://doi.org/10.1007/bfb0032853

Kaltofen, E., Morozov, D., & Yuhasz, G. (2005). Generic matrix multiplication and memory management in linBox. Proceedings of the 2005 international symposium on Symbolic and algebraic computation  - ISSAC '05. Presented at the the 2005 international symposium. https://doi.org/10.1145/1073884.1073915

Kaltofen, E., & Villard, G. (2005). On the complexity of computing determinants. COMPUTATIONAL COMPLEXITY, 13(3-4), 91–130. https://doi.org/10.1007/s00037-004-0185-3

Kaltofen, E., & Koiran, P. (2005). On the complexity of factoring bivariate supersparse (Lacunary) polynomials. Proceedings of the 2005 international symposium on Symbolic and algebraic computation  - ISSAC '05. Presented at the the 2005 international symposium. https://doi.org/10.1145/1073884.1073914

Gao, S., Kaltofen, E., May, J., Yang, Z., & Zhi, L. (2004). Approximate factorization of multivariate polynomials via differential equations. Proceedings of the 2004 international symposium on Symbolic and algebraic computation  - ISSAC '04. Presented at the the 2004 international symposium. https://doi.org/10.1145/1005285.1005311

Kaltofen, E., & Villard, G. (2004, January 1). Computing the sign or the value of the determinant of an integer matrix, a complexity survey. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, Vol. 162, pp. 133–146. https://doi.org/10.1016/j.cam.2003.08.019

Gao, S. H., Kaltofen, E., & Lauder, A. G. B. (2004). Deterministic distinct-degree factorization of polynomials over finite fields. JOURNAL OF SYMBOLIC COMPUTATION, 38(6), 1461–1470. https://doi.org/10.1016/j.jsc.2004.05.004

Eberly, W., & Kaltofen, E. (2004). Early termination in Shoup's algorithm for the minimum polynomial of an algebraic.

Kaltofen, E. (2003). Absolute factorization of polynomials. In J. Grabmeier, E. Kaltofen, & V. Weispfenning (Eds.), Computer Algebra Handbook (p. 26). Heidelberg, Germany: Springer Verlag.

Giesbrecht, M., Kaltofen, E., & Lee, W. S. (2003). Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases. JOURNAL OF SYMBOLIC COMPUTATION, Vol. 36, pp. 401–424. https://doi.org/10.1016/S0747-7171(03)00087-7

Grabmeier, J., & Weispfenning, V. (2003). Computer Algebra Handbook (J. Grabmeier, E. Kaltofen, & V. Weispfenning, Eds.). Heidelberg, Germany: Springer Verlag.

Kaltofen, E., & Weispfenning, V. (2003). Computer algebra - impact on research. In J. Grabmeier, E. Kaltofen, & V. Weispfenning (Eds.), Computer Algebra Handbook (pp. 4–6). Heidelberg, Germany: Springer Verlag.

Computer algebra handbook foundations, applications, systems. (2003). https://doi.org/10.1007/978-3-540-72122-2_20

Kaltofen, E., & Lee, E. S. (2003). Early termination in sparse interpolation algorithms. JOURNAL OF SYMBOLIC COMPUTATION, Vol. 36, pp. 365–400. https://doi.org/10.1016/S0747-7171(03)00088-9

Kaltofen, E. (2003). FoxBox and other blackbox systems. In J. Grabmeier, E. Kaltofen, & V. Weispfenning (Eds.), Computer Algebra Handbook (pp. 383–385). Heidelberg, Germany: Springer Verlag.

Corless, M., Kaltofen, E., & Watt, S. M. (2003). Hybrid methods. In J. Grabmeier, E. Kaltofen, & V. Weispfenning (Eds.), Computer Algebra Handbook (pp. 112–125). Heidelberg, Germany: Springer Verlag.

Kaltofen, E., & Saunders, B. D. (2003). Linear systems. In J. Grabmeier, E. Kaltofen, & V. Weispfenning (Eds.), Computer algebra handbook: foundations, applications, systems (pp. 36–38). Heidelberg, Germany: Springer Verlag.

Kaltofen, E., & May, J. (2003). On approximate irreducibility of polynomials in several variables. Proceedings of the 2003 international symposium on Symbolic and algebraic computation  - ISSAC '03. Presented at the the 2003 international symposium. https://doi.org/10.1145/860854.860893

Kaltofen, E. (2003). Polynomial factorization. Proceedings of the 2003 international symposium on Symbolic and algebraic computation  - ISSAC '03. Presented at the the 2003 international symposium. https://doi.org/10.1145/860854.860857

Kaltofen, E., McLean, M., & Norris, L. (2002). 'Using Maple to grade Maple' assessment software from North Carolina State University. Proceedings 2002 Maple Workshop. Waterloo, Canada: Waterloo Maple Inc. With Dmitriy Morozov, John May and William Turner.

Giesbrecht, M., Kaltofen, E., & Lee, W.-shin. (2002). Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. Proceedings of the 2002 international symposium on Symbolic and algebraic computation  - ISSAC '02. Presented at the ISSAC 02: International symposium on symbolic and algebraic computation, Lille, France. https://doi.org/10.1145/780506.780519

Kaltofen, E. (2002). An output-sensitive variant of the baby steps/giant steps determinant algorithm. Proceedings of the 2002 international symposium on Symbolic and algebraic computation  - ISSAC '02. Presented at the the 2002 international symposium. https://doi.org/10.1145/780506.780524

Chen, L., Eberly, W., Kaltofen, E., Saunders, B. D., Turner, W. J., & Villard, G. (2002). Efficient matrix preconditioners for black box linear algebra. LINEAR ALGEBRA AND ITS APPLICATIONS, 343, 119–146. https://doi.org/10.1016/S0024-3795(01)00472-4

Dumas, J. G., Gautier, T., Giesbrecht, M., Giorgi, P., Hovinen, B., Kaltofen, E., … Villard, G. (2002). LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA. Mathematical Software. Presented at the Proceedings of the First International Congress of Mathematical Software. https://doi.org/10.1142/9789812777171_0005

Kaltofen, E. (2001, May 23). Algorithms for sparse and black box matrices over finite fields. Presented at the International Conference on Finite Fields and Applications, Oaxaca, Mexico.

Kaltofen, E. (2000). [Review of Challenges of symbolic computation: My favorite open problems]. JOURNAL OF SYMBOLIC COMPUTATION, 29(6), 891–919. https://doi.org/10.1006/jsco.2000.0370

Kaltofen, E., Lee, W.-shin, & Lobo, A. A. (2000). Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. Proceedings of the 2000 international symposium on Symbolic and algebraic computation symbolic and algebraic computation  - ISSAC '00. Presented at the the 2000 international symposium. https://doi.org/10.1145/345542.345629

Kaltofen, E., & Lobo, A. (1999). Distributed matrix-free solution of large sparse linear systems over finite fields. ALGORITHMICA, 24(3-4), 331–348. https://doi.org/10.1007/PL00008266

Hong, H., Kaltofen, E., & Singer, M. (Eds.). (1999). East Coast Computer Algebra Day '99 (April 24, 1999): Abstracts of invited talks and presented posters. Association for Computing Machinery SIGSAM Bulletin, 33(2), 43–52. https://doi.org/10.1145/334714.570085

Hitz, M. A., Kaltofen, E., & Lakshman, Y. N. (1999). Efficient algorithms for computing the nearest polynomial with a real root and related problems. Proceedings of the 1999 international symposium on Symbolic and algebraic computation  - ISSAC '99. Presented at the the 1999 international symposium. https://doi.org/10.1145/309831.309937

Kaltofen, E., & Monagan, M. B. (1999). On the genericity of the modular polynomial GCD algorithm. Proceedings of the 1999 international symposium on Symbolic and algebraic computation  - ISSAC '99. Presented at the the 1999 international symposium. https://doi.org/10.1145/309831.309861

Bernardin, L., Char, B., & Kaltofen, E. (1999). Symbolic computation in Java. Proceedings of the 1999 international symposium on Symbolic and algebraic computation  - ISSAC '99. Presented at the the 1999 international symposium. https://doi.org/10.1145/309831.309946

Díaz, A., Emiris, I., Kaltofen, E., & Pan, V. (1998). Algebraic Algorithms. In Algorithms and Theory of Computation Handbook. https://doi.org/10.1201/9781420049503-c17

Hitz, M. A., & Kaltofen, E. (1998). Efficient algorithms for computing the nearest polynomial with constrained roots. Proceedings of the 1998 international symposium on Symbolic and algebraic computation  - ISSAC '98. Presented at the the 1998 international symposium. https://doi.org/10.1145/281508.281624

Díaz, A., & Kaltofen, E. (1998). FOXBOX. Proceedings of the 1998 international symposium on Symbolic and algebraic computation  - ISSAC '98. Presented at the the 1998 international symposium. https://doi.org/10.1145/281508.281538

Kaltofen, E., & Shoup, V. (1998). Subquadratic-time factoring of polynomials over finite fields. MATHEMATICS OF COMPUTATION, 67(223), 1179–1197. https://doi.org/10.1090/S0025-5718-98-00944-2

Díaz, A., Kaltofen, E., & Pan, V. (1997). Algebraic algorithms. In A. B. Tucker (Ed.), The computer science and engineering handbook (pp. 226–248). Boca Raton, Florida: CRC Press.

Kaltofen, E., & Shoup, V. (1997). Fast polynomial factorization over high algebraic extensions of finite fields. Proceedings of the 1997 international symposium on Symbolic and algebraic computation  - ISSAC '97. Presented at the the 1997 international symposium. https://doi.org/10.1145/258726.258777

Eberly, W., & Kaltofen, E. (1997). On randomized Lanczos algorithms. Proceedings of the 1997 international symposium on Symbolic and algebraic computation  - ISSAC '97. Presented at the the 1997 international symposium. https://doi.org/10.1145/258726.258776

Hong, H., Kaltofen, E., & Hitz, M. (Eds.). (1997). PASCO '97: Proceedings of the second international symposium on Parallel symbolic computation. https://doi.org/10.1145/266670

Kaltofen, E. (1997). Teaching computational abstract algebra. JOURNAL OF SYMBOLIC COMPUTATION, 23(5-6), 503–515. https://doi.org/10.1006/jsco.1996.0104

Kaltofen, E. (1996). Blocked iterative sparse linear system solvers for finite fields. In C. Roucairol (Ed.), Proceedings of the Symposium of Parallel Computing Solving Large Scale Irregular Applications (Stratagem '96) (pp. 91–95). Sophia Antipolis, France: INRIA.

Erlingsson, Ú., Kaltofen, E., & Musser, D. (1996). Generic Gram-Schmidt orthogonalization by exact division. Proceedings of the 1996 international symposium on Symbolic and algebraic computation  - ISSAC '96. Presented at the the 1996 international symposium. https://doi.org/10.1145/236869.237085

Kaltofen, E., & Lobo, A. (1996). On rank properties of Toeplitz matrices over finite fields. Proceedings of the 1996 international symposium on Symbolic and algebraic computation  - ISSAC '96. Presented at the the 1996 international symposium. https://doi.org/10.1145/236869.237081

Samadani, M., & Kaltofen, E. (1996). Prediction Based Task Scheduling in Distributed Computing. In Languages, Compilers and Run-Time Systems for Scalable Computers (pp. 317–320). https://doi.org/10.1007/978-1-4615-2315-4_30

Kaltofen, E. (1995). Analysis of Coppersmith’s block Wiedemann algorithm for the parallel solution of sparse linear systems. Mathematics of Computation, 64(210), 777–777. https://doi.org/10.1090/s0025-5718-1995-1270621-1

Kaltofen, E. (1995). Effective Noether Irreducibility Forms and Applications. Journal of Computer and System Sciences, 50(2), 274–295. https://doi.org/10.1006/jcss.1995.1023

Hitz, M. A., & Kaltofen, E. (1995). Integer division in residue number systems. IEEE Transactions on Computers, 44(8), 983–989. https://doi.org/10.1109/12.403714

Díaz, A., & Kaltofen, E. (1995). On computing greatest common divisors with polynomials given by black boxes for their evaluations. In A. H. M. Levelt (Ed.), Proceedings of the 1995 international symposium on Symbolic and algebraic computation  - ISSAC '95. https://doi.org/10.1145/220346.220375

Dı́az A., Hitz, M., Kaltofen, E., Lobo, A., & Valente, T. (1995). Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. Journal of Symbolic Computation, 19(1-3), 269–282. https://doi.org/10.1006/jsco.1995.1015

Chan, K. C., Díaz, A., & Kaltofen, E. (1994). A Distributed Approach to Problem Solving in Maple. In Maple V: Mathematics and its Applications (pp. 13–21). https://doi.org/10.1007/978-1-4612-0263-9_2

Kaltofen, E. (1994). Asymptotically fast solution of Toeplitz-like singular linear systems. Proceedings of the international symposium on Symbolic and algebraic computation  - ISSAC '94. Presented at the the international symposium. https://doi.org/10.1145/190347.190431

Kaltofen, E., & Lobo, A. (1994). Factoring high-degree polynomials by the black box Berlekamp algorithm. Proceedings of the international symposium on Symbolic and algebraic computation  - ISSAC '94. Presented at the the international symposium. https://doi.org/10.1145/190347.190371

Kaltofen, E., & Pan, V. (1994). Parallel solution of Toeplitz and Toeplitz-like linear systems over fields of small positive characteristic. In H. Hong (Ed.), Proceedings of the First International Symposium of Parallel Symbolic Computation (pp. 225–233). Singapore: World Scientific Publishing Co.

Kaltofen, E. (1993). Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (pp. 195–212). https://doi.org/10.1007/3-540-56686-4_44

Kaltofen, E. (1993). Computational differentiation and algebraic complexity theory. In C. H. Bischof, A. Griewank, & P. M. Khademi (Eds.), Workshop Report on First Theory Institute on Computational Differentiation (Technical Report No. ANL/MCS-TM-183; pp. 28–30). Argonne, Illinois: Argonne National Laboratory.

Kaltofen, E. (1993). Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor. ACM SIGSAM Bulletin, 27(4), 2. https://doi.org/10.1145/182125.182126

Kaltofen, E. (1993). Dynamic parallel evaluation of computation DAGs. In J. Reif (Ed.), Synthesis of Parallel Algorithms (pp. 723–758). San Mateo, California: Morgan Kaufmann Publishers.

Diaz, A., Hitz, M., Kaltofen, E., Lobo, A., & Valente, T. (1993). Process scheduling in DSC and the large sparse linear systems challenge. Design and Implementation of Symbolic Computation Systems (DISCO 1993), 66–80. https://doi.org/10.1007/bfb0013169

Kaltofen, E. (1992). Efficient solution of sparse linear systems [Lecture Notes]. Troy, New York: Rensselaer Polytechnic Institute, Department of Computer Science.

Kaltofen, E. (1992). On computing determinants of matrices without divisions. Papers from the international symposium on Symbolic and algebraic computation  - ISSAC '92. Presented at the Papers from the international symposium. https://doi.org/10.1145/143242.143350

Kaltofen, E. (1992). Polynomial factorization 1987–1991. In Lecture Notes in Computer Science: Vol. 583. LATIN '92 (pp. 294–313). https://doi.org/10.1007/bfb0023837

Kaltofen, E., & Pan, V. (1992). Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases. Proceedings., 33rd Annual Symposium on Foundations of Computer Science. Presented at the Proceedings., 33rd Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1992.267779

Diaz, A., Kaltofen, E., Schmitz, K., & Valente, T. (1991). DSC: a system for distributed symbolic computation. In S. M. Watt (Ed.), Proceedings of the 1991 international symposium on Symbolic and algebraic computation  - ISSAC '91 (pp. 323–332). https://doi.org/10.1145/120694.120772

Kaltofen, E. (1991). Effective Noether irreducibility forms and applications. Proceedings of the twenty-third annual ACM symposium on Theory of computing  - STOC '91. Presented at the the twenty-third annual ACM symposium. https://doi.org/10.1145/103418.103431

Kaltofen, E., & Yui, N. (1991). Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields by Integer Lattice Reduction. In D. V. Chudnovsky, G. V. Chudnovsky, H. Cohn, & M. B. Nathanson (Eds.), Number Theory (pp. 149–202). https://doi.org/10.1007/978-1-4757-4158-2_8

Cantor, D. G., & Kaltofen, E. (1991). On fast multiplication of polynomials over arbitrary algebras. Acta Informatica, 28(7), 693–701. https://doi.org/10.1007/bf01178683

Kaltofen, E., & Saunders, B. D. (1991). On wiedemann's method of solving sparse linear systems. In H. F. Mattson, T. Mora, & T. R. N. Rao (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (pp. 29–38). https://doi.org/10.1007/3-540-54522-0_93

Kaltofen, E., & Pan, V. (1991). Processor efficient parallel solution of linear systems over an abstract field. Proceedings of the third annual ACM symposium on Parallel algorithms and architectures  - SPAA '91. Presented at the the third annual ACM symposium. https://doi.org/10.1145/113379.113396

Kaltofen, E., & Singer, M. F. (1991). Size efficient parallel algebraic circuits for partial derivatives. In D. V. Shirkov, V. A. Rostovtsev, & V. P. Gerdt (Eds.), IV International Conference on Computer Algebra in Physical Research (pp. 133–145). Singapore: World Scientific Publishing Co.

Kaltofen, E. (Ed.). (1990). Algebraic Computational Complexity. Journal of Symbolic Computation, 9(3).

Rebne, D., & Kaltofen, E. (1990). Computer mathematics systems and a trilateral approach to human resource development in technical occupations. In N. Estes, J. Heene, & D. Leclercq (Eds.), Proceedings of the 7th International Conference on Technology and Education (Vol. 1, pp. 251–253). Edinburgh, United Kingdom: CEP Consultants Ltd.

Kaltofen, E. (1990). Computing the irreducible real factors and components of an algebraic curve. Applicable Algebra in Engineering, Communication and Computing, 1(2), 135–148. https://doi.org/10.1007/bf01810297

Kaltofen, E., & Trager, B. M. (1990). Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators. Journal of Symbolic Computation, 9(3), 301–320. https://doi.org/10.1016/s0747-7171(08)80015-6

Kaltofen, E., Lakshman, Y. N., & Wiley, J.-M. (1990). Modular rational sparse multivariate polynomial interpolation. Proceedings of the international symposium on Symbolic and algebraic computation  - ISSAC '90. Presented at the the international symposium. https://doi.org/10.1145/96877.96912

Kaltofen, E., Krishnamoorthy, M. S., & Saunders, B. D. (1990). Parallel algorithms for matrix normal forms. Linear Algebra and Its Applications, 136, 189–208. https://doi.org/10.1016/0024-3795(90)90028-b

Kaltofen, E. (1990). Polynomial factorization 1982-1986. In D. V. Chudnovsky & R. D. Jenks (Eds.), Computers in Mathematics, Lecture Notes in Pure and Applied Mathematics (Vol. 125, pp. 285–309). New York, NY: Marcel Dekker, Inc.

Kaltofen, E., Valente, T., & Yui, N. (1989). An improved Las Vegas primality test. Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation  - ISSAC '89. Presented at the the ACM-SIGSAM 1989 international symposium. https://doi.org/10.1145/74540.74545

Kaltofen, E., & Watt, S. M. (Eds.). (1989). Computers and Mathematics. https://doi.org/10.1007/978-1-4613-9647-5

Kaltofen, E., & Rolletschek, H. (1989). Computing greatest common divisors and factorizations in quadratic number fields. Mathematics of Computation, 53(188), 697–697. https://doi.org/10.1090/s0025-5718-1989-0982367-2

Kaltofen, E. (1989). Computing the irreducible real factors and components of an algebraicf curve. In K. Mehlhorn (Ed.), Proceedings of the fifth annual symposium on Computational geometry  - SCG '89 (pp. 79–87). https://doi.org/10.1145/73833.73842

Kaltofen, E. (1989). Factorization of polynomials given by straight-line programs. In S. Micali (Ed.), Randomness and Computation, Advances in Computing Research (Vol. 5, pp. 375–412). Greenwhich, Connecticut: JAI Press Inc.

Kaltofen, E., & Yagati, L. (1989). Improved sparse multivariate polynomial interpolation algorithms. In Symbolic and Algebraic Computation (pp. 467–474). https://doi.org/10.1007/3-540-51084-2_44

Kaltofen, E., Krishnamoorthy, M. S., & Saunders, B. D. (1989). Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices. In Lecture Notes in Computer Science (pp. 317–322). https://doi.org/10.1007/3-540-51517-8_134

Kaltofen, E. (1989, July). Parallel algebraic algorithm design. Presented at the 1989 International Symposium on Symbolic and Algebraic Computation, Portland, Oregon.

Canny, J. F., Kaltofen, E., & Yagati, L. (1989). Solving systems of nonlinear polynomial equations faster. Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation  - ISSAC '89. Presented at the the ACM-SIGSAM 1989 international symposium. https://doi.org/10.1145/74540.74556

Gregory, B., & Kaltofen, E. (1988). Analysis of the binary complexity of asymptotically fast algorithms for linear system solving. ACM SIGSAM Bulletin, 22(2), 41–49. https://doi.org/10.1145/43876.43880

Kaltofen, E., & Trager, B. (1988). Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators. [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. Presented at the [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1988.21946

Freeman, T. S., Imirzian, G. M., Kaltofen, E., & Yagati, L. (1988). Dagwood: a system for manipulating polynomials given by straight-line programs. ACM Transactions on Mathematical Software, 14(3), 218–240. https://doi.org/10.1145/44128.214376

Miller, G. L., Ramachandran, V., & Kaltofen, E. (1988). Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. SIAM Journal on Computing, 17(4), 687–695. https://doi.org/10.1137/0217044

Kaltofen, E. (1988). Greatest common divisors of polynomials given by straight-line programs. Journal of the ACM, 35(1), 231–264. https://doi.org/10.1145/42267.45069

Kaltofen, E. (1987). Computer Algebra Algorithms. Annual Review of Computer Science, 2(1), 91–118. https://doi.org/10.1146/annurev.cs.02.060187.000515

Kaltofen, E. (1987). Deterministic irreducibility testing of polynomials over large finite fields. Journal of Symbolic Computation, 4(1), 77–82. https://doi.org/10.1016/s0747-7171(87)80055-x

Kaltofen, E., Krishnamoorthy, M. S., & Saunders, B. D. (1987). Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices. SIAM Journal on Algebraic Discrete Methods, 8(4), 683–690. https://doi.org/10.1137/0608057

Cantor, D. G., & Kaltofen, E. (1987). Fast multiplication of polynomials over arbitrary rings (Technical Report No. 87-35). Troy, NY: Rensselaer Polytechnic Institute, Department of Computer Science.

Kaltofen, E. (1987). Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials. Proceedings of the nineteenth annual ACM conference on Theory of computing  - STOC '87. Presented at the the nineteenth annual ACM conference. https://doi.org/10.1145/28395.28443

Freeman, T., Imirzian, G., & Kaltofen, E. (1986). A system for manipulating polynomials given by straight-line programs. Proceedings of the fifth ACM symposium on Symbolic and algebraic computation  - SYMSAC '86. Presented at the the fifth ACM symposium. https://doi.org/10.1145/32439.32473

Miller, G. L., Ramachandran, V., & Kaltofen, E. (1986). Efficient parallel evaluation of straight-line code and arithmetic circuits. In VLSI Algorithms and Architectures (pp. 236–245). https://doi.org/10.1007/3-540-16766-8_21

Kaltofen, E., Krishnamoorthy, M., & Saunders, B. D. (1986). Fast parallel algorithms for similarity of matrices. Proceedings of the fifth ACM symposium on Symbolic and algebraic computation  - SYMSAC '86. Presented at the the fifth ACM symposium. https://doi.org/10.1145/32439.32452

Kaltofen, E. (1986). Uniform closure properties of P-computable functions. Proceedings of the eighteenth annual ACM symposium on Theory of computing  - STOC '86. Presented at the the eighteenth annual ACM symposium. https://doi.org/10.1145/12130.12163

Kaltofen, E. (1985). Computing with polynomials given by straight-line programs I: greatest common divisors. Proceedings of the seventeenth annual ACM symposium on Theory of computing  - STOC '85. Presented at the the seventeenth annual ACM symposium. https://doi.org/10.1145/22145.22160

Kaltofen, E. (1985). Computing with polynomials given by straight-line programs II sparse factorization. 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). Presented at the 26th Annual Symposium on Foundations of Computer Science (sfcs 1985). https://doi.org/10.1109/sfcs.1985.17

Kaltofen, E. (1985). Effective Hilbert irreducibility. Information and Control, 66(3), 123–137. https://doi.org/10.1016/s0019-9958(85)80056-5

von zur Gathen, J., & Kaltofen, E. (1985). Factoring sparse multivariate polynomials. Journal of Computer and System Sciences, 31(2), 265–287. https://doi.org/10.1016/0022-0000(85)90044-3

von zur Gathen, J., & Kaltofen, E. (1985). Factorization of multivariate polynomials over finite fields. Mathematics of Computation, 45(171), 251–251. https://doi.org/10.1090/s0025-5718-1985-0790658-x

Kaltofen, E. (1985). Fast parallel absolute irreducibility testing. Journal of Symbolic Computation, 1(1), 57–67. https://doi.org/10.1016/s0747-7171(85)80029-8

Kaltofen, E. (1985). Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization. SIAM Journal on Computing, 14(2), 469–489. https://doi.org/10.1137/0214035

Kaltofen, E. (1985). Sparse hensel lifting. In EUROCAL '85 (pp. 4–17). https://doi.org/10.1007/3-540-15984-3_230

Kaltofen, E., & Pan, V. (1985). The integer manipulation techniques can compete with the linear algebra methods for solving sparse linear systems (Technical Report No. 85-6). State University of New York at Albany, Computer Science Department.

Kaltofen, E. (1984). A note on the Risch differential equation. In J. Fitch (Ed.), EUROSAM 84 (pp. 359–366). https://doi.org/10.1007/bfb0032858

Kaltofen, E. (1984). Effective Hilbert irreducibility. In EUROSAM 84 (pp. 277–284). https://doi.org/10.1007/bfb0032850

Kaltofen, E. (1984). On a theorem by R. Dedekind. In H. W. Lenstra Jr., J. K. Lenstra, & P. van Emde Boas (Eds.), DOPO LE PAROLE, Album in Honor of A. K. Lenstra's Doctorate. Amsterdam.

Kaltofen, E. (1984). The algebraic theory of integration [Lecture Notes]. Troy, New York: Rensselaer Polytechnic Institute, Department of Computer Science.

Kaltofen, E., & Yui, N. (1984). The modular equation of order 11. Third Macsyma Users' Conference, 472–485. General Electric.

Kaltofen, E., Musser, D. R., & Saunders, B. D. (1983). A Generalized Class of Polynomials that are Hard to Factor. SIAM Journal on Computing, 12(3), 473–483. https://doi.org/10.1137/0212031

Kaltofen, E. (1983). On the complexity of finding short vectors in integer lattices. In Lecture Notes in Computer Science (pp. 236–244). https://doi.org/10.1007/3-540-12868-9_107

von zur Gathen, J., & Kaltofen, E. (1983). Polynomial-time factorization of multivariate polynomials over finite fields. In Lecture Notes in Computer Science: Vol. 154. Automata, Languages and Programming (pp. 250–263). https://doi.org/10.1007/bfb0036913

Kaltofen, E. (1982). A polynomial reduction from multivariate to bivariate integral polynomial factorization. Proceedings of the fourteenth annual ACM symposium on Theory of computing  - STOC '82. Presented at the the fourteenth annual ACM symposium. https://doi.org/10.1145/800070.802200

Kaltofen, E. (1982). A polynomial-time reduction from bivariate to univariate integral polynomial factorization. 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982). Presented at the 23rd Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1982.56

Kaltofen, E. (1982). Factorization of Polynomials. In B. Buchberger, G. E. Collins, & R. Loos (Eds.), Computing Supplementum (pp. 95–113). https://doi.org/10.1007/978-3-7091-3406-1_8

Kaltofen, E. (1982). On the complexity of factoring polynomials with integer coefficients (PhD thesis). Rensselaer Polytechnic Institute, Troy, NY.

Kaltofen, E., Musser, D. R., & Saunders, B. D. (1981). A generalized class of polynomials that are hard to factor. Proceedings of the fourth ACM symposium on Symbolic and algebraic computation  - SYMSAC '81. Presented at the the fourth ACM symposium. https://doi.org/10.1145/800206.806394

Kaltofen, E., & Abdali, S. K. (1981). An attributed LL(1) compilation of Pascal into the lambda-calculus (Technical Report No. CS-8103). Troy, NY: Rensselaer Polytechnic Institute Mathematical Sciences Department.

Kaltofen, E. (1980). LISP/370 under the Michigan Terminal System. Troy, NY: Rensselaer Polytechnic Institute, Mathematical Sciences Department.