Erich Kaltofen

	2012
103		Erich Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi: Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. J. Symb. Comput. 47(1): 1-15 (2012)
102		Matthew T. Comer, Erich Kaltofen: On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field. J. Symb. Comput. 47(4): 480-491 (2012)
101		Jeremy R. Johnson, Erich Kaltofen, Hyungju Park: Special Issue on Symbolic and Algebraic Computation Foundations, Algorithmics and Applications: ISSAC 2009. J. Symb. Comput. 47(7): 751 (2012)
	2011
100		Erich Kaltofen, Michael Nehring, B. David Saunders: Quadratic-time certificates in linear algebra. ISSAC 2011: 171-176
99		Erich Kaltofen, Michael Nehring: Supersparse black box rational function interpolation. ISSAC 2011: 177-186
98		Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier: Symmetric Determinantal Representation of Weakly-Skew Circuits. STACS 2011: 543-554
97		Erich Kaltofen: What is Hybrid Symbolic-Numeric Computation? SYNASC 2011: 11
	2010
96		Sharon Hutton, Erich Kaltofen, Lihong Zhi: Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method. ISSAC 2010: 227-234
95		Erich Kaltofen: Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010. PASCO 2010: 10-17
94		Bruno Grenet, Erich Kaltofen, Pascal Koiran, Natacha Portier: Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits CoRR abs/1007.3804: (2010)
93		Erich Kaltofen, Mark Lavin: Efficiently Certifying Non-Integer Powers. Computational Complexity 19(3): 355-366 (2010)
	2009
92		Jeremy R. 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
91		Erich Kaltofen, Pascal Koiran: Expressing a fraction of two determinants as a determinant. ISSAC 2008: 141-146
90		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
89		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
88		Erich Kaltofen, Zhengfeng Yang: On exact and approximate interpolation of sparse rational functions. ISSAC 2007: 203-210
87		Erich Kaltofen, Zhengfeng Yang, Lihong Zhi: On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. SNC 2007: 11-17
86		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
85		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
84		Wolfram Decker, Mike Dewar, Erich Kaltofen, Stephen M. Watt: 06271 Abstracts Collection -- Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software 2006
83		Wolfram Decker, Mike Dewar, Erich Kaltofen, Stephen M. Watt: 06271 Executive Summary - Challenges in Symbolic Computation Software. Challenges in Symbolic Computation Software 2006
82		Erich Kaltofen, Pascal Koiran: Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. ISSAC 2006: 162-168
81		Erich Kaltofen, Zhengfeng Yang, Lihong Zhi: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. ISSAC 2006: 169-176
80		Erich Kaltofen, Lihong Zhi: Hybrid symbolic-numeric computation. ISSAC 2006: 7
	2005
79		Erich Kaltofen, Pascal Koiran: On the complexity of factoring bivariate supersparse (Lacunary) polynomials. ISSAC 2005: 208-215
78		Erich Kaltofen, Dmitriy Morozov, George Yuhasz: Generic matrix multiplication and memory management in linBox. ISSAC 2005: 216-223
77		Erich Kaltofen, Gilles Villard: On the complexity of computing determinants. Computational Complexity 13(3-4): 91-130 (2005)
	2004
76		Shuhong Gao, Erich Kaltofen, John May, Zhengfeng Yang, Lihong Zhi: Approximate factorization of multivariate polynomials via differential equations. ISSAC 2004: 167-174
75		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
74		Erich Kaltofen, John May: On approximate irreducibility of polynomials in several variables. ISSAC 2003: 161-168
73		Erich Kaltofen: Polynomial factorization: a success story. ISSAC 2003: 3-4
72		Erich Kaltofen, Wen-shin Lee: Early termination in sparse interpolation algorithms. J. Symb. Comput. 36(3-4): 365-400 (2003)
71		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
70		Mark Giesbrecht, Erich Kaltofen, Wen-shin Lee: Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm. ISSAC 2002: 101-108
69		Erich Kaltofen: An output-sensitive variant of the baby steps/giant steps determinant algorithm. ISSAC 2002: 138-144
	2001
68		Erich Kaltofen, Gilles Villard: Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001 ACM 2001
	2000
67		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
66		Erich Kaltofen: Challenges of Symbolic Computation: My Favorite Open Problems. J. Symb. Comput. 29(6): 891-919 (2000)
	1999
65		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
64		Laurent Bernardin, Bruce W. Char, Erich Kaltofen: Symbolic Computation in Java: An Appraisement. ISSAC 1999: 237-244
63		Erich Kaltofen, Michael B. Monagan: On the Genericity of the Modular Polynomial GCD Algorithm. ISSAC 1999: 59-66
62		Erich Kaltofen, A. Lobo: Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields. Algorithmica 24(3-4): 331-348 (1999)
	1998
61		Markus A. Hitz, Erich Kaltofen: Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots. ISSAC 1998: 236-243
60		Angel Díaz, Erich Kaltofen: FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation. ISSAC 1998: 30-37
59		Erich Kaltofen, Victor Shoup: Subquadratic-time factoring of polynomials over finite fields. Math. Comput. 67(223): 1179-1197 (1998)
	1997
58		Hoon Hong, Erich Kaltofen, Markus A. Hitz: Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, PASCO 1997, July 20-22, 1997, Kihei, Hawaii, USA ACM 1997
57		Wayne Eberly, Erich Kaltofen: On Randomized Lanczos Algorithms. ISSAC 1997: 176-183
56		Erich Kaltofen, Victor Shoup: Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields. ISSAC 1997: 184-188
55		Angel Díaz, Erich Kaltofen, Victor Y. Pan: Algebraic Algorithms. The Computer Science and Engineering Handbook 1997: 226-249
54		Erich Kaltofen: Teaching Computational Abstract Algebra. J. Symb. Comput. 23(5/6): 503-515 (1997)
	1996
53		Erich Kaltofen, A. Lobo: On Rank Properties of Toeplitz Matrices over Finite Fields. ISSAC 1996: 241-249
52		Úlfar Erlingsson, Erich Kaltofen, David R. Musser: Generic Gram-Schmidt Orthogonalization by Exact Division. ISSAC 1996: 275-282
	1995
51		Angel Díaz, Erich Kaltofen: On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations. ISSAC 1995: 232-239
50		Mehrdad Samadani, Erich Kaltofen: Prediction Based Task Scheduling in Distributed Computing (Abstract). PODC 1995: 261
49		Erich Kaltofen, Victor Shoup: Subquadratic-time factoring of polynomials over finite fields. STOC 1995: 398-406
48		Markus A. Hitz, Erich Kaltofen: Integer Division in Residue Number Systems. IEEE Trans. Computers 44(8): 983-989 (1995)
47		Erich Kaltofen: Effective Noether Irreducibility Forms and Applications. J. Comput. Syst. Sci. 50(2): 274-295 (1995)
46		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
45		Erich Kaltofen: Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems. ISSAC 1994: 297-304
44		Erich Kaltofen, A. Lobo: Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm. ISSAC 1994: 90-98
	1993
43		Erich Kaltofen: Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems. AAECC 1993: 195-212
42		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
41		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
40		Erich Kaltofen: On Computing Determinants of Matrices without Divisions. ISSAC 1992: 342-349
39		Erich Kaltofen: Polynomial Factorization 1987-1991. LATIN 1992: 294-313
	1991
38		Erich Kaltofen, B. David Saunders: On Wiedemann's Method of Solving Sparse Linear Systems. AAECC 1991: 29-38
37		Angel Díaz, Erich Kaltofen, K. Schmitz, T. Valente: DSC: A System for Distributed Symbolic Computation. ISSAC 1991: 323-332
36		Erich Kaltofen, Victor Y. Pan: Processor Efficient Parallel Solution of Linear Systems over an Abstract Field. SPAA 1991: 180-191
35		Erich Kaltofen: Effective Noether Irreducibility Forms and Applications (Extended Abstract) STOC 1991: 54-63
34		David G. Cantor, Erich Kaltofen: On Fast Multiplication of Polynomials over Arbitrary Algebras. Acta Inf. 28(7): 693-701 (1991)
	1990
33		Erich Kaltofen, Yagati N. Lakshman, J.-M. Wiley: Modular Rational Sparse Multivariate Polynomial Interpolation. ISSAC 1990: 135-139
32		Erich Kaltofen: Computing the Irreducible Real Factors and Components of an Algebraic Curve. Appl. Algebra Eng. Commun. Comput. 1: 135-148 (1990)
31		Erich Kaltofen, Bruno Buchberger: Special Issue Computational Algebraic Complexity Editorial. J. Symb. Comput. 9(3): 225-228 (1990)
30		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
29		John F. Canny, Erich Kaltofen, Yagati N. Lakshman: Solving Systems of Nonlinear Polynomial Equations Faster. ISSAC 1989: 121-128
28		Erich Kaltofen, T. Valente, Norika Yui: An Improved Las Vegas Primality Test. ISSAC 1989: 26-33
27		Erich Kaltofen: Computing the Irreducible Real Factors and Components of an Algebraic Curve. Symposium on Computational Geometry 1989: 79-87
	1988
26		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
25		Erich Kaltofen, Yagati N. Lakshman: Improved Sparse Multivariate Polynomial Interpolation Algorithms. ISSAC 1988: 467-474
24		Timothy S. Freeman, Gregory M. Imirzian, Erich Kaltofen, Yagati N. Lakshman: Dagwood: a system for manipulating polynomials given by straight-line programs. ACM Trans. Math. Softw. 14(3): 218-240 (1988)
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

Coauthor Index

1	Laurent Bernardin	[64]
2	Bruno Buchberger	[31]
3	John F. Canny (John Canny)	[29]
4	David G. Cantor	[34]
5	Bruce W. Char	[64]
6	Matthew T. Comer	[102]
7	Wolfram Decker	[83] [84] [85]
8	Mike Dewar	[83] [84] [85]
9	Angel Díaz	[37] [42] [46] [51] [55] [60]
10	Wayne Eberly (Wayne M. Eberly)	[57]
11	Úlfar Erlingsson	[52]
12	Timothy S. Freeman	[24]
13	Shuhong Gao	[75] [76]
14	Joachim von zur Gathen	[4] [11]
15	Mark Giesbrecht	[70] [71]
16	Bruno Grenet	[94] [98]
17	Markus A. Hitz	[42] [46] [48] [58] [61] [65]
18	Hoon Hong	[58]
19	Sharon Hutton	[96]
20	Gregory M. Imirzian	[24]
21	Jeremy R. Johnson	[92] [101]
22	Pascal Koiran	[79] [82] [91] [94] [98]
23	Mukkai S. Krishnamoorthy	[21]
24	Yagati N. Lakshman	[24] [25] [29] [33] [65]
25	Alan G. B. Lauder	[75]
26	Mark Lavin	[93]
27	Wen-shin Lee	[67] [70] [71] [72]
28	Bin Li	[86] [90] [103]
29	A. Lobo	[42] [44] [46] [53] [62] [67]
30	John May	[74] [76]
31	John P. May	[89]
32	Gary L. Miller	[18] [22]
33	Michael B. Monagan	[63]
34	Dmitriy Morozov	[78]
35	David R. Musser	[3] [52]
36	Michael Nehring	[99] [100]
37	Victor Y. Pan	[36] [41] [55]
38	Hyungju Park	[92] [101]
39	Natacha Portier	[94] [98]
40	Vijaya Ramachandran	[18] [22]
41	Heinrich Rolletschek	[16]
42	Mehrdad Samadani	[50]
43	B. David Saunders	[3] [21] [38] [100]
44	K. Schmitz	[37]
45	Victor Shoup	[49] [56] [59]
46	Kartik Sivaramakrishnan	[86]
47	Barry M. Trager	[26] [30]
48	T. Valente	[28] [37] [42] [46]
49	Gilles Villard	[68] [77]
50	Stephen M. Watt	[83] [84] [85]
51	J.-M. Wiley	[33]
52	Zhengfeng Yang	[76] [81] [86] [87] [88] [89] [90] [103]
53	George Yuhasz	[78]
54	Norika Yui	[28]
55	Noriko Yui	[7]
56	Lihong Zhi	[76] [80] [81] [86] [87] [89] [90] [96] [103]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page