Home Research Books and Papers Software Posters Talks Teaching Students Scholarly Activities

Selected Talks

• Optimizing Algorithms and Code for Data Locality and Parallelism: A SHARCNET Tutorial.
  SHARCNET Summer Seminar, London, Ontario, August 3, 2011
• Optimizing FFT-based Polynomial Arithmetic for Data Locality and Parallelism.
  MaGiX@LIX Workshop, Ecole Polytechnique, Palaiseau, France, September 20, 2011.
• Semi-algebraic description of the equilibria of dynamical systems.
  CASC 2011, Kassel Germany, September 7, 2011.
• Exact Computation of the Real Solutions of Arbitrary Polynomial Systems.
  ICIAM 2011, Computer Algebra Mini-symposium, Vancouver BC, July 18, 2011.
• Computing the real solutions of polynomial systems with the RegularChains library in Maple.
  Here's the worksheet (with output) and the ISSAC 2011 Distinguished Software Presentation Award.
  
• Fundamental Algorithms and Implementation Techniques for Computing with Regular Chains.
  Summer School of Symbolic Computation, Chengdu, China, August 12, 2009.
• Computations Modulo Regular Chains
  ISSAC'09, Seoul, Korea, July 29, 2009.
• Computing Cylindrical Algebraic Decomposition via Triangular Decomposition.
  ISSAC'09, Seoul, Korea, July 29, 2009.
• FFT-based Dense Polynomial Arithmetic on Multi-cores.
  ACA'09, Montréal, June 26, 2009.
• Balanced Dense Polynomial Multiplication on Multicores.
  ACA'09, Montréal, June 26, 2009.
• Solving Parametric Polynomial Systems with the RegularChains Library in Maple.
  ACA'09, Montréal, June 25, 2009.
• Differential Algebra, Regular Chains and Modeling. ACA'09, Montréal, June 25, 2009.
• Triangular Decomposition of Polynomial Systems: Algorithmic Advances and Remaining Challenges.
  International Conference on Mathematics Mechanization'09
  In honor of Prof. Wu Wen-Tsün, Beijing, China, May 13, 2009.
• Computing with Constructible Sets.
  MOCAA M3 Workshop, Lodon, Ontario, May 9, 2008.
• When does 〈T〉 Equal sat(T)?
  MOCAA M3 Workshop, Lodon, Ontario, May 9, 2008.
• Component-level Parallelization of Triangular Decompositions.
  Interactive Parallel Computation in Support of Research in Algebra, Geometry and Number Theory
  MSRI Workshop 2007, Berkeley, February 1, 2007.
• Parallelization of Triangular Decompositions.
  SHARCNET Fall Workshop 2006, Waterloo, Canada, November, 2006.
• AXIOM: Generic, Open, Powerful
  International Congress on Mathematical Software, Castro Urdiales, Spain, 2006.
• Triangular Decompositions of Polynomial Systems: From Theory to Practice.
  Tutorial at ISSAC'06, Genoa, Italy, 9 July 2006.
• Bounds and Algorithms in Differential Alegbra:the Ordinary Case.
  Dagstuhl Seminar,Dagstuhl, Germany, July, 2006.
• Solving Polynomial Systems Symbolically and in Parallel.
  MITACS - CAIMS Meeting, Toronto, Canada, June 18, 2006.
• Some Recipes for Handling Large Expressions in Polynomial System Solving.
  ACA'05.
• On the Complexity of the D5 Principle.
  CMS Meeting 2005.
• Lifting Techniques for Triangular Decompositions.
  MOCCA'05.
• On Polynomial Gcds over Direct Products of Fields Given by Towers of Simple Extensions.
  MOCCA'04.
• Generic Modular Computations in Aldor.
  CATLAN'04.
• Solving Systems of Algebraic Equations with AXIOM.
  ACA'04.
• Dr Modular or How I Learned to Stop Worrying and Love Symbolics.
  ACA'03.
• Recent Advances on Regular Chains.
  SCA'02.
• Computation of Canonical Forms for Ternary Cubics.
  ISSAC'02.
• Around the StandardMath Library.
  CATLAN'01.
• Integrable (systems of) PDEs and Solitons.
  ISSAC'01.
• On Triangular Decompositions of Algebraic Varieties.
  MEGA 2000.
• Design of Nonseparable Bidimensional Wavelets and Filter Banks using Gröbner Bases and Triangualr Systems.
  FRISCO'97.
• On the Theories of Triangular Sets.
  Seminar talk at the University of Santander, 1998.
• PhD Defence.
  University Paris 6, June 1997.