The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Erich Kaltofen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Erich Kaltofen, B. David Saunders
    On Wiedemann's Method of Solving Sparse Linear Systems. [Citation Graph (0, 0)][DBLP]
    AAECC, 1991, pp:29-38 [Conf]
  3. Gary L. Miller, Vijaya Ramachandran, Erich Kaltofen
    Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:236-245 [Conf]
  4. 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]
  5. Angel Díaz, Markus A. Hitz, Erich Kaltofen, A. Lobo, T. Valente
    Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. [Citation Graph (0, 0)][DBLP]
    DISCO, 1993, pp:66-80 [Conf]
  6. Erich Kaltofen, Mukkai S. Krishnamoorthy, B. David Saunders
    Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices. [Citation Graph (0, 0)][DBLP]
    EUROCAL, 1987, pp:317-322 [Conf]
  7. Erich Kaltofen, Heinrich Rolletschek
    Arithmetic in Quadratic Fields with Unique Factorization. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (2), 1985, pp:279-288 [Conf]
  8. Erich Kaltofen
    On the complexity of finding short vectors in integer lattices. [Citation Graph (0, 0)][DBLP]
    EUROCAL, 1983, pp:236-244 [Conf]
  9. Erich Kaltofen
    Sparse Hensel Lifting. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (2), 1985, pp:4-17 [Conf]
  10. Erich Kaltofen
    Effective Hilbert Irreducibility. [Citation Graph (0, 0)][DBLP]
    EUROSAM, 1984, pp:277-284 [Conf]
  11. Erich Kaltofen
    A Note on the Risch Differential Equation. [Citation Graph (0, 0)][DBLP]
    EUROSAM, 1984, pp:359-366 [Conf]
  12. 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]
  13. Erich Kaltofen
    A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:57-64 [Conf]
  14. Erich Kaltofen
    Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:451-458 [Conf]
  15. 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]
  16. 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]
  17. Joachim von zur Gathen, Erich Kaltofen
    Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:250-263 [Conf]
  18. Laurent Bernardin, Bruce W. Char, Erich Kaltofen
    Symbolic Computation in Java: An Appraisement. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1999, pp:237-244 [Conf]
  19. John F. Canny, Erich Kaltofen, Yagati N. Lakshman
    Solving Systems of Nonlinear Polynomial Equations Faster. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1989, pp:121-128 [Conf]
  20. 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]
  21. Angel Díaz, Erich Kaltofen
    FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1998, pp:30-37 [Conf]
  22. Angel Díaz, Erich Kaltofen, K. Schmitz, T. Valente
    DSC: A System for Distributed Symbolic Computation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1991, pp:323-332 [Conf]
  23. Wayne Eberly, Erich Kaltofen
    On Randomized Lanczos Algorithms. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1997, pp:176-183 [Conf]
  24. Úlfar Erlingsson, Erich Kaltofen, David R. Musser
    Generic Gram-Schmidt Orthogonalization by Exact Division. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1996, pp:275-282 [Conf]
  25. Shuhong Gao, Erich Kaltofen, John May, Zhengfeng Yang, Lihong Zhi
    Approximate factorization of multivariate polynomials via differential equations. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2004, pp:167-174 [Conf]
  26. Markus A. Hitz, Erich Kaltofen
    Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1998, pp:236-243 [Conf]
  27. Markus A. Hitz, Erich Kaltofen, Yagati N. Lakshman
    Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1999, pp:205-212 [Conf]
  28. Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee
    Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2002, pp:101-108 [Conf]
  29. 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]
  30. Erich Kaltofen
    Polynomial factorization: a success story. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2003, pp:3-4 [Conf]
  31. Erich Kaltofen
    On Computing Determinants of Matrices without Divisions. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1992, pp:342-349 [Conf]
  32. Erich Kaltofen
    Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1994, pp:297-304 [Conf]
  33. Erich Kaltofen, Pascal Koiran
    On the complexity of factoring bivariate supersparse (Lacunary) polynomials. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2005, pp:208-215 [Conf]
  34. Erich Kaltofen, A. Lobo
    Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1994, pp:90-98 [Conf]
  35. Erich Kaltofen, A. Lobo
    On Rank Properties of Toeplitz Matrices over Finite Fields. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1996, pp:241-249 [Conf]
  36. Erich Kaltofen, Wen-shin Lee, A. Lobo
    Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2000, pp:192-201 [Conf]
  37. Erich Kaltofen, Yagati N. Lakshman, J.-M. Wiley
    Modular Rational Sparse Multivariate Polynomial Interpolation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1990, pp:135-139 [Conf]
  38. Erich Kaltofen, John May
    On approximate irreducibility of polynomials in several variables. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2003, pp:161-168 [Conf]
  39. Erich Kaltofen, Michael B. Monagan
    On the Genericity of the Modular Polynomial GCD Algorithm. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1999, pp:59-66 [Conf]
  40. Erich Kaltofen, Dmitriy Morozov, George Yuhasz
    Generic matrix multiplication and memory management in linBox. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2005, pp:216-223 [Conf]
  41. Erich Kaltofen, Victor Shoup
    Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1997, pp:184-188 [Conf]
  42. Erich Kaltofen, T. Valente, Norika Yui
    An Improved Las Vegas Primality Test. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1989, pp:26-33 [Conf]
  43. Erich Kaltofen, Yagati N. Lakshman
    Improved Sparse Multivariate Polynomial Interpolation Algorithms. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1988, pp:467-474 [Conf]
  44. 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]
  45. Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
    Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2006, pp:169-176 [Conf]
  46. Erich Kaltofen, Lihong Zhi
    Hybrid symbolic-numeric computation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2006, pp:7- [Conf]
  47. Erich Kaltofen
    Polynomial Factorization 1987-1991. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:294-313 [Conf]
  48. Mehrdad Samadani, Erich Kaltofen
    Prediction Based Task Scheduling in Distributed Computing (Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1995, pp:261- [Conf]
  49. Erich Kaltofen, Victor Y. Pan
    Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:180-191 [Conf]
  50. Erich Kaltofen
    A Polynomial Reduction from Multivariate to Bivariate Integral Polynomial Factorization [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:261-266 [Conf]
  51. 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]
  52. Erich Kaltofen
    Uniform Closure Properties of P-Computable Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:330-337 [Conf]
  53. 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]
  54. Erich Kaltofen
    Effective Noether Irreducibility Forms and Applications (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:54-63 [Conf]
  55. Erich Kaltofen, Victor Shoup
    Subquadratic-time factoring of polynomials over finite fields. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:398-406 [Conf]
  56. 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]
  57. David G. Cantor, Erich Kaltofen
    On Fast Multiplication of Polynomials over Arbitrary Algebras. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1991, v:28, n:7, pp:693-701 [Journal]
  58. 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]
  59. Erich Kaltofen, Gilles Villard
    On the complexity of computing determinants. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:13, n:3-4, pp:91-130 [Journal]
  60. Erich Kaltofen
    Effective Hilbert Irreducibility [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:66, n:3, pp:123-137 [Journal]
  61. 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]
  62. Joachim von zur Gathen, Erich Kaltofen
    Factoring Sparse Multivariate Polynomials. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:31, n:2, pp:265-287 [Journal]
  63. Erich Kaltofen
    Effective Noether Irreducibility Forms and Applications. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:2, pp:274-295 [Journal]
  64. Angel Díaz, Markus A. Hitz, Erich Kaltofen, A. Lobo, T. Valente
    Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1995, v:19, n:1-3, pp:269-282 [Journal]
  65. Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee
    Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2003, v:36, n:3-4, pp:401-424 [Journal]
  66. Shuhong Gao, Erich Kaltofen, Alan G. B. Lauder
    Deterministic distinct-degree factorization of polynomials over finite fields. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2004, v:38, n:6, pp:1461-1470 [Journal]
  67. 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]
  68. Erich Kaltofen
    Fast Parallel Absolute Irreducibility Testing. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1985, v:1, n:1, pp:57-67 [Journal]
  69. 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]
  70. Erich Kaltofen
    Teaching Computational Abstract Algebra. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1997, v:23, n:5/6, pp:503-515 [Journal]
  71. Erich Kaltofen, Bruno Buchberger
    Special Issue Computational Algebraic Complexity Editorial. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1990, v:9, n:3, pp:225-228 [Journal]
  72. Erich Kaltofen, Wen-shin Lee
    Early termination in sparse interpolation algorithms. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 2003, v:36, n:3-4, pp:365-400 [Journal]
  73. 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]
  74. Erich Kaltofen, Victor Shoup
    Subquadratic-time factoring of polynomials over finite fields. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1998, v:67, n:223, pp:1179-1197 [Journal]
  75. 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]
  76. Erich Kaltofen, David R. Musser, B. David Saunders
    A Generalized Class of Polynomials that are Hard to Factor. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:3, pp:473-483 [Journal]
  77. Gary L. Miller, Vijaya Ramachandran, Erich Kaltofen
    Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:4, pp:687-695 [Journal]
  78. Markus A. Hitz, Erich Kaltofen
    Integer Division in Residue Number Systems. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1995, v:44, n:8, pp:983-989 [Journal]
  79. Erich Kaltofen, Zhengfeng Yang
    On exact and approximate interpolation of sparse rational functions. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2007, pp:203-210 [Conf]

  80. 06271 Abstracts Collection -- Challenges in Symbolic Computation Software. [Citation Graph (, )][DBLP]


  81. 06271 Executive Summary - Challenges in Symbolic Computation Software. [Citation Graph (, )][DBLP]


  82. On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. [Citation Graph (, )][DBLP]


  83. Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). [Citation Graph (, )][DBLP]


  84. Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. [Citation Graph (, )][DBLP]


  85. Expressing a fraction of two determinants as a determinant. [Citation Graph (, )][DBLP]


  86. Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits [Citation Graph (, )][DBLP]


Search in 0.012secs, Finished in 0.016secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002