The Computer Algebra Group at Simon Fraser

Text Size: ππππ
2024 Meetings 2023 Meetings 2022 Meetings 2021 Meetings 2020 Meetings 2019 Meetings 2018 Meetings 2017 Meetings 2016 Meetings 2015 Meetings 2014 Meetings 2013 Meetings 2012 Meetings 2011 Meetings 2010 Meetings 2009 Meetings 2008 Meetings 2007 Meetings 2006 Meetings 2005 Meetings 2004 Meetings 2003 Meetings 2002 Meetings 2001 Meetings 2000 Meetings 1999 Meetings 1998 Meetings

2024 Computer Algebra Group Meetings and Seminars


April 2024
 14    Hyukho Kwon, Masters Thesis Defense, 12pm, BH 11911
 17    Maple Project Meeting
        Hyukho Kwon The Fast Vandermonde Solver
        Tian Chen Computing the factors of the content using a black box representation
        Garrett Paluck The Fast Euclidean Algorithm
        Mahsa Ansari Computing Resultants of Polynomials over Number Fields
        Michael Monagan Computing GCDs in Z[x1,x2,...xn]

July 2024
16–19 ISSAC 2024, NCSU, Raleigh, North Carolina
 24   Tian Chen, PhD Thesis Defense, 9:30am, Thesis defense room, LIB 2020
      Sparse Hensel Lifting Algorithms for Multivariate Polynomial Factorization
 25   Mark Giesbrecht, Computer Science, University of Wateroo, 10:30am in AQ 5004
      Functional Decomposition of Sparse Polynomials
 26   Garrett Paluck, PhD Proposal, 10:00am in SHL 10075
      Computing Gcds of Multivariate Black Box Polynomials


September 2024
 2–6  CASC 2024, Rennes, France

October 2024
 1    Michael Monagan, Department of Mathematics, SFU, 10:30am in AQ 5004
      A new sparse polynomial GCD by separating terms.
 22   Roman Pearce, CECM Research Centre, 10:30am in AQ 5004
      Ax: An Online Computer Algebra System