"kaltofen" - читать интересную книгу автора

Publications by Erich Kaltofen Previous: Students Up: Resume TOC Next: Courses

Publications by Erich Kaltofen

In the following the BASE URL for the online document is http://www.math.ncsu.edu/~kaltofen/bibliography.
COPYRIGHT NOTICE: The items linked in the url fields of the References section are copyrighted by the publishers or by E. Kaltofen.

Major Research Results

Polynomial Factorization

Polynomial-time algorithms for multivariate polynomial factorization with coefficients from a field [5,6,25,27] or the algebraic closure of a field [19,85]; deterministic polynomial-time irreducibility testing [35] and distinct degree factorization [109] of multivariate polynomials over a large finite field; computing the nearest multivariate polynomial with factor of constant degree and complex coefficients in polynomial time [105].
Polynomial-time sparse multivariate polynomial factorization algorithms by introducing the straight-line program [42,39,34,31,24,20] and the black box representations of polynomials [57,81].
Subquadratic-time polynomial factorization of univariate polynomials over a finite field [82,97]; asymptotically fastest polynomial factorization algorithm over high algebraic extensions of finite fields [93].

Linear Algebra

Processor-efficient parallel algorithms for solving general linear systems over a field [62,66].
Parallel algorithms for matrix canonical forms [32,54].
Probabilistic analysis [80] and implementation [76,89,102] of the block Wiedemann parallel sparse linear system solver.
Probabilistic analysis of the Lanczos sparse linear system solver over finite fields [94].
Fastest algorithm in terms of bit operations for the determinant of an integer matrix [110].

Divisions in Algebraic Complexity Theory

Polynomial-length separate computation of the numerator and denominator of a rational function given by a straight-line program [39].
Asymptotically fast multiplication of polynomials over a ring [64].
Fast division-free computation of the determinant and the characteristic polynomial of a matrix [67,110].
Integer division with remainder in residue number systems via Newton iteration [83].

Computational Number Theory

Use of Weber equations for the Hilbert class fields arising in the Goldwasser-Kilian/Atkin primality prover [14,12,48,60].

Symbolic/Numeric Computation

Stability of roots of polynomials with respect to coefficient perturbations [99,105].

Software

DAGWOOD: a system for manipulating polynomials given by straight-line programs [40]. The archive directory of the Lisp program source code is at BASE/../software/dagwood.
DSC: the distributed symbolic manipulation tool [61,71,75,79]. The archive directory of the C, C++, Lisp, and Maple program source code is at BASE/../software/dsc.
FOXBOX: a plug-and-play symbolic system component for objects in black box representation [98]. The archive directory of the C++ program source code and the NTL and Saclib library binaries (solaris and linux elf) is at BASE/../software/foxbox.
WiLiSS: an implementation of the block Wiedemann algorithm [84,102]. The archive directory of the C program source code is at BASE/../software/wiliss.
LINBOX: a generic library for exact black box linear algebra [115]. The homepage including downloads can be found at www.linalg.org.

Paper on Pedagogy and Significant Instructional Software

Undergraduate abstract algebra from a computational point of view [92]. The Mathematica packages and notebooks are at BASE/../courses/ ComputAlgebra/Mathematica.
A demonstration implementation in Maple of the RSA public crypto system is at BASE/../software/rsa.
A demonstration package in Maple of algorithms in linear algebra is at BASE/../courses/ LinAlgebra/Maple/RefPkg/ (see README.html).
An STL-like implementation in C++ of the container class binary search tree is at BASE/../courses/ DataStruct/C++Examples/BinSearchTree.
A C++ implementation of common sorting algorithms is at BASE/../courses/ DataStruct/C++Examples/Sorting.

Surveys

Three surveys on polynomial factorization [68,56,7].
Three surveys on algebraic algorithms [101,95,33].
A survey on sparse linear systems [90] and one on the computational complexity of matrix determinants [114].
A list of open problems [106].
A survey on parallelizing straight-line programs [70].

Bibliography

119: L. Chen, W. Eberly, E. Kaltofen, B. D. Saunders, W. J. Turner, and G. Villard.
Efficient matrix preconditioners for black box linear algebra.
Linear Algebra and Applications, 343-344:119-146, 2002.
Special issue on Structured and Infinite Systems of Linear Equations, edited by P. Dewilde, V. Olshevsky and A. H. Sayed.
URL: BASE/2K/CEKSTV02.pdf
118: Mark Giesbrecht, Erich Kaltofen, and Wen-shin Lee.
Algorithms for computing the sparsest shifts for polynomials via the Berlekamp/Massey algorithm.
In Proc. 2002 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'02) [-2], pages 101-108.
URL: BASE/02/GKL02.pdf Talk: BASE/02/issaclee.pdf (given by Wen-shin Lee)
117: Erich Kaltofen.
An output-sensitive variant of the baby steps/giant steps determinant algorithm.
In Proc. 2002 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'02) [-2], pages 138-144.
URL: BASE/02/Ka02.pdf Talk: BASE/02/issac.pdf
116: J. Grabmeier, E. Kaltofen, and V. Weispfenning, editors.
Computer Algebra Handbook.
Springer Verlag, Heidelberg, Germany, 2002.
637 + xx pages + CD-ROM. Includes E. Kaltofen and V. Weispfenning §1.4 Computer algebra - impact on research, pages 4-6; E. Kaltofen §2.2.3 Absolute factorization of polynomials, page 26; E. Kaltofen and B. D. Saunders §2.3.1 Linear systems, pages 36-38; R. M. Corless, E. Kaltofen and S. M. Watt §2.12.3 Hybrid methods, pages 112-125; E. Kaltofen §4.2.17 FoxBox and other blackbox systems, pages 383-385.
URL: BASE/01/symnum.pdf (§2.12.3)
115: J.-G. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen, E. Kaltofen, B. D. Saunders, W. J. Turner, and G. Villard.
LinBox: A generic library for exact linear algebra.
In Proc. First Internat. Congress Math. Software ICMS 2002, Beijing, China [-1], pages 40-50.
URL: BASE/02/Detal02.pdf
114: E. Kaltofen and G. Villard.
Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
J. Computational Applied Math., 2002.
To appear, 17 pages. Special issue on Congrès International Algèbre Linéaire et Arithmétique: Calcul Numérique, Symbolique et Parallèle, held in Rabat, Morocco, May 2001.
URL: BASE/02/KaVi02.pdf
113: Erich Kaltofen, Michael McLean, and Larry Norris.
`Using Maple to grade Maple' assessment software from North Carolina State University.
In Proceedings 2002 Maple Workshop, Waterloo, Canada, 2002. Waterloo Maple Inc.
With Dmitriy Morozov, John May and William Turner.
URL: BASE/02/KMN02.pdf
112: Erich Kaltofen and Wen-shin Lee.
Early termination in sparse interpolation algorithms.
Paper submitted, 37 pages, 2002.
111: Mark Giesbrecht, Erich Kaltofen, and Wen-shin Lee.
Algorithms for computing sparsest shifts of polynomials in standard, Chebychev, and Pochhammer bases.
Paper submitted, 28 pages, 2002.
110: E. Kaltofen and G. Villard.
On the complexity of computing determinants.
In Proc. Fifth Asian Symposium on Computer Mathematics (ASCM 2001) [-3], pages 13-27.
Invited contribution; extended abstract.
URL: BASE/01/KaVi01.pdf Maple 6 worksheet: BASE/01/KaVi01.mws
109: Shuhong Gao, E. Kaltofen, and A. Lauder.
Deterministic distinct degree factorization for polynomials over finite fields.
Paper submitted, 10 pages, 2001.
URL: BASE/01/GKL01.pdf
108: E. Kaltofen.
Algorithms for sparse and black box matrices over finite fields (invited talk).
Bibliography for my talk on May 23, 2001 at the Sixth International Conference on Finite Fields and Applications (Fq6) in Oaxaca, Mexico, 6 pages, 2001.
URL: BASE/01/Ka01:Fq6.pdf
107: E. Kaltofen, W.-s. Lee, and A. A. Lobo.
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm.
In Proc. 2000 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'00) [-4], pages 192-201.
URL: BASE/2K/KLL2K.pdf Talk: BASE/2K/issaclee.pdf (given by Wen-shin Lee)
106: E. Kaltofen.
Challenges of symbolic computation my favorite open problems.
J. Symbolic Comput., 29(6):891-919, 2000.
With an additional open problem by R. M. Corless and D. J. Jeffrey.
URL: BASE/2K/Ka2K.pdf Talk: BASE/lectures/lecture.html#eccadannapolis
105: M. A. Hitz, E. Kaltofen, and Lakshman Y. N.
Efficient algorithms for computing the nearest polynomial with a real root and related problems.
In Proc. 1999 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'99) [-5], pages 205-212.
URL: BASE/99/HKL99.ps.gz Talk: BASE/ lectures/lecture.html#snsclinz (given at SNSC'99)
104: L. Bernardin, B. Char, and E. Kaltofen.
Symbolic computation in Java: an appraisement.
In Proc. 1999 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'99) [-5], pages 237-244.
URL: BASE/99/BCK99.ps.gz Talk: BASE/99/bernardin.ps.gz (given by Laurent Bernadin)
103: E. Kaltofen and M. Monagan.
On the genericity of the modular polynomial GCD algorithm.
In Proc. 1999 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'99) [-5], pages 59-66.
URL: BASE/99/KaMo99.ps.gz Talk: BASE/99/issac1.ps.gz, BASE/99/issac2.ps.gz
102: E. Kaltofen and A. Lobo.
Distributed matrix-free solution of large sparse linear systems over finite fields.
Algorithmica, 24(3-4):331-348, July-Aug. 1999.
Special Issue on ``Coarse Grained Parallel Algorithms''.
URL: BASE/98/KaLo99.ps.gz
101: A. Díaz, I. Emiris, E. Kaltofen, and V. Pan.
Algebraic algorithms.
In M. J. Atallah, editor, Algorithms & Theory of Computation Handbook, pages 16.1-16.27. CRC Press, Boca Raton, Florida, 1999.
URL: BASE/99/DEKP99.ps.gz
100: H. Hong, E. Kaltofen, and M. Singer, editors.
East Coast Computer Algebra Day '99 (April 24, 1999) Abstracts of invited talks and presented posters.
SIGSAM Bulletin, 23(2):43-52, June 1999.
99: M. A. Hitz and E. Kaltofen.
Efficient algorithms for computing the nearest polynomial with constrained roots.
In Proc. 1998 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'98) [-6], pages 236-243.
URL: BASE/98/HiKa98.ps.gz Talk: BASE/98/issac2.ps.gz, realaudio (2.3M)
98: A. Díaz and E. Kaltofen.
FOXBOX a system for manipulating symbolic objects in black box representation.
In Proc. 1998 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'98) [-6], pages 30-37.
URL: BASE/98/DiKa98.ps.gz Talk: BASE/98/issac1.ps.gz
97: E. Kaltofen and V. Shoup.
Subquadratic-time factoring of polynomials over finite fields.
Math. Comput., 67(223):1179-1197, July 1998.
URL: BASE/98/KaSh98.ps.gz
96: M. A. Hitz and E. Kaltofen.
The Kharitonov theorem and its applications in symbolic mathematical computation.
Unpublished paper, North Carolina State Univ., Dept. Math., May 1997.
URL: BASE/97/HiKa97:kharit.ps.gz
95: A. Díaz, E. Kaltofen, and V. Pan.
Algebraic algorithms.
In A. B. Tucker, editor, The Computer Science and Engineering Handbook, chapter 10, pages 226-248. CRC Press, Boca Raton, Florida, 1997.
Expanded version in [101].
URL: BASE/97/DKP97.ps.gz
94: W. Eberly and E. Kaltofen.
On randomized Lanczos algorithms.
In Proc. 1997 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'97) [-7], pages 176-183.
URL: BASE/97/EbKa97.ps.gz
93: E. Kaltofen and V. Shoup.
Fast polynomial factorization over high algebraic extensions of finite fields.
In Proc. 1997 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'97) [-7], pages 184-188.
URL: BASE/97/KaSh97.ps.gz Talk: BASE/97/issac97a.ps.gz, BASE/97/issac97b.ps.gz
92: E. Kaltofen.
Teaching computational abstract algebra.
J. Symbolic Comput., 23(5-6):503-515, 1997.
Special issue on education, L. Lambe, editor.
URL: BASE/97/Ka97:jsc.ps.gz
91: M. Hitz and E. Kaltofen, editors.
Proc. Second Internat. Symp. Parallel Symbolic Comput. PASCO '97, New York, N. Y., 1997. ACM Press.
90: E. Kaltofen.
Blocked iterative sparse linear system solvers for finite fields.
In C. Roucairol, editor, Proc. Symp. Parallel Comput. Solving Large Scale Irregular Applic. (Stratagem '96), pages 91-95, Sophia Antipolis, France, 1996. INRIA.
URL: BASE/96/Ka96:stratagem.ps.gz
89: E. Kaltofen and A. Lobo.
Distributed matrix-free solution of large sparse linear systems over finite fields.
In A. M. Tentner, editor, Proc. High Performance Computing '96, pages 244-247, San Diego, CA, 1996. Society for Computer Simulation, Simulation Councils, Inc.
Journal version [102].
URL: BASE/96/KaLo96:hpc.ps.gz
88: M. Samadani and E. Kaltofen.
On distributed scheduling using load prediction from past information.
Unpublished paper, 1996.
87: E. Kaltofen and A. Lobo.
On rank properties of Toeplitz matrices over finite fields.
In Proc. 1996 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'96) [-8], pages 241-249.
URL: BASE/96/KaLo96:issac.ps.gz
86: Ú. Erlingsson, E. Kaltofen, and D. Musser.
Generic Gram-Schmidt orthogonalization by exact division.
In Proc. 1996 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'96) [-8], pages 275-282.
URL: BASE/96/EKM96.ps.gz
85: E. Kaltofen.
Effective Noether irreducibility forms and applications.
J. Comput. System Sci., 50(2):274-295, 1995.
URL: BASE/95/Ka95:jcss.ps.gz
84: A. Díaz, M. Hitz, E. Kaltofen, A. Lobo, and T. Valente.
Process scheduling in DSC and the large sparse linear systems challenge.
J. Symbolic Comput., 19(1-3):269-282, 1995.
URL: BASE/95/DHKLV95.ps.gz
83: M. A. Hitz and E. Kaltofen.
Integer division in residue number systems.
IEEE Trans. Computers, 44(8):983-989, 1995.
URL: BASE/95/HiKa95.ps.gz
82: E. Kaltofen and V. Shoup.
Subquadratic-time factoring of polynomials over finite fields.
In Proc. 27th Annual ACM Symp. Theory Comput., pages 398-406, New York, N.Y., 1995. ACM Press.
Journal version [97].
URL: BASE/95/KaSh95.ps.gz Talk: BASE/95/stoc95.ps.gz
81: A. Díaz and E. Kaltofen.
On computing greatest common divisors with polynomials given by black boxes for their evaluation.
In Proc. 1995 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'95) [-10], pages 232-239.
URL: BASE/95/DiKa95.ps.gz
80: E. Kaltofen.
Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems.
Math. Comput., 64(210):777-806, 1995.
URL: BASE/95/Ka95:mathcomp.ps.gz
79: M. Samadani and E. Kaltofen.
Prediction based task scheduling in distributed computing.
In Proc. 14th Annual ACM Symp. Principles Distrib. Comput., page 261, New York, N. Y., 1995. ACM Press.
Brief announcement of [78,88].
78: M. Samadani and E. Kaltofen.
Prediction based task scheduling in distributed computing.
In B. K. Szymanski and B. Sinharoy, editors, Languages, Compilers and Run-Time Systems for Scalable Computers, pages 317-320, Boston, 1996. Kluwer Academic Publ.
Poster session paper of [88].
URL: BASE/95/SaKa95:poster.ps.gz
77: E. Kaltofen.
Asymptotically fast solution of Toeplitz-like singular linear systems.
In ISSAC'94 [-11], pages 297-304.
Journal version in [80].
URL: BASE/94/Ka94:issac.ps.gz Talk: BASE/94/issac94.ps.gz
76: E. Kaltofen and A. Lobo.
Factoring high-degree polynomials by the black box Berlekamp algorithm.
In ISSAC'94 [-11], pages 90-98.
URL: BASE/94/KaLo94.ps.gz
75: K. C. Chan, A. Díaz, and E. Kaltofen.
A distributed approach to problem solving in Maple.
In R. J. Lopez, editor, Maple V: Mathematics and its Application, Proceedings of the Maple Summer Workshop and Symposium (MSWS'94), pages 13-21, Boston, 1994. Birkhäuser.
URL: BASE/94/CDK94.ps.gz
74: E. Kaltofen and V. Pan.
Parallel solution of Toeplitz and Toeplitz-like linear systems over fields of small positive characteristic.
In Proc. First Internat. Symp. Parallel Symbolic Comput. PASCO '94 [-12], pages 225-233.
URL: BASE/94/KaPa94.ps.gz
73: E. Kaltofen.
Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor.
SIGSAM Bulletin, 27(4):2, 1993.
URL: BASE/93/Ka93:sambull.ps.gz
72: E. Kaltofen.
Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems.
In G. Cohen, T. Mora, and O. Moreno, editors, Proc. AAECC-10, volume 673 of Lect. Notes Comput. Sci., pages 195-212, Heidelberg, Germany, 1993. Springer Verlag.
Journal version in [80].
URL: BASE/93/Ka93:aaecc.ps.gz Talk: BASE/93/oberwolfach.ps.gz
71: A. Díaz, M. Hitz, E. Kaltofen, A. Lobo, and T. Valente.
Process scheduling in DSC and the large sparse linear systems challenge.
In A. Miola, editor, Proc. DISCO '93, volume 722 of Lect. Notes Comput. Sci., pages 66-80, Heidelberg, Germany, 1993. Springer Verlag.
Journal version in [84].
URL: BASE/93/DHKLV93.ps.gz
70: E. Kaltofen.
Dynamic parallel evaluation of computation DAGs.
In J. Reif, editor, Synthesis of Parallel Algorithms, pages 723-758. Morgan Kaufmann Publ., San Mateo, California, 1993.
URL: BASE/93/Ka93:synthesis.ps.gz
69: E. Kaltofen.
Computational differentiation and algebraic complexity theory.
In C. H. Bischof, A. Griewank, and P. M. Khademi, editors, Workshop Report on First Theory Institute on Computational Differentiation, volume ANL/MCS-TM-183 of Tech. Rep., pages 28-30, Argonne, Illinois, December 1993. Argonne National Laboratory.
URL: BASE/93/Ka93:diff.ps.gz
68: E. Kaltofen.
Polynomial factorization 1987-1991.
In I. Simon, editor, Proc. LATIN '92, volume 583 of Lect. Notes Comput. Sci., pages 294-313, Heidelberg, Germany, 1992. Springer Verlag.
URL: BASE/92/Ka92:latin.ps.gz
67: E. Kaltofen.
On computing determinants of matrices without divisions.
In Proc. 1992 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'92) [-9], pages 342-349.
URL: BASE/92/Ka92:issac.ps.gz
66: E. Kaltofen and V. Pan.
Processor-efficient parallel solution of linear systems II: the positive characteristic and singular cases.
In Proc. 33rd Annual Symp. Foundations of Comp. Sci., pages 714-723, Los Alamitos, California, 1992. IEEE Computer Society Press.
URL: BASE/92/KaPa92.pdf
65: E. Kaltofen.
Efficient solution of sparse linear systems.
Lect. Notes, Rensselaer Polytechnic Instit., Dept. Comput. Sci., Troy, New York, 1992.
64: D. G. Cantor and E. Kaltofen.
On fast multiplication of polynomials over arbitrary algebras.
Acta Inform., 28(7):693-701, 1991.
URL: BASE/91/CaKa91.ps.gz
63: E. Kaltofen.
Effective Noether irreducibility forms and applications.
In Proc. 22nd Annual ACM Symp. Theory Comput., pages 54-63, New York, N.Y., 1991. ACM Press.
Full version in [85].
62: E. Kaltofen and V. Pan.
Processor efficient parallel solution of linear systems over an abstract field.
In Proc. SPAA '91 3rd Ann. ACM Symp. Parallel Algor. Architecture, pages 180-191, New York, N.Y., 1991. ACM Press.
URL: BASE/91/KaPa91.pdf
61: A. Díaz, E. Kaltofen, K. Schmitz, and T. Valente.
DSC A system for distributed symbolic computation.
In Proc. 1991 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'91) [-13], pages 323-332.
URL: BASE/91/DKSV91.ps.gz
60: E. Kaltofen and N. Yui.
Explicit construction of Hilbert class fields of imaginary quadratic fields by integer lattice reduction.
In D. V. Chudnovsky, G. V. Chudnovsky, H. Cohn, and M. B. Nathanson, editors, Number Theory New York Seminar 1989-1990, pages 150-202. Springer Verlag, Heidelberg, Germany, 1991.
URL: BASE/91/KaYui91.pdf
59: E. Kaltofen and M. F. Singer.
Size efficient parallel algebraic circuits for partial derivatives.
In D. V. Shirkov, V. A. Rostovtsev, and V. P. Gerdt, editors, IV International Conference on Computer Algebra in Physical Research, pages 133-145, Singapore, 1991. World Scientific Publ. Co.
URL: BASE/91/KaSi91.ps.gz
58: E. Kaltofen and B. D. Saunders.
On Wiedemann's method of solving sparse linear systems.
In H. F. Mattson, T. Mora, and T. R. N. Rao, editors, Proc. AAECC-9, volume 539 of Lect. Notes Comput. Sci., pages 29-38, Heidelberg, Germany, 1991. Springer Verlag.
URL: BASE/91/KaSa91.ps.gz Talk: BASE/91/aaecc.ps.gz
57: E. Kaltofen and B. Trager.
Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators.
J. Symbolic Comput., 9(3):301-320, 1990.
URL: BASE/90/KaTr90.ps.gz
56: E. Kaltofen.
Polynomial factorization 1982-1986.
In D. V. Chudnovsky and R. D. Jenks, editors, Computers in Mathematics, volume 125 of Lecture Notes in Pure and Applied Mathematics, pages 285-309. Marcel Dekker, Inc., New York, N. Y., 1990.
URL: BASE/90/Ka90:survey.ps.gz
55: E. Kaltofen.
Computing the irreducible real factors and components of an algebraic curve.
Applic. Algebra Engin. Commun. Comput., 1(2):135-148, 1990.
URL: BASE/90/Ka90:aaecc.ps.gz
54: E. Kaltofen, M. S. Krishnamoorthy, and B. D. Saunders.
Parallel algorithms for matrix normal forms.
Linear Algebra and Applications, 136:189-208, 1990.
URL: BASE/90/KKS90.ps.gz
53: E. Kaltofen, Lakshman Y. N., and J. M. Wiley.
Modular rational sparse multivariate polynomial interpolation.
In S. Watanabe and M. Nagata, editors, Proc. 1990 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'90), pages 135-139. ACM Press, 1990.
URL: BASE/90/KLW90.ps.gz
52: D. Rebne and E. Kaltofen.
Computer mathematics systems and a trilateral approach to human resource development in technical occupations.
In N. Estes, J. Heene, and D. Leclercq, editors, Proc. 7th International Conference on Technology and Education, volume 1, pages 251-253, Edinburgh, United Kingdom, 1990. CEP Consultants Ltd.
51: E. Kaltofen, editor.
Algebraic Computational Complexity.
Academic Press, London, October 1990.
Special issue volume 9, number 3 (March 1990) of J. Symbolic Comput.
50: E. Kaltofen.
Computing the irreducible real factors and components of an algebraic curve.
In Proc. 5th Symp. Comput. Geometry, pages 79-87. ACM Press, 1989.
Journal version in [55].
49: E. Kaltofen and S. M. Watt, editors.
Computers and Mathematics.
Springer Verlag, Heidelberg, Germany, 1989.
48: E. Kaltofen, T. Valente, and N. Yui.
An improved Las Vegas primality test.
In Proc. 1989 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'89) [-14], pages 26-33.
URL: BASE/89/KVY89.ps.gz
47: J. Canny, E. Kaltofen, and Lakshman Yagati.
Solving systems of non-linear polynomial equations faster.
In Proc. 1989 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'89) [-14], pages 121-128.
URL: BASE/89/CKL89.ps.gz
46: E. Kaltofen.
Parallel algebraic algorithm design.
Lect. Notes, Rensselaer Polytechnic Instit., Dept. Comput. Sci., Troy, New York, July 1989.
Tutorial at 1989 Internat. Symp. Symb. Algebraic Comput., Portland, Oregon; contains [45].
URL: BASE/89/Ka89:parallel.ps.gz
45: E. Kaltofen.
Processor efficient parallel computation of polynomial greatest common divisors.
Unpublished paper included in [46], July 1989.
URL: BASE/89/Ka89:gcd.ps.gz
44: E. Kaltofen and H. Rolletschek.
Computing greatest common divisors and factorizations in quadratic number fields.
Math. Comput., 53(188):697-720, 1989.
URL: BASE/89/KaRo89.ps.gz
43: E. Kaltofen, M. S. Krishnamoorthy, and B. D. Saunders.
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith normal form of polynomial matrices.
In J. H. Davenport, editor, Proc. EUROCAL '87, volume 378 of Lect. Notes Comput. Sci., pages 317-322, Heidelberg, Germany, 1989. Springer Verlag.
Journal version in [54].
42: E. Kaltofen.
Factorization of polynomials given by straight-line programs.
In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 375-412. JAI Press Inc., Greenwhich, Connecticut, 1989.
URL: BASE/89/Ka89:slpfac.ps.gz
41: B. Gregory and E. Kaltofen.
Analysis of the binary complexity of asymptotically fast algorithms for linear system solving.
SIGSAM Bulletin, 22(2):41-49, April 1988.
40: T. S. Freeman, G. Imirzian, E. Kaltofen, and Lakshman Yagati.
DAGWOOD: A system for manipulating polynomials given by straight-line programs.
ACM Trans. Math. Software, 14(3):218-240, 1988.
URL: BASE/88/FIKY88.ps.gz
39: E. Kaltofen.
Greatest common divisors of polynomials given by straight-line programs.
J. ACM, 35(1):231-264, 1988.
URL: BASE/88/Ka88:jacm.ps.gz
38: E. Kaltofen and Lakshman Yagati.
Improved sparse multivariate polynomial interpolation algorithms.
In Symbolic Algebraic Comput. Internat. Symp. ISSAC '88 Proc. [-15], pages 467-474.
URL: BASE/88/KaLa88.ps.gz
37: G. L. Miller, V. Ramachandran, and E. Kaltofen.
Efficient parallel evaluation of straight-line code and arithmetic circuits.
SIAM J. Comput., 17(4):687-695, 1988.
URL: BASE/88/MRK88.ps.gz
36: E. Kaltofen and B. Trager.
Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators.
In Proc. 29th Annual Symp. Foundations of Comp. Sci., pages 296-305. IEEE, 1988.
Journal version in [57]. Talk: BASE/88/focs88.ps.gz
35: E. Kaltofen.
Deterministic irreducibility testing of polynomials over large finite fields.
J. Symbolic Comput., 4:77-82, 1987.
URL: BASE/87/Ka87:jsc.ps.gz
34: E. Kaltofen.
Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials.
In Proc. 19th Annual ACM Symp. Theory Comput., pages 443-452. ACM, 1987.
URL: BASE/87/Ka87:stoc.ps.gz
33: E. Kaltofen.
Computer algebra algorithms.
In J. F. Traub, editor, Annual Review in Computer Science, volume 2, pages 91-118. Annual Reviews Inc., Palo Alto, California, 1987.
URL: BASE/87/Ka87:annrev.ps.gz
32: E. Kaltofen, M. S. Krishnamoorthy, and B. D. Saunders.
Fast parallel computation of Hermite and Smith forms of polynomial matrices.
SIAM J. Alg. Discrete Math., 8:683-690, 1987.
URL: BASE/87/KKS87.ps.gz
31: E. Kaltofen.
Uniform closure properties of p-computable functions.
In Proc. 18th Annual ACM Symp. Theory Comput., pages 330-337. ACM, 1986.
Also published as part of [39] and [42].
30: E. Kaltofen, M. S. Krishnamoorthy, and B. D. Saunders.
Fast parallel algorithms for similarity of matrices.
In Proc. 1986 Symp. Symbolic Algebraic Comput. (Symsac '86) [-16], pages 65-70.
Journal version in [32] and [54].
29: T. S. Freeman, G. Imirzian, E. Kaltofen, and Lakshman Yagati.
DAGWOOD: A system for manipulating polynomials given by straight-line programs.
In Proc. 1986 Symp. Symbolic Algebraic Comput. (Symsac '86) [-16], pages 169-175.
Journal version in [40].
28: G. L. Miller, V. Ramachandran, and E. Kaltofen.
Efficient parallel evaluation of straight-line code and arithmetic circuits.
In Proc. Second International Workshop on Parallel Computing and VLSI - AWOC '86, volume 227 of Lect. Notes Comput. Sci., pages 236-245, 1986.
Journal version in [37].
27: J. von zur Gathen and E. Kaltofen.
Factoring multivariate polynomials over finite fields.
Math. Comput., 45:251-261, 1985.
URL: BASE/85/GaKa85:mathcomp.ps.gz
26: J. von zur Gathen and E. Kaltofen.
Factoring sparse multivariate polynomials.
J. Comput. System Sci., 31:265-287, 1985.
25: E. Kaltofen.
Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization.
SIAM J. Comput., 14(2):469-489, 1985.
URL: BASE/85/Ka85:sicomp.ps.gz
24: E. Kaltofen.
Computing with polynomials given by straight-line programs I; greatest common divisors.
In Proc. 17th Annual ACM Symp. Theory Comput., pages 131-142. ACM, 1985.
Also published as part of [39] and [42].
23: E. Kaltofen.
Sparse Hensel lifting.
In EUROCAL 85 European Conf. Comput. Algebra Proc. Vol. 2 [-17], pages 4-17.
Proofs in [22].
URL: BASE/85/Ka85:eurocal.pdf
22: E. Kaltofen.
Sparse Hensel lifting.
Technical Report 85-12, Rensselaer Polytechnic Instit., Dept. Comput. Sci., Troy, N. Y., 1985.
URL: BASE/85/Ka85:techrep.pdf
21: E. Kaltofen and H. Rolletschek.
Computing greatest common divisors and factorizations in quadratic number fields.
In EUROCAL 85 European Conf. Comput. Algebra Proc. Vol. 2 [-17], pages 279-288.
Journal version in [44].
20: E. Kaltofen.
Computing with polynomials given by straight-line programs II; sparse factorization.
In Proc. 26th Annual Symp. Foundations of Comp. Sci., pages 451-458. IEEE, 1985.
URL: BASE/85/Ka85:focs.ps.gz
19: E. Kaltofen.
Fast parallel absolute irreducibility testing.
J. Symbolic Comput., 1(1):57-67, 1985.
Misprint corrections: J. Symbolic Comput. vol. 9, p. 320 (1989).
URL: BASE/85/Ka85:jsc.ps.gz
18: E. Kaltofen.
Effective Hilbert irreducibility.
Information and Control, 66:123-137, 1985.
URL: BASE/85/Ka85:infcontr.ps.gz
17: E. Kaltofen and V. Pan.
The integer manipulation techniques can compete with the linear algebra methods for solving sparse linear systems.
Tech. Rep. 85-6, State Univ. of New York at Albany, Comp. Sci. Dept., 1985.
16: E. Kaltofen.
The algebraic theory of integration.
Lect. Notes, Rensselaer Polytechnic Instit., Dept. Comput. Sci., Troy, New York, 1984.
URL: BASE/84/Ka84:integration.ps.gz
15: E. Kaltofen.
Effective Hilbert irreducibility.
In Proc. EUROSAM '84 [-18], pages 275-284.
Journal version in [18].
14: E. Kaltofen and N. Yui.
Explicit construction of the Hilbert class field of imaginary quadratic fields with class number 7 and 11.
In Proc. EUROSAM '84 [-18], pages 310-320.
URL: BASE/84/KaYui84:eurosam.ps.gz
13: E. Kaltofen.
A note on the Risch differential equation.
In Proc. EUROSAM '84 [-18], pages 359-366.
URL: BASE/84/Ka84:risch.ps.gz
12: E. Kaltofen and N. Yui.
The modular equation of order 11.
In Third Macsyma Users' Conference, pages 472-485. General Electric, 1984.
11: E. Kaltofen.
On a theorem by R. Dedekind.
In H. W. Lenstra, Jr., J. K. Lenstra, and P. van Emde Boas, editors, DOPO LE PAROLE. Album in Honor of A. K. Lenstra's Doctorate, Amsterdam, May 1984.
10: E. Kaltofen.
On the complexity of finding short vectors in integer lattices.
In Proc. EUROCAL '83, volume 162 of Lect. Notes Comput. Sci., pages 236-244, Heidelberg, Germany, 1983. Springer Verlag.
URL: BASE/83/Ka83:eurocal.ps.gz
9: J. von zur Gathen and E. Kaltofen.
Factoring multivariate polynomials over finite fields.
In Proc. 1983 ICALP, volume 154 of Lect. Notes Comput. Sci., pages 250-263, Heidelberg, Germany, 1983. Springer Verlag.
Journal version in [27].
8: E. Kaltofen, D. R. Musser, and B. D. Saunders.
A generalized class of polynomials that are hard to factor.
SIAM J. Comput., 12(3):473-485, 1983.
Also chapter 2.2 in [4].
7: E. Kaltofen.
Polynomial factorization.
In B. Buchberger, G. Collins, and R. Loos, editors, Computer Algebra, pages 95-113. Springer Verlag, Heidelberg, Germany, 2 edition, 1982.
URL: BASE/82/Ka82:survey.ps.gz
6: E. Kaltofen.
A polynomial-time reduction from bivariate to univariate integral polynomial factorization.
In Proc. 23rd Annual Symp. Foundations of Comp. Sci., pages 57-64. IEEE, 1982.
Journal version in [25].
URL: BASE/82/Ka82:focs.ps.gz
5: E. Kaltofen.
A polynomial reduction from multivariate to bivariate integral polynomial factorization.
In Proc. 14th Annual ACM Symp. Theory Comput., pages 261-266. ACM, 1982.
Journal version in [25].
4: E. Kaltofen.
On the complexity of factoring polynomials with integer coefficients.
PhD thesis, Rensselaer Polytechnic Instit., Troy, N. Y., December 1982.
See also [7,8,25].
URL: BASE/82/Ka82:thesis.pdf
3: E. Kaltofen, D. R. Musser, and B. D. Saunders.
A generalized class of polynomials that are hard to factor.
In Proc. 1981 ACM Symp. Symbolic and Algebraic Comput., pages 188-194. ACM, 1981.
Journal version in [8].
2: E. Kaltofen and S. K. Abdali.
An attributed LL(1) compilation of Pascal into the lambda-calculus.
Technical Report CS-8103, Rensselaer Polytechnic Instit., Math. Sci. Dept., Troy, N. Y., 1981.
1: E. Kaltofen.
LISP/370 under the Michigan Terminal System.
Rensselaer Polytechnic Instit., Math. Sci. Dept., Troy, N. Y., August 1980.

Books where papers are located
-1: Arjeh M. Cohen, Xiao-Shan Gao, and Nobuki Takayama, editors.
Proc. First Internat. Congress Math. Software ICMS 2002, Beijing, China, Singapore, 2002. World Scientific.
-2: T. Mora, editor.
ISSAC 2002 Proc. 2002 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 2002. ACM Press.
-3: Kiyoshi Shirayanagi and Kazuhiro Yokoyama, editors.
Computer Mathematics Proc. Fifth Asian Symposium (ASCM 2001), volume 9 of Lecture Notes Series on Computing, Singapore, 2001. World Scientific.
-4: C. Traverso, editor.
Internat. Symp. Symbolic Algebraic Comput. ISSAC 2000 Proc. 2000 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 2000. ACM Press.
-5: S. Dooley, editor.
ISSAC 99 Proc. 1999 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 1999. ACM Press.
-6: O. Gloor, editor.
ISSAC 98 Proc. 1998 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 1998. ACM Press.
-7: W. Küchlin, editor.
ISSAC 97 Proc. 1997 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 1997. ACM Press.
-8: Lakshman Y. N., editor.
ISSAC 96 Proc. 1996 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 1996. ACM Press.
-9: P. S. Wang, editor.
Internat. Symp. Symbolic Algebraic Comput. 92, New York, N. Y., 1992. ACM Press.
-10: A. H. M. Levelt, editor.
Proc. 1995 Internat. Symp. Symbolic Algebraic Comput. ISSAC'95, New York, N. Y., 1995. ACM Press.
-11: ISSAC '94 Proc. Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 1994. ACM Press.
-12: H. Hong, editor.
First Internat. Symp. Parallel Symbolic Comput. PASCO '94, Singapore, 1994. World Scientific Publishing Co.
-13: S. M. Watt, editor.
Proc. 1991 Internat. Symp. Symbolic Algebraic Comput. ISSAC'91, New York, N. Y., 1991. ACM Press.
-14: Proc. ACM-SIGSAM 1989 Internat. Symp. Symbolic Algebraic Comput. ISSAC `89, New York, N. Y., 1989. ACM Press.
-15: P. Gianni, editor.
Symbolic Algebraic Comput. Internat. Symp. ISSAC '88 Proc., volume 358 of Lect. Notes Comput. Sci., Heidelberg, Germany, 1988. Springer Verlag.
-16: B. W. Char, editor.
Proc. 1986 Symp. Symbolic Algebraic Comput. Symsac `86, New York, N. Y., 1986. ACM.
-17: B. F. Caviness, editor.
EUROCAL 85 European Conf. Comput. Algebra Proc. Vol. 2, Lect. Notes Comput. Sci., Heidelberg, Germany, 1985. Springer Verlag.
-18: J. Fitch, editor.
EUROSAM 84 Internat. Symp. Symbolic Algebraic Comput. Proc., Lect. Notes Comput. Sci., Heidelberg, Germany, 1984. Springer Verlag.

How to Access the Bib Files

What you read is made from the L^ATEX2e wrapper file BASE/kaltofen.tex using BIBTEX on my bibliography file BASE/kaltofen.bib. Note that my bibliography file is viewable by an html browser, although you may have to change the suffix to .html, or make a symbolic link/shortcut with a .html suffix to it. The locations of my papers are mirrored in the url fields, so that you can retrieve my papers by viewing the downloaded kaltofen.bib file in your browser. The talk field is used for links to talks that discuss the material in the papers, e.g., at the conferences where the papers were presented. If you reuse my transparencies, please acknowledge their origin. The wrapper file can be processed both by L^ATEX2e or by L^ATEX2HTML. A pdf file of this document is at BASE/kaltofen.pdf. The clickable links in the Reference section, which are only visible in the online document, are produced from ekurl and talk fields in the kaltofen.bib file using the bibliography style file BASE/unsrt_w_url.bst, which places the rawhtml directives for L^ATEX2HTML into the kaltofen.bbl file.

About this document ...

Publications by Erich Kaltofen This document was generated using the LaTeX2HTML translator Version 2002 (1.62) Copyright © 1993, 1994, 1995, 1996, Nikos Drakos, Computer Based Learning Unit, University of Leeds.
Copyright © 1997, 1998, 1999, Ross Moore, Mathematics Department, Macquarie University, Sydney. The command line arguments were:
latex2html -ascii_mode -split 0 -no_navigation kaltofen.tex The translation was initiated by Erich Kaltofen on 2002-12-15

Erich Kaltofen 2002-12-15

Publications by Erich Kaltofen Previous: Students Up: Resume TOC Next: Courses

Publications by Erich Kaltofen

Major Research Results

Polynomial Factorization

Polynomial-time algorithms for multivariate polynomial factorization with coefficients from a field [5,6,25,27] or the algebraic closure of a field [19,85]; deterministic polynomial-time irreducibility testing [35] and distinct degree factorization [109] of multivariate polynomials over a large finite field; computing the nearest multivariate polynomial with factor of constant degree and complex coefficients in polynomial time [105].
Polynomial-time sparse multivariate polynomial factorization algorithms by introducing the straight-line program [42,39,34,31,24,20] and the black box representations of polynomials [57,81].
Subquadratic-time polynomial factorization of univariate polynomials over a finite field [82,97]; asymptotically fastest polynomial factorization algorithm over high algebraic extensions of finite fields [93].

Linear Algebra

Processor-efficient parallel algorithms for solving general linear systems over a field [62,66].
Parallel algorithms for matrix canonical forms [32,54].
Probabilistic analysis [80] and implementation [76,89,102] of the block Wiedemann parallel sparse linear system solver.
Probabilistic analysis of the Lanczos sparse linear system solver over finite fields [94].
Fastest algorithm in terms of bit operations for the determinant of an integer matrix [110].

Divisions in Algebraic Complexity Theory

Polynomial-length separate computation of the numerator and denominator of a rational function given by a straight-line program [39].
Asymptotically fast multiplication of polynomials over a ring [64].
Fast division-free computation of the determinant and the characteristic polynomial of a matrix [67,110].
Integer division with remainder in residue number systems via Newton iteration [83].

Computational Number Theory

Use of Weber equations for the Hilbert class fields arising in the Goldwasser-Kilian/Atkin primality prover [14,12,48,60].

Symbolic/Numeric Computation

Stability of roots of polynomials with respect to coefficient perturbations [99,105].

Software

DAGWOOD: a system for manipulating polynomials given by straight-line programs [40]. The archive directory of the Lisp program source code is at BASE/../software/dagwood.
DSC: the distributed symbolic manipulation tool [61,71,75,79]. The archive directory of the C, C++, Lisp, and Maple program source code is at BASE/../software/dsc.
FOXBOX: a plug-and-play symbolic system component for objects in black box representation [98]. The archive directory of the C++ program source code and the NTL and Saclib library binaries (solaris and linux elf) is at BASE/../software/foxbox.
WiLiSS: an implementation of the block Wiedemann algorithm [84,102]. The archive directory of the C program source code is at BASE/../software/wiliss.
LINBOX: a generic library for exact black box linear algebra [115]. The homepage including downloads can be found at www.linalg.org.

Paper on Pedagogy and Significant Instructional Software

Undergraduate abstract algebra from a computational point of view [92]. The Mathematica packages and notebooks are at BASE/../courses/ ComputAlgebra/Mathematica.
A demonstration implementation in Maple of the RSA public crypto system is at BASE/../software/rsa.
A demonstration package in Maple of algorithms in linear algebra is at BASE/../courses/ LinAlgebra/Maple/RefPkg/ (see README.html).
An STL-like implementation in C++ of the container class binary search tree is at BASE/../courses/ DataStruct/C++Examples/BinSearchTree.
A C++ implementation of common sorting algorithms is at BASE/../courses/ DataStruct/C++Examples/Sorting.

Surveys

Three surveys on polynomial factorization [68,56,7].
Three surveys on algebraic algorithms [101,95,33].
A survey on sparse linear systems [90] and one on the computational complexity of matrix determinants [114].
A list of open problems [106].
A survey on parallelizing straight-line programs [70].

Bibliography

119: L. Chen, W. Eberly, E. Kaltofen, B. D. Saunders, W. J. Turner, and G. Villard.
Efficient matrix preconditioners for black box linear algebra.
Linear Algebra and Applications, 343-344:119-146, 2002.
Special issue on Structured and Infinite Systems of Linear Equations, edited by P. Dewilde, V. Olshevsky and A. H. Sayed.
URL: BASE/2K/CEKSTV02.pdf
118: Mark Giesbrecht, Erich Kaltofen, and Wen-shin Lee.
Algorithms for computing the sparsest shifts for polynomials via the Berlekamp/Massey algorithm.
In Proc. 2002 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'02) [-2], pages 101-108.
URL: BASE/02/GKL02.pdf Talk: BASE/02/issaclee.pdf (given by Wen-shin Lee)
117: Erich Kaltofen.
An output-sensitive variant of the baby steps/giant steps determinant algorithm.
In Proc. 2002 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'02) [-2], pages 138-144.
URL: BASE/02/Ka02.pdf Talk: BASE/02/issac.pdf
116: J. Grabmeier, E. Kaltofen, and V. Weispfenning, editors.
Computer Algebra Handbook.
Springer Verlag, Heidelberg, Germany, 2002.
637 + xx pages + CD-ROM. Includes E. Kaltofen and V. Weispfenning §1.4 Computer algebra - impact on research, pages 4-6; E. Kaltofen §2.2.3 Absolute factorization of polynomials, page 26; E. Kaltofen and B. D. Saunders §2.3.1 Linear systems, pages 36-38; R. M. Corless, E. Kaltofen and S. M. Watt §2.12.3 Hybrid methods, pages 112-125; E. Kaltofen §4.2.17 FoxBox and other blackbox systems, pages 383-385.
URL: BASE/01/symnum.pdf (§2.12.3)
115: J.-G. Dumas, T. Gautier, M. Giesbrecht, P. Giorgi, B. Hovinen, E. Kaltofen, B. D. Saunders, W. J. Turner, and G. Villard.
LinBox: A generic library for exact linear algebra.
In Proc. First Internat. Congress Math. Software ICMS 2002, Beijing, China [-1], pages 40-50.
URL: BASE/02/Detal02.pdf
114: E. Kaltofen and G. Villard.
Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
J. Computational Applied Math., 2002.
To appear, 17 pages. Special issue on Congrès International Algèbre Linéaire et Arithmétique: Calcul Numérique, Symbolique et Parallèle, held in Rabat, Morocco, May 2001.
URL: BASE/02/KaVi02.pdf
113: Erich Kaltofen, Michael McLean, and Larry Norris.
`Using Maple to grade Maple' assessment software from North Carolina State University.
In Proceedings 2002 Maple Workshop, Waterloo, Canada, 2002. Waterloo Maple Inc.
With Dmitriy Morozov, John May and William Turner.
URL: BASE/02/KMN02.pdf
112: Erich Kaltofen and Wen-shin Lee.
Early termination in sparse interpolation algorithms.
Paper submitted, 37 pages, 2002.
111: Mark Giesbrecht, Erich Kaltofen, and Wen-shin Lee.
Algorithms for computing sparsest shifts of polynomials in standard, Chebychev, and Pochhammer bases.
Paper submitted, 28 pages, 2002.
110: E. Kaltofen and G. Villard.
On the complexity of computing determinants.
In Proc. Fifth Asian Symposium on Computer Mathematics (ASCM 2001) [-3], pages 13-27.
Invited contribution; extended abstract.
URL: BASE/01/KaVi01.pdf Maple 6 worksheet: BASE/01/KaVi01.mws
109: Shuhong Gao, E. Kaltofen, and A. Lauder.
Deterministic distinct degree factorization for polynomials over finite fields.
Paper submitted, 10 pages, 2001.
URL: BASE/01/GKL01.pdf
108: E. Kaltofen.
Algorithms for sparse and black box matrices over finite fields (invited talk).
Bibliography for my talk on May 23, 2001 at the Sixth International Conference on Finite Fields and Applications (Fq6) in Oaxaca, Mexico, 6 pages, 2001.
URL: BASE/01/Ka01:Fq6.pdf
107: E. Kaltofen, W.-s. Lee, and A. A. Lobo.
Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm.
In Proc. 2000 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'00) [-4], pages 192-201.
URL: BASE/2K/KLL2K.pdf Talk: BASE/2K/issaclee.pdf (given by Wen-shin Lee)
106: E. Kaltofen.
Challenges of symbolic computation my favorite open problems.
J. Symbolic Comput., 29(6):891-919, 2000.
With an additional open problem by R. M. Corless and D. J. Jeffrey.
URL: BASE/2K/Ka2K.pdf Talk: BASE/lectures/lecture.html#eccadannapolis
105: M. A. Hitz, E. Kaltofen, and Lakshman Y. N.
Efficient algorithms for computing the nearest polynomial with a real root and related problems.
In Proc. 1999 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'99) [-5], pages 205-212.
URL: BASE/99/HKL99.ps.gz Talk: BASE/ lectures/lecture.html#snsclinz (given at SNSC'99)
104: L. Bernardin, B. Char, and E. Kaltofen.
Symbolic computation in Java: an appraisement.
In Proc. 1999 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'99) [-5], pages 237-244.
URL: BASE/99/BCK99.ps.gz Talk: BASE/99/bernardin.ps.gz (given by Laurent Bernadin)
103: E. Kaltofen and M. Monagan.
On the genericity of the modular polynomial GCD algorithm.
In Proc. 1999 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'99) [-5], pages 59-66.
URL: BASE/99/KaMo99.ps.gz Talk: BASE/99/issac1.ps.gz, BASE/99/issac2.ps.gz
102: E. Kaltofen and A. Lobo.
Distributed matrix-free solution of large sparse linear systems over finite fields.
Algorithmica, 24(3-4):331-348, July-Aug. 1999.
Special Issue on ``Coarse Grained Parallel Algorithms''.
URL: BASE/98/KaLo99.ps.gz
101: A. Díaz, I. Emiris, E. Kaltofen, and V. Pan.
Algebraic algorithms.
In M. J. Atallah, editor, Algorithms & Theory of Computation Handbook, pages 16.1-16.27. CRC Press, Boca Raton, Florida, 1999.
URL: BASE/99/DEKP99.ps.gz
100: H. Hong, E. Kaltofen, and M. Singer, editors.
East Coast Computer Algebra Day '99 (April 24, 1999) Abstracts of invited talks and presented posters.
SIGSAM Bulletin, 23(2):43-52, June 1999.
99: M. A. Hitz and E. Kaltofen.
Efficient algorithms for computing the nearest polynomial with constrained roots.
In Proc. 1998 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'98) [-6], pages 236-243.
URL: BASE/98/HiKa98.ps.gz Talk: BASE/98/issac2.ps.gz, realaudio (2.3M)
98: A. Díaz and E. Kaltofen.
FOXBOX a system for manipulating symbolic objects in black box representation.
In Proc. 1998 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'98) [-6], pages 30-37.
URL: BASE/98/DiKa98.ps.gz Talk: BASE/98/issac1.ps.gz
97: E. Kaltofen and V. Shoup.
Subquadratic-time factoring of polynomials over finite fields.
Math. Comput., 67(223):1179-1197, July 1998.
URL: BASE/98/KaSh98.ps.gz
96: M. A. Hitz and E. Kaltofen.
The Kharitonov theorem and its applications in symbolic mathematical computation.
Unpublished paper, North Carolina State Univ., Dept. Math., May 1997.
URL: BASE/97/HiKa97:kharit.ps.gz
95: A. Díaz, E. Kaltofen, and V. Pan.
Algebraic algorithms.
In A. B. Tucker, editor, The Computer Science and Engineering Handbook, chapter 10, pages 226-248. CRC Press, Boca Raton, Florida, 1997.
Expanded version in [101].
URL: BASE/97/DKP97.ps.gz
94: W. Eberly and E. Kaltofen.
On randomized Lanczos algorithms.
In Proc. 1997 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'97) [-7], pages 176-183.
URL: BASE/97/EbKa97.ps.gz
93: E. Kaltofen and V. Shoup.
Fast polynomial factorization over high algebraic extensions of finite fields.
In Proc. 1997 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'97) [-7], pages 184-188.
URL: BASE/97/KaSh97.ps.gz Talk: BASE/97/issac97a.ps.gz, BASE/97/issac97b.ps.gz
92: E. Kaltofen.
Teaching computational abstract algebra.
J. Symbolic Comput., 23(5-6):503-515, 1997.
Special issue on education, L. Lambe, editor.
URL: BASE/97/Ka97:jsc.ps.gz
91: M. Hitz and E. Kaltofen, editors.
Proc. Second Internat. Symp. Parallel Symbolic Comput. PASCO '97, New York, N. Y., 1997. ACM Press.
90: E. Kaltofen.
Blocked iterative sparse linear system solvers for finite fields.
In C. Roucairol, editor, Proc. Symp. Parallel Comput. Solving Large Scale Irregular Applic. (Stratagem '96), pages 91-95, Sophia Antipolis, France, 1996. INRIA.
URL: BASE/96/Ka96:stratagem.ps.gz
89: E. Kaltofen and A. Lobo.
Distributed matrix-free solution of large sparse linear systems over finite fields.
In A. M. Tentner, editor, Proc. High Performance Computing '96, pages 244-247, San Diego, CA, 1996. Society for Computer Simulation, Simulation Councils, Inc.
Journal version [102].
URL: BASE/96/KaLo96:hpc.ps.gz
88: M. Samadani and E. Kaltofen.
On distributed scheduling using load prediction from past information.
Unpublished paper, 1996.
87: E. Kaltofen and A. Lobo.
On rank properties of Toeplitz matrices over finite fields.
In Proc. 1996 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'96) [-8], pages 241-249.
URL: BASE/96/KaLo96:issac.ps.gz
86: Ú. Erlingsson, E. Kaltofen, and D. Musser.
Generic Gram-Schmidt orthogonalization by exact division.
In Proc. 1996 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'96) [-8], pages 275-282.
URL: BASE/96/EKM96.ps.gz
85: E. Kaltofen.
Effective Noether irreducibility forms and applications.
J. Comput. System Sci., 50(2):274-295, 1995.
URL: BASE/95/Ka95:jcss.ps.gz
84: A. Díaz, M. Hitz, E. Kaltofen, A. Lobo, and T. Valente.
Process scheduling in DSC and the large sparse linear systems challenge.
J. Symbolic Comput., 19(1-3):269-282, 1995.
URL: BASE/95/DHKLV95.ps.gz
83: M. A. Hitz and E. Kaltofen.
Integer division in residue number systems.
IEEE Trans. Computers, 44(8):983-989, 1995.
URL: BASE/95/HiKa95.ps.gz
82: E. Kaltofen and V. Shoup.
Subquadratic-time factoring of polynomials over finite fields.
In Proc. 27th Annual ACM Symp. Theory Comput., pages 398-406, New York, N.Y., 1995. ACM Press.
Journal version [97].
URL: BASE/95/KaSh95.ps.gz Talk: BASE/95/stoc95.ps.gz
81: A. Díaz and E. Kaltofen.
On computing greatest common divisors with polynomials given by black boxes for their evaluation.
In Proc. 1995 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'95) [-10], pages 232-239.
URL: BASE/95/DiKa95.ps.gz
80: E. Kaltofen.
Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems.
Math. Comput., 64(210):777-806, 1995.
URL: BASE/95/Ka95:mathcomp.ps.gz
79: M. Samadani and E. Kaltofen.
Prediction based task scheduling in distributed computing.
In Proc. 14th Annual ACM Symp. Principles Distrib. Comput., page 261, New York, N. Y., 1995. ACM Press.
Brief announcement of [78,88].
78: M. Samadani and E. Kaltofen.
Prediction based task scheduling in distributed computing.
In B. K. Szymanski and B. Sinharoy, editors, Languages, Compilers and Run-Time Systems for Scalable Computers, pages 317-320, Boston, 1996. Kluwer Academic Publ.
Poster session paper of [88].
URL: BASE/95/SaKa95:poster.ps.gz
77: E. Kaltofen.
Asymptotically fast solution of Toeplitz-like singular linear systems.
In ISSAC'94 [-11], pages 297-304.
Journal version in [80].
URL: BASE/94/Ka94:issac.ps.gz Talk: BASE/94/issac94.ps.gz
76: E. Kaltofen and A. Lobo.
Factoring high-degree polynomials by the black box Berlekamp algorithm.
In ISSAC'94 [-11], pages 90-98.
URL: BASE/94/KaLo94.ps.gz
75: K. C. Chan, A. Díaz, and E. Kaltofen.
A distributed approach to problem solving in Maple.
In R. J. Lopez, editor, Maple V: Mathematics and its Application, Proceedings of the Maple Summer Workshop and Symposium (MSWS'94), pages 13-21, Boston, 1994. Birkhäuser.
URL: BASE/94/CDK94.ps.gz
74: E. Kaltofen and V. Pan.
Parallel solution of Toeplitz and Toeplitz-like linear systems over fields of small positive characteristic.
In Proc. First Internat. Symp. Parallel Symbolic Comput. PASCO '94 [-12], pages 225-233.
URL: BASE/94/KaPa94.ps.gz
73: E. Kaltofen.
Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor.
SIGSAM Bulletin, 27(4):2, 1993.
URL: BASE/93/Ka93:sambull.ps.gz
72: E. Kaltofen.
Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems.
In G. Cohen, T. Mora, and O. Moreno, editors, Proc. AAECC-10, volume 673 of Lect. Notes Comput. Sci., pages 195-212, Heidelberg, Germany, 1993. Springer Verlag.
Journal version in [80].
URL: BASE/93/Ka93:aaecc.ps.gz Talk: BASE/93/oberwolfach.ps.gz
71: A. Díaz, M. Hitz, E. Kaltofen, A. Lobo, and T. Valente.
Process scheduling in DSC and the large sparse linear systems challenge.
In A. Miola, editor, Proc. DISCO '93, volume 722 of Lect. Notes Comput. Sci., pages 66-80, Heidelberg, Germany, 1993. Springer Verlag.
Journal version in [84].
URL: BASE/93/DHKLV93.ps.gz
70: E. Kaltofen.
Dynamic parallel evaluation of computation DAGs.
In J. Reif, editor, Synthesis of Parallel Algorithms, pages 723-758. Morgan Kaufmann Publ., San Mateo, California, 1993.
URL: BASE/93/Ka93:synthesis.ps.gz
69: E. Kaltofen.
Computational differentiation and algebraic complexity theory.
In C. H. Bischof, A. Griewank, and P. M. Khademi, editors, Workshop Report on First Theory Institute on Computational Differentiation, volume ANL/MCS-TM-183 of Tech. Rep., pages 28-30, Argonne, Illinois, December 1993. Argonne National Laboratory.
URL: BASE/93/Ka93:diff.ps.gz
68: E. Kaltofen.
Polynomial factorization 1987-1991.
In I. Simon, editor, Proc. LATIN '92, volume 583 of Lect. Notes Comput. Sci., pages 294-313, Heidelberg, Germany, 1992. Springer Verlag.
URL: BASE/92/Ka92:latin.ps.gz
67: E. Kaltofen.
On computing determinants of matrices without divisions.
In Proc. 1992 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'92) [-9], pages 342-349.
URL: BASE/92/Ka92:issac.ps.gz
66: E. Kaltofen and V. Pan.
Processor-efficient parallel solution of linear systems II: the positive characteristic and singular cases.
In Proc. 33rd Annual Symp. Foundations of Comp. Sci., pages 714-723, Los Alamitos, California, 1992. IEEE Computer Society Press.
URL: BASE/92/KaPa92.pdf
65: E. Kaltofen.
Efficient solution of sparse linear systems.
Lect. Notes, Rensselaer Polytechnic Instit., Dept. Comput. Sci., Troy, New York, 1992.
64: D. G. Cantor and E. Kaltofen.
On fast multiplication of polynomials over arbitrary algebras.
Acta Inform., 28(7):693-701, 1991.
URL: BASE/91/CaKa91.ps.gz
63: E. Kaltofen.
Effective Noether irreducibility forms and applications.
In Proc. 22nd Annual ACM Symp. Theory Comput., pages 54-63, New York, N.Y., 1991. ACM Press.
Full version in [85].
62: E. Kaltofen and V. Pan.
Processor efficient parallel solution of linear systems over an abstract field.
In Proc. SPAA '91 3rd Ann. ACM Symp. Parallel Algor. Architecture, pages 180-191, New York, N.Y., 1991. ACM Press.
URL: BASE/91/KaPa91.pdf
61: A. Díaz, E. Kaltofen, K. Schmitz, and T. Valente.
DSC A system for distributed symbolic computation.
In Proc. 1991 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'91) [-13], pages 323-332.
URL: BASE/91/DKSV91.ps.gz
60: E. Kaltofen and N. Yui.
Explicit construction of Hilbert class fields of imaginary quadratic fields by integer lattice reduction.
In D. V. Chudnovsky, G. V. Chudnovsky, H. Cohn, and M. B. Nathanson, editors, Number Theory New York Seminar 1989-1990, pages 150-202. Springer Verlag, Heidelberg, Germany, 1991.
URL: BASE/91/KaYui91.pdf
59: E. Kaltofen and M. F. Singer.
Size efficient parallel algebraic circuits for partial derivatives.
In D. V. Shirkov, V. A. Rostovtsev, and V. P. Gerdt, editors, IV International Conference on Computer Algebra in Physical Research, pages 133-145, Singapore, 1991. World Scientific Publ. Co.
URL: BASE/91/KaSi91.ps.gz
58: E. Kaltofen and B. D. Saunders.
On Wiedemann's method of solving sparse linear systems.
In H. F. Mattson, T. Mora, and T. R. N. Rao, editors, Proc. AAECC-9, volume 539 of Lect. Notes Comput. Sci., pages 29-38, Heidelberg, Germany, 1991. Springer Verlag.
URL: BASE/91/KaSa91.ps.gz Talk: BASE/91/aaecc.ps.gz
57: E. Kaltofen and B. Trager.
Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators.
J. Symbolic Comput., 9(3):301-320, 1990.
URL: BASE/90/KaTr90.ps.gz
56: E. Kaltofen.
Polynomial factorization 1982-1986.
In D. V. Chudnovsky and R. D. Jenks, editors, Computers in Mathematics, volume 125 of Lecture Notes in Pure and Applied Mathematics, pages 285-309. Marcel Dekker, Inc., New York, N. Y., 1990.
URL: BASE/90/Ka90:survey.ps.gz
55: E. Kaltofen.
Computing the irreducible real factors and components of an algebraic curve.
Applic. Algebra Engin. Commun. Comput., 1(2):135-148, 1990.
URL: BASE/90/Ka90:aaecc.ps.gz
54: E. Kaltofen, M. S. Krishnamoorthy, and B. D. Saunders.
Parallel algorithms for matrix normal forms.
Linear Algebra and Applications, 136:189-208, 1990.
URL: BASE/90/KKS90.ps.gz
53: E. Kaltofen, Lakshman Y. N., and J. M. Wiley.
Modular rational sparse multivariate polynomial interpolation.
In S. Watanabe and M. Nagata, editors, Proc. 1990 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'90), pages 135-139. ACM Press, 1990.
URL: BASE/90/KLW90.ps.gz
52: D. Rebne and E. Kaltofen.
Computer mathematics systems and a trilateral approach to human resource development in technical occupations.
In N. Estes, J. Heene, and D. Leclercq, editors, Proc. 7th International Conference on Technology and Education, volume 1, pages 251-253, Edinburgh, United Kingdom, 1990. CEP Consultants Ltd.
51: E. Kaltofen, editor.
Algebraic Computational Complexity.
Academic Press, London, October 1990.
Special issue volume 9, number 3 (March 1990) of J. Symbolic Comput.
50: E. Kaltofen.
Computing the irreducible real factors and components of an algebraic curve.
In Proc. 5th Symp. Comput. Geometry, pages 79-87. ACM Press, 1989.
Journal version in [55].
49: E. Kaltofen and S. M. Watt, editors.
Computers and Mathematics.
Springer Verlag, Heidelberg, Germany, 1989.
48: E. Kaltofen, T. Valente, and N. Yui.
An improved Las Vegas primality test.
In Proc. 1989 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'89) [-14], pages 26-33.
URL: BASE/89/KVY89.ps.gz
47: J. Canny, E. Kaltofen, and Lakshman Yagati.
Solving systems of non-linear polynomial equations faster.
In Proc. 1989 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'89) [-14], pages 121-128.
URL: BASE/89/CKL89.ps.gz
46: E. Kaltofen.
Parallel algebraic algorithm design.
Lect. Notes, Rensselaer Polytechnic Instit., Dept. Comput. Sci., Troy, New York, July 1989.
Tutorial at 1989 Internat. Symp. Symb. Algebraic Comput., Portland, Oregon; contains [45].
URL: BASE/89/Ka89:parallel.ps.gz
45: E. Kaltofen.
Processor efficient parallel computation of polynomial greatest common divisors.
Unpublished paper included in [46], July 1989.
URL: BASE/89/Ka89:gcd.ps.gz
44: E. Kaltofen and H. Rolletschek.
Computing greatest common divisors and factorizations in quadratic number fields.
Math. Comput., 53(188):697-720, 1989.
URL: BASE/89/KaRo89.ps.gz
43: E. Kaltofen, M. S. Krishnamoorthy, and B. D. Saunders.
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith normal form of polynomial matrices.
In J. H. Davenport, editor, Proc. EUROCAL '87, volume 378 of Lect. Notes Comput. Sci., pages 317-322, Heidelberg, Germany, 1989. Springer Verlag.
Journal version in [54].
42: E. Kaltofen.
Factorization of polynomials given by straight-line programs.
In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 375-412. JAI Press Inc., Greenwhich, Connecticut, 1989.
URL: BASE/89/Ka89:slpfac.ps.gz
41: B. Gregory and E. Kaltofen.
Analysis of the binary complexity of asymptotically fast algorithms for linear system solving.
SIGSAM Bulletin, 22(2):41-49, April 1988.
40: T. S. Freeman, G. Imirzian, E. Kaltofen, and Lakshman Yagati.
DAGWOOD: A system for manipulating polynomials given by straight-line programs.
ACM Trans. Math. Software, 14(3):218-240, 1988.
URL: BASE/88/FIKY88.ps.gz
39: E. Kaltofen.
Greatest common divisors of polynomials given by straight-line programs.
J. ACM, 35(1):231-264, 1988.
URL: BASE/88/Ka88:jacm.ps.gz
38: E. Kaltofen and Lakshman Yagati.
Improved sparse multivariate polynomial interpolation algorithms.
In Symbolic Algebraic Comput. Internat. Symp. ISSAC '88 Proc. [-15], pages 467-474.
URL: BASE/88/KaLa88.ps.gz
37: G. L. Miller, V. Ramachandran, and E. Kaltofen.
Efficient parallel evaluation of straight-line code and arithmetic circuits.
SIAM J. Comput., 17(4):687-695, 1988.
URL: BASE/88/MRK88.ps.gz
36: E. Kaltofen and B. Trager.
Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators.
In Proc. 29th Annual Symp. Foundations of Comp. Sci., pages 296-305. IEEE, 1988.
Journal version in [57]. Talk: BASE/88/focs88.ps.gz
35: E. Kaltofen.
Deterministic irreducibility testing of polynomials over large finite fields.
J. Symbolic Comput., 4:77-82, 1987.
URL: BASE/87/Ka87:jsc.ps.gz
34: E. Kaltofen.
Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials.
In Proc. 19th Annual ACM Symp. Theory Comput., pages 443-452. ACM, 1987.
URL: BASE/87/Ka87:stoc.ps.gz
33: E. Kaltofen.
Computer algebra algorithms.
In J. F. Traub, editor, Annual Review in Computer Science, volume 2, pages 91-118. Annual Reviews Inc., Palo Alto, California, 1987.
URL: BASE/87/Ka87:annrev.ps.gz
32: E. Kaltofen, M. S. Krishnamoorthy, and B. D. Saunders.
Fast parallel computation of Hermite and Smith forms of polynomial matrices.
SIAM J. Alg. Discrete Math., 8:683-690, 1987.
URL: BASE/87/KKS87.ps.gz
31: E. Kaltofen.
Uniform closure properties of p-computable functions.
In Proc. 18th Annual ACM Symp. Theory Comput., pages 330-337. ACM, 1986.
Also published as part of [39] and [42].
30: E. Kaltofen, M. S. Krishnamoorthy, and B. D. Saunders.
Fast parallel algorithms for similarity of matrices.
In Proc. 1986 Symp. Symbolic Algebraic Comput. (Symsac '86) [-16], pages 65-70.
Journal version in [32] and [54].
29: T. S. Freeman, G. Imirzian, E. Kaltofen, and Lakshman Yagati.
DAGWOOD: A system for manipulating polynomials given by straight-line programs.
In Proc. 1986 Symp. Symbolic Algebraic Comput. (Symsac '86) [-16], pages 169-175.
Journal version in [40].
28: G. L. Miller, V. Ramachandran, and E. Kaltofen.
Efficient parallel evaluation of straight-line code and arithmetic circuits.
In Proc. Second International Workshop on Parallel Computing and VLSI - AWOC '86, volume 227 of Lect. Notes Comput. Sci., pages 236-245, 1986.
Journal version in [37].
27: J. von zur Gathen and E. Kaltofen.
Factoring multivariate polynomials over finite fields.
Math. Comput., 45:251-261, 1985.
URL: BASE/85/GaKa85:mathcomp.ps.gz
26: J. von zur Gathen and E. Kaltofen.
Factoring sparse multivariate polynomials.
J. Comput. System Sci., 31:265-287, 1985.
25: E. Kaltofen.
Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization.
SIAM J. Comput., 14(2):469-489, 1985.
URL: BASE/85/Ka85:sicomp.ps.gz
24: E. Kaltofen.
Computing with polynomials given by straight-line programs I; greatest common divisors.
In Proc. 17th Annual ACM Symp. Theory Comput., pages 131-142. ACM, 1985.
Also published as part of [39] and [42].
23: E. Kaltofen.
Sparse Hensel lifting.
In EUROCAL 85 European Conf. Comput. Algebra Proc. Vol. 2 [-17], pages 4-17.
Proofs in [22].
URL: BASE/85/Ka85:eurocal.pdf
22: E. Kaltofen.
Sparse Hensel lifting.
Technical Report 85-12, Rensselaer Polytechnic Instit., Dept. Comput. Sci., Troy, N. Y., 1985.
URL: BASE/85/Ka85:techrep.pdf
21: E. Kaltofen and H. Rolletschek.
Computing greatest common divisors and factorizations in quadratic number fields.
In EUROCAL 85 European Conf. Comput. Algebra Proc. Vol. 2 [-17], pages 279-288.
Journal version in [44].
20: E. Kaltofen.
Computing with polynomials given by straight-line programs II; sparse factorization.
In Proc. 26th Annual Symp. Foundations of Comp. Sci., pages 451-458. IEEE, 1985.
URL: BASE/85/Ka85:focs.ps.gz
19: E. Kaltofen.
Fast parallel absolute irreducibility testing.
J. Symbolic Comput., 1(1):57-67, 1985.
Misprint corrections: J. Symbolic Comput. vol. 9, p. 320 (1989).
URL: BASE/85/Ka85:jsc.ps.gz
18: E. Kaltofen.
Effective Hilbert irreducibility.
Information and Control, 66:123-137, 1985.
URL: BASE/85/Ka85:infcontr.ps.gz
17: E. Kaltofen and V. Pan.
The integer manipulation techniques can compete with the linear algebra methods for solving sparse linear systems.
Tech. Rep. 85-6, State Univ. of New York at Albany, Comp. Sci. Dept., 1985.
16: E. Kaltofen.
The algebraic theory of integration.
Lect. Notes, Rensselaer Polytechnic Instit., Dept. Comput. Sci., Troy, New York, 1984.
URL: BASE/84/Ka84:integration.ps.gz
15: E. Kaltofen.
Effective Hilbert irreducibility.
In Proc. EUROSAM '84 [-18], pages 275-284.
Journal version in [18].
14: E. Kaltofen and N. Yui.
Explicit construction of the Hilbert class field of imaginary quadratic fields with class number 7 and 11.
In Proc. EUROSAM '84 [-18], pages 310-320.
URL: BASE/84/KaYui84:eurosam.ps.gz
13: E. Kaltofen.
A note on the Risch differential equation.
In Proc. EUROSAM '84 [-18], pages 359-366.
URL: BASE/84/Ka84:risch.ps.gz
12: E. Kaltofen and N. Yui.
The modular equation of order 11.
In Third Macsyma Users' Conference, pages 472-485. General Electric, 1984.
11: E. Kaltofen.
On a theorem by R. Dedekind.
In H. W. Lenstra, Jr., J. K. Lenstra, and P. van Emde Boas, editors, DOPO LE PAROLE. Album in Honor of A. K. Lenstra's Doctorate, Amsterdam, May 1984.
10: E. Kaltofen.
On the complexity of finding short vectors in integer lattices.
In Proc. EUROCAL '83, volume 162 of Lect. Notes Comput. Sci., pages 236-244, Heidelberg, Germany, 1983. Springer Verlag.
URL: BASE/83/Ka83:eurocal.ps.gz
9: J. von zur Gathen and E. Kaltofen.
Factoring multivariate polynomials over finite fields.
In Proc. 1983 ICALP, volume 154 of Lect. Notes Comput. Sci., pages 250-263, Heidelberg, Germany, 1983. Springer Verlag.
Journal version in [27].
8: E. Kaltofen, D. R. Musser, and B. D. Saunders.
A generalized class of polynomials that are hard to factor.
SIAM J. Comput., 12(3):473-485, 1983.
Also chapter 2.2 in [4].
7: E. Kaltofen.
Polynomial factorization.
In B. Buchberger, G. Collins, and R. Loos, editors, Computer Algebra, pages 95-113. Springer Verlag, Heidelberg, Germany, 2 edition, 1982.
URL: BASE/82/Ka82:survey.ps.gz
6: E. Kaltofen.
A polynomial-time reduction from bivariate to univariate integral polynomial factorization.
In Proc. 23rd Annual Symp. Foundations of Comp. Sci., pages 57-64. IEEE, 1982.
Journal version in [25].
URL: BASE/82/Ka82:focs.ps.gz
5: E. Kaltofen.
A polynomial reduction from multivariate to bivariate integral polynomial factorization.
In Proc. 14th Annual ACM Symp. Theory Comput., pages 261-266. ACM, 1982.
Journal version in [25].
4: E. Kaltofen.
On the complexity of factoring polynomials with integer coefficients.
PhD thesis, Rensselaer Polytechnic Instit., Troy, N. Y., December 1982.
See also [7,8,25].
URL: BASE/82/Ka82:thesis.pdf
3: E. Kaltofen, D. R. Musser, and B. D. Saunders.
A generalized class of polynomials that are hard to factor.
In Proc. 1981 ACM Symp. Symbolic and Algebraic Comput., pages 188-194. ACM, 1981.
Journal version in [8].
2: E. Kaltofen and S. K. Abdali.
An attributed LL(1) compilation of Pascal into the lambda-calculus.
Technical Report CS-8103, Rensselaer Polytechnic Instit., Math. Sci. Dept., Troy, N. Y., 1981.
1: E. Kaltofen.
LISP/370 under the Michigan Terminal System.
Rensselaer Polytechnic Instit., Math. Sci. Dept., Troy, N. Y., August 1980.

Books where papers are located
-1: Arjeh M. Cohen, Xiao-Shan Gao, and Nobuki Takayama, editors.
Proc. First Internat. Congress Math. Software ICMS 2002, Beijing, China, Singapore, 2002. World Scientific.
-2: T. Mora, editor.
ISSAC 2002 Proc. 2002 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 2002. ACM Press.
-3: Kiyoshi Shirayanagi and Kazuhiro Yokoyama, editors.
Computer Mathematics Proc. Fifth Asian Symposium (ASCM 2001), volume 9 of Lecture Notes Series on Computing, Singapore, 2001. World Scientific.
-4: C. Traverso, editor.
Internat. Symp. Symbolic Algebraic Comput. ISSAC 2000 Proc. 2000 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 2000. ACM Press.
-5: S. Dooley, editor.
ISSAC 99 Proc. 1999 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 1999. ACM Press.
-6: O. Gloor, editor.
ISSAC 98 Proc. 1998 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 1998. ACM Press.
-7: W. Küchlin, editor.
ISSAC 97 Proc. 1997 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 1997. ACM Press.
-8: Lakshman Y. N., editor.
ISSAC 96 Proc. 1996 Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 1996. ACM Press.
-9: P. S. Wang, editor.
Internat. Symp. Symbolic Algebraic Comput. 92, New York, N. Y., 1992. ACM Press.
-10: A. H. M. Levelt, editor.
Proc. 1995 Internat. Symp. Symbolic Algebraic Comput. ISSAC'95, New York, N. Y., 1995. ACM Press.
-11: ISSAC '94 Proc. Internat. Symp. Symbolic Algebraic Comput., New York, N. Y., 1994. ACM Press.
-12: H. Hong, editor.
First Internat. Symp. Parallel Symbolic Comput. PASCO '94, Singapore, 1994. World Scientific Publishing Co.
-13: S. M. Watt, editor.
Proc. 1991 Internat. Symp. Symbolic Algebraic Comput. ISSAC'91, New York, N. Y., 1991. ACM Press.
-14: Proc. ACM-SIGSAM 1989 Internat. Symp. Symbolic Algebraic Comput. ISSAC `89, New York, N. Y., 1989. ACM Press.
-15: P. Gianni, editor.
Symbolic Algebraic Comput. Internat. Symp. ISSAC '88 Proc., volume 358 of Lect. Notes Comput. Sci., Heidelberg, Germany, 1988. Springer Verlag.
-16: B. W. Char, editor.
Proc. 1986 Symp. Symbolic Algebraic Comput. Symsac `86, New York, N. Y., 1986. ACM.
-17: B. F. Caviness, editor.
EUROCAL 85 European Conf. Comput. Algebra Proc. Vol. 2, Lect. Notes Comput. Sci., Heidelberg, Germany, 1985. Springer Verlag.
-18: J. Fitch, editor.
EUROSAM 84 Internat. Symp. Symbolic Algebraic Comput. Proc., Lect. Notes Comput. Sci., Heidelberg, Germany, 1984. Springer Verlag.

How to Access the Bib Files

About this document ...

Erich Kaltofen 2002-12-15

"kaltofen" - читать интересную книгу автора

Publications by Erich Kaltofen

Contents

Major Research Results

Polynomial Factorization

Linear Algebra

Divisions in Algebraic Complexity Theory

Computational Number Theory

Symbolic/Numeric Computation

Software

Paper on Pedagogy and Significant Instructional Software

Surveys

Bibliography

How to Access the Bib Files

About this document ...

Publications by Erich Kaltofen

Contents

Major Research Results

Polynomial Factorization

Linear Algebra

Divisions in Algebraic Complexity Theory

Computational Number Theory

Symbolic/Numeric Computation

Software

Paper on Pedagogy and Significant Instructional Software

Surveys

Bibliography

How to Access the Bib Files

About this document ...