Follow
Erich Kaltofen
Erich Kaltofen
Verified email at ncsu.edu - Homepage
Title
Cited by
Cited by
Year
On fast multiplication of polynomials over arbitrary algebras
DG Cantor, E Kaltofen
Acta Informatica 28 (7), 693-701, 1991
4581991
On Wiedemann's method of solving sparse linear systems
E Kaltofen, B David Saunders
International Symposium on Applied Algebra, Algebraic Algorithms, and Error …, 1991
2381991
Subquadratic-time factoring of polynomials over finite fields
E Kaltofen, V Shoup
Mathematics of computation 67 (223), 1179-1197, 1998
2341998
Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators
E Kaltofen, BM Trager
Journal of Symbolic Computation 9 (3), 301-320, 1990
2271990
Solving systems of nonlinear polynomial equations faster
JF Canny, E Kaltofen, L Yagati
Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and …, 1989
2101989
On the complexity of computing determinants
E Kaltofen, G Villard
Computational complexity 13 (3), 91-130, 2005
2032005
Computer algebra handbook: foundations, applications, systems
J Grabmeier, E Kaltofen
Springer, 2003
1902003
Improved sparse multivariate polynomial interpolation algorithms
E Kaltofen, L Yagati
International Symposium on Symbolic and Algebraic Computation, 467-474, 1988
1811988
Analysis of Coppersmith’s block Wiedemann algorithm for the parallel solution of sparse linear systems
E Kaltofen
Mathematics of Computation 64 (210), 777-806, 1995
1731995
Polynomial-time reductions from multivariate to bi-and univariate integral polynomial factorization
E Kaltofen
SIAM Journal on Computing 14 (2), 469-489, 1985
1551985
Factorization of polynomials given by straight-line programs.
E Kaltofen
Adv. Comput. Res. 5, 375-412, 1989
1471989
Greatest common divisors of polynomials given by straight-line programs
E Kaltofen
Journal of the ACM (JACM) 35 (1), 231-264, 1988
1451988
Early termination in sparse interpolation algorithms
E Kaltofen, W Lee
Journal of Symbolic Computation 36 (3-4), 365-400, 2003
1372003
Polynomial factorization 1987–1991
E Kaltofen
Latin American Symposium on Theoretical Informatics, 294-313, 1992
1331992
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
E Kaltofen, Z Yang, L Zhi
Proceedings of the 2006 international symposium on Symbolic and algebraic …, 2006
1232006
Processor efficient parallel solution of linear systems over an abstract field
E Kaltofen, V Pan
Proceedings of the third annual ACM symposium on Parallel algorithms and …, 1991
1151991
LinBox: A generic library for exact linear algebra
JG Dumas, T Gautier, M Giesbrecht, P Giorgi, B Hovinen, E Kaltofen, ...
Proceedings of the 2002 International Congress of Mathematical Software …, 2002
1132002
Factoring sparse multivariate polynomials
J Von Zur Gathen, E Kaltofen
Journal of Computer and System Sciences 31 (2), 265-287, 1985
1131985
Challenges of symbolic computation: my favorite open problems
E Kaltofen
Journal of Symbolic Computation 29 (6), 891-919, 2000
1102000
Approximate factorization of multivariate polynomials via differential equations
S Gao, E Kaltofen, J May, Z Yang, L Zhi
Proceedings of the 2004 international symposium on Symbolic and algebraic …, 2004
1042004
The system can't perform the operation now. Try again later.
Articles 1–20