 | 2009 |
|---|
| 89 |       | Jeremy Johnson,
Hyungju Park,
Erich Kaltofen:
Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings
ACM 2009 |
| 2008 |
|---|
| 88 |  | Erich Kaltofen,
Pascal Koiran:
Expressing a fraction of two determinants as a determinant.
ISSAC 2008: 141-146 |
| 87 | | Erich Kaltofen,
Bin Li,
Zhengfeng Yang,
Lihong Zhi:
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars.
ISSAC 2008: 155-164 |
| 86 | | Erich Kaltofen,
John P. May,
Zhengfeng Yang,
Lihong Zhi:
Approximate factorization of multivariate polynomials using singular value decomposition.
J. Symb. Comput. 43(5): 359-376 (2008) |
| 2007 |
|---|
| 85 | | Erich Kaltofen,
Zhengfeng Yang:
On exact and approximate interpolation of sparse rational functions.
ISSAC 2007: 203-210 |
| 84 | | Erich Kaltofen,
Zhengfeng Yang,
Lihong Zhi:
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms.
SNC 2007: 11-17 |
| 83 | | Erich Kaltofen,
Bin Li,
Kartik Sivaramakrishnan,
Zhengfeng Yang,
Lihong Zhi:
Lower bounds for approximate factorizations via semidefinite programming: (extended abstract).
SNC 2007: 203-204 |
| 2006 |
|---|
| 82 | | Wolfram Decker,
Mike Dewar,
Erich Kaltofen,
Stephen M. Watt:
Challenges in Symbolic Computation Software, 02.07. - 07.07.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 81 | | Wolfram Decker,
Mike Dewar,
Erich Kaltofen,
Stephen M. Watt:
06271 Abstracts Collection -- Challenges in Symbolic Computation Software.
Challenges in Symbolic Computation Software 2006 |
| 80 | | Wolfram Decker,
Mike Dewar,
Erich Kaltofen,
Stephen M. Watt:
06271 Executive Summary - Challenges in Symbolic Computation Software.
Challenges in Symbolic Computation Software 2006 |
| 79 | | Erich Kaltofen,
Pascal Koiran:
Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields.
ISSAC 2006: 162-168 |
| 78 | | Erich Kaltofen,
Zhengfeng Yang,
Lihong Zhi:
Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials.
ISSAC 2006: 169-176 |
| 77 | | Erich Kaltofen,
Lihong Zhi:
Hybrid symbolic-numeric computation.
ISSAC 2006: 7 |
| 2005 |
|---|
| 76 | | Erich Kaltofen,
Pascal Koiran:
On the complexity of factoring bivariate supersparse (Lacunary) polynomials.
ISSAC 2005: 208-215 |
| 75 | | Erich Kaltofen,
Dmitriy Morozov,
George Yuhasz:
Generic matrix multiplication and memory management in linBox.
ISSAC 2005: 216-223 |
| 74 | | Erich Kaltofen,
Gilles Villard:
On the complexity of computing determinants.
Computational Complexity 13(3-4): 91-130 (2005) |
| 2004 |
|---|
| 73 | | Shuhong Gao,
Erich Kaltofen,
John May,
Zhengfeng Yang,
Lihong Zhi:
Approximate factorization of multivariate polynomials via differential equations.
ISSAC 2004: 167-174 |
| 72 | | Shuhong Gao,
Erich Kaltofen,
Alan G. B. Lauder:
Deterministic distinct-degree factorization of polynomials over finite fields.
J. Symb. Comput. 38(6): 1461-1470 (2004) |
| 2003 |
|---|
| 71 | | Erich Kaltofen,
John May:
On approximate irreducibility of polynomials in several variables.
ISSAC 2003: 161-168 |
| 70 | | Erich Kaltofen:
Polynomial factorization: a success story.
ISSAC 2003: 3-4 |
| 69 | | Erich Kaltofen,
Wen-shin Lee:
Early termination in sparse interpolation algorithms.
J. Symb. Comput. 36(3-4): 365-400 (2003) |
| 68 | | Mark Giesbrecht,
Erich Kaltofen,
Wen-shin Lee:
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases.
J. Symb. Comput. 36(3-4): 401-424 (2003) |
| 2002 |
|---|
| 67 | | Mark Giesbrecht,
Erich Kaltofen,
Wen-shin Lee:
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm.
ISSAC 2002: 101-108 |
| 66 | | Erich Kaltofen:
An output-sensitive variant of the baby steps/giant steps determinant algorithm.
ISSAC 2002: 138-144 |
| 2000 |
|---|
| 65 | | Erich Kaltofen,
Wen-shin Lee,
A. Lobo:
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm.
ISSAC 2000: 192-201 |
| 64 | | Erich Kaltofen:
Challenges of Symbolic Computation: My Favorite Open Problems.
J. Symb. Comput. 29(6): 891-919 (2000) |
| 1999 |
|---|
| 63 | | Markus A. Hitz,
Erich Kaltofen,
Yagati N. Lakshman:
Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems.
ISSAC 1999: 205-212 |
| 62 | | Laurent Bernardin,
Bruce W. Char,
Erich Kaltofen:
Symbolic Computation in Java: An Appraisement.
ISSAC 1999: 237-244 |
| 61 | | Erich Kaltofen,
Michael B. Monagan:
On the Genericity of the Modular Polynomial GCD Algorithm.
ISSAC 1999: 59-66 |
| 60 | | Erich Kaltofen,
A. Lobo:
Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields.
Algorithmica 24(3-4): 331-348 (1999) |
| 1998 |
|---|
| 59 | | Markus A. Hitz,
Erich Kaltofen:
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots.
ISSAC 1998: 236-243 |
| 58 | | Angel Díaz,
Erich Kaltofen:
FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation.
ISSAC 1998: 30-37 |
| 57 | | Erich Kaltofen,
Victor Shoup:
Subquadratic-time factoring of polynomials over finite fields.
Math. Comput. 67(223): 1179-1197 (1998) |
| 1997 |
|---|
| 56 | | Wayne Eberly,
Erich Kaltofen:
On Randomized Lanczos Algorithms.
ISSAC 1997: 176-183 |
| 55 | | Erich Kaltofen,
Victor Shoup:
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields.
ISSAC 1997: 184-188 |
| 54 | | Angel Díaz,
Erich Kaltofen,
Victor Y. Pan:
Algebraic Algorithms.
The Computer Science and Engineering Handbook 1997: 226-249 |
| 53 | | Erich Kaltofen:
Teaching Computational Abstract Algebra.
J. Symb. Comput. 23(5/6): 503-515 (1997) |
| 1996 |
|---|
| 52 | | Erich Kaltofen,
A. Lobo:
On Rank Properties of Toeplitz Matrices over Finite Fields.
ISSAC 1996: 241-249 |
| 51 | | Úlfar Erlingsson,
Erich Kaltofen,
David R. Musser:
Generic Gram-Schmidt Orthogonalization by Exact Division.
ISSAC 1996: 275-282 |
| 1995 |
|---|
| 50 | | Angel Díaz,
Erich Kaltofen:
On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations.
ISSAC 1995: 232-239 |
| 49 | | Mehrdad Samadani,
Erich Kaltofen:
Prediction Based Task Scheduling in Distributed Computing (Abstract).
PODC 1995: 261 |
| 48 | | Erich Kaltofen,
Victor Shoup:
Subquadratic-time factoring of polynomials over finite fields.
STOC 1995: 398-406 |
| 47 | | Markus A. Hitz,
Erich Kaltofen:
Integer Division in Residue Number Systems.
IEEE Trans. Computers 44(8): 983-989 (1995) |
| 46 | | Erich Kaltofen:
Effective Noether Irreducibility Forms and Applications.
J. Comput. Syst. Sci. 50(2): 274-295 (1995) |
| 45 | | Angel Díaz,
Markus A. Hitz,
Erich Kaltofen,
A. Lobo,
T. Valente:
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge.
J. Symb. Comput. 19(1-3): 269-282 (1995) |
| 1994 |
|---|
| 44 | | Erich Kaltofen:
Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems.
ISSAC 1994: 297-304 |
| 43 | | Erich Kaltofen,
A. Lobo:
Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm.
ISSAC 1994: 90-98 |
| 1993 |
|---|
| 42 | | Erich Kaltofen:
Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems.
AAECC 1993: 195-212 |
| 41 | | Angel Díaz,
Markus A. Hitz,
Erich Kaltofen,
A. Lobo,
T. Valente:
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge.
DISCO 1993: 66-80 |
| 1992 |
|---|
| 40 | | Erich Kaltofen,
Victor Y. Pan:
Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract)
FOCS 1992: 714-723 |
| 39 | | Erich Kaltofen:
On Computing Determinants of Matrices without Divisions.
ISSAC 1992: 342-349 |
| 38 | | Erich Kaltofen:
Polynomial Factorization 1987-1991.
LATIN 1992: 294-313 |
| 1991 |
|---|
| 37 | | Erich Kaltofen,
B. David Saunders:
On Wiedemann's Method of Solving Sparse Linear Systems.
AAECC 1991: 29-38 |
| 36 | | Angel Díaz,
Erich Kaltofen,
K. Schmitz,
T. Valente:
DSC: A System for Distributed Symbolic Computation.
ISSAC 1991: 323-332 |
| 35 | | Erich Kaltofen,
Victor Y. Pan:
Processor Efficient Parallel Solution of Linear Systems over an Abstract Field.
SPAA 1991: 180-191 |
| 34 | | Erich Kaltofen:
Effective Noether Irreducibility Forms and Applications (Extended Abstract)
STOC 1991: 54-63 |
| 33 | | David G. Cantor,
Erich Kaltofen:
On Fast Multiplication of Polynomials over Arbitrary Algebras.
Acta Inf. 28(7): 693-701 (1991) |
| 1990 |
|---|
| 32 | | Erich Kaltofen,
Yagati N. Lakshman,
J.-M. Wiley:
Modular Rational Sparse Multivariate Polynomial Interpolation.
ISSAC 1990: 135-139 |
| 31 | | Erich Kaltofen:
Computing the Irreducible Real Factors and Components of an Algebraic Curve.
Appl. Algebra Eng. Commun. Comput. 1: 135-148 (1990) |
| 30 | | Erich Kaltofen,
Bruno Buchberger:
Special Issue Computational Algebraic Complexity Editorial.
J. Symb. Comput. 9(3): 225-228 (1990) |
| 29 | | Erich Kaltofen,
Barry M. Trager:
Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators.
J. Symb. Comput. 9(3): 301-320 (1990) |
| 1989 |
|---|
| 28 | | John F. Canny,
Erich Kaltofen,
Yagati N. Lakshman:
Solving Systems of Nonlinear Polynomial Equations Faster.
ISSAC 1989: 121-128 |
| 27 | | Erich Kaltofen,
T. Valente,
Norika Yui:
An Improved Las Vegas Primality Test.
ISSAC 1989: 26-33 |
| 26 | | Erich Kaltofen:
Computing the Irreducible Real Factors and Components of an Algebraic Curve.
Symposium on Computational Geometry 1989: 79-87 |
| 1988 |
|---|
| 25 | | Erich Kaltofen,
Barry M. Trager:
Computing with Polynomials Given By Black Boxes for Their Evaluation: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators
FOCS 1988: 296-305 |
| 24 | | Erich Kaltofen,
Yagati N. Lakshman:
Improved Sparse Multivariate Polynomial Interpolation Algorithms.
ISSAC 1988: 467-474 |
| 23 | | Erich Kaltofen:
Greatest common divisors of polynomials given by straight-line programs.
J. ACM 35(1): 231-264 (1988) |
| 22 | | Gary L. Miller,
Vijaya Ramachandran,
Erich Kaltofen:
Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits.
SIAM J. Comput. 17(4): 687-695 (1988) |
| 1987 |
|---|
| 21 | | 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.
EUROCAL 1987: 317-322 |
| 20 | | Erich Kaltofen:
Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials
STOC 1987: 443-452 |
| 19 | | Erich Kaltofen:
Deterministic Irreducibility Testing of Polynomials over Large Finite Fields.
J. Symb. Comput. 4(1): 77-82 (1987) |
| 1986 |
|---|
| 18 | | Gary L. Miller,
Vijaya Ramachandran,
Erich Kaltofen:
Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits.
Aegean Workshop on Computing 1986: 236-245 |
| 17 | | Erich Kaltofen:
Uniform Closure Properties of P-Computable Functions
STOC 1986: 330-337 |
| 1985 |
|---|
| 16 | | Erich Kaltofen,
Heinrich Rolletschek:
Arithmetic in Quadratic Fields with Unique Factorization.
European Conference on Computer Algebra (2) 1985: 279-288 |
| 15 | | Erich Kaltofen:
Sparse Hensel Lifting.
European Conference on Computer Algebra (2) 1985: 4-17 |
| 14 | | Erich Kaltofen:
Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization
FOCS 1985: 451-458 |
| 13 | | Erich Kaltofen:
Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors
STOC 1985: 131-142 |
| 12 | | Erich Kaltofen:
Effective Hilbert Irreducibility
Information and Control 66(3): 123-137 (1985) |
| 11 | | Joachim von zur Gathen,
Erich Kaltofen:
Factoring Sparse Multivariate Polynomials.
J. Comput. Syst. Sci. 31(2): 265-287 (1985) |
| 10 | | Erich Kaltofen:
Fast Parallel Absolute Irreducibility Testing.
J. Symb. Comput. 1(1): 57-67 (1985) |
| 9 | | Erich Kaltofen:
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization.
SIAM J. Comput. 14(2): 469-489 (1985) |
| 1984 |
|---|
| 8 | | Erich Kaltofen:
Effective Hilbert Irreducibility.
EUROSAM 1984: 277-284 |
| 7 | | Erich Kaltofen,
Noriko Yui:
Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields with Class Numbers 7 and 11.
EUROSAM 1984: 310-320 |
| 6 | | Erich Kaltofen:
A Note on the Risch Differential Equation.
EUROSAM 1984: 359-366 |
| 1983 |
|---|
| 5 | | Erich Kaltofen:
On the complexity of finding short vectors in integer lattices.
EUROCAL 1983: 236-244 |
| 4 | | Joachim von zur Gathen,
Erich Kaltofen:
Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields.
ICALP 1983: 250-263 |
| 3 | | Erich Kaltofen,
David R. Musser,
B. David Saunders:
A Generalized Class of Polynomials that are Hard to Factor.
SIAM J. Comput. 12(3): 473-483 (1983) |
| 1982 |
|---|
| 2 | | Erich Kaltofen:
A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization
FOCS 1982: 57-64 |
| 1 | | Erich Kaltofen:
A Polynomial Reduction from Multivariate to Bivariate Integral Polynomial Factorization
STOC 1982: 261-266 |
