Erich Kaltofen Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems. [Citation Graph (0, 0)][DBLP] AAECC, 1993, pp:195-212 [Conf]
Erich Kaltofen Computing the Irreducible Real Factors and Components of an Algebraic Curve. [Citation Graph (0, 0)][DBLP] Symposium on Computational Geometry, 1989, pp:79-87 [Conf]
Erich Kaltofen, Noriko Yui Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields with Class Numbers 7 and 11. [Citation Graph (0, 0)][DBLP] EUROSAM, 1984, pp:310-320 [Conf]
Erich Kaltofen A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization [Citation Graph (0, 0)][DBLP] FOCS, 1982, pp:57-64 [Conf]
Erich Kaltofen Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization [Citation Graph (0, 0)][DBLP] FOCS, 1985, pp:451-458 [Conf]
Erich Kaltofen, Victor Y. Pan Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract) [Citation Graph (0, 0)][DBLP] FOCS, 1992, pp:714-723 [Conf]
Erich Kaltofen, Barry M. Trager Computing with Polynomials Given By Black Boxes for Their Evaluation: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators [Citation Graph (0, 0)][DBLP] FOCS, 1988, pp:296-305 [Conf]
Angel Díaz, Erich Kaltofen On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations. [Citation Graph (0, 0)][DBLP] ISSAC, 1995, pp:232-239 [Conf]
Erich Kaltofen An output-sensitive variant of the baby steps/giant steps determinant algorithm. [Citation Graph (0, 0)][DBLP] ISSAC, 2002, pp:138-144 [Conf]
Erich Kaltofen, Pascal Koiran Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. [Citation Graph (0, 0)][DBLP] ISSAC, 2006, pp:162-168 [Conf]
Erich Kaltofen A Polynomial Reduction from Multivariate to Bivariate Integral Polynomial Factorization [Citation Graph (0, 0)][DBLP] STOC, 1982, pp:261-266 [Conf]
Erich Kaltofen Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors [Citation Graph (0, 0)][DBLP] STOC, 1985, pp:131-142 [Conf]
Erich Kaltofen Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials [Citation Graph (0, 0)][DBLP] STOC, 1987, pp:443-452 [Conf]
Erich Kaltofen Effective Noether Irreducibility Forms and Applications (Extended Abstract) [Citation Graph (0, 0)][DBLP] STOC, 1991, pp:54-63 [Conf]
Erich Kaltofen Computing the Irreducible Real Factors and Components of an Algebraic Curve. [Citation Graph (0, 0)][DBLP] Appl. Algebra Eng. Commun. Comput., 1990, v:1, n:, pp:135-148 [Journal]
Erich Kaltofen, A. Lobo Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields. [Citation Graph (0, 0)][DBLP] Algorithmica, 1999, v:24, n:3-4, pp:331-348 [Journal]
Erich Kaltofen Greatest common divisors of polynomials given by straight-line programs. [Citation Graph (0, 0)][DBLP] J. ACM, 1988, v:35, n:1, pp:231-264 [Journal]
Erich Kaltofen Challenges of Symbolic Computation: My Favorite Open Problems. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 2000, v:29, n:6, pp:891-919 [Journal]
Erich Kaltofen Deterministic Irreducibility Testing of Polynomials over Large Finite Fields. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1987, v:4, n:1, pp:77-82 [Journal]
Erich Kaltofen, Barry M. Trager Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1990, v:9, n:3, pp:301-320 [Journal]
Erich Kaltofen Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1985, v:14, n:2, pp:469-489 [Journal]
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. [Citation Graph (, )][DBLP]
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). [Citation Graph (, )][DBLP]
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. [Citation Graph (, )][DBLP]
Expressing a fraction of two determinants as a determinant. [Citation Graph (, )][DBLP]
Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits [Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP