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

Selected Talks

• Recent Advances in Algorithms Supporting the Polyhedral Model.
  CDP 2024 (CASCON 2024) University of York, November 12..
• Comprehensive LU Decomposition and True Path.
  SYNASC 2024, West University of Timisoara, September 17th.
• Counting the integer points of parametric polytopes: A Maple implementation.
  CASC 2024, Rennes, September 3rd.
• Osculating spaces of plane analytic curves.
  CASC 2024, Rennes, September 5th.
• Efficient detection of redundancies in systems of linear inequalities.
  ISSAC 2024, Raleigh, July 18.
• Modular algorithms for computing triangular decompositions of polynomial systems.
  RTCA 2023, IHP Paris, France, October 16
• Decomposition and QE algorithms over the reals and over the integers.
  Special Session in honor of Professor James Davenport, SYNASC 2023, LORIA, France, September 11-13
• Contributions to Automatic Parallelization Probably in Support of Computer Algebra.
  RTCA 2023, ENS Lyon, France, June 29
• Cache Complexity in Computer Algebra.
  École Polytechnique, 5 Décembre 2022
• Implementation Techniques for Power, Laurent, and Puiseux Series in Several Variables.
  CASC 2022, Gebze, Turkey, 23 August 2022
• Design and Implementation of Multi-Threaded Algorithms in Polynomial Algebra.
  ISSAC 2021, Saint Petersburg, Russia, July 20.
• Parallelization of Triangular Decompositions: Design and Implementation with the BPAS library.
  Sage/Oscar Days, February 17, 2021.
• Big Prime Field FFTs on the GPU.
  13th Workshop on Challenges for Parallel Computing, CASCON 2017, Markham ON. October 29th, 2018.
• Polynomials over Power Series and their Applications to Limit Computations (tutorial version).
  CASC 2018 Tutorial, University of Lillem September 17, 2018
• Models of Computation for Graphics Processing Units.
  12th Workshop on Challenges for Parallel Computing, CASCON 2017, Markham ON. November 6th, 2017.
• Computing the Integer Points of a Polyhedron, I: Algorithm.
  CASC 2017: Beijing, September 2017.
• Computing the Integer Points of a Polyhedron, II: Complexity Estimates.
  CASC 2017: Beijing, September 2017.
• Jordan Canonical Form with Parameters From Frobenius Form with Parameters.
  MACIS 2017: Vienna, November 2017.
• On the Extended Hensel Construction and its Application to the Computation of Limit Points.
  ISSAC 2017: Kaisersluatern, July 2017.
• Big Prime Field FFT on the GPU7.
  ISSAC 2017: Kaisersluatern, July 2017.
• Cache Memories, Cache Complexity.
  ACA, Session on High-Performance Computer Algebra, Jerusalem College of Technology, July 20, 2017.
• Comprehensive Optimization of Parametric Kernels for Graphics Processing Units.
  ACA, Session on High-Performance Computer Algebra, Jerusalem College of Technology, July 21, 2017.
• Comprehensive Optimization of Parametric Kernels for Graphics Processing Units.
  15th Workshop on Compiler-Driven Performance. CASCON 2016, Markham ON. November 1st, 2016.
• Computing limits of real multivariate rational functions: around and beyond the case of an isolated zero of the denominator.
  JLM talk given by Mahsa Kazemi, UWO, October 14, 2016
• Parallel Integer Polynomial Multiplication.
  SYNASC, West University of Timisoara, September 24, 2016.
• Computing Limits of Real Multivariate Rational Functions.
  ISSAC 2016, July 22, 2016.
• Automatic Parallelization of Computer Programs: From C to CUDA.
  TRICS Seminar, University of Western Ontario, March 2nd, 2016.
• MetaFork: A Compilation Framework for Concurrency Models Targeting Hardware Accelerators and Its Application to the Generation of Parametric CUDA Kernels.
  Technical Paper Session. CASCON 2015, Markham ON. November 2nd, 2015.
• Symbolic-Numeric Integration of Rational Functions with the BPAS Library.
  Chongqing Institute of Green and Intelligent Technology, Chinese Academy of Sciences, ChongQing, Ocotober 10, 2015.
• Quantifier Elimination, Polyhedral Computations and their Applications to the Parallelization of Computer Programs.
  East Coast Computer Algebra Day, The Fields Institute, October 3rd, 2015.
• Regular Chains under Linear Changes of Coordinates and Applications.
  CASC, Aachen. September 17, 2015.
• A Standard Basis Free Algorithm for Computing the Tangent Cones of a Space Curve.
  CASC, Aachen. September 16, 2015.
• Simplification of Cylindrical Algebraic Formulas.
  CASC, Aachen. September 15, 2015.
• Solving Parametric Polynomial Optimization via Triangular Decomposition
  ICIAM 2015, Beijing, August 10, 2015.
• Optimizing Computer Programs: A Killer App for Scientific Computing?
  Chongqing Institute of Green and Intelligent Technology, Chinese Academy of Sciences, Chongqing, July 9, 2015.
• A Many-core Machine Model for Designing Algorithms with Minimum Parallelism Overheads.
  9th Workshop on Challenges for Parallel Computing, CASCON 2014, November 4th.
• Cylindrical Algebraic Decomposition in the RegularChains Library.
  August 9, 2014. ICMS 2014, Seoul, Korea.
• Doing Algebraic Geometry with the RegularChains Library.
  August 9, 2014. ICMS 2014, Seoul, Korea.
• The Basic Polynomial Algebra Subprograms.
  August 8, 2014. ICMS 2014, Seoul, Korea.
• Dense Arithmetic over Finite Fields with CUMODP.
  August 8, 2014. ICMS 2014, Seoul, Korea.
• Solving Parametric Polynomial Systems by RealComprehensiveTriangularize.
  August 8, 2014. ICMS 2014, Seoul, Korea.
• Real Quantifier Elimination in the RegularChains Library.
  August 5, 2014. ICMS 2014, Seoul, Korea.
• Doing Algebraic Geometry with the RegularChains Library.
  July 9, 2014. ACA 2014, Fordham University, NY, USA.
• Quantifier Elimination by Cylindrical Algebraic Decomposition Based on Regular Chains.
  July 23, 2014. ISSAC 2014, Kobe, Japan.
• The Basic Linear Algebra Subprograms.
  July 23, 2014. ISSAC 2014, Kobe, Japan.
• Tutorial on the theorey and practice of regular chains.
  IPM, Teheran, Iran, 21 - 25 June 2014.
• Triangular decomposition of semi-algebraic systems.
  IPM, Teheran, Iran, 24 June 2014.
• Computing the real solutions of polynomial systems with the RegularChains library in Maple.
  Graduate Computational Algebraic Geometry Seminar, University of Illinois at Chicago, Ocotober 2, 2013. Maple worksheet: Real solving commands of the RegularChains library and their applications.
  

• MetaFork: A Metalanguage for Concurrency Platforms Targeting Multicores.
  WG14 C Standards Committee Meeting, Chicago, October 1st, 2013
• Computing the Limit Points of Quasi-componets of Regular Chains in Diemnsion One.
  CASC 2013, ZIB, Berlin, September 9, 2013.
• An Incremental Algorithm for Computing Cylindrical Algebraic Decomposition and Its Application to Quantifier Elimination.
  SIAM Algebraic Geometry, Fort Collins, Colorado, Aug. 2, 2013.
• A Many-core Machine Model for Designing Algorithms with Minimum Parallelism Overheads.
  HPCS 2013, University of Ottawa, June 6, 2013.
• On the Parallelization of Subproduct Tree Techniques Targeting Many-core Architectures.
  HPCS 2013, University of Ottawa, June 6, 2013.
• Optimizing Algorithms and Code for Data Locality and Parallelism Targeting Multicore Architectures Using Cilk.
  University Wilfrid Laurier, Waterloo, March 25, 2013.
• Generating Loop Invariants via Polynomial Interpolation
  ASCM 2012 - Beijing Key Laboratory of Mathematics Mechanization October 27, 2012.
• An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions
  ASCM 2012 - Beijing Key Laboratory of Mathematics Mechanization October 27, 2012.
• Parallelization Overheads: A SHARCNET Tutorial.
  SHARCNET Summer Seminar, London, Ontario, July 12, 2012.
• Optimizing Algorithms and Code for Data Locality and Parallelism: A SHARCNET Tutorial.
  SHARCNET Summer Seminar, London, Ontario, August 3, 2011, July 5, 2012 and June 17, 2013.
• Parallel Generation of Transversal Hypergraphs.
  SIAM Discrete Maths, Halifax, 21 June 2012, 2012.
• What computer algebra systems can offer to tackle realizability problems of matroids?
  SIAM Discrete Maths, Halifax, 21 June 2012, 2012.
• Generating Loop Invariants via Polynomial Interpolation
  East China Normal University May 24, 2012.
• On Fulton's Algorithm for Computing Intersection Multiplicities.
  Michigan Computational Algebraic Geometry, March 9, 2012.
• On parametric polynomial system solving.
  MACIS 2011, Beijing, October 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.
• Parallel Univariate Real Root Isolation on Multicores.
  AMMCS 2011, Waterloo, June 29, 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.
  
• Algorithms for Computing Triangular Decompositions of Polynomial Systems.
  ISSAC 2011, San Jose CA, June 11, 2011.
• Computing with Semi-Algebraic Sets Represented by Triangular Decomposition.
  ISSAC 2011, San Jose CA, June 11, 2011.
• Calcul parallele exacte des solutions reelles des systemes algrebriquese.
  LIFL, Universite de Lille 1, 19 Mai 2011.
• Triangular decomposition of semi-algebraic systems.
  Algebra Seminar, University of Western Ontario, February 4, 2011.
• Determinant Computation on the GPU.
  AMMCS 2011, Waterloo, July 25, 2011.
• Around Montgomery's trick.
  Various places in 2009 and 2010, including the Supertech group at CSIL, MIT.
• Efficient Evaluation of Large Polynomials.
  International Congress of Mathematical Software (ICMS), Kobe, Japan, September 17, 2010.
• Cache Friendly Sparse Matrix Vector Multilication.
  Parallel Symbolic Computation (PASCO), Grenoble, France, July 22, 2010.
• Intersection Formulas and Algorithms for Computing Triangular Decompositions.
  MACIS 2009, Fukuoka, Japan, December, 2009.
• Real Root Isolation of Regular Chains.
  ASCM 2009, Fukuoka, Japan, December, 2009.
• 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.
• Change of order for regular chains in positive dimension.
  AGGM'06, Barcelona, 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.
• PARDI !.
  ISSAC'01 and talk at INRIA Sophia-Antipolos (25/04/2001).
• 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.