Works (179)

Updated: September 12th, 2023 05:02

2022 article

Sparse Polynomial Hermite Interpolation

PROCEEDINGS OF THE 2022 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, ISSAC 2022, pp. 469โ€“478.

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: model fitting; gradient data; measurement minimization
Source: Web Of Science
Added: September 11, 2023

2022 article

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.

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: cloud computing; primality testing; proof-of-work certificate
Source: Web Of Science
Added: September 11, 2023

2021 article

Foreword

JOURNAL OF SYMBOLIC COMPUTATION, Vol. 105, pp. 1โ€“3.

By: E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Web Of Science
Added: February 15, 2021

2021 journal article

On computing the degree of a Chebyshev Polynomial from its value

JOURNAL OF SYMBOLIC COMPUTATION, 104, 159โ€“167.

By: E. Imamogluโ€‰* & E. Kaltofen n

co-author countries: Tรผrkiye ๐Ÿ‡น๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: Algorithms; Discrete logarithms; Chebyshev Polynomials; Interpolation in terms of the Chebyshev; Polynomials of the First Kind
Source: Web Of Science
Added: January 19, 2021

2021 journal article

Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding

IEEE TRANSACTIONS ON INFORMATION THEORY, 67(1), 232โ€“243.

By: E. Kaltofen n & Z. Yangโ€‰ n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: Sparse polynomial interpolation; error correction; black box polynomial; list-decoding
Source: Web Of Science
Added: January 19, 2021

2020 journal article

A Note on Sparse Polynomial Interpolation in Dickson Polynomial Basis

ACM COMMUNICATIONS IN COMPUTER ALGEBRA, 54(4), 125โ€“128.

By: E. Imamogluโ€‰* & E. Kaltofen n

co-author countries: Tรผrkiye ๐Ÿ‡น๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Web Of Science
Added: June 10, 2021

2019 journal article

Computing Approximate Greatest Common Right Divisors of Differential Polynomials

Foundations of Computational Mathematics.

By: M. Giesbrecht*, J. Haraldson* & E. Kaltofen n

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: Symbolic-numeric computation; Approximate polynomial computation; Approximate GCD; Differential polynomials; Linear differential operators
Source: Crossref
Added: July 21, 2019

2019 article

Elimination-based certificates for triangular equivalence and rank profiles

JOURNAL OF SYMBOLIC COMPUTATION, Vol. 98, pp. 246โ€“269.

By: J. Dumas, E. Kaltofen n, D. Lucas & C. Pernet

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: Interactive certificate; Rank profile; Linear algebra; Triangular equivalence; Verifiable computing
Source: Web Of Science
Added: December 30, 2019

2018 article

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.

By: E. Imamogluโ€‰ n, E. Kaltofen n & Z. Yang*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Web Of Science
Added: February 25, 2019

2017 conference paper

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.

By: E. Kaltofen n, C. Pernet*, A. Storjohann* & C. Waddell n

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ France ๐Ÿ‡ซ๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2017 ACM

Source: Crossref
Added: July 21, 2019

2017 conference paper

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.

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ France ๐Ÿ‡ซ๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2017 ACM

Source: Crossref
Added: July 21, 2019

2016 article

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.

co-author countries: France ๐Ÿ‡ซ๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Web Of Science
Added: August 6, 2018

2016 conference paper

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.

By: Z. Haoโ€‰*, E. Kaltofen n & L. Zhiโ€‰*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the ACM

author keywords: Hankel matrix; Vandermonde matrix; sparse polynomial interpolation; condition number; early termination; sparse signal processing
Source: Crossref
Added: July 21, 2019

2016 journal article

Sparse multivariate function recovery with a small number of evaluations

JOURNAL OF SYMBOLIC COMPUTATION, 75, 209โ€“218.

By: E. Kaltofen n & Z. Yangโ€‰*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: Error correcting coding; Fault tolerance; Cauchy interpolation; Multivariate rational function model
Source: Web Of Science
Added: August 6, 2018

2015 conference paper

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.

By: A. Arnold* & E. Kaltofen n

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2015 ACM

author keywords: sparse polynomial interpolation; Prony's algorithm; Chebyshev polynomials; Descartes' rule of signs; orthogonal basis; error-correcting code
Source: Crossref
Added: July 21, 2019

2015 book

PASCO '15 Proceedings of the 2015 International Workshop on Parallel Symbolic Computation

New York, NY: Association for Computing Machinery.

Ed(s): J. Dumas, E. Kaltofen & C. Pernet

Source: NC State University Libraries
Added: August 16, 2021

2014 conference paper

Cleaning-up data for sparse model synthesis

Proceedings of the 2014 Symposium on Symbolic-Numeric Computation - SNC '14. Presented at the the 2014 Symposium.

By: E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2014 Symposium

Source: Crossref
Added: July 21, 2019

2014 conference paper

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.

By: J. Dumasโ€‰* & E. Kaltofen n

co-author countries: France ๐Ÿ‡ซ๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 39th International Symposium

Source: Crossref
Added: July 21, 2019

2014 conference paper

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.

By: B. Boyer n & E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2014 Symposium

Source: Crossref
Added: July 21, 2019

2014 chapter

Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations

In Computer Mathematics (pp. 183โ€“197).

By: B. Boyer n, M. Comer n & E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: July 27, 2019

2014 conference paper

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.

By: E. Kaltofen n & Z. Yangโ€‰*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 39th International Symposium

Source: Crossref
Added: July 21, 2019

2014 conference paper

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.

By: E. Kaltofen n & C. Pernet*

co-author countries: France ๐Ÿ‡ซ๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 39th International Symposium

Source: Crossref
Added: July 21, 2019

2014 chapter

Symbolic Computation and Complexity Theory Transcript of My Talk

In Computer Mathematics (pp. 3โ€“7).

By: E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: July 27, 2019

2013 journal article

A fraction free Matrix Berlekamp/Massey algorithm

LINEAR ALGEBRA AND ITS APPLICATIONS, 439(9), 2515โ€“2526.

By: E. Kaltofen n & G. Yuhasz n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: Exact division; Linear recurrences; Matrix recurrences; Block Hankel systems; Block Toeplitz systems; Integer sequences
Source: Web Of Science
Added: August 6, 2018

2013 chapter

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.

By: E. Kaltofen & G. Lecerf

Ed(s): G. Mullen & D. Panario

Source: NC State University Libraries
Added: March 26, 2022

2013 journal article

On the Matrix Berlekamp-Massey Algorithm

ACM TRANSACTIONS ON ALGORITHMS, 9(4).

By: E. Kaltofen n & G. Yuhasz n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: Linear generated sequences; matrix polynomials; minimal generators; vector Berlekamp/Massey algorithm; multivariable linear control
Source: Web Of Science
Added: August 6, 2018

2013 conference paper

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.

By: E. Kaltofen n & Z. Yangโ€‰*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 38th international symposium

Source: Crossref
Added: July 27, 2019

2012 conference paper

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.

By: F. Guoโ€‰*, E. Kaltofen n & L. Zhiโ€‰*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 37th International Symposium

Source: Crossref
Added: July 27, 2019

2012 journal article

Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients

Journal of Symbolic Computation, 47(1), 1โ€“15.

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: Semidefinite programming; Sum-of-squares; Validated output; Hybrid method
Source: Crossref
Added: July 27, 2019

2012 journal article

On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field

JOURNAL OF SYMBOLIC COMPUTATION, 47(4), 480โ€“491.

By: M. Comer n & E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: Toeplitz matrix; Hankel matrix; Block matrix; Finite field; Singularity counts; Fixed entry; Berlekamp/Massey algorithm
Source: Web Of Science
Added: August 6, 2018

2012 conference paper

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.

By: M. Comer n, E. Kaltofen n & C. Pernet*

co-author countries: France ๐Ÿ‡ซ๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 37th International Symposium

Source: Crossref
Added: July 27, 2019

2012 article

Special Issue on Symbolic and Algebraic Computation Foundations, Algorithmics and Applications: ISSAC 2009

Johnson, J. R., Kaltofen, E., & Park, H. (2012, July). JOURNAL OF SYMBOLIC COMPUTATION, Vol. 47, pp. 751โ€“751.

By: J. Johnsonโ€‰*, E. Kaltofen n & H. Park*

co-author countries: Korea (Republic of) ๐Ÿ‡ฐ๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Web Of Science
Added: August 6, 2018

2011 conference paper

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.

By: E. Kaltofen n, W. Lee* & Z. Yangโ€‰*

co-author countries: Belgium ๐Ÿ‡ง๐Ÿ‡ช China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2011 International Workshop

Source: Crossref
Added: July 27, 2019

2011 conference paper

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.

By: E. Kaltofen n, M. Nehring n & B. Saunders*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 36th international symposium

Source: Crossref
Added: August 18, 2019

2011 conference paper

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.

By: E. Kaltofen n & M. Nehring n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 36th international symposium

Source: Crossref
Added: July 27, 2019

2011 other

Symmetric determinantal representation of formulas and weakly skew circuits

By: B. Grenet, E. Kaltofen*, P. Koiran & N. Portier

Source: Crossref
Added: July 27, 2019

2011 conference paper

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.

By: B. Grenet, E. Kaltofen, P. Koiran & N. Portier

Ed(s): C. Dรผrr & T. Schwentick

Event: Symposium on Theoretical Aspects of Computer Science (STACS 2011) at Dortmund, Germany

Source: NC State University Libraries
Added: March 26, 2022

2011 chapter

The โ€œSeven Dwarfsโ€ of Symbolic Computation

In Texts & Monographs in Symbolic Computation (pp. 95โ€“104).

By: E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: July 27, 2019

2010 conference paper

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.

By: S. Hutton n, E. Kaltofen n & L. Zhiโ€‰*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2010 International Symposium

Source: Crossref
Added: August 18, 2019

2010 journal article

Efficiently Certifying Non-Integer Powers

COMPUTATIONAL COMPLEXITY, 19(3), 355โ€“366.

By: E. Kaltofen n & M. Lavin n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: Integer roots; integer powers; linear-time algorithm; bit complexity; Chebotarev density theorem
Source: Web Of Science
Added: August 6, 2018

2010 conference paper

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.

By: E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 4th International Workshop

Source: Crossref
Added: August 18, 2019

2010 report

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.

By: E. Kaltofen

Source: NC State University Libraries
Added: March 26, 2022

2009 conference paper

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.

By: E. Kaltofen n, Z. Yangโ€‰* & L. Zhiโ€‰*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2009 conference

Source: Crossref
Added: August 18, 2019

2008 journal article

Approximate factorization of multivariate polynomials using singular value decomposition

JOURNAL OF SYMBOLIC COMPUTATION, 43(5), 359โ€“376.

By: E. Kaltofen n, J. May*, Z. Yang* & L. Zhiโ€‰*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: multivariate polynomial factorization; approximate factorization; singular value decomposition; numerical algebra; Gauss-Newton optimization
Source: Web Of Science
Added: August 6, 2018

2008 conference paper

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.

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the twenty-first international symposium

Source: Crossref
Added: August 18, 2019

2008 conference paper

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.

By: E. Kaltofen n & P. Koiran*

co-author countries: France ๐Ÿ‡ซ๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the twenty-first international symposium

Source: Crossref
Added: August 18, 2019

2007 journal article

Irreducible polynomials and barker sequences

ACM Communications in Computer Algebra, 41(4), 118.

By: P. Borwein*, E. Kaltofen n & M. Mossinghoffโ€‰*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 18, 2019

2007 conference paper

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.

By: E. Kaltofen, B. Li, K. Sivaramakrishnan, Z. Yang & L. Zhi

Ed(s): J. Verschelde & S. Watt

Event: International Workshop on Symbolic-Numeric Computation at London, Ontario, Canada on July 25-27, 2007

Source: NC State University Libraries
Added: March 26, 2022

2007 conference paper

On exact and approximate interpolation of sparse rational functions

ISSAC 2007: International Symposium for Symbolic and Algebraic Computation: Proceedings.

By: E. Kaltofen n & Z. Yang n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: NC State University Libraries
Added: August 6, 2018

2007 conference paper

On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms

International Workshop on Symbolic-Numeric Computation: Proceedings. New York: ACM Press.

By: E. Kaltofen, Z. Yang & L. Zhi

Source: NC State University Libraries
Added: August 6, 2018

2007 chapter

Structured Low Rank Approximation of a Sylvester Matrix

In Trends in Mathematics (pp. 69โ€“83).

By: E. Kaltofen n, Z. Yangโ€‰* & L. Zhiโ€‰*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: Sylvester matrix; approximate greatest common divisor; structured total least norm; hybrid symbolic/numeric algorithm
Source: Crossref
Added: August 18, 2019

2006 conference paper

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.

By: E. Kaltofen*, Z. Yangโ€‰* & L. Zhiโ€‰*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2006 international symposium

Source: Crossref
Added: August 18, 2019

2006 conference paper

Challenges in Symbolic Computation Software, number 06271

In Dagstuhl Seminar Proceedings. Germany: Schloss Dagstuhl.

Ed(s): W. Decker, M. Dewar, E. Kaltofen & S. Watt

Event: Internationales Begegnungs- und Forschungszentrum fรผr Informatik (IBFI) at Schloss Dagstuhl

Source: NC State University Libraries
Added: March 26, 2022

2006 conference paper

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.

By: E. Kaltofen* & P. Koiran*

co-author countries: France ๐Ÿ‡ซ๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2006 international symposium

Source: Crossref
Added: August 28, 2020

2006 conference paper

Hybrid symbolic-numeric computation

Proceedings of the 2006 international symposium on Symbolic and algebraic computation - ISSAC '06. Presented at the the 2006 international symposium.

By: E. Kaltofen* & L. Zhiโ€‰*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2006 international symposium

Source: Crossref
Added: August 28, 2020

2005 chapter

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).

By: E. Kaltofen* & N. Yui*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ

Ed(s): J. Fitch

Event: International Symposium on Symbolic and Algebraic Computation at Cambridge, England on July 9-11, 1984

Source: Crossref
Added: June 15, 2021

2005 conference paper

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.

By: E. Kaltofen n, D. Morozov* & G. Yuhasz n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2005 international symposium

Source: Crossref
Added: August 28, 2020

2005 journal article

On the complexity of computing determinants

COMPUTATIONAL COMPLEXITY, 13(3-4), 91โ€“130.

By: E. Kaltofen n & G. Villardโ€‰*

co-author countries: France ๐Ÿ‡ซ๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: integer matrix; matrix determinant; characteristic polynomial; Smith normal form; bit complexity; division-free complexity; randomized algorithm; multivariable control theory; realization; matrix sequence; block Wiedemann algorithm; block Lanczos algorithm
Source: Web Of Science
Added: August 6, 2018

2005 conference paper

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.

By: E. Kaltofen n & P. Koiran*

co-author countries: France ๐Ÿ‡ซ๐Ÿ‡ท United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2005 international symposium

Source: Crossref
Added: August 28, 2020

2004 conference paper

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.

By: S. Gaoโ€‰*, E. Kaltofen n, J. May n, Z. Yangโ€‰* & L. Zhiโ€‰*

co-author countries: China ๐Ÿ‡จ๐Ÿ‡ณ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2004 international symposium

Source: Crossref
Added: August 28, 2020

2004 article

Computing the sign or the value of the determinant of an integer matrix, a complexity survey

Kaltofen, E., & Villard, G. (2004, January 1). JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, Vol. 162, pp. 133โ€“146.

By: E. Kaltofen n & G. Villard

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: determinant; bit-complexity; integer matrix; approximate computation; exact computation; randomized algorithms
Source: Web Of Science
Added: August 6, 2018

2004 journal article

Deterministic distinct-degree factorization of polynomials over finite fields

JOURNAL OF SYMBOLIC COMPUTATION, 38(6), 1461โ€“1470.

By: S. Gaoโ€‰*, E. Kaltofen n & A. Lauder*

co-author countries: United Kingdom of Great Britain and Northern Ireland ๐Ÿ‡ฌ๐Ÿ‡ง United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: multivariate polynomial; deterministic algorithm; distinct-degree factorization
Source: Web Of Science
Added: August 6, 2018

2004 journal article

Early termination in Shoup's algorithm for the minimum polynomial of an algebraic

By: W. Eberly & E. Kaltofen

Source: NC State University Libraries
Added: March 26, 2022

2003 chapter

Absolute factorization of polynomials

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

By: E. Kaltofen

Ed(s): J. Grabmeier, E. Kaltofen & V. Weispfenning

Source: NC State University Libraries
Added: December 5, 2020

2003 article

Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases

JOURNAL OF SYMBOLIC COMPUTATION, Vol. 36, pp. 401โ€“424.

By: M. Giesbrecht*, E. Kaltofen n & W. Lee*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: sparse shifts; early termination; sparse polynomial; sparse interpolation; Chebyshev basis; Pochhammer basis
Source: Web Of Science
Added: August 6, 2018

2003 book

Computer Algebra Handbook

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

By: J. Grabmeier & V. Weispfenning

Ed(s): J. Grabmeier, E. Kaltofen & V. Weispfenning

Source: NC State University Libraries
Added: March 26, 2022

2003 chapter

Computer algebra - impact on research

In J. Grabmeier, E. Kaltofen, & V. Weispfenning (Eds.), Computer Algebraย Handbook (pp. 4โ€“6). Heidelberg, Germany: Springer Verlag.

By: E. Kaltofen & V. Weispfenning

Ed(s): J. Grabmeier, E. Kaltofen & V. Weispfenning

Source: NC State University Libraries
Added: December 5, 2020

2003 book

Computer algebra handbook foundations, applications, systems

Source: NC State University Libraries
Added: August 6, 2018

2003 article

Early termination in sparse interpolation algorithms

JOURNAL OF SYMBOLIC COMPUTATION, Vol. 36, pp. 365โ€“400.

By: E. Kaltofen n & E. Lee*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: early termination; sparse polynomial; black box polynomial; interpolation; sparse interpolation; randomized algorithm
Source: Web Of Science
Added: August 6, 2018

2003 chapter

FoxBox and other blackbox systems

In J. Grabmeier, E. Kaltofen, & V. Weispfenning (Eds.), Computer Algebra Handbook (pp. 383โ€“385). Heidelberg, Germany: Springer Verlag.

By: E. Kaltofen

Ed(s): J. Grabmeier, E. Kaltofen & V. Weispfenning

Source: NC State University Libraries
Added: December 5, 2020

2003 chapter

Hybrid methods

In J. Grabmeier, E. Kaltofen, & V. Weispfenning (Eds.), Computer Algebra Handbook (pp. 112โ€“125). Heidelberg, Germany: Springer Verlag.

By: M. Corless, E. Kaltofen & S. Watt

Ed(s): J. Grabmeier, E. Kaltofen & V. Weispfenning

Source: NC State University Libraries
Added: December 5, 2020

2003 chapter

Linear systems

In J. Grabmeier, E. Kaltofen, & V. Weispfenning (Eds.), Computer algebra handbook: foundations, applications, systems (pp. 36โ€“38). Heidelberg, Germany: Springer Verlag.

By: E. Kaltofen & B. Saunders

Ed(s): J. Grabmeier, E. Kaltofen & V. Weispfenning

Source: NC State University Libraries
Added: December 5, 2020

2003 conference paper

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.

By: E. Kaltofen n & J. May n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2003 international symposium

Source: Crossref
Added: August 28, 2020

2003 conference paper

Polynomial factorization

Proceedings of the 2003 international symposium on Symbolic and algebraic computation - ISSAC '03. Presented at the the 2003 international symposium.

By: E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2003 international symposium

Source: Crossref
Added: August 28, 2020

2002 conference paper

'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.

By: E. Kaltofen, M. McLean & L. Norris

Source: NC State University Libraries
Added: March 26, 2022

2002 conference paper

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.

By: M. Giesbrecht*, E. Kaltofen n & W. Lee*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: ISSAC 02: International symposium on symbolic and algebraic computation at Lille, France

Source: Crossref
Added: May 18, 2021

2002 conference paper

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.

By: E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2002 international symposium

Source: Crossref
Added: August 28, 2020

2002 journal article

Efficient matrix preconditioners for black box linear algebra

LINEAR ALGEBRA AND ITS APPLICATIONS, 343, 119โ€“146.

By: L. Chen, W. Eberly, E. Kaltofen*, B. Saunders, W. Turner & G. Villard

author keywords: black box matrix; sparse matrix; structured matrix; Toeplitz-like matrix; matrix preconditioner; exact arithmetic; finite field; symbolic computation; linear system solution; minimal polynomial; characteristic polynomial; rank; determinant; Wiedemann algorithm; randomized algorithm; butterfly network
Source: Web Of Science
Added: August 6, 2018

2002 conference paper

LINBOX: A GENERIC LIBRARY FOR EXACT LINEAR ALGEBRA

Mathematical Software. Presented at the Proceedings of the First International Congress of Mathematical Software.

By: J. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen, E. Kaltofen*, B. Saunders, W. Turner, G. Villard

Event: Proceedings of the First International Congress of Mathematical Software

Source: Crossref
Added: August 28, 2020

2001 conference paper

Algorithms for sparse and black box matrices over finite fields

Kaltofen, E. (2001, May 23). Presented at the International Conference on Finite Fields and Applications, Oaxaca, Mexico.

By: E. Kaltofen

Event: International Conference on Finite Fields and Applications at Oaxaca, Mexico

Source: NC State University Libraries
Added: March 26, 2022

2000 review

Challenges of symbolic computation: My favorite open problems

[Review of ]. JOURNAL OF SYMBOLIC COMPUTATION, 29(6), 891โ€“919.

By: E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Web Of Science
Added: August 6, 2018

2000 conference paper

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.

By: E. Kaltofen n, W. Lee n & A. Lobo*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 2000 international symposium

Source: Crossref
Added: August 28, 2020

1999 journal article

Distributed matrix-free solution of large sparse linear systems over finite fields

ALGORITHMICA, 24(3-4), 331โ€“348.

By: E. Kaltofen n & A. Lobo*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: distributed symbolic computation; sparse linear systems; block Wiedemann; outer loop parallelization
Source: Web Of Science
Added: August 6, 2018

1999 journal article

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.

Ed(s): H. Hongโ€‰ n, E. Kaltofen n & M. Singer n

Event: East Coast Computer Algebra Day on April 24, 1999

Source: NC State University Libraries
Added: March 26, 2022

1999 conference paper

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.

By: M. Hitz*, E. Kaltofen n & Y. Lakshman*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 1999 international symposium

Source: Crossref
Added: August 28, 2020

1999 conference paper

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.

By: E. Kaltofen n & M. Monaganโ€‰*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 1999 international symposium

Source: Crossref
Added: August 28, 2020

1999 conference paper

Symbolic computation in Java

Proceedings of the 1999 international symposium on Symbolic and algebraic computation - ISSAC '99. Presented at the the 1999 international symposium.

By: L. Bernardin*, B. Charโ€‰* & E. Kaltofen n

co-author countries: Switzerland ๐Ÿ‡จ๐Ÿ‡ญ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 1999 international symposium

Source: Crossref
Added: August 28, 2020

1998 chapter

Algebraic Algorithms

In Algorithms and Theory of Computation Handbook.

By: A. Dรญaz, I. Emiris, E. Kaltofen* & V. Pan

Source: Crossref
Added: January 21, 2021

1998 conference paper

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.

By: M. Hitz* & E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 1998 international symposium

Source: Crossref
Added: August 28, 2020

1998 conference paper

FOXBOX

Proceedings of the 1998 international symposium on Symbolic and algebraic computation - ISSAC '98. Presented at the the 1998 international symposium.

By: A. Dรญaz* & E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 1998 international symposium

Source: Crossref
Added: August 28, 2020

1998 journal article

Subquadratic-time factoring of polynomials over finite fields

MATHEMATICS OF COMPUTATION, 67(223), 1179โ€“1197.

By: E. Kaltofen n & V. Shoup*

co-author countries: Switzerland ๐Ÿ‡จ๐Ÿ‡ญ United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: factoring; polynomials; finite fields; randomized algorithms; normal bases
Source: Web Of Science
Added: August 6, 2018

1997 chapter

Algebraic algorithms

In A. B. Tucker (Ed.), The computer science and engineering handbook (pp. 226โ€“248). Boca Raton, Florida: CRC Press.

By: A. Dรญaz, E. Kaltofen & V. Pan

Ed(s): A. Tucker

Source: NC State University Libraries
Added: March 26, 2022

1997 conference paper

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.

By: E. Kaltofen* & V. Shoup

Event: the 1997 international symposium

Source: Crossref
Added: August 28, 2020

1997 conference paper

On randomized Lanczos algorithms

Proceedings of the 1997 international symposium on Symbolic and algebraic computation - ISSAC '97. Presented at the the 1997 international symposium.

By: W. Eberly* & E. Kaltofen n

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 1997 international symposium

Source: Crossref
Added: August 28, 2020

1997 book

PASCO '97: Proceedings of the second international symposium on Parallel symbolic computation

Ed(s): H. Hong, E. Kaltofen & M. Hitz

Event: PASCO97: International Symposium on Parallel Symbolic Computation at Maui, Hawaii on July 20-22, 1997

Source: Crossref
Added: June 15, 2021

1997 journal article

Teaching computational abstract algebra

JOURNAL OF SYMBOLIC COMPUTATION, 23(5-6), 503โ€“515.

By: E. Kaltofen n

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Web Of Science
Added: August 6, 2018

1996 conference paper

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.

By: E. Kaltofen

Ed(s): C. Roucairol

Source: NC State University Libraries
Added: March 26, 2022

1996 conference paper

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.

By: รš. Erlingsson*, E. Kaltofen n & D. Musser*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 1996 international symposium

Source: Crossref
Added: August 28, 2020

1996 conference paper

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.

By: E. Kaltofen n & A. Lobo*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the 1996 international symposium

Source: Crossref
Added: August 28, 2020

1996 chapter

Prediction Based Task Scheduling in Distributed Computing

In Languages, Compilers and Run-Time Systems for Scalable Computers (pp. 317โ€“320).

By: M. Samadani & E. Kaltofen*

Source: Crossref
Added: August 28, 2020

1995 journal article

Analysis of Coppersmithโ€™s block Wiedemann algorithm for the parallel solution of sparse linear systems

Mathematics of Computation, 64(210), 777โ€“777.

By: E. Kaltofen*

Source: Crossref
Added: August 28, 2020

1995 journal article

Effective Noether Irreducibility Forms and Applications

Journal of Computer and System Sciences, 50(2), 274โ€“295.

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1995 journal article

Integer division in residue number systems

IEEE Transactions on Computers, 44(8), 983โ€“989.

By: M. Hitz* & E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
author keywords: INTEGER DIVISION; RECIPROCAL; NEWTON ITERATION; EXTENDED RESIDUE NUMBER SYSTEM; MIXED RADIX CONVERSION; BASE EXTENSION
Source: Crossref
Added: August 28, 2020

1995 conference paper

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.

By: A. Dรญaz* & E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Ed(s): A. Levelt

Event: ISSAC95: International Symposium on Symbolic and Algebraic Computation at Montreal Quebec Canada on July 10-12, 1995

Source: Crossref
Added: June 15, 2021

1995 journal article

Process Scheduling in DSC and the Large Sparse Linear Systems Challenge

Journal of Symbolic Computation, 19(1-3), 269โ€“282.

By: A. Dฤฑฬaz*, M. Hitz*, E. Kaltofen*, A. Lobo* & T. Valenteโ€‰*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1994 chapter

A Distributed Approach to Problem Solving in Maple

In Maple V: Mathematics and its Applications (pp. 13โ€“21).

By: K. Chan*, A. Dรญaz* & E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1994 conference paper

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.

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the international symposium

Source: Crossref
Added: August 28, 2020

1994 conference paper

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.

By: E. Kaltofen* & A. Lobo*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the international symposium

Source: Crossref
Added: August 28, 2020

1994 conference paper

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.

By: E. Kaltofen & V. Pan

Ed(s): H. Hong

Source: NC State University Libraries
Added: March 26, 2022

1993 chapter

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).

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1993 report

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.

By: E. Kaltofen

Ed(s): C. Bischof, A. Griewank & P. Khademi

Source: NC State University Libraries
Added: March 26, 2022

1993 journal article

Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor

ACM SIGSAM Bulletin, 27(4), 2.

By: E. Kaltofen*

Source: Crossref
Added: August 28, 2020

1993 chapter

Dynamic parallel evaluation of computation DAGs

In J. Reif (Ed.), Synthesis of Parallel Algorithms (pp. 723โ€“758). San Mateo, California: Morgan Kaufmann Publishers.

By: E. Kaltofen

Ed(s): J. Reif

Source: NC State University Libraries
Added: March 26, 2022

1993 conference paper

Process scheduling in DSC and the large sparse linear systems challenge

Design and Implementation of Symbolic Computation Systems (DISCO 1993), 66โ€“80.

By: A. Diaz*, M. Hitz*, E. Kaltofen*, A. Lobo* & T. Valenteโ€‰*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: Design and Implementation of Symbolic Computation Systems International Symposium, DISCO '93 at Gmunden, Austria on September 15-17, 1993

Source: Crossref
Added: June 15, 2021

1992 report

Efficient solution of sparse linear systems

[Lecture Notes]. Troy, New York: Rensselaer Polytechnic Institute, Department of Computer Science.

By: E. Kaltofen

Source: NC State University Libraries
Added: March 26, 2022

1992 conference paper

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.

By: E. Kaltofen*

Event: Papers from the international symposium

Source: Crossref
Added: August 28, 2020

1992 chapter

Polynomial factorization 1987โ€“1991

In Lecture Notes in Computer Science: Vol. 583. LATIN '92 (pp. 294โ€“313).

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: 1st Latin American Symposium on Theoretical Informatics at Sรฃo Paulo, Brazil on April 6-10, 1992

Source: Crossref
Added: June 15, 2021

1992 conference paper

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.

By: E. Kaltofen* & V. Pan

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: Proceedings., 33rd Annual Symposium on Foundations of Computer Science

Source: Crossref
Added: August 28, 2020

1991 conference paper

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).

By: A. Diaz*, E. Kaltofen*, K. Schmitzโ€‰* & T. Valenteโ€‰*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Ed(s): S. Watt

Event: ISSAC 91: International Symposium on Symbolic Algebraic Computation at Bonn, West Germany on July 15-17, 1991

Source: Crossref
Added: June 15, 2021

1991 conference paper

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.

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the twenty-third annual ACM symposium

Source: Crossref
Added: August 28, 2020

1991 chapter

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).

By: E. Kaltofen* & N. Yui*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Ed(s): D. Chudnovsky, G. Chudnovsky, H. Cohn & M. Nathanson

Source: Crossref
Added: June 15, 2021

1991 journal article

On fast multiplication of polynomials over arbitrary algebras

Acta Informatica, 28(7), 693โ€“701.

By: D. Cantor* & E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1991 chapter

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).

By: E. Kaltofen* & B. Saunders*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Ed(s): H. Mattson, T. Mora & T. Rao

Event: 9th International Symposium, AAECC-9 at New Orleans, LA on October 7-11, 1991

Source: Crossref
Added: June 15, 2021

1991 conference paper

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.

By: E. Kaltofen* & V. Pan*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the third annual ACM symposium

Source: Crossref
Added: August 28, 2020

1991 conference paper

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.

By: E. Kaltofen & M. Singer

Ed(s): D. Shirkov, V. Rostovtsev & V. Gerdt

Source: NC State University Libraries
Added: March 26, 2022

1990 journal article

Algebraic Computational Complexity

Journal of Symbolic Computation, 9(3).

Ed(s): E. Kaltofen

Source: NC State University Libraries
Added: March 26, 2022

1990 conference paper

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.

By: D. Rebne & E. Kaltofen

Ed(s): N. Estes, J. Heene & D. Leclercq

Source: NC State University Libraries
Added: March 26, 2022

1990 journal article

Computing the irreducible real factors and components of an algebraic curve

Applicable Algebra in Engineering, Communication and Computing, 1(2), 135โ€“148.

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1990 journal article

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.

By: E. Kaltofen* & B. Trager*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: January 24, 2021

1990 conference paper

Modular rational sparse multivariate polynomial interpolation

Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '90. Presented at the the international symposium.

By: E. Kaltofen*, Y. Lakshman* & J. Wiley*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the international symposium

Source: Crossref
Added: August 28, 2020

1990 journal article

Parallel algorithms for matrix normal forms

Linear Algebra and Its Applications, 136, 189โ€“208.

By: E. Kaltofen*, M. Krishnamoorthyโ€‰* & B. Saunders*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: June 15, 2021

1990 chapter

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.

By: E. Kaltofen

Ed(s): D. Chudnovsky & R. Jenks

Source: NC State University Libraries
Added: March 26, 2022

1989 conference paper

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.

By: E. Kaltofen*, T. Valenteโ€‰* & N. Yui*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the ACM-SIGSAM 1989 international symposium

Source: Crossref
Added: August 28, 2020

1989 book

Computers and Mathematics

Ed(s): E. Kaltofen* & S. Watt

Source: Crossref
Added: June 15, 2021

1989 journal article

Computing greatest common divisors and factorizations in quadratic number fields

Mathematics of Computation, 53(188), 697โ€“697.

By: E. Kaltofen* & H. Rolletschek

Source: Crossref
Added: August 28, 2020

1989 conference paper

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).

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Ed(s): K. Mehlhorn

Event: Fifth annual symposium on Computational geometry

Source: Crossref
Added: June 15, 2021

1989 chapter

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.

By: E. Kaltofen

Ed(s): S. Micali

Source: NC State University Libraries
Added: March 26, 2022

1989 chapter

Improved sparse multivariate polynomial interpolation algorithms

In Symbolic and Algebraic Computation (pp. 467โ€“474).

By: E. Kaltofen* & L. Yagati

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: International Symposium ISSAC '88 at Rome, Italy on July 4-8, 1988

Source: Crossref
Added: June 15, 2021

1989 chapter

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).

By: E. Kaltofen*, M. Krishnamoorthyโ€‰* & B. Saunders*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1989 conference paper

Parallel algebraic algorithm design

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

By: E. Kaltofen

Event: 1989 International Symposium on Symbolic and Algebraic Computation at Portland, Oregon

Source: NC State University Libraries
Added: March 26, 2022

1989 conference paper

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.

By: J. Cannyโ€‰*, E. Kaltofen* & L. Yagati*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the ACM-SIGSAM 1989 international symposium

Source: Crossref
Added: January 24, 2021

1988 journal article

Analysis of the binary complexity of asymptotically fast algorithms for linear system solving

ACM SIGSAM Bulletin, 22(2), 41โ€“49.

By: B. Gregory* & E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1988 conference paper

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.

By: E. Kaltofen* & B. Trager*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science

Source: Crossref
Added: August 28, 2020

1988 journal article

Dagwood: a system for manipulating polynomials given by straight-line programs

ACM Transactions on Mathematical Software, 14(3), 218โ€“240.

By: T. Freeman*, G. Imirzian*, E. Kaltofen* & L. Yagati*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1988 journal article

Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits

SIAM Journal on Computing, 17(4), 687โ€“695.

By: G. Miller, V. Ramachandran & E. Kaltofen*

Source: Crossref
Added: August 28, 2020

1988 journal article

Greatest common divisors of polynomials given by straight-line programs

Journal of the ACM, 35(1), 231โ€“264.

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1987 journal article

Computer Algebra Algorithms

Annual Review of Computer Science, 2(1), 91โ€“118.

By: E. Kaltofen*

Source: Crossref
Added: August 28, 2020

1987 journal article

Deterministic irreducibility testing of polynomials over large finite fields

Journal of Symbolic Computation, 4(1), 77โ€“82.

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1987 journal article

Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices

SIAM Journal on Algebraic Discrete Methods, 8(4), 683โ€“690.

By: E. Kaltofen*, M. Krishnamoorthy & B. Saunders

Source: Crossref
Added: August 28, 2020

1987 report

Fast multiplication of polynomials over arbitrary rings

(Technical Report No. 87-35). Troy, NY: Rensselaer Polytechnic Institute, Department of Computer Science.

By: D. Cantor & E. Kaltofen

Source: NC State University Libraries
Added: March 26, 2022

1987 conference paper

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.

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the nineteenth annual ACM conference

Source: Crossref
Added: August 28, 2020

1986 conference paper

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.

By: T. Freeman*, G. Imirzian* & E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the fifth ACM symposium

Source: Crossref
Added: August 28, 2020

1986 chapter

Efficient parallel evaluation of straight-line code and arithmetic circuits

In VLSI Algorithms and Architectures (pp. 236โ€“245).

By: G. Millerโ€‰*, V. Ramachandran* & E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1986 conference paper

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.

By: E. Kaltofen*, M. Krishnamoorthyโ€‰* & B. Saunders*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the fifth ACM symposium

Source: Crossref
Added: August 28, 2020

1986 conference paper

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.

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the eighteenth annual ACM symposium

Source: Crossref
Added: August 28, 2020

1985 conference paper

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.

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: the seventeenth annual ACM symposium

Source: Crossref
Added: August 28, 2020

1985 conference paper

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).

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Event: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)

Source: Crossref
Added: August 28, 2020

1985 journal article

Effective Hilbert irreducibility

Information and Control, 66(3), 123โ€“137.

By: E. Kaltofen*

Source: Crossref
Added: August 28, 2020

1985 journal article

Factoring sparse multivariate polynomials

Journal of Computer and System Sciences, 31(2), 265โ€“287.

By: J. von zur Gathen* & E. Kaltofen*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1985 journal article

Factorization of multivariate polynomials over finite fields

Mathematics of Computation, 45(171), 251โ€“251.

By: J. von zur Gathen & E. Kaltofen*

Source: Crossref
Added: June 15, 2021

1985 journal article

Fast parallel absolute irreducibility testing

Journal of Symbolic Computation, 1(1), 57โ€“67.

By: E. Kaltofen*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ
Source: Crossref
Added: August 28, 2020

1985 journal article

Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization

SIAM Journal on Computing, 14(2), 469โ€“489.

By: E. Kaltofen*

Source: Crossref
Added: August 28, 2020

1985 chapter

Sparse hensel lifting

In EUROCAL '85 (pp. 4โ€“17).

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ
Source: Crossref
Added: August 28, 2020

1985 report

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.

By: E. Kaltofen & V. Pan

Source: NC State University Libraries
Added: March 26, 2022

1984 chapter

A note on the Risch differential equation

In J. Fitch (Ed.), EUROSAM 84 (pp. 359โ€“366).

By: E. Kaltofen*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ

Ed(s): J. Fitch

Event: International Symposium on Symbolic and Algebraic Computation at Cambridge, England on July 9-11, 1984

Source: Crossref
Added: June 15, 2021

1984 chapter

Effective Hilbert irreducibility

In EUROSAM 84 (pp. 277โ€“284).

By: E. Kaltofen*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ
Source: Crossref
Added: June 15, 2021

1984 chapter

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.

By: E. Kaltofen

Ed(s): H. Lenstra, J. Lenstra & P. van Emde Boas

Source: NC State University Libraries
Added: March 26, 2022

1984 report

The algebraic theory of integration

[Lecture Notes]. Troy, New York: Rensselaer Polytechnic Institute, Department of Computer Science.

By: E. Kaltofen

Source: NC State University Libraries
Added: March 26, 2022

1984 conference paper

The modular equation of order 11

Third Macsyma Users' Conference, 472โ€“485. General Electric.

By: E. Kaltofen & N. Yui

Source: NC State University Libraries
Added: March 26, 2022

1983 journal article

A Generalized Class of Polynomials that are Hard to Factor

SIAM Journal on Computing, 12(3), 473โ€“483.

By: E. Kaltofen*, D. Musser & B. Saunders

Source: Crossref
Added: August 28, 2020

1983 chapter

On the complexity of finding short vectors in integer lattices

In Lecture Notes in Computer Science (pp. 236โ€“244).

By: E. Kaltofen*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ
Source: Crossref
Added: August 28, 2020

1983 chapter

Polynomial-time factorization of multivariate polynomials over finite fields

In Lecture Notes in Computer Science: Vol. 154. Automata, Languages and Programming (pp. 250โ€“263).

By: J. von zur Gathen* & E. Kaltofen*

co-author countries: Canada ๐Ÿ‡จ๐Ÿ‡ฆ

Event: 10th Colloquium at Barcelona, Spain on July 18-22, 1983

Source: Crossref
Added: June 15, 2021

1982 conference paper

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.

By: E. Kaltofen*

Event: the fourteenth annual ACM symposium

Source: Crossref
Added: August 28, 2020

1982 conference paper

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.

By: E. Kaltofen*

Event: 23rd Annual Symposium on Foundations of Computer Science

Source: Crossref
Added: August 28, 2020

1982 chapter

Factorization of Polynomials

In B. Buchberger, G. E. Collins, & R. Loos (Eds.), Computing Supplementum (pp. 95โ€“113).

By: E. Kaltofen*

co-author countries: United States of America ๐Ÿ‡บ๐Ÿ‡ธ

Ed(s): B. Buchberger, G. Collins & R. Loos

Source: Crossref
Added: June 15, 2021

1982 thesis

On the complexity of factoring polynomials with integer coefficients

(PhD thesis). Rensselaer Polytechnic Institute, Troy, NY.

By: E. Kaltofen

Source: NC State University Libraries
Added: March 26, 2022

1981 conference paper

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.

By: E. Kaltofen*, D. Musser & B. Saunders

Event: the fourth ACM symposium

Source: Crossref
Added: August 28, 2020

1981 report

An attributed LL(1) compilation of Pascal into the lambda-calculus

(Technical Report No. CS-8103). Troy, NY: Rensselaer Polytechnic Institute Mathematical Sciences Department.

By: E. Kaltofen & S. Abdali

Source: NC State University Libraries
Added: March 26, 2022

1980 report

LISP/370 under the Michigan Terminal System

Troy, NY: Rensselaer Polytechnic Institute, Mathematical Sciences Department.

By: E. Kaltofen

Source: NC State University Libraries
Added: March 26, 2022