Previous: Committees Up: Resume TOC Next: Awards

Invited Lectures by
Erich Kaltofen


Contents

Introduction

In the following the BASE URL for the online document is http:// www. math. ncsu. edu/ ˜elk27/ bibliography. You may use any of my transparencies for your own purposes, provided you acknowledge my authorship and copyright.

   
Invited Lectures at Conferences

262.
 “Encounters in Symbolic Computation: Ideas for the Ages,” Invited Lecture at the Internat. Symp. Symbolic Algebraic Comput. (ISSAC 2024) Raleigh, USA, July 2024. Paper at BASE/index.html#Ka24encounters.

261.
“Hermite Interpolation With Error Correction,” Lecture at the 26th International Conference on Applications of Computer Algebra (ACA 2021), Virtual, Online, July 25, 2021; abstract.pdf.

260.
“Interpolation and Model Fitting With Outlier Detection How MM/SC Impacts Signal Processing/Learning,” Invited Lecture at the `International Symposium on Wen-Tsun Wu's Academic Thought and Mathematics Mechanization' at the Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China, May 16, 2019.

259.
“Commemorating Professor Wen-Tsun Wu,” Remarks on the occasion of Wen-Tsun Wu's 100th Birthday at the `International Symposium on Wen-Tsun Wu's Academic Thought and Mathematics Mechanization' at the University of the Chinese Academy of Sciences, Beijing, China, May 12, 2019.

258.
 “Proof-of-work Certificates for High Complexity Mathematical Computations,” Invited Lecture at the `Core Computational Methods' workshop of the Non-Linear Algebra Program at the Institute for Computational and Experimental Research in Mathematics (ICERM), Brown Univ., Providence, Rhode Island, September 21, 2018.

257.
Same as 258, Lecture at the Special Session 6 `Computer Science' of the 2018 Joint International Meeting of the Chinese Mathematical Society and the American Mathematical Society (JIMCA'18), Fudan Univ., Shanghai, China, June 14, 2018.

256.
 “Remembrance of Things Past (À la recherche du temps perdu [Marcel Proust])” Invited Lecture at `Milestones in Computer Algebra (MICA 2016) Celebrating the research of Erich Kaltofen,' Waterloo, Canada, July 17, 2016. Presentation screens at BASE/16/mica.pdf (13MB).

255.
 “Hybrid Symbolic-Numeric Computation A Marriage Made in Heaven,” one-hour Lecture at the Embedded Meeting `Third Workshop on Hybrid Methodologies for Symbolic-Numeric Computing' at the 8th ICIAM, Beijing, China, August 2015. On p. 20 I give an algorithm for reconstrucing a sparse matrix from a black box for its matrix-times-vector product: BASE/15/iciam_15.pdf (500K).

254.
253. 252. “Algorithms for Interpolating Sparse Polynomials,” three 80 minutes' lectures at the International Summer School at the Key Laboratory for Mathematics Mechanization, Academy of Mathematics and Systems Science, August 2015, Beijing, China.

251.
 “Error-Correcting Sparse Interpolation In Chebyshev Basis,” Lecture at the seminar `Sparse Modelling and Multi-Exponential Analysis' at Schloss Dagstuhl – Leibniz Center for Informatics, Germany, June 2015.

250.
“Fast Multiplication of Polynomials Over Arbitrary Rings,” Lecture at the seminar `Complexity of Symbolic and Numerical Problems' at Schloss Dagstuhl – Leibniz Center for Informatics, Germany, June 2015.

249.
 “Essentially Optimal Interactive Certificates in Linear Algebra,” Invited Lecture at the Geometric Complexity Theory GCT Workshop Workshop at the Simons Institute in Berkeley, California, September 2014.

248.
“Cleaning-Up Data for Sparse Model Synthesis: When Symbolic-Numeric Computation Meets Error-Correcting Codes,” Invited Lecture at the 2014 International Conference on Symbolic-Numeric Computation (SNC'14) at the East China Normal University in Shanghai, China July 2014.

247.
“Multivariate Sparse Interpolation and Error-Correcting Coding,” Invited Lecture at the Workshop 3 at the Special Semester on Applications of Algebra and Number Theory at RICAM Linz, Austria, November 27, 2013,

246.
245. “Polynomial Factorization,” Two invited tutorial lectures at the Special Semester on Applications of Algebra and Number Theory at RICAM Linz, Austria, November 19 and 21, 2013,

244.
“Multivariate Sparse Interpolation and Error-Correcting Coding” Invited Lecture at the Minisymposium `Algorithms in Real Algebraic Geometry and its Applications' at the “SIAM Conference on Applied Algebraic Geometry AAG '13,” Fort Collins, August 2, 2013.

243.
“Outlier detection by error correcting decoding and structured linear algebra methods,” Invited Lecture at the Invited Minisymposium “Symbolic Matrix Algorithms” at the “International Linear Algebra Society 2013 Meeting (ILAS 2013),” Providence, Rhode Island, USA, June 6, 2013

242.
“Symbolic Computation and Complexity Theory,” Invited Lecture at the “The Tenth Asian Symposium on Computer Mathematics (ASCM),” Beijing, China, October 26, 2012.

241.
“Complexity Theory and Symbolic Computation,” Invited Lecture at the “Alan Turing's Heritage: Logic, Computation & Complexity,” Lyon, France, July 3, 2012.

240.
“What Is Hybrid Symbolic-Numeric Computation?” Invited Lecture at the “Fields Institute Workshop on Hybrid Methodologies for Symbolic-Numeric Computation,” Waterloo, November 16, 2011.

239.
“Fast Estimates of Hankel Matrix Condition Numbers and Numeric Sparse Interpolation,” Invited Lecture at the Minisymposium `Algorithms in Real Algebraic Geometry and Applications' at the “SIAM Conference on Applied Algebraic Geometry,” Raleigh, October 7, 2011.

238.
“What Is Hybrid Symbolic-Numeric Computation?” Invited Lecture at “SYNASC 2011 – the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing,” Timisoara, Romania, September 27, 2011.

237.
“What Is Hybrid Symbolic-Numeric Computation?” Invited Lecture at the CRC 2011 – International Workshop on Certified and Reliable Computation in NanNing, GuangXi, China, July 17, 2011.

236.
“Fast Estimates of Hankel Matrix Condition Numbers and Numeric Sparse Interpolation,” Invited Lecture at the 15th International Conference on Applications of Computer Algebra ACA 2011 in Houston, Texas, June 29, 2011.

235.
 “Fifteen years after DSC and WLSS2: what parallel computations I do today,” Invited Lecture at the 2010 International Workshop on Parallel Symbolic Computation PASCO 2010 at the University of Grenoble, France, July 22, 2010.

234.
“The indomitable Berlekamp/Massey algorithm,” Invited Lecture at Jo60: A Modern Computer Algebraist at the Bonn-Aachen International Center for Information Technology b-it, Bonn, May 27, 2010.

233.
“Certifying the Radius of Positive Semidefiniteness Via Our ARTINPROVER Package,” Invited Lecture at the Workshop on Convex Algebraic Geometry at the Banff International Research Station, Canada, February 15, 2010.

232.
 “ARTINPROVER: a truly hybrid symbolic/numeric global optimization algorithm,” Invited Lecture at the AMS-SIAM Special Session on Applications of Algebraic Geometry at the Joint Mathematics Meeting, San Francisco, California, January 16, 2010.

231.
Same as 232, Invited Lecture at the NSF-NAIS Workshop Intelligent Software: the Interface Between Algorithms and Machines, Edinburgh, Scotland, October 19, 2009.

230.
“Exact Certification in Global Polynomial Optimization Via Sums-Of-Squares of Rational Functions With Rational Coefficients” (same as 228), Lecture at the 15th International Conference on Applications of Computer Algebra (ACA 2009), Montreal, Canada, June 27, 2009.

229.
“Supersparse Interpolation: Mathematics + Algorithmic And Computational Thinking = Mathematics Mechanization,” Invited Lecture at the International Conference on Mathematics Mechanization ICMM'09 in honor of Prof. Wen-tsun Wu's 90th birthday, Beijing, China, May 11, 2009.

228.
 “Exact Certification in Global Polynomial Optimization Via Sums-Of-Squares of Rational Functions With Rational Coefficients,” Invited Lecture at the AMS Special Session on Concrete Aspects of Real Positive Polynomials, Spring Central Sectional Meeting, Urbana, Illinois, March 28, 2009.

227.
“Rump's Model Problem and the Computer Search for Records in Number Theory,” Invited Lecture at the AMS Special Session on SAGE and Mathematical Research Using Open Source Software at the Joint Mathematics Meeting, Washington, DC, January 8, 2009.

226.
“Exact Certification in Global Polynomial Optimization Via Rationalizing Sums-Of-Squares,” Invited lecture at the Workshop on Approximate Commutative Algebra ApCoA 2008 at RISC Linz, Hagenberg, Austria, July 25, 2008.

225.
“The Seven Dwarfs of Symbolic Computation and the Discovery of Reduced Symbolic Models,” Invited lecture at the 4th International Conference on Symbolic and Numerical Scientific Computing SNSC '08 at RISC Linz, Hagenberg, Austria, July 24, 2008. Transparencies at BASE/08/snsc.pdf.

224.
223. “The Algebraic Synthesis of Algorithms Part 1: The Transposition Principle Part 2: Elimination of Divisions,” Two invited tutorial lectures at the International Conference on Rewriting Techniques and Applications RTA 2008 at RISC Linz, Hagenberg, Austria, July 14, 2008.

222.
 “Model Discovery and Verification With Hybrid Symbolic-Numeric Computation,” Lecture at the East Coast Computer Algebra Day at Shepherd University, Shepherdstown, West Virginia, May 2008.

221.
 “Expressing a Fraction of Two Determinants as a Determinant,” Plenary Lecture at the CMS Winter 2007 Meeting Meeting in London, Canada, December 2007.

220.
“On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms,” Invited Lecture at the 2007 International Workshop on Symbolic-Numeric Computation (SNC'07) at the University of Western Ontario in London, Canada, July 2007.

219.
 “Efficient linear algebra algorithms in symbolic computation,” Invited Plenary Lecture at the 14th Conference of the International Linear Algebra Society (ILAS 2007) at Shanghai University, China, July 2007. I discuss randomized linear algebra and numerical aspects: BASE/07/K07_ilas_talk.pdf (155K).

218.
“On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms,” Short Report at the `Complexity Theory' meeting at the Mathematical Research Institute in Oberwolfach, Germany, June 2007.

217.
“Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields,” Invited Lecture at the Workshop on Computational Challenges Arising in Algorithmic Number Theory and Cryptography at the Fields Institute in Toronto, Canada October 2006. Transparencies at BASE/06/fields.pdf.

216.
215. 214. 213.  “Computer Algebra,” Four lectures at the Summer School on Mathematics, Algorithms, and Proofs, DIMA/DISI, University of Genova, Italy August 28 – September 2, 2006. Transparencies at BASE/ 06/ MAPlinbox. pdf, BASE/ 06/ MAPpolyfac. pdf, BASE/ 06/ MAPssparse. pdf, BASE/ 06/ MAPsncintro. pdf, and BASE/ 06/ MAPissacKYZ. pdf.

212.
“Enabling Breakthrough: Manuel Bronstein's Impact on the Infrastructure of Symbolic Computation Research,” Invited Lecture at CAFE Computer Algebra and Functional Equations, an international conference, in memory of Manuel Bronstein at INRIA Sophia Antipolis, France, July 13, 2006. Transparencies at BASE/06/manuel.pdf and BASE/06/PiledHigherDeeper.html.

211.
“Hybrid Symbolic-Numeric Computation,” Invited Tutorial given jointly with Lihong Zhi at the International Symposium on Symbolic and Algebraic Computation ISSAC 2006 at Genova, Italy, July 9, 2006. Abstract at BASE/index.html#KaZhi06.

210.
“Errors in Variables and Hybrid Symbolic-Numeric Methods,” Invited Lecture at the Scientific Session on Applications and Recent Developments in Symbolic Computation 2006 at the CAIMS-MITACS 2006 Joint Annual Conference in Toronto, Canada, June 18, 2006.

209.
“Approximate Factorization of Complex Multivariate Polynomials My Lessons Learned,” Keynote Lecture at the Special Semester on Gröbner Bases and Related Methods 2006: Workshop B1. Approximate Commutative Algebra at the Radon Institute for Computational and Applied Mathematics in Linz, Austria, February 2006. Transparencies at BASE/06/groebner.pdf. Maple worksheet at BASE/ 06/ groebner. txt.

208.
“Approximate Factorization of Complex Multivariate Polynomials,” Invited Lecture at the AMS-SIAM Special Session on Symbolic-Numeric Computation and Applications at the Joint Mathematics Meeting, San Antonio, Texas, Jan 15, 2006.

207.
“The Art of Symbolic Computation,” Invited Plenary Lecture at the Conference on Applications of Computer Algebra (ACA 2005), Nara City, Japan, August 2005. Transparencies at BASE/05/aca.pdf. Maple worksheet at BASE/ 05/ aca. txt.

206.
“On the complexity of factoring sparse polynomials,” Lecture at the `Complexity Theory' meeting at the Mathematical Research Institute in Oberwolfach, Germany, June 2005. Transparencies at BASE/05/oberwolfach.pdf.

205.
 “Tellegen's principle and the synthesis of algorithms,” Lecture at the 33rd Theoretical Computer Science Spring School Computational Complexity Montagnac-les-truffes, Alpes de Haute Provence, France, May 2005. Transparencies at BASE/05/montagnac.pdf and BASE/05/95montagnac.pdf.

204.
“The role of algorithms in symbolic computation,” Lecture at the East Coast Computer Algebra Day, Ashland University, Ashland, Ohio, March 2005. Transparencies at BASE/05/eccad.pdf.

203.
“On the complexity of factoring bivariate supersparse and straight-line polynomials,” Lecture at the Finite Fields: Theory and Applications meeting at the Mathematical Research Institute in Oberwolfach, Germany, December 2004.

202.
“Approximate Factorization of Multivariate Polynomials via Differential Equations,” Lecture at the seminar `Real Computation and Complexity' at the International Conference and Research Center for Computer Science in Dagstuhl castle, Germany, February 2004. Transparencies at BASE/ 04/ dagstuhl. pdf.

201.
 “Polynomial Factorization: a Success Story,” Invited Lecture at the Internat. Symp. Symbolic Algebraic Comput. (ISSAC 2003) Philadelphia, USA, August 2003. Transparencies at BASE/ 03/ issac. pdf. Maple worksheets at BASE/ 03/ issac1. txt, BASE/ 03/ issac2. txt. Abstract at BASE/index.html#Ka03.

200.
“Separation Bounds from Polynomial Reducibility,” `Numerical Polynomial Algebra' Minisymposium Lecture at the First Joint Meeting of CAIMS & SIAM (24th Annual Meeting of CAIMS / SCMAI and 2003 SIAM Annual Meeting), Montreal, Canada, June 2003. See BASE/index.html#KM03.

199.
“On the Complexity of the Determinant,” Lecture at the `Complexity Theory' meeting at the Mathematical Research Institute in Oberwolfach, Germany, April 2003. Transparencies at BASE/03/oberwolfach.pdf.

198.
 “Efficient Problem Reductions in Linear Algebra,” Lecture at the 8th International Conference on Applications of Computer Algebra (ACA), at the University of Thessaly in Volos, Greece, June 2002. Transparencies at BASE/02/aca.pdf.

197.
“On the complexity of computing determinants and other challenges in symbolic computation,” at the ASCM 2001 The Fifth Asian Symposium on Computer Mathematics at Ehime University in Matsuyama, Japan, September 2001. Talk given by video tape due to the terrorist events of September 11. Transparencies at BASE/01/ascm.pdf.

196.
“Efficient linear algebra algorithms in symbolic computation,” Invited Lecture at the AMS-IMS-SIAM Joint Summer Research Conference on Fast Algorithms in Mathematics, Engineering and Computer Science at Mount Holyoke College, Massachusetts, August 2001. Transparencies at BASE/01/holyoke.pdf.

195.
 “Algorithms for sparse and black box matrices over finite fields,” Invited Lecture at the Sixth International Conference on Finite Fields and Applications (Fq6) in Oaxaca, Mexico, May 2001. Transparencies at BASE/01/fq6.pdf. Bibliography at BASE/index.html#Ka01:Fq6.

194.
“On the Complexity of Computing Determinants,” Invited Lecture at the `Finite Fields and Applications' meeting at the Mathematical Research Institute in Oberwolfach, Germany, January 2001. Transparencies at BASE/01/oberwolfach.pdf.

193.
“Teachning Math over the Internet: A new challenge for computer algebra,” Tutorial lecture at the International Symposium on Symbolic and Algebraic Computation ISSAC 2000 at St. Andrews, Scotland, August 2000. Transparencies at BASE/2K/issactut.ppt.

192.
 “Computer Algebra in the New Century: The Road Ahead,” Lecture at the Computer Algebra Minisymposium at the 3rd European Congress of Mathematics at Barcelona, Spain, July 2000. Transparencies at BASE/2K/ecm.pdf.

191.
“Efficient Algorithms for Computing the Nearest Polynomial With Parametrically Constrained Roots and Factors,” Lecture at the AMS-IMS-SIAM Joint Summer Research Conference on Symbolic Computation: Solving Equations in Algebra, Geometry and Engineering at Mount Holyoke College, Massachusetts, June 2000. Transparencies at BASE/2K/holyoke.pdf.

190.
 “Efficient Algorithms for Computing the Nearest Polynomial With Parametrically Constrained Roots and Factors,” Lecture at the Workshop on Symbolic and Numerical Scientific Computation (SNSC'99) at Johannes Kepler University Linz, Austria, August 1999. Transparencies at BASE/99/snsc.pdf.

189.
“Algebraic Complexity and Algorithms: Recent Advances and New Open Problems,” Plenary Lecture at the `Complexity Theory' meeting at the Mathematical Research Institute in Oberwolfach, Germany, November 1998. Transparencies at BASE/98/oberwolfach.pdf.

188.
“Massively Parallel Algorithms in Symbolic Computing,” Lecture at the workshop “Parallel Symbolic Computation” at the Mathematical Sciences Research Institute, Berkeley, California, October 1998. Transparencies at BASE/ 98/ msri. pdf.

187.
186.  “Challenges of Symbolic Computation My Favorite Open Problems,” Lecture at the East Coast Computer Algebra Day, Naval Academy, Annapolis, Maryland, April 1998. Transparencies at BASE/98/eccad.pdf; Lecture at the 1998 IMACS Conference on Applications of Computer Algebra (ACA), Prague, Czech Republic, August 1998.

185.
“Generic Programming with Black Boxes,” Lecture at the seminar `Generic Programming' at the International Conference and Research Center for Computer Science in Dagstuhl castle, Germany, April 1998. Transparencies at BASE/98/dagstuhl.pdf.

184.
“Factoring Polynomials over Finite Fields by Modular Polynomial Composition,” Lecture at the seminar `Computational Aspects of Commutative Algebra and Algebraic Geometry' at the International Conference and Research Center for Computer Science in Dagstuhl castle, Germany, May 1997. Transparencies at BASE/97/dagstuhl.pdf, BASE/97/dagstuhl_fig.pdf

183.
“Factoring Polynomials over High Algebraic Extensions of Finite Fields,” Lecture at the `Complexity Theory' meeting at the Mathematical Research Institute in Oberwolfach, Germany, November 1996.

182.
“Blocked Iterative Sparse Linear System Solvers,” Lecture at the Symposium on Parallel Computing for Solving Large Scale and Irregular Applications (Stratagem '96), INRIA Sophia Antipolis, France July 1996.

181.
“Factoring High-Degree Polynomials over Finite Fields New Theory, Faster Practice,” Lecture at the Second Magma Conference on Computational Algebra, Marquette University, Milwaukee, May 1996.

180.
“Generic Symbolic Programming in C++ an Example,” Lecture at the seminar `Computer Algebra – Software' at the International Conference and Research Center for Computer Science in Dagstuhl castle, Germany, February 1996.

179.
“Complexity Theory in the Service of Algorithm Design,” Lecture at the Conference on Algebraic Complexity in the memory of Jacques Morgenstern, INRIA Sophia Antipolis, France May 1995. Transparencies at BASE/ 95/ morgenstern. pdf.

178.
“Parallel Matrix-free Linear System Solving and Symbolic Math Applications,” Lecture at the East Coast Computer Algebra Day, University of Delaware, April 1995.

177.
“Factoring High-degree Polynomials on a Computer Network,” Minisymposium lecture at the 7th SIAM Conference on Parallel Processing for Scientific Computing, San Francisco, February 1995.

176.
“Subquadratic-Time Factoring of Polynomials over Finite Fields,” Lecture at the `Complexity Theory' meeting at the Mathematical Research Institute in Oberwolfach, Germany, November 1994.

175.
“Future Directions of Computer Algebra,” Lecture at the 1994 Maple Technical Retreat, Sparrow Lake, Canada, June 1994.

174.
“Polynomial Factorization,” Lecture at the Symposium on Quantifier Elimination and Cylindrical Algebraic Decomposition (in honor of Prof. George E. Collins's 65th birthday), RISC Linz, Austria, October 1993.

173.
“Computational Differentiation and Algebraic Complexity Theory,” Lecture at the Theory Institute on Combinatorial Challenges in Computational Differentiation, Argonne National Laboratory, May 24, 1993.

172.
“Parallel Solution of Sparse Linear Systems with Symbolic Entries,” Lecture at the `Applicable Algebra' meeting at the Mathematical Research Institute in Oberwolfach, Germany, February 1993. Transparencies at BASE/93/oberwolfach.pdf.

171.
“Parallel Sparse Linear System Solving,” Lecture at the `Complexity Theory' meeting at the Mathematical Research Institute in Oberwolfach, Germany, November 1992.

170.
“Processor-Efficient Parallel Solution of Systems of Linear Equations,” Lecture at the seminar `Algebraic Complexity and Parallelism' at the International Conference and Research Center for Computer Science in Dagstuhl castle, Germany, July 1992.

169.
“Processor-Efficient Parallel Solution of Systems of Linear Equations,” Minisymposium lecture at the 6th SIAM Conference on Discrete Mathematics, Vancouver, Canada, June 1992.

168.
“Computing Determinants of Matrices without Divisions,” Lecture at the 5th Mid-Atlantic Algebra Conference, George Mason University, Fairfax, Virginia, May 1992.

167.
“A Decade of Research on Polynomial Factorization,” Lecture at the 1st Latin American Symposium on Theoretical Informatics, São Paulo, Brazil, April 1992.

166.
“Factoring Polynomials over the Algebraic Closure,” Lecture at the seminar `Algorithms in Computer Algebra' at the International Conference and Research Center for Computer Science in Dagstuhl castle, Germany, December 1991.

165.
164. “Processor-Efficient Parallel Solution of Linear Systems,” Lecture at the Parallel Scientific Computation Workshop, Rensselaer Polytechnic Institute, October 1991; Lecture at the seminar `Efficient Interpolation Algorithms' at the International Conference and Research Center for Computer Science in Dagstuhl castle, Germany, December 1991.

163.
“On Wiedemann's Method of Solving Sparse Linear Systems,” Lecture at the 9th Symposium on Applied Algebra, Algebraic Algorithms, and Error Correcting Codes in New Orleans, October 1991.

162.
“DSC A System for Distributed Symbolic Computation,” Lecture at the `Symbolic Software for Mathematical Research' workshop at the DIMACS NSF Science and Technology Center at Rutgers University, March 1991.

161.
“Effective Noether Irreducibility Forms and Applications,” Lecture at the `Complexity Theory' meeting at the Mathematical Research Institute in Oberwolfach, Germany, November 1990.

160.
“Efficient Size Bounds for Noether Irreducibility Forms and Applications to Parallel Problems on Hyper-Surfaces,” Lecture at the `Purdue Conference on Algebraic Geometry and Its Applications' in Honor of S. Abhyankar's 60th Birthday, June 1990.

159.
“Processor Efficient Algebraic Computation,” Lecture at the `IV International Conference on Computer Algebra in Physical Research' at the Joint Institute for Nuclear Research in Dubna, Soviet Union, May 1990.

158.
“Decomposing an Algebraic Curve,” Minisymposium Lecture at the SIAM Conference on Geometric Design, Tempe, Arizona, November 1989.

157.
“Parallel Algebraic Algorithm Design,” Half-Day Tutorial at the 1989 International Symposium for Symbolic and Algebraic Computation, Portland, Oregon, July 1989.

156.
“Computing the Irreducible Complex and Real Components of an Algebraic Curve,” Lecture at the RISC-Workshop on `Combinatorics and Computational Algebraic Geometry' at the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, May 1989.

155.
“Size Efficient Parallel Algebraic Circuits for Partial Derivatives,” Lecture at the `Complexity Theory' meeting at the Mathematical Research Institute in Oberwolfach, West Germany, November 1988.

154.
“Explicit Construction of the Hilbert Class Field of Imaginary Quadratic Fields,” Lecture at the `Computational Number Theory' meeting at the Mathematical Research Institute in Oberwolfach, West Germany, May 1988.

153.
“Factoring into Sparse Polynomials Made Easy,” Lecture at the conference `Toronto Experience: 20 Years of Computer Science Research,' University of Toronto, May 1988.

152.
“Randomized Parallel Computation of Matrix Canonical Forms,” Lecture at the `Foundations of Computing' workshop by the Max Planck Institute for Mathematics and by the Department of Computer Science of the University in Bonn, West Germany, June 1987.

151.
“Computing with Polynomials Given by Straight-Line Programs,” Lecturer at the `Complexity Theory' meeting at the Mathematical Research Institute in Oberwolfach, West Germany, November 1986.

150.
“Polynomial Factorization,” Lecturer in the short-course `Computer Algebraic Algorithms' at the conference “Computers in Mathematics” at Stanford University, August 1986.

149.
“Multivariate Polynomial Factorization: From Curves to van der Monde Determinants,” Lecture at the workshop “Computational Algebra and Number Theory” at the Mathematical Sciences Research Institute, Berkeley, California, October 1985.

148.
“Deterministic Irreducibility Testing of Polynomials over Large Finite Fields,” presentation at the AMS-IMS-SIAM Joint Summer Research Conference on Computational Number Theory, Arcata, California, August 1985.

147.
“An Alternate Construction of Succinct Certificates for Normal Univariate Irreducible Polynomials with Integer Coefficients,” invited Presentation at the Special Session on `Constructive Methods in Algebra' at the 793rd meeting of the AMS in Bryn Mawr, Pennsylvania, March 16, 1982.

Presentations of Papers at Conferences

See References section in Publications by Erich Kaltofen.

Invited Colloquia and Seminar Lectures

146.
“Proof-of-Work Certificates for Cloud-Delegated Massive Computations,” Werner Krandick Lecture, Department of Computer Science, Drexel University, January 25, 2021.

145.
“Proof-of-work Certificates for High Complexity Computations for Linear Algebra,” Joint CUNY Graduate Center-Courant Seminar in Symbolic-Numeric Computing at City University of New York Graduate Center, November 14, 2019.

144.
“Sparse Polynomial Interpolation Without and With Errors,” Lecture at Shanghai University, China, June 8, 2018.

143.
“Linear time interactive certificates for the MinPoly & Determinant of a sparse matrix,” Seminar Lecture at the Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China, June 7, 2018.

142.
“Polynomial Time Interactive Proofs For Linear Algebra with Exponential Matrix Dimensions,” Theoretical Computer Science Seminar at Duke University, Durham, NC, September 21, 2017.

141.
“Sparse Multivariate Function Recovery With Errors in the Evaluations,” Seminar at Georgia Institute of Technology, Atlanta, Georgia, March 17, 2017.

140.
“Sparse Polynomial Interpolation Without and With Errors,” Colloquium at Georgia Institute of Technology, Atlanta, Georgia, March 16, 2017.

139.
“Sparse Polynomial Interpolation Codes and Their Decoding Beyond Half the Minimum Distance,” Theoretical Computer Science Seminar at Duke University, Durham, NC, April 28, 2016.

138.
“Hybrid Symbolic-Numeric Computation A Marriage Made in Heaven,” Symbolic-Numeric Computing Seminar at the Graduate Center of CUNY New York, NY, September 17, 2015.

137.
“Fast Polynomial Multiplication And Applications,” Kwan Chao-Chi Distinguished Lecture at the Institute of Systems Science of the Academy of Mathematics and Systems Science, August 19, 2015, Beijing, China.

136.
“Sparse Multivariate Rational Function Recovery With Many Errors in the Evaluations,” Seminar at IMAG, J. Fourier University Grenoble, France, November 20, 2014.

135.
“Cleaning-Up Data With Errors: When Symbolic-Numeric Sparse Interpolation Meets Error-Correcting Codes,” Computational Mathematics Colloquium, University of Waterloo, Canada, October 10, 2014. On p. 25 I give the multivariate generalization of the Prony sparse interpolation algorithm: BASE/14/waterloo_14.pdf (430K).
134.
“Symbolic Computation and Complexity Theory,” Colloquium, RISC Linz, Austria, November 11, 2013.

133.
“Approximation of Data Points By Sparse Polynomial Models,” Helen Barton Lecture Series in Computational Mathematics Series in Computational Mathematics, University of North Carolina at Greensboro, March 27, 2013.

132.
“Sparse Interpolation in the Presence of Noise and Outliers (SPINO),” Seminar Lecture at the Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China, November 2, 2012.

131.
“Complexity Theory and Symbolic Computation,” Invited Lecture at the University Pierre and Marie Curie (UPMC) Paris 6, France, July 17, 2012.

130.
“The Art of Hybrid Computation,” Colloquium at the University of Montpellier 2, France April 19, 2012.

129.
“The Art of Hybrid Symbolic-Numeric Computation,” Distinguished Faculty Colloquium at the Dept. of Mathematics at North Carolina State University, Raleigh, February 16, 2012; BASE/12/ncsu_12.pdf, https://www.youtube.com/watch?v=QQtdWXGRPto.

128.
“Two complexity results from convex optimization: Matrix definiteness certified and Valiant's determinants symmetricized,” Seminar Lecture at Hong Kong University, December 19, 2011

127.
“Sixteen years after DSC and WLSS2: what parallel computations I do today,” (same as 235), Seminar Lecture at the Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China, July 23, 2011.

126.
“Two complexity results from convex optimization Valiant's determinants symmetricized and matrix definiteness certified,” Seminar Lecture at the Key Laboratory of Mathematics-Mechanization KLMM, Institute of Systems Sciences, Chinese Academy of Sciences, Beijing, China, July 12, 2011.

125.
“Quadratic-Time Certificates in Linear Algebra,” Theory Seminar Lecture at the University of Toronto, Canada, April 8, 2011.

124.
“Exact Certification in Global Polynomial Optimization via Sums-Of-Squares of Polynomials and Rational Functions with Rational Coefficients,” Seminar Lecture at the University College Dublin, Ireland, May 31, 2010.

123.
“A Fraction Free Matrix Berlekamp/Massey Algorithm,” Seminar Lecture at the Key Laboratory of Mathematics-Mechanization KLMM, Institute of Systems Sciences, Chinese Academy of Sciences, Beijing, China, November 12, 2008.

122.
Same as 222, Invited talk at the Joint Lab Meeting (JLM) of the Ontario Research Centre for Computer Algebra (ORCCA) at the University of Waterloo, June 2008.

121.
“On Exact and Approximate Interpolation of Sparse Rational Functions,” Colloquium at Tsukuba University, Japan, March 2007.

120.
“The Art of Symbolic Computation,” Applied Mathematics Colloquium at Massachusetts Institute of Technology, April 2006. Transparencies at BASE/ 06/ mit. pdf. Maple worksheets at BASE/ 06/ groebner. txt and BASE/ 05/ aca. txt.
119.
“The Art of Symbolic Computation,” Computer Science Colloquium at North Carolina State University, October 2004. Transparencies at BASE/ 04/ ncsu. pdf. Maple worksheets at BASE/ 04/ nyu. txt and BASE/ 03/ risc1. txt.
118.
“Approximate Factorization of Complex Multivariate Polynomials,” Computer Science Colloquium at New York University, September 2004. Transparencies at BASE/ 04/ nyu. pdf. Maple worksheet at BASE/ 04/ nyu. txt.
117.
“On the Complexity of Computing Determinants,” Computer Science Colloquium at Duke University, October 2003. Transparencies at BASE/ 03/ duke. pdf.

116.
“The Art of Symbolic Computation,” Colloquium at the Research Institute for Symbolic Computation in Linz, Austria, May 2003. Transparencies at BASE/ 03/ risc. pdf. Maple worksheets at BASE/ 03/ risc1. txt, BASE/ 03/ risc2. txt.

115.
“The art of symbolic computation,” Colloquium at the University of Waterloo, Canada, March 2002. Transparencies at BASE/ 02/ waterloo. pdf.

114.
“Deterministic polynomial-time algorithms for polynomial factorization modulo a large prime,” Seminar at the École Normale Supérieure in Lyon, France, June 2001.

113.
“Symbolic computation in the new century The road ahead,” Colloquium at Clemson University, April 2001. Transparencies at BASE/ 01/ clemson. pdf.

112.
“On the Complexity of Computing Determinants,” Lecture in the `Algorithmic Number Theory Program' at the Mathematical Sciences Research Institute, Berkeley, California, November 2000. Transparencies at BASE/ 2K/ msri. pdf.
111.
Same as 192, Colloquium at the Institut d'Informatique et de Mathématiques Appliquées de Grenoble (IMAG), France, July 2000.

110.
 “Early Termination in Ben-Or/Tiwari Sparse Interpolation and a Hybrid of Zippel's Algorithm,” Seminar lecture at the University of Western Ontario, Canada, February 2000. Transparencies at BASE/ 2K/ uwo.pdf.

109.
“Generic programming: C++ vs. Java,” Object Technologies Seminar, University of Delaware, November 1999. Transparencies at BASE/ 99/ udel.pdf.

108.
107.  “Efficient Algorithms for Computing the Nearest Polynomial With A Real Root and Related Problems,” Seminar lectures at the Institut d'Informatique et de Mathématiques Appliquées de Grenoble, France and the Eidgenössische Technische Hochschule in Zurich, Switzerland, January 1999. Transparencies at BASE/ 99/ imagethz.pdf.
106.
Same as 187, Simon Fraser University, Center for Experimental and Constructive Mathematics, Vancouver, July 1998.

105.
“The Black Box Representation of Symbolic Mathematical Objects: New Algorithms, Record Breaking Computations,” Pacific Institute for the Mathematical Sciences (PIMS) 1997 Distinguished Lecture Series, Simon Fraser University, Vancouver, March 1997.

104.
“Matrix-free Polynomial Factorization,” Center for Computing Sciences Colloquium, Institute for Defense Analysis, Bowie, Maryland, November 1995.

103.
“Parallel Symbolic Computation by Black Boxes,” Colloquium at Indiana University Purdue University at Indianapolis, April 1995.

102.
“Polynomial Factorization and Applications,” Special Colloquium at Florida State University, April 1995.

101.
“Parallel Matrix-free Linear System Solving and Symbolic Math Applications,” Special Seminar Lecture at North Carolina State University, March 1995.

100.
“Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm,” Colloquium at the State University of New York at Albany, April 1994.

99.
“Factoring a High-Degree Polynomial on Many Computers,” Seminar Lecture at Virginia Polytechnic Institute and State University, March 1994.

98.
97. 96. “Parallel Solution of Sparse Linear Systems with Symbolic Entries,” Seminar Lecture at the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, February 1993; Lecture at the University Tübingen, Germany, October 1993; Lecture at IBM Heidelberg, Germany, October 1993.

95.
“Solving Sparse Systems of Linear Equations (With Symbolic Entries),” Seminar Lecture at Xerox PARC, July 1992.

94.
“Polynomial Factorization and Applications,” Special Seminar Lecture at North Carolina State University, April 1992.

93.
“Solving Sparse Systems of Linear Equations (with Symbolic Entries),” Seminar Lecture at Virginia Polytechnic Institute and State University, March 1992.

92.
“Parallel Algebraic Computation: Theory & Practice,” Colloquium at Radford University, March 1992.

91.
“Polynomial Factorization and Applications,” Colloquium at Williams College, October 1991.

90.
“Parallel Algebraic Computation: Theory and Practice,” Seminar Lecture at the University of Waterloo, May 1991.

89.
“Processor Efficient Parallel Solution of Linear Systems,” Seminar Lecture at the University of Toronto, April 1991.

88.
“Effective Noether Irreducibility Forms and Applications,” Seminar Lecture at Queen's University in Kingston, Canada, April 1991.

87.
“Parallel Symbolic Computation A Beginning,” Lecture at the New York State Center for Advanced Technology in Computer Applications and Software Engineering, Syracuse University, March 1991.

86.
“Effective Noether Irreducibility Forms and Applications,” Seminar Lecture at the Eidgenössische Technische Hochschule in Zurich, Switzerland, November 1990.

85.
“Processor Efficient Parallel Program Transformations,” Colloquium at Louisiana State University, November 1989.

84.
“How to Solve Systems of Non-Linear Equations Faster,” Seminar Lecture at Carnegie-Mellon University, September 1989.

83.
“An Improve Las Vegas Primality Test,” Colloquium at the University of Saarbrücken, West Germany, June 1989.

82.
“How to Solve Systems of Non-Linear Equations Faster,” Colloquium at Cornell University, February 1989.

81.
“Implicit Representations of Symbolic Data and Applications,” Seminar Lecture at Syracuse University, February 1989.

80.
79. 78. 77. “How to Solve Systems of Non-Linear Equations Faster,” Seminar Lecture at the University of Illinois at Urbana-Champaign, April 1988, at the Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, June 1988, Colloquium at the University of Alberta in Edmonton, September 1988, and Seminar Lecture at the National Science Foundation, October 1988.

76.
“The Problem of Factoring Polynomials,” Colloquium at the University of Indiana in Bloomington, December 1987.

75.
“Computing with Polynomials Given by Straight-Line Programs: Theory and Practice,” RISC-Colloquium at the Johannes Kepler University in Linz, Austria, June 1987.

74.
“Fast Multiplication of Polynomials over Arbitrary Rings,” Colloquium at the University of Zürich, Switzerland, June 1987.

73.
“Fast Parallel Computation of Canonical Forms of Polynomial Matrices,” Seminar Lecture at the University of Southern California, February 1987.

72.
“Computer Algebra,” Colloquium at Oakland University, Rochester, Michigan, January 1987.

71.
“The Problem of Factoring Polynomials,” Seminar Lecture at the University of California in Los Angeles, May 1986.

70.
“Computing with Polynomials Given by Straight-Line Programs: Theory and Practice,” Seminar Lecture at the Massachussetts Institute of Technology, April 1986.

69.
“The Complexity Year: A Personal Perspective,” Colloquium at the University of Delaware, March 1986.

68.
“Computing with Polynomials Given by Straight-Line Programs: Theory and Practice,” Seminar Lecture at the University of Toronto, March 1986.

67.
“Uniform Closure Properties of P-Computable Functions,” Seminar Lecture at Stanford University, November 1985.

66.
“Computing with Polynomials Given by Straight-Line Programs,” Seminar Lecture at the University of California at Berkeley, September 1985.

65.
“Computer Algebra: Theory and Practice,” Colloquium at the Tektronix Computer Research Laboratory in Beaverton, Oregon, August 1985.

64.
63. 62. 61. “Computing with Polynomials Given by Straight-Line Programs,” Seminar Lecture at Kent State University, March 1985, at the University of Toronto, March 1985, Colloquium at the University of Washington, June 1985, and Colloquium at the University of Oregon, July 1985.

60.
“Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices,” Colloquium at the State University of New York in Albany, February 1985.

59.
“Introduction to Computer Algebra and the Computer Algebra System Macsyma,” Colloquium at the University of Ottawa, June 1984.

58.
“Arithmetic in Imaginary Quadratic Fields,” Seminar Lecture at the University of Toronto, May 1984.

57.
“Fast Parallel Absolute Irreducibility Testing and Factoring,” Colloquium at the Massachussetts Institute of Technology, May 1984.

56.
55. “On the Sequential and Parallel Complexity of Polynomial Factorization,” Colloquium at Harvard University, October 1983, and Colloquium at the General Electric Research and Development Center in Schenectady, March 1984.

54.
53. “An Introduction to the MACSYMA Computer Algebra System,” Colloquium and live demonstration in the Mathematics and Physics Dept. at the University of Toronto, November and December 1983.

52.
“Polynomial-Time Polynomial Factorization—a Tutorial,” Seminar Lecture at the University of Waterloo, June 1983.

51.
“Three Uses of VAXIMA: How to Break the Multiplicative Knapsack Encryption Scheme, how to Compute Polynomials with Dihedral Galois Group, and how to Locate a Company for Maximum Profit,” Colloquium at Kent State University, May 1983.

50.
49. 48. “Some Recent Results for Factoring Polynomials in Polynomial Time,” Colloquium at Purdue University, February 1983, Seminar Lecture at the T. J. Watson IBM Research Center, April 1983, and Colloquium at Dartmouth College, April 1983.

47.
46.  “Factoring Multivariate Integer Polynomials in Polynomial Time,” Seminar Lecture at the Massachussetts Institute of Technology, July 1982, and Seminar Lecture at Bell Laboratories, Murray Hill, July 1982. I describe what later became known as the “inverse calculator,” which computes from high precision approximations of roots the corresponding equations: BASE/82/MIT_talk_july_82.pdf (19.4MB).

45.
44. 43. “The Problem of Factoring Polynomials with Integer Coefficients,” Colloquium at Cornell University, November 1981, Colloquium at Rensselaer Polytechnic Institute, April 1982 and Seminar at the University of Toronto, April 14, 1982. The link is to several slides from the Toronto talk incl. an execution of the bivariate algorithm in Macsyma [later published at FOCS 1982]: BASE/82/Ka82_toronto_apr_14.pdf (2.3MB).

42.
“On Integer Polynomials that are Exponentially Hard to Factor,” Colloquium at the University of Delaware, March 1981.

41.
“Compiling Pascal into the Lambda Calculus,” Mathematics Seminar at the Johannes Kepler University in Linz, June 1979.

Other Talks

40.
“Proof-of-work Certificates for High Complexity Mathematical Computations,” Informal Lecture at the Calculemus Track of the 11th Conference on Intelligent Computer Mathematics (CICM'18), RISC-Linz, Hagenberg, Austria, August 16, 2018.

39.
“What is Hybrid Symbolic-Numeric Computation,” Thematic Program in Computer Algebra Seminar Lecture (Introductory Lecture to Workshop on Linear Computer Algebra and Symbolic-Numeric Computation), Fields Institute, Toronto, October 23, 2015.

38.
“Sparse Polynomial Interpolation Codes and Their Decoding Beyond Half the Minimum Distance,” Lecture in the Symbolic Computation Seminar at North Carolina State University, September 15, 2015.

37.
“Error-Correcting Sparse Interpolation In Chebyshev Basis,” (same as 251), evening lecture at the seminar `Complexity of Symbolic and Numerical Problems' at Schloss Dagstuhl – Leibniz Center for Informatics, Germany, June 2015.

36.
“Essentially Optimal Interactive Certificates in Linear Algebra,” (same as 249), Joint Radon Colloquium and RISC Seminar at the Johann Radon Institute for Computational and Applied Mathematics (RICAM), Linz, Austria, November 25, 2014.

35.
“Essentially Optimal Interactive Certificates in Linear Algebra,” (same as 249) Lecture at the Key Laboratory of Mathematics-Mechanization KLMM, Institute of Systems Sciences, Chinese Academy of Sciences, Beijing, China, August 7, 2014.

34.
“Minisymposium Summary What I've Observed,” Lecture at the Minisymposium `Sparse Models, Interpolation and Polynomials' at the “SIAM Conference on Applied Algebraic Geometry AAG '13,” Fort Collins, August 3, 2013.

33.
“The Power of Open Source Math Software,” Presentation at the Roundtable on Software for Research at the Simons Foundation, New York, May 15, 2012.

32.
“Supersparse Black Box Rational Function Interpolation,” Seminar in the Department of Computer Science at the University of Calgary, February 19, 2010.

31.
Same as 221, Lecture in the Symbolic Computation Seminar at North Carolina State University, December 2007.

30.
“Fast Algorithms for Polynomial Factorization: a Selection,” Lecture at the Second NCSU-China Symbolic Computation Collaboration Workshop at Zhejiang University, Hangzhou, China, March 2007. Transparencies at BASE/07/hangzhou.pdf.

29.
“Errors in variables and hybrid symbolic-numeric methods,” Joint Lecture in the Numerical Analysis and Symbolic Computation Seminars at North Carolina State University, September 2006.

28.
“Finding Small Degree Factors of Multivariate Supersparse (Lacunary) Polynomials Over Algebraic Number Fields,” Lecture at the seminar `Challenges in Symbolic Computation Software' at the International Conference and Research Center for Computer Science in Dagstuhl castle, Germany, July 2006.

27.
“Approximate Complex Multivariate Polynomial Factorization,” Lecture in the Ph.D. Seminar at the College of Computer and Information Science at Northeastern University, April 2006.

26.
Same as 205. Lecture at the First NCSU-China Symbolic Computation Collaboration Workshop at North Carolina State University, October 2005.

25.
“On the complexity of factoring bivariate supersparse (lacunary) polynomials,” Lecture in the Symbolic Computation Seminar at North Carolina State University, January 2005.

24.
Same as 198. Lecture at the Mathematics Mechanization Research Center, Institute of Systems Sciences, Chinese Academy of Sciences, Beijing, China, August 2002.

23.
Same as 190. Lecture in the Numerical Analysis Seminar at North Carolina State University, September 1999.

22.
“Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots,” Simon Fraser University, Center for Experimental and Constructive Mathematics, Vancouver, July 1998. Transparencies at BASE/ 98/ sfu.pdf.
21.
“Mathematics on the Internet New Problems, Suggested Solutions,” Presentation at the 1997 Instructional Technologies Expo, North Carolina State University, September 1997. HTML document at http://www. math. ncsu. edu/ ˜elk27/ ssg/ Erich/ Expo97/ expo97.html

20.
“Factoring High-Degree Polynomials over Finite Fields New Theory, Faster Practice,” Lecture in the Algbra Seminar at North Carolina State University, November 1996.

19.
“Polynomial Factorization over High Algebraic Extensions of Finite Fields,” Special Seminar at the University of Delaware, May 1996.

18.
“Parallel Matrix-free Linear System Solving and Computational Complexity Theory,” Special Seminar at Florida State University, April 1995.

17.
“Teaching Computational Abstract Algebra,” Workshop on New Technology for Symbolic Computational Mathematics and Applications in Research and Education, Center for Computer Aids for Industrial Productivity, Rutgers University, June 1994.

16.
“Asymptotically Fast Solution of Toeplitz-Like Singular Linear Systems,” invited Presentation at 884th meeting of the AMS at Syracuse University, September 1993.

15.
“Symbolic Computation,” MP&O Research Seminar Lecture in the Management Department at Rensselaer Polytechnic Institute, April 1990.

14.
“Processor Efficient Computation of Partial Derivatives,” Lecture at the Parallel Circus, Rensselaer Polytechnic Institute, April 1989.

13.
12. “Polynomial Factorization,” and “Parallel Algorithms for Algebraic Problems,” two Lectures given for the shortcourse `Algorithmic Methods in Computer Algebra,' organized by A. Miola at the College G. Reiss Romoli in L'Aquila, Italy, April 1988.

11.
“Cryptography: Where Theoretical Computer Science Becomes a National Security Issue,” Lecture given for the Pi Mu Epsilon Mathematics Honor Society at Rensselaer Polytechnic Institute, February 1988.

10.
“Fast Multiplication of Polynomials over Arbitrary Rings,” Seminar Lecture at IBM T. J. Watson Research Center, August 1987.

9.
“Las Vegas-RNC Computation of the Smith Normal Form of Polynomial Matrices,” Presentation at the Princeton Forum on Algorithms and Complexity, March 1987.

8.
“Computing with Polynomials Given by Straight-Line Programs,” informal Presentation at the 12th Symposium on Mathematical Foundations of Computer Science in Bratislava, Czechoslovakia, August 1986.

7.
“Macsyma Seminar,” demonstration of Macsyma to the Physics Department at the University of Toronto, December 1983.

ACM Lectures

6.
5. 4. 3. “Computational Algebra and Number Theory: A Technological Wonder of our Times,” Lecture at the Western Massachusetts ACM Chapter in Springfield, Massachusetts, October 1989; Lecture at the ACM Student Chapter at Louisiana State University, November 1989; Lecture at the Fourth Congress on Computer Science Applications of the Puerto Rico ACM Student Chapter in Ponce, Puerto Rico, April 1990; Lecture at the ACM Student Chapter at Lawrence University, Appleton, Wisconsin, April 1991.

2.
1. “Parallel Algebraic Computation: A Beginning,” Lecture at the Virginia Polytechnic Institute ACM Student Chapter, April 1991; Lecture at the ACM Student Chapter at Lawrence University, Appleton, Wisconsin, April 1991.

About this document ...

Invited Lectures by
Erich Kaltofen

This document was generated using the LaTeX2HTML translator Version 2021.2 (Released July 1, 2021)

The command line arguments were:
latex2html -ascii_mode -split 0 -no_navigation lectures.tex

The translation was initiated on 2024-07-25