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
Computer Algebra Group at SFU - Meetings and Colloquia
CAG Schedule for 2009February
11 Roman Pearce: Parallel Sparse Polynomial Multiplication. 18 Michael Monagan: Hilbert's Nullstellensatz and Graph k-colorability.March
4 Bojan Mohar: How to draw with a small number of crossings. 11 Mahdi Javadi: On factorization of multivariate polynomials over algebraic number and function fields.April
22 Suling Yang: Computing the greatest common divisor of multivariate polynomials over finite fields.May
6 Michael Monagan: The FFT and fast arithmetic in Z. 20 Michael Monagan: Polynomial multiplication and division.June
1 Paul Vrbik: Visualization of Homotopy's and their Properties. 10 Michael Monagan: Trager's algorithm for factorization over number fields. 17 Michael Monagan: Brown's dense modular GCD algorithm. 24 Michael Monagan: Zippel's sparse modular GCD algorithm and Wang's rational number reconstruction.July
17 Michael Monagan: Two fundamental problems in computational linear algebra. 24 CECM day '09 on computational mathematics. Roman Pearce: High Performance Computing on the Desktop. Robert Corless: Pseudospectra for Exponential Polynomial Matrices. Daniel Roche: Fast and Small: Multiplying Polynomials without Extra Space.July
6 Chelsea Richards: Algorithms for Factoring Square-Free Polynomials over Finite Fields.September
9 Paul Vrbik: Code generation for polynomial multiplication. 22-26 Workshop on Discovery and Experimentation in Number Theory, IRMACS, Simon Fraser. Michael Monagan: Computing cyclotomic polynomials of very large height and very small height.November
25 Michael Monagan: In-place arithmetic for univariate polynomials over an algebraic number field.
Back to the CAG Home Page.