Symbolic Computation Group

David R. Cheriton School of Computer Science
University of Waterloo, Waterloo, Ontario, Canada

Recent Papers

This is a short list of some recent publications by researchers associated with SCG. For more details see individual researchers' home pages.

2015

M. Giesbrecht, A. Heinle and V. Levandovskyy. Factoring Differential Operators in n Variables. Journal of Symbolic Computation. Journal link, arXiv:1404.0002.
A. Arnold, M. Giesbrecht and D. Roche. Multivariate Polynomial Interpolation of Straight-Line Program. To appear in Journal of Symbolic Computation. arxiv:1412.4088.

A. Storjohann and S. Yang, A relaxed algorithm for online matrix inversion. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'15), ACM Press, 2015, 8pp.
E. Hubert and G. Labahn, Computation of Invariants of Finite Abelian Groups. To appear in Mathematics of Computation.
M. Elsheikh, M. Giesbrecht. Relating p-Adic eigenvalues and the local Smith normal form. To appear in Linear Algebra and It's Applications.
J. Bergen, M. Giesbrecht, P.N. Shivakumar and Y. Zhang. Factorizations for Difference Operators. Advances in Difference Equations 2015, 2015:57
S. MacLean and G. Labahn, A Bayesian model for recognizing handwritten mathematical expressions, To appear in Pattern Recognition.
W. Zhou, G. Labahn and A. Storjohann, A deterministic algorithm for inverting a polynomial matrix, Journal of Complexity, 2015, v. 31, pp. 162-173.
A. Heinle and V. Levandovskyy, The SDEval Benchmarking Toolkit, ACM Communications in Computer Algebra 49. 1/4 (2015): 1-9.
A. Arnold, E. Kaltofen. Error-correcting sparse interpolation in the Chebyshev-basis. ACM ISSAC '15, Proceedings of the 40th international symposium on symbolic and algebraic computation.
A. Arnold, D. S. Roche. Output-sensitive algorithms for sumset and sparse polynomial multiplication. ACM ISSAC '15, Proceedings of the 40th international symposium on symbolic and algebraic computation.
S. Burrill, S. Melczer and M. Mishna. A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape. Proceedings of FPSAC 2015.
M. Bousquet-Mélou, A. Bostan, M. Kauers, and S. Melczer. On 3-dimensional lattice walks confined to the positive octant. To appear, Annals of Combinatorics, November 2014.
S. Melczer and M. Mishna. Asymptotic lattice path enumeration using diagonals [Extended Abstract]. Proceedings of AofA 2014, DMTCS-HAL Proceedings Series, 2014, 313–324.

2014

M. Giesbrecht, G. Labahn and Y. Zhang, Computing Popov Forms of Matrices Over PBW Extensions, Computer Mathematics. Proceedings of ASCM 09 and 12. R. Feng, W-s Lee, Y. Sato (Eds.) (2014) 61-66.
H. Cheng and G. Labahn, A Practical Implementation of a Modular Algorithm for Ore Polynomial Matrices, Computer Mathematics. Proceedings of ASCM 09 and 12. R. Feng, W-s Lee, Y. Sato (Eds.) (2014) 49-60.
J. Babbin, P. Forsyth and G. Labahn, A Comparison of Iterated Optimal Stopping and Local Policy Iteration for American Options Under Regime Switching, Journal of Scientific Computing 58 (2014) 409-430.
W. Zhou and G. Labahn, Unimodular Completion of Polynomial Matrices, Proceedings of ISSAC'14, Kobe, Japan, July 23-25, (2014).
A. Arnold, M. Giesbrecht and D. Roche.Sparse interpolation over finite fields via low-order roots of unity, ISSAC '14, Proceedings of the 39th international symposium on symbolic and algebraic computation
M. Giesbrecht, A. Heinle and V. Levandovskyy. Factoring Differential Operators in n Variables. arXiv:1404.0002. In Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (ISSAC'14), Katsusuke Nabeshima(Ed.), ACM, New York, NY, USA, 194-201, 2014. arXiv:1404.0002
A. Storjohann and S. Yang, Linear independence oracles and applications to rectangular and low rank linear systems. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'14), ACM Press, 2014, 8pp.
A. Arnold and Daniel S. Roche, Multivariate sparse interpolation using randomized Kronecker substitutions, ISSAC '14, Proceedings of the 39th international symposium on symbolic and algebraic computation.
M. Giesbrecht and J. Haraldson. Computing GCRDs of Approximate Differential Polynomials, Workshop on Symbolic-Numeric Computing (SNC'14). July 2014.
R. Burger. Solving Higher Order Linear Differential Equations having Elliptic Function Coefficients, ISSAC '14, Proceedings of the 39th international symposium on symbolic and algebraic computation.
A. Storjohann, On the complexity of inverting integer and polynomial matrices. To appear in Computational Complexity. Updated October 6, 2014, 45pp. pdf
Modelling and Simulation for the Analysis of Securities Markets, Rui Hu, Vadim Mazalov and Stephen M. Watt, Proc. Sixth International Symposium on Symbolic Computation in Software Science, (SCSS 2014), Tunis 7-8 2014, Gammarth, Tunisia.
An Agent-Based Financial Market Simulator for Evaluation of Algorithmic Trading Strategies, Rui Hu and Stephen M. Watt, pp. 221-227, Proc. Sixth International Conference on Advances in System Simulation, (SIMUL 2014), October 12-16 2014, Nice, France.
Distance-Based High-Frequency Trading, Travis Felker, Vadim Mazalov and Stephen M. Watt, pp. 2055-2064, Proc. 14th International Conference on Computational Science, (ICCS 2014), June 10-12 2014, Cairns, Australia, Elsevier Procedia Computer Science, Volume 29, 2014.

2013

W. Ng, D.E. Chang and G. Labahn, Energy Shaping for Systems with Two Degrees of Underactuation and More than Three Degrees of Freedom, Journal on Control and Optimization. 51(2), 881–905.
Andrew Arnold, A new truncated Fourier transform algorithm, ISSAC '13, Proceedings of the 38th international symposium on symbolic and algebraic computation.
M. Giesbrecht and M. Sub Kim. Computation of the Hermite form of a Matrix of Ore Polynomials. Journal of Algebra, v. 376, pp. 341–362, 2013. DOI: 10.1016/j.jalgebra.2012.11.033.
M. Giesbrecht. Algorithms for irreducibility testing and constructing irreducible polynomials. Handbook of Finite Fields (invited article). pp. 374-380. CRC Press. 2013.
A. Arnold, M. Giesbrecht, and D. Roche. Faster Sparse Interpolation of Straight-Line Programs. Proceedings of Computer Algebra in Scientific Computation (CASC 2013), pp. 61–74. Lecture Notes in Computer Science, v.8136. DOI: 10.1007/978-3-319-02297-0_5.
E. Hubert and G. Labahn, Scaling Invariants and Symmetry Reduction of Dynamical Systems, Foundations of Computational Mathematics, 13(4) (2013) 479--516
Y. Huang, P. Forsyth and G. Labahn, Inexact Arithmetic Considerations for Direct Control and Penalty Methods: American Options under Jump Diffusion, Applied Numerical Mathematics Volume 72, October 2013, Pages 33–51
S. Maclean and G. Labahn, A new approach for recognizing handwritten mathematics using relational grammars and fuzzy sets, International Journal of Document Analysis and Recognition, 16(2) (2013) 139-163
M. Barkatou, C. El Bacha, G. Labahn and E. Pfluegel, On Simultaneous Row and Column Reduction of Higher-Order Linear Differential Systems, Journal of Symbolic Computation 49(1) (2013) 45-64
W. Zhou and G. Labahn, Computing Column Bases of Polynomial Matrices, Proceedings of ISSAC'13, Boston, USA, June 26-29, (2013)
C.-P. Jeannerod, C. Pernet and A. Storjohann, Rank-profile revealing Gaussian elimination and the CUP matrix decomposition. Journal of Symbolic Computation, 2013.
C. Pauderis and A. Storjohann, Computing the invariant structure of integer matrices: fast algorithms into practice. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'13), ACM Press, 2013, 8pp.
Identifying Features via Homotopy on Handwritten Mathematical Symbols, Rui Hu and Stephen M. Watt, pp. 61-67, Proc. 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, (SYNASC 2013), Sept 23-26 2013, Timişoara Romania, IEEE Computer Society.
Determining Points on Handwritten Mathematical Symbols, Rui Hu and Stephen M. Watt, pp. 168-183, Proc. 2013 Conferences on Intelligent Computer Mathematics, (CICM 2013), July 8-12 2013, Bath, UK, Springer Verlag LNAI 7961.
Recommendation Systems in Mathematical Character Recognition, Vadim Mazalov and Stephen M. Watt, Electronic Proc. Mathematical User Interfaces Workshop 2013, (MATHUI 2013), July 10 2013, Bath, UK, http://cermat.org/events/MathUI/13.
InkChat: A Collaboration Tool for Mathematics, Rui Hu and Stephen M. Watt, Electronic Proc. Mathematical User Interfaces Workshop 2013, (MATHUI 2013), July 10 2013, Bath, UK, http://cermat.org/events/MathUI/13.

2012

Y. Huang, P. Forsyth and G. Labahn, Combined Fixed Point and Policy Iteration for Hamilton-Jacobi-Bellman Equations in Finance SIAM Journal of Numerical Analysis 50(4) (2012) 1861-1882
Y. Huang, P. Forsyth and G. Labahn, Iterative methods for the solution of a singular control formulation of a GMWB pricing problem, Numerische Mathematik 122(1) (2012) 133-167
W. Zhou and G. Labahn, Algorithms for Efficient Order Basis Computation, Journal of Symbolic Computation, 47(7) (2012) 793-819
E. Hubert and G. Labahn, Rational invariants of scalings from Hermite normal forms, Proceedings of ISSAC'12, Grenoble, France, July 22-25, (2012) 219-226
W. Zhou, G. Labahn and A. Storjohann, Computing Minimal Nullspace Bases, Proceedings of ISSAC'12, Grenoble, France, July 22-25, (2012) 366-373
M. Giesbrecht and A. Heinle. A polynomial-time algorithm for the Jacobson form of a matrix of Ore polynomials.CASC 2012. Lecture Notes in Computer Science Volume 7442, 2012, pp 117-128
M. Elsheikh, M. Giesbrecht, A. Novocin, B.D. Saunders. Fast Computation for Smith Forms of Sparse Matrices Over Local Rings. Proceeding ISSAC '12 Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation Pages 146-153 ACM New York, NY. arXiv
M. Giesbrecht, D. Roche, and H. Tilak. Computing sparse multiples of polynomials. Algorithmica. Volume 64, Number 3, pp.454–480. DOI, arXiv
M. Giesbrecht, D. Panario. In honour of the research and influence of Joachim von zur Gathen at 60. Journal of Symbolic Computation Volume 47, Issue 4, April 2012, Pages 355–357, Special Issue for Joachim von zur Gathen at 60 DOI
S. Gupta, S. Sarkar, A. Storjohann, J. Valeriote, Triangular x-basis decompositions and derandomization of linear algebra algorithms over K[x] Journal of Symbolic Computation: Special issue in honour of the research and influence of Joachim von zur Gathen at 60, 2012, v. 47(4), pp. 422-453
C. Pauderis and A. Storjohann, Deterministic unimodularity certification. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'12), ACM Press, 2012, 8pp. pdf
What is an Equation? (Invited), Solomon Marcus and Stephen M. Watt, pp. 23-29, Proc. 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, (SYNASC 2012), Sept 26-29 2012, Timişoara Romania, IEEE Computer Society.
Lightweight Abstraction for Mathematical Computation in Java, Pavel Bourdykine and Stephen Watt, pp. 47-59, Proc. Computer Algebra in Scientific Computing, (CASC 2012), September 3-6 2012, Maribor, Slovenia, DOI 10.1007/978-3-642-32973-9_5, Springer Verlag LNCS 7442.
Recognition of Relatively Small Handwritten Characters, or "Size Matters", Vadim Mazalov and Stephen M. Watt, pp. 319-324, Proc. 13th International Conference on Frontiers in Handwriting Recognition, (ICFHR 2012), September 18-20 2012, Bari, Italy, IEEE Computer Society.
A Structure for Adaptive Handwriting Recognition, Vadim Mazalov and Stephen M. Watt, pp. 688-693, Proc. 13th International Conference on Frontiers in Handwriting Recognition, (ICFHR 2012), September 18-20 2012, Bari, Italy, IEEE Computer Society.
Optimization of Point Selection on Digital Ink Curves, Rui Hu and Stephen M. Watt, pp. 525-530, Proc. 13th International Conference on Frontiers in Handwriting Recognition, (ICFHR 2012), September 18-20 2012, Bari, Italy, IEEE Computer Society.
Writing on Clouds, Vadim Mazalov and Stephen Watt, pp. 402-416, Proc. 2012 Conferences on Intelligent Computer Mathematics, (CICM 2012), July 9-14 2012, Bremen, Germany, Springer Verlang LNAI 7362.
A Streaming Digital Ink Framework for Multi-Party Collaboration, Rui Hu, Vadim Mazalov and Stephen Watt, pp. 81-95, Proc. 2012 Conferences on Intelligent Computer Mathematics, (CICM 2012), July 9-14 2012, Bremen, Germany, Springer Verlang.
Linear Compression of Digital Ink via Point Selection, Vadim Mazalov and Stephen Watt, pp. 429-434, Proc. 10th IAPR International Workshop on Document Analysis Systems, (DAS 2012), March 27-29 2012, Gold Coast, Australia, IEEE Computer Society.
From MIT SketchML to InkML or There and Back Again, Rui Hu and Stephen M. Watt, pp. 26-27, Proc. 10th IAPR International Workshop on Document Analysis Systems Short Papers, (DAS 2012), March 27-29 2012, Gold Coast, Australia, IAPR.
Improving Isolated and In-Context Classification of Handwritten Characters, Vadim Mazalov and Stephen M. Watt, Proc. Document Recognition and Retrieval XIX, (DRR XIX), January 22-26 2012, San Francisco, California, DOI doi:10.1117/12.912112, SPIE.

2011

Y. Huang, P.A. Forsyth and G. Labahn, Methods for pricing American options under regime switching, SIAM Journal on Scientific Computing 33(5) (2011) 2144-2168.
S. Maclean, D. Tausky, G. Labahn, E. Lank and M. Marzouk, Is the iPad useful for sketch input? A comparison with the Tablet PC, Proceedings of the 8th Eurographics Symposium on Sketch-Based Interfaces and Modeling (SBIM 2011), ACM, (2011) 7-14
S. Maclean, G. Labahn, E. Lank, M. Marzouk and D. Tausky, Grammar-based techniques for creating ground-truthed sketch corpora, International Journal of Document Analysis and Recognition, 14(1) (2011) 65-74.
S. Gupta and A. Storjohann, Computing Hermite forms of polynomial matrices. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'11), ACM Press, 2011, 8pp. pdf
S. Sarkar and A. Storjohann, Normalization of row reduced matrices. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'11), ACM Press, 2011, 7pp. pdf
C. Bright and A. Storjohann, Vector rational number reconstruction. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC'11), ACM Press, 2011, 7pp. pdf
M. Giesbrecht and D. Roche. Detecting lacunary perfect powers and computing their roots, Journal of Symbolic Computation, v. 46, pp. 1242-1259, 2011. arXiv. DOI.
M. Giesbrecht and D Roche. Diversification improves interpolation. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2011, pp. 123-130. Extended abstract: DOI. Preprint in arXiv.
M. Giesbrecht and S. Watt, In honour of Keith Geddes on his 60th birthday, v. 46, issue 7, pp. 735-740. DOI.
Computational Tools for Mathematical Collaboration (Invited), Stephen M. Watt, pp. 16-18, Proc. 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, (SYNASC 2011), Sept 26-29 2011, Timişoara Romania, IEEE Computer Society.
Polynomial Approximation in Handwriting Recognition (Invited), Stephen M. Watt, pp. 3-7, Proc. 4th International Workshop on Symbolic-Numeric Computation, (SNC 2011), June 7-9 2011, San Jose, California, ACM Press.
An Architecture for Generic Extensions, Cosmin Oancea and Stephen M. Watt, Science of Computer Programming, Vol. 76, No. 4, pp. 258-277, April 2011, Elsevier.

2010

S. MacLean and G. Labahn, Elastic matching in linear time and constant space. Proceedings of Ninth IAPR International Workshop on Document Analysis Systems, (Short paper), pp. 551-554 (2010)
J. von zur Gathen, Mark Giesbrecht and K. Ziegler. Composition collisions at degree p². Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2010, pp. 123-130. Extended abstract: DOI. Full version: arXiv
M. Giesbrecht, D. Roche, and H. Tilak. Computing sparse multiples of polynomials, International Symposium on Algorithms and Computation (ISAAC 2010). Lecture Notes in Computer Science v. 6506, pp. 266-278, 2010. DOI
M. Giesbrecht and D. Roche, Interpolation of shifted-lacunary polynomials. Computational Complexity. Volume 19, No 3., pp. 333-354, 2010. DOI, arXiv
Digital Ink Compression via Functional Approximation, Vadim Mazalov and Stephen M. Watt, pp. 688-694, Proc. 12th International Conference on Frontiers in Handwriting Recognition, (ICFHR 2010), November 16-18 2010, Kolkata, India, IEEE Computer Society.
Type Specialization in Aldor, Laurentiu Dragan and Stephen M. Watt, pp. 73-84, Proc. 12th International Workshop on Computer Algebra in Scientific Computing, (CASC 2010), September 5-12 2010, Tsakhkadzor, Armenia, Springer Verlag LNCS 6244.
An Analytic Model for Colluding Processes, Stephen M. Watt, Vestnik Tambov University: Natural and Technical Sciences, Vol. 15, No. 6, pp. 1730-1747, Tambov University, ISSN 1810-0198.
An Interface for Math e-Learning on Pen-Based Mobile Devices, Mitsushi Fujimoto and Stephen M. Watt, Electronic Proc. Mathematical User Interfaces Workshop 2010, (MATHUI 2010), July 10 2010, Paris, France, http://www.activemath.org/workshops/MathUI/10/proc.
Symbolic Domain Decomposition, Jacques Carette, Alan P. Sexton, Volker Sorge and Stephen M. Watt, pp. 172-188, Proc. 17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning, (Calculemus 2010), July 6-7 2010, Paris, France, Springer Verlag LNAI 6167.
Improved Classification through Runoff Elections, Oleg Golubitsky and Stephen M. Watt, pp. 59-63, Proc. International Workshop on Document Analysis Systems, (DAS 2010), June 9-11 2010, Boston, USA, ACM Press.
Toward Affine Recognition of Handwritten Mathematical Characters, Oleg Golubitsky, Vadim Mazalov and Stephen M. Watt, pp. 35-42, Proc. International Workshop on Document Analysis Systems, (DAS 2010), June 9-11 2010, Boston, USA, ACM Press.
Distance-Based Classification of Handwritten Symbols, Oleg Golubitsky and Stephen M. Watt, International Journal on Document Analysis and Recognition, Vol. 13, No. 2, pp. 133-146, June, 2010, Springer.

2009

Mark Giesbrecht, George Labahn and W.-s. Lee. Symbolic-numeric sparse interpolation of multivariate polynomials. Journal of Symbolic Computation, Volume 44, pp. 943-959, 2009.
Mark Giesbrecht and Myung Sub Kim. On computing the Hermite form of a matrix of differential polynomials. Computer Algebra and Scientific Computation (CASC) Workshop, Lecture Notes in Computer Science 5743, 2009.
B. Beckermann and George Labahn. Fraction-Free Computation of Simultaneous Pade Approximants. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2009, ACM Press, pp. 15-22, Seoul, Korea, 2009.
Wei Zhou and George Labahn. Efficient Computation of Order Bases. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2009, ACM Press, pp. 375-382, Seoul, Korea, 2009.
S. Maclean, D. Tausky, George Labahn, E. Lank and M. Marzouk. Tools for the efficient generation of hand-drawn corpora based on context-free grammars. Proceedings of the Eurographics Symposium on Sketch-Based Interfaces and Modeling (SBIM 2009), pp. 125-132, 2009.
D. Roche. Space- and Time-Efficient Polynomial Multiplication. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2009, Seoul, Korea, July 28-31, 2009. Implementation (gzipped tar). Presentation (PDF). Longer Version (PDF).
Arne Storjohann. Integer matrix rank certification. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2009, ACM Press, pp. 8, 2009.
Brice Boyer, Jean-Guillaume Dumas, C. Pernet and Wei Zhou. Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2009, July 28, 2009. Slides.
Mark Giesbrecht, George Labahn and Yang Zhang. Computing Popov Forms of Matrices over PBW Extensions. Ninth Asian Symposium on Computer Mathematics (ASCM) 2009, Fukuoka, Japan, December 14-17, 2009.
On the Future of Computer Algebra Systems at the Threshold of 2010, Stephen M. Watt, pp. 422-430, Proc. Joint Conference of ASCM 2009 and MACIS 2009: Asian Symposium of Computer Mathematics and Mathematical Aspects of Computer and Information Sciences, (MACIS 2009), December 14-17 2009, Fukuoka, Japan, COE Lecture Note Vol. 22, Kyushu University, ISSN 1881-4042.
Orientation-Independent Recognition of Handwritten Characters with Integral Invariants, Oleg Golubitsky, Vadim Mazalov and Stephen M. Watt, pp. 252-261, Proc. Joint Conference of ASCM 2009 and MACIS 2009: Asian Symposium of Computer Mathematics and Mathematical Aspects of Computer and Information Sciences, (ASCM 2009), December 14-17 2009, Fukuoka, Japan, COE Lecture Note Vol. 22, Kyushu University, ISSN 1881-4042.
Computing with Abstract Matrix Structures, Alan P. Sexton, Volker Sorge and Stephen M. Watt, pp. 325-332, Proc. 2009 International Symposium on Symbolic and Algebraic Computation, (ISSAC 2009), July 28-31 2009, Seoul, South Korea, ACM Press.
Online Recognition of Multi-Stroke Symbols with Orthogonal Series, Oleg Golubitsky and Stephen M. Watt, pp. 1265-1269, Proc. 10th International Conference on Document Analysis and Recognition, (ICDAR 2009), July 26-29 2009, Barcelona, Spain, IEEE Computer Society.
A Collaborative Interface for Multimodal Ink and Audio Documents, Amit Regmi and Stephen M. Watt, pp. 901-905, Proc. 10th International Conference on Document Analysis and Recognition, (ICDAR 2009), July 26-29 2009, Barcelona, Spain, IEEE Computer Society.
Confidence Measures in Recognizing Handwritten Mathematical Symbols, Oleg Golubitsky and Stephen M. Watt, pp. 460-466, Proc. Conferences on Intelligent Computer Mathematics 2009: 16th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning and 8th International Conference on Mathematical Knowledge Management , (MKM 2009), July 10-12 2009, Grand Bend, Canada, Springer Verlag LNAI 5625.
Algorithms for the Functional Decomposition of Laurent Polynomials, Stephen M. Watt, pp. 186-200, Proc. Conferences on Intelligent Computer Mathematics 2009: 16th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning and 8th International Conference on Mathematical Knowledge Management , (Calculemus 2009), July 6-7 2009, Grand Bend, Canada, Springer Verlag LNAI 5625.
Reasoning with Generic Cases in the Arithmetic of Abstract Matrices, Alan P. Sexton, Volker Sorge and Stephen M. Watt, pp. 138-153, Proc. Conferences on Intelligent Computer Mathematics 2009: 16th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning and 8th International Conference on Mathematical Knowledge Management , (Calculemus 2009), July 6-7 2009, Grand Bend, Canada, Springer Verlag LNAI 5625.
A New Approach to Parallelising Tracing Algorithms, Cosmin E. Oancea, Alan Mycroft and Stephen M. Watt, pp. 10-19, Proc. 2009 International Symposium on Memory Management, (ISMM 2009), June 19-20 2009, Dublin, Ireland, ACM Press.
Online Computation of Similarity between Handwritten Characters, Oleg Golubitsky and Stephen M. Watt, Proc. Document Recognition and Retrieval XVI, (DRR 2009), Jan 21-22 2009, San Jose, California USA, pp. C1-C10, Vol. 7247, SPIE and IS&T, ISBN 9780819474971, ISSN 0277-786X.

2008

Mark Giesbrecht and D. Roche. On Lacunary Polynomial Perfect Powers. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2008, RISC, Linz, Austria, July 20-23, 2008. Implementation (gzipped tar) (requires GMP and NTL) . GMP. NTL.
George Labahn, E. Lank, M. Marzouk, A. Bunt, S. Maclean and D. Tausky. MathBrush: A Case Study for Pen-based Interactive Mathematics. Proceedings of the 5th Eurographics Workshop on Sketch-Based Interfaces and Modelling (SBIM 2008), 2008.
Arne Storjohann. On the complexity of inverting integer and polynomial matrices. Updated draft pp. 26 (December 31 2008), Submitted for publication, 2008.
D. Roche. Adaptive Polynomial Multiplication. Milestones in Computer Algebra (MICA 2008), Stonehaven Bay, Trinidad and Tobago, May 1-3, 2008.
George Labahn, E. Lank, S. Maclean, M. Marzouk and D. Tausky. MathBrush: A system for doing math on pen-based devices. Eighth IAPR Workshop on Document Analysis Systems, pp. 599-606, 2008.
Communicating Mathematics via Pen-Based Computer Interfaces (Invited), Elena Smirnova and Stephen M. Watt, pp. 9-18, Proc. 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, (SYNASC 2008), Sept 26-29 2008, Timişoara Romania, IEEE Computer Society.
Abstract Matrix Arithmetic, Alan P. Sexton, Volker Sorge and Stephen M. Watt, pp. 61-68, Proc. 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, (SYNASC 2008), Sept 26-29 2008, Timişoara Romania, IEEE Computer Society.
Online Stroke Modeling for Handwriting Recognition, Oleg Golubitsky and Stephen M. Watt, pp. 72-80, Proc. 18th Annual International Conference on Computer Science and Software Engineering, (CASCON 2008), October 27-30 2008, Toronto, Canada, IBM Canada, ISSN 1705-7345.
An Empirical Measure on the Set of Symbols Occurring in Engineering Mathematics Texts, Stephen M. Watt, pp. 557-564, Proc. 8th IAPR International Workshop on Document Analysis Systems, (DAS 2008), Sept 17-19 2008, Nara, Japan, IEEE Computer Society.
Mathematical Document Classification via Symbol Frequency Analysis, Stephen M. Watt, pp. 29-40, Proc. Towards Digital Mathematics Library, (DML 08), July 27 2008, Birmingham, UK, IEEE Computer Society.
Online Mathematical Symbol Recognition using SVMs with Features from Functional Approximation, Birendra Keshari and Stephen M. Watt, Electronic Proc. Mathematical User-Interfaces Workshop 2008, (MathUI 08), July 27 2008, Birmingham, UK, http://www.activemath.org/workshops/MathUI/08/proceedings.
Adaptive libraries and interactive code generation for Common Lisp, Geoff Wozniak, Mark Daley and Stephen M. Watt, Proc. 5th European Lisp Workshop, (ELW '08), July 7 2008, Paphos, Cyprus.
Context-Sensitive Mathematical Character Recognition, Elena Smirnova and Stephen M. Watt, pp. 604-610, Proc. IAPR International Conference on Frontiers in Handwriting Recognition, (ICFHR 2008), August 19-21 2008, Montreal, Canada, CENPARMI Concordia University, ISBN 1-895193-03-6.
Sharing Digital Ink in Heterogeneous Collaborative Environments, Birendra Keshari, Sriganesh Madhvanath, Manoj Prasad A, Muthuselvam Selvaraj and Stephen M. Watt, pp. 580-585, Proc. IAPR International Conference on Frontiers in Handwriting Recognition, (ICFHR 2008), August 19-21 2008, Montreal, Canada, CENPARMI Concordia University, ISBN 1-895193-03-6.
Functional Decomposition of Symbolic Polynomials, Stephen M. Watt, pp. 353-362, Proc. International Conference on Computatioanl Sciences and its Applications, (ICCSA 2008), June 30-July 3 2008, Perugia, Italy, IEEE Computer Society.
Symbolic Polynomials with Sparse Exponents, Stephen M. Watt, pp. 91-97, Proc. Milestones in Computer Algebra: a Conference in Honour of Keith Geddes' 60th Birthday, (MICA 2008), May 1-3 2008, Stonehaven Bay, Trinidad and Tobago, University of Western Ontario, ISBN 978-0-7714-2682-7.

2007

C. Pernet and Arne Storjohann. Faster algorithms for the characteristic polynomial. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2007, ACM Press, pp. 307-314, 2007.
B. Beckermann, G. Golub and George Labahn. On the Numerical Condition of a Generalized Hankel Eigenvalue Problem. Numerische Mathematik, 106(1),pp. 41-68, 2007.
H. Cheng and George Labahn. Output-sensitive Modular Algorithms for Polynomial Matrix Normal Forms. Journal of Symbolic Computation, 42(7) pp. 733-750, 2007.
D. Tausky, George Labahn, E. Lank and M. Marzouk. Managing Ambiguity in Mathematical Matrices. Proceedings of the Eurographics Workshop on Sketch-Base Interfaces and Modelling (SBIM), 2007.
W. Eberly, Mark Giesbrecht, P. Giorgi, Arne Storjohann and G. Villard. Faster inversion and other black box matrix computations using efficient block projections. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2007, ACM Press, pp. 143-150, 2007.
Mark Giesbrecht and D. Roche. Interpolation of Shifted-Lacunary Polynomials. Mathematical Aspects of Computer and Information Sciences (MACIS), 2007.
Z. Olesh and Arne Storjohann. The vector rational function reconstruction problems. Proceedings of the Waterloo Workshop on Computer Algebra: devoted to the 60th birthday of Sergei Abramov (WWCA), World Scientific, pp. 137-149, 2007.
J. Selby, F. Ruffell, Mark Giesbrecht and M. Godfrey. Recovering Maintainability Effort in the Presence of Global Data Usage. Proceedings of the 14th Working Conference on Reverse Engineering (WCRE), pp. 60-69, 2007.
Representing and Characterizing Handwritten Mathematical Symbols Through Succinct Functional Approximation, Bruce W. Char and Stephen M. Watt, pp. 1198-1202, Proc. International Conference on Document Analysis and Recognition, (ICDAR), September 23-26 2007, Curitiba, Brazil, IEEE Computer Society.
Hybrid Mathematical Symbol Recognition Using Support Vector Machines, Birendra Keshari and Stephen M. Watt, pp. 859-863, Proc. International Conference on Document Analysis and Recognition, (ICDAR), September 23-26 2007, Curitiba, Brazil, IEEE Computer Society.
New Aspects of InkML for Pen-Based Computing, Stephen M. Watt, pp. 457-460, Proc. International Conference on Document Analysis and Recognition, (ICDAR), September 23-26 2007, Curitiba, Brazil, IEEE Computer Society.
Aspects of Mathematical Expression Analysis in Arabic Handwriting, Elena Smirnova and Stephen M. Watt, pp. 1183-1187, Proc. International Conference on Document Analysis and Recognition, (ICDAR), September 23-26 2007, Curitiba, Brazil, IEEE Computer Society.
Streaming-Archival InkML Conversion, Birendra Keshari and Stephen M. Watt, pp. 1253-1257, Proc. International Conference on Document Analysis and Recognition, (ICDAR), September 23-26 2007, Curitiba, Brazil, IEEE Computer Society.
Generation and Optimization of Code using Coxeter Lattice Paths (Invited), Thomas J. Ashby, Anthony D. Kennedy and Stephen M. Watt, pp. 1-10, Proc. Parallel Symbolic Computation, (PASCO'07), July 27-28 2007, Waterloo, Canada, ACM Press.
Multiprocessed Parallelism Support in ALDOR on SMPs and Multicores, Marc Moreno Maza, Ben Stephenson, Stephen M. Watt and Yuzhen Xie, pp. 60-68, Proc. Parallel Symbolic Computation, (PASCO'07), July 27-28 2007, Waterloo, Canada, ACM Press.
What Happened to Languages for Symbolic Mathematical Computation?, Stephen M. Watt, pp. 81-90, Proc. Programming Languages for Mechanized Mathematics, (PLMMS), June 29-30 2007, Hagenberg, Austria, J. Carette and F. Wiedijk (editors), RISC-Linz, http://www.risc.uni-linz.ac.at/publications/download/risc_3120/PLMMS_proc.pdf.
A Cross-Application Architecture for Pen-Based Mathematical Interfaces, Elena Smirnova and Stephen M. Watt, (5 pages), Electronic Proc. Mathematical User Interfaces, (MathUI), June 27 2007, Hagenberg, Austria, http://www.activemath.org/workshops/MathUI/07/proceedings/Smirnova-Watt-MathInk-MathUI07.pdf.
Generic Programming Techniques in Aldor, Manuel Bronstein, Marc Moreno Maza and Stephen M. Watt, pp. 72-77, Proc. Fifth Asian Workshop on Foundations of Software, (AWFS), June 1-3 2007, Xiamen, China, Universiyt of Xiamen.
Dynamic ADTs: a "Don't Ask, Don't Tell" Policy for Data Abstraction , Geoff Wozniak, Mark Daley and Stephen M. Watt, pp. 209-220, Proc. International Lisp Conference, (ILC), April 1-4 2007, Cambridge UK, Association of Lisp Users.
Two Families of Algorithms for Symbolic Polynomials (Invited), Stephen M. Watt, pp. 193-210, in Computer Algebra 2006: Latest Advances in Symbolic Algorithms -- Proceedings of the Waterloo Workshop I. Kotsireas, E. Zima (editors) , World Scientific 2007.

2006

B. Beckermann, George Labahn and G. Villard. Normal Forms for General Polynomial Matrices. Journal of Symbolic Computation, 41(6), pp. 708-737, 2006.
B. Beckermann, H. Cheng and George Labahn. Fraction-free Row Reduction of Matrices of Ore Polynomials. Journal of Symbolic Computation, 41(5), pp. 513-543, 2006.
H. Cheng and George Labahn. On Computing Polynomial GCD in Alternate Bases. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2006, ACM Press, pp. 47-54, Genoa, Italy, 2006.
Mark Giesbrecht, George Labahn and W.-s. Lee. Symbolic-numeric Sparse Interpolation of Multivariate Polynomials. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2006, ACM Press, pp. 116-123, Genoa, Italy, 2006.
George Labahn, S. Maclean, M. Marzouk, I. Rutherford and D. Tausky. A preliminary report on the MathBrush pen-math system. Proceedings of the Maple Conference 2006, pp. 162-178, 2006.
W. Eberly, Mark Giesbrecht, P. Giorgi, Arne Storjohann and G. Villard. Solving sparse rational linear systems. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2006, ACM Press, pp. 63-70, 2006.
F.W. Chapman and K.O. Geddes. An improved algorithm for the automatic derivation and proof of tensor product identities via computer algebra. Proceedings of Calculemus 2006, (Genoa, Italy, Jul 2006), Anna Bigatti and Silvio Ranise (ed.), pp. 67. Electronic Notes in Theoretical Computer Science, Elsevier B.V., Amsterdam, 2006.
J. Selby and Mark Giesbrecht. A Fine-Grained Analysis of the Performance and Power Benefits of Compiler Optimizations for Embedded Devices. International Conference on Programming Languages & Compilers, pp. 920-927, 2006.
Generating TeX from Mathematical Content with Respect to Notational Settings, Elena Smirnova and Stephen M. Watt, pp. 96-105, Proc. International Conference on Digital Typography & Electronic Publishing: Localization & Internationalization, (TUG 2006), November 9-11 2006, Marakesh, Morocco.
A Localized Tracing Scheme applied to Garbage Collection, Yannis Chicha and Stephen M. Watt, pp. 323-339, Proc. The Fourth Asian Symposium on Programming Languages and Systems, (APLAS 2006), November 8-10 2006, Sydney, Australia, Springer Verlag LNCS 4279.
Post Facto Type Extension for Mathematical Programming, Stephen M. Watt, pp. 26-31, Proc. Domain-Specific Aspect Languages, (SIGPLAN/SIGSOFT DSAL 2006), October 23 2006, Portland OR, USA.
Generic Library Extension in a Heterogeneous Environment, Cosmin E. Oancea and Stephen M. Watt, pp. 25-34, Proc. Library Centric Software Design, (LCSD 2006), October 22 2006, Portland OR, USA.
Performance Rights for Software, Mark Perry and Stephen M. Watt, pp. 59-64, Proc. Fourth IASTED Internatioanl Conference on Law and Technology, (LAWTECH 2006), October 9-11 2006, Cambridge Massacusetts, USA, ACTA Press.
Pivot-Free Block Matrix Inversion, Stephen M. Watt, pp. 151-155, Proc. 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, (SYNASC 2006), Sept 26-29 2006, Timişoara Romania, IEEE Press.
A Technique for Generic Iteration and Its Optimization, Stephen M. Watt, pp. 76-86, Proc. ACM SIGPLAN Workshop on Generic Programming 2006, (WGP 2006), September 16 2006, Portland Oregon, USA, ACM.
On the Conversion Between Content MathML and OpenMath, Clare M. So and Stephen M. Watt, pp. 169-182, Proc. 2006 Conference on the Communicating Mathematics in the Digital Era, (CMDE 2006), August 15-18 2006, Aveiro, Portugal, A.K. Peters.
On the Performance of Parametric Polymorphism in Maple, Laurentiu Dragan and Stephen M. Watt, pp. 35-42, Proc. Maple Conference 2006, (MSC 2006), July 23-26 2006, Waterloo Canada, Maplesoft.
Making Computer Algebra More Symbolic (Invited), Stephen M. Watt, pp. 43-49, Proc. Transgressive Computing 2006: A conference in honor or Jean Della Dora , (TC 2006), April 24-26 2006, Granada Spain.
Notation Selection in Mathematical Computing Environments, Elena Smirnova and Stephen M. Watt, pp. 339-355, Proc. Transgressive Computing 2006: A conference in honor or Jean Della Dora , (TC 2006), April 24-26 2006, Granada Spain.
Component-Free Vector Algebra in Aldor, Songxin Liang, David J. Jeffrey and Stephen M. Watt, pp. 415-418, Proc. Transgressive Computing 2006: A conference in honor or Jean Della Dora , (TC 2006), April 24-26 2006, Granada Spain.

2005

Mark Giesbrecht, George Labahn and Yang Zhang. Computing Valuation Popov Forms. Proceedings of Computer Algebra Systems and their Applications (CASA) 2005, Lecture Notes on Computer Science 3516, Springer-Verlag, pp. 619-626, 2005.
Arne Storjohann. The shifted number system for fast linear algebra on integer matrices. Journal of Complexity, v. 21(4), pp. 609-650, 2005.
Z. Chen and Arne Storjohann. A BLAS based C library for exact linear algebra on integer matrices. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2005, ACM Press, pp. 92-99, 2005.
Arne Storjohann and G. Villard. Computing the rank and a small nullspace basis of a polynomial matrix. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2005, ACM Press, pp. 309-316, 2005. Extended Version in RR LIP 2005-3, ENS Lyon, France.
George Labahn and T. Humphries. Symbolic Integration of Jacobian Elliptic Functions in Maple. Proceedings of the Maple Conference 2005, pp. 331-339, 2005.
O.A. Carvajal, F.W. Chapman and K.O. Geddes. Hybrid symbolic-numeric integration in multiple dimensions via tensor-product series. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2005, Manuel Kauers (ed.), ACM Press, pp. 91, New York, 2005.
Tom Robinson and K.O. Geddes. Automated generation of numerical evaluation routines. Proceedings of the Maple Conference 2005, Ilias S. Kotsireas (ed.), Maplesoft, Waterloo, Ontario, Canada, pp. 398, 2005.
Yu.A. Brychkov and K.O. Geddes. On the derivatives of the Bessel and Struve functions with respect to the order. Integral Transforms and Special Functions, 16 (3), pp. 198, April, 2005.
C. Oancea, J. Selby and Mark Giesbrecht. Distributed Models of Thread-Level Speculation. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), 2005.
Mark Giesbrecht and J.P. May. New algorithms for exact and approximate polynomial decomposition. International Workshop on Symbolic-Numeric Computation (SNC), pp. 297-307, July, 2005.
B. Botting, Mark Giesbrecht and J.P. May. Using the Riemannian SVD for Problems in Approximate Algebra. International Workshop on Symbolic-Numeric Computation (SNC), pp. 209-219, July, 2005.
XML in Mathematical Web Services, Mike Dewar, Elena Smirnova and Stephen M. Watt, Proc. XML 2005 Conference -- Syntax to Semantics, (XML 2005), http://www.idealliance.org/proceedings/xml05/, (29 pages), November 14-18 2005, Atlanta USA.
Parametric Polymorphism for Software Component Architectures, Cosmin Oancea and Stephen M. Watt, pp. 147-166, Proc. 20th Annual ACM Conference on Object Oriented Programming, Systems, Languages and Applications, (OOPSLA'05), October 16-20 2005, San Diego USA, ACM Press.
Performance Analysis of Generics for Scientific Computing , Laurentiu Dragan and Stephen M. Watt, pp. 93-100, Proc. 7th Internatioanl Symposium on Symbolic and Numeric Algorithms in Scientific Computing, (SYNASC 2005), September 25-29 2005, Timişoara Romania, IEEE Press.
Recognition for Large Sets of Handwritten Mathematical Symbols , Stephen M. Watt and Xiaofang Xie, pp. 740-744, Proc. IEEE International Conference on Document Analysis and Recognition, (ICDAR 2005), August 29-September 1 2005, Seoul Korea, IEEE Press.
Domains and Expressions: An interface between two approaches to computer algebra, C. Oancea and S.M. Watt, pp. 261-268, Proc. International Symposium on Symbolic and Algebraic Computation, (ISSAC 2005), July 24-27 2005, Beijing China, ACM Press.
Parametric Polymorphism Optimization for Deeply Nested Types in Computer Algebra, Laurentiu Dragan and Stephen M. Watt, pp. 243-259, Proc. Maple Conference 2005, July 17-21 2005, Waterloo Canada, Maplesoft.
Generalization in Maple, Cosmin Oancea, Clare So and Stephen M. Watt, pp. 377-382, Proc. Maple Conference 2005, July 17-21 2005, Waterloo Canada, Maplesoft.
A Context for Pen-Based Computing, Elena Smirnova and Stephen M. Watt, pp. 409-422, Proc. Maple Conference 2005, July 17-21 2005, Waterloo Canada, Maplesoft.
Prototype Pruning by Feature Extraction in Handwritten Mathematical Symbol Recognition, Stephen M. Watt and Xiaofang Xie, pp. 423-437, Proc. Maple Conference 2005, July 17-21 2005, Waterloo Canada, Maplesoft.
Determining Empirical Properties of Mathematical Expression Use , Clare M. So and Stephen M. Watt, pp. 361-375, Proc. Fourth International Conference on Mathematical Knowledge Management, (MKM 2005), July 15-17 2005, Bremen Germany, Springer Verlag LNCS 3863.
Distributed Models of Thread-Level Speculation, C. Oancea, J.W.A. Selby, M.W. Giesbrecht and S.M. Watt, pp. 920-927, Proc. 2005 International Conference on Parallel and Distributed Processing Techniques and Applications, (PDPTA'05), June 27-30 2005, Las Vagas USA, CSREA Press, ISBN 1-932415-58-0/59-9/60-2/61-0.
Toward an Acessible Web through Semantic Web Standards, Clare M. So, M. Perry and S.M. Watt, pp. 10-16, Proc. 2005 International Conference on Computers for People with Special Needs, (CPSN'05), June 20-23 2005, Las Vagas USA, CSREA Press, ISBN 1-932415-78-5.

2004

George Labahn and Ziming Li. Hyperexponential Solutions of Finite-rank Ideals in Orthogonal Ore Algebras. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2004, Santander, Spain, ACM Press, pp. 213-220, 2004.
R. Burger, George Labahn and M. van Hoeij. Closed form solutions of linear odes having elliptic functions as coefficients. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2004, Santander, Spain, ACM Press, pp. 58-64, 2004.
Mark Giesbrecht, George Labahn and W.-s. Lee. Symbolic-Numeric Sparse Polynomial Interpolation in Chebyshev Basis and Trigonometric Interpolation. Proceedings of Computer Algebra in Scientific Computing (CASC) 2004, St. Petersburg, Russia, 2004.
T. Mulders and Arne Storjohann. Certified dense linear system solving. Journal of Symbolic Computation, 37(4), pp. 485-510, 2004.
D. Saunders, Arne Storjohann and G. Villard. Matrix rank certification . Electronic Journal of Linear Algebra, 11, pp. 16-23, 2004.
S.A. Abramov, J.J. Carette, K.O. Geddes and H.Q. Le. Telescoping in the context of symbolic summation in Maple. Journal of Symbolic Computation, 38 (4), pp. 1326, October, 2004.
K.O. Geddes, H.Q. Le and Ziming Li. Differential rational normal forms and a reduction algorithm for hyperexponential functions. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2004, J. Gutierrez (ed.), ACM Press, pp. 190, New York, 2004.
Yu.A. Brychkov and K.O. Geddes. Differentiation of hypergeometric functions with respect to parameters. Appears in Abstract and Applied Analysis, (Proceedings of the International Conference, Hanoi, Vietnam), N.M. Chuong, L. Nirenberg and W. Tutschke (ed.), World Scientific, pp. 28, 2004.
W. Eberly and Mark Giesbrecht. Efficient decomposition of separable algebras. Journal of Symbolic Computation, Volume 37, Issue 1, pp. 35-81, 2004.
Mark Giesbrecht, George Labahn and W.-s. Lee. Symbolic-numeric sparse interpolation of multivariate polynomials. Proceedings of the Ninth Rhine Workshop on Computer Algebra, 2004.
QR Factoring to Compute the GCD of Univariate Approximate Polynomials, Robert M. Corless, Stephen M. Watt and Lihong Zhi, IEEE Transactions on Signal Processing, Vol. 52, No. 12, pp. 3394-3402, December 2004.
Parametric Polymorphism for Computer Algebra Software Components, Y. Chicha, M. Lloyd, C. Oancea and S.M. Watt, pp. 119-130, Proc. 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computation, (SYNASC 2004), September 26-30 2004, Timişoara Romania, MITRON Press , ISBN 973-661-441-7.
Bernstein Bases are Optimal, but, sometimes, Lagrange Bases are Better, R.M. Corless and S.M. Watt, pp. 141-152, Proc. 6th International Symposium on Symbolic and Numeric Algorithms for Scientific Computation, (SYNASC 2004), September 26-30 2004, Timişoara Romania, MITRON Press , ISBN 973-661-441-7.
An Architecture for Distributed Mathematical Web Services, E. Smirnova, C. So and S.M. Watt, pp. 363-377, Proc. Mathematical Knowledge Management (Third International Conference MKM 2004), September 19-21 2004, Białoweża Poland, Lecture Notes in Computer Science, No. 3119, Springer Verlag , ISBN 3-540-23029-7.
Debugging A High-Level Language via a Unified Interpreter and Compiler Runtime Environment (Extended Version), J. Cai, M. Moreno Maza, S.M. Watt and M. Dunstan, pp. 125-138, Proc. Tenth International Conference on Applications of Computer Algebra, (ACA 2004), July 21-23 2004, Beaumont Texas, Lamar University, , ISBN 0-9759946-0-3.
Debugging A High-Level Language via a Unified Interpreter and Compiler Runtime Environment, J. Cai, M. Moreno Maza, S.M. Watt and M. Dunstan, pp. 119-124, Actas de los Encuentros de Algebra Computacional y Aplicaciones (EACA) 2004, July 1-3 2004, Santander Spain, Universitad de Cantabria, , ISBN 84-688-6988-04.
A Framework for Using Aldor Libraries with Maple, C. Oancea and S.M. Watt, pp. 219-224, Actas de los Encuentros de Algebra Computacional y Aplicaciones (EACA) 2004, July 1-3 2004, Santander Spain, Universitad de Cantabria, , ISBN 84-688-6988-04.

2003

T. Mulders and Arne Storjohann. On lattice reduction for polynomial matrices. Journal of Symbolic Computation, 35(4), pp. 377-401, 2003.
Arne Storjohann. High-order lifting and integrality certification. Journal of Symbolic Computation, 36(3-4), pp. 613-648, 2003.
K.O. Geddes and W.W. Zheng. Exploiting fast hardware floating point in high precision computation. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2003, J.R. Sendra (ed.), ACM Press, pp. 118, New York, 2003.
Mark Giesbrecht and Yang Zhang. Factoring and Decomposing Ore Polynomials over F_q(t). Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2003, pp. 127-134, 2003.
J. Gerhard, Mark Giesbrecht, Arne Storjohann and E. Zima. Shiftless decomposition and polynomial-time rational summation. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2003, pp. 119-126, 2003.
Mark Giesbrecht, E. Kaltofen and W.-s. Lee. Algorithms for Computing Sparsest Shifts of Polynomials in Standard, Chebyshev, and Pochhammer Bases. Journal of Symbolic Computation, 36(3-4), pp. 287-683, 2003.
Mark Giesbrecht, Arne Storjohann and G. Villard. Algorithms for matrix canonical forms. Invited Submission: Computer Algebra Handbook · Foundations, Applications, Systems, Springer Verlag, pp. 38-41, 2003.
Meta-Stylesheets for the Conversion of Mathematical Documents into Multiple Forms, W.N. Naylor and S.M. Watt, Annals of Mathematics and Artificial Intelligence, Vol. 38, pp. 3-25, 2003.
An Exploration of Homotopy Solving in Maple, K. Hazaveh, D.J. Jeffrey, G.J. Reid, S.M. Watt and A.D. Wittkopf, pp. 145-162, Proc. The Sixth Asian Symposium on Computer Mathematics, (ASCM 2003), April 17-19 2003, Beijing China.
Hybrid Methods, R.M. Corless, E.L. Kaltofen and S.M. Watt, pp. 112-125, in Handbook of Computer Algebra J. Grabmeier, E. Kaltofen, V. Weispfenning (editors) , Springer Verlag, Heidelberg 2003 , ISBN 3-540-65466-6.
MathML, S.M. Watt, pp. 154-160, in Handbook of Computer Algebra J. Grabmeier, E. Kaltofen, V. Weispfenning (editors) , Springer Verlag, Heidelberg 2003 , ISBN 3-540-65466-6.
Aldor, S.M. Watt, pp. 265-270, in Handbook of Computer Algebra J. Grabmeier, E. Kaltofen, V. Weispfenning (editors) , Springer Verlag, Heidelberg 2003 , ISBN 3-540-65466-6.
Mathematical Markup Language (MathML) Version 2.0 (Second Edition), D. Carlisle, P. Ion, R. Miner, N. Poppelier (editors), R. Ausbrooks, S. Buswell, D. Carlisle, S. Dalmas, S. Devitt, A. Diaz, M. Froumentin, R. Hunter, P. Ion, M. Kohlhase, R. Miner, N. Poppelier, B. Smith, N. Soiffer, R. Sutor, S. Watt, W3C Recommendation 21 October 2003, (541 pages), http://www.w3.org/TR/2003/REC-MathML2-20031021, World Wide Web Consortium.
Aldor User Guide, S.M. Watt, M. Moreno Maza, http://www.aldor.org/docs/aldorug.pdf, (302 pages), Aldor.org 2003.
Approximate Computation of Pseudovarieties, R.M. Corless, Hiroshi Kai and S.M. Watt, SIGSAM Bulletin, Vol. 37, No. 3, pp. 67-71, Issue 145, September 2003.

2002

B. Beckermann, H. Cheng and George Labahn. Fraction-free row reduction of matrices of skew polynomials. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2002, ACM Press, pp. 8-15, Lille, France, 2002.
Jean-Guillaume Dumas, T. Gautier, Mark Giesbrecht, P. Giorgi, B. Hovinen, E. Kaltofen, D. Saunders, W.J. Turner and G. Villard. Linbox: A Generic Library for Exact Linear Algebra. International Congress of Mathematical Software, pp. 40-50, Beijing, China, 2002.
Mark Giesbrecht, E. Kaltofen and W.-s. Lee. Algorithms for computing the sparsest shifts for polynomials via the Berlekamp/Massey algorithm. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2002, ACM Press, Lille, France, 2002.
Mark Giesbrecht and Arne Storjohann. Computing Rational Forms of Integer Matrices. Journal of Symbolic Computation, 34(3), pp. 157-172, September 1, 2002.
Mark Giesbrecht, G. Reid and Yang Zhang. Non-commutative Gröobner Bases in Poincaré-Burkhoff-Witt Extensions. Conference on Computer Algebra and Scientific Computation, pp. 97-106, 2002.
C.P. Jeannerod and George Labahn. The SNAP package for arithmetic with numeric polynomials. International Congress of Mathematical Software, World Scientific, pp. 61-71, 2002.
S.A. Abramov, K.O. Geddes and H.Q. Le. Computer algebra library for the construction of the minimal telescopers. International Congress of Mathematical Software, A.M. Cohen, X. Gao, N. Takayama (ed.), World Scientific, pp. 329, 2002.
K.O. Geddes and H.Q. Le. An algorithm to compute the minimal telescopers for rational functions (Differential-integral case). International Congress of Mathematical Software, A.M. Cohen, X. Gao, N. Takayama (ed.), World Scientific, pp. 463, 2002.
Reasoning about the Elementary Functions of Complex Analysis, R.J. Bradford, R.M. Corless, J.H. Davenport, D.J. Jeffrey and S.M. Watt, Annals of Mathematics and Artificial Intelligence, Vol. 36, pp. 303-318, 2002.
Conserving Implicit Mathematical Semantics in Conversion between T_EX and MathML, S.M. Watt, TUGBoat, Vol. 23, No. 1, pp. 108-, 2002.
A Study in the Integration of Computer Algebra Systems: Memory Management in a Maple-Aldor Environment (Invited), S.M. Watt, pp. 405-410, Proc. International Congress of Mathematical Software, (ICMS), August 17-19 2002, Beijing China, World Scientific 2002.
Exploiting Implicit Mathematical Semantics in Conversion between T_EX and MathML, S.M. Watt, (13 pages), Proc. Internet Accessible Mathematical Communication, (IAMC 2002), http://www.symbolicnet.org/conferences/iamc02, July 7 2002, Lille France.
A Family of Modular XML Schemas for MathML, S.M. Watt and Yuzhen Xie, (5 pages), Proc. Internet Accessible Mathematical Communication, (IAMC 2002), http://www.symbolicnet.org/conferences/iamc02, July 7 2002, Lille France.
An Interactive Mathematical Handwriting Recognizer for the Pocket PC, Bo Wan and S.M. Watt, (7 pages), Proc. International Conference on MathML and Math on the Web, (MathML 2002), http://www.mathmlconference.org/2002, June 28-30 2002, Chicago USA.
Content-Faithful Transformations for MathML, S. Huerter, I. Rodionov and S.M. Watt, (9 pages), Proc. International Conference on MathML and Math on the Web, (MathML 2002), http://www.mathmlconference.org/2002, June 28-30 2002, Chicago USA.
A Lisp Subset Based on MathML, Yuzhen Xie, S.M. Watt, and L. Padovani, (7 pages), Proc. International Conference on MathML and Math on the Web, (MathML 2002), http://www.mathmlconference.org/2002, June 28-30 2002, Chicago USA.
A Symbolic-Geometric Algorithm for Factoring Multivariate Polynomials, R.M. Corless, A. Galligo, I.S. Kotsireas and S.M. Watt, pp. 37-45, Proc. International Symposium on Symbolic and Algebraic Computation , (ISSAC 2002), July 7-10 2002, Lille France, ACM Press 2002.

2001

H. Cheng and George Labahn. Computing all factorizations in Zn[x]. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2001, ACM Press, pp. 64-71, London, Ontario, 2001.
R.M. Corless, Mark Giesbrecht, M. van Hoeij, Ilias S. Kotsireas and S.M. Watt. Towards Factoring Bivariate Approximate Polynomials. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2001, ACM Press, pp. 85-92, 2001.
Ziming Li and F. Schwarz. Rational Solutions of Riccati-like Partial Differential Equations. Journal of Symbolic Computation, 31, pp. 619-716, 2001.
E. Zima. On computational properties of chains of recurrences. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2001, ACM Press, 2001.
K.O. Geddes. Algorithms for indefinite and definite integration in Maple. Appears in Applications of Computer Algebra, (Proceedings of the International Symposium on Applications of Computer Algebra, Kolhapur, India, Oct 2000), R. Akerkar (ed.), Allied Publishers Ltd, Mumbai, pp. 84, 2001.
K.O. Geddes. Hybrid symbolic-numeric methods applied to definite integrals and ODEs. Appears in Applications of Computer Algebra, (Proceedings of the International Symposium on Applications of Computer Algebra, Kolhapur, India, Oct 2000), R. Akerkar (ed.), Allied Publishers Ltd, Mumbai, pp. 108, 2001.
Mark Giesbrecht, M. Jacobson Jr. and Arne Storjohann. Algorithms for Large Integer Matrix Problems. Proceedings of the Fourteenth Symposium on Applied Algebra, Algebraic Algorithms and Error Correcting Codes (AAECC), LNCS 2227, pp. 297-307, 2001.
Mark Giesbrecht. Fast computation of the Smith form of a sparse integer matrix. Computational Complexity, 10(1), pp.41-69, 2001.
Meta Stylesheets for the Conversion of Mathematical Documents into Multiple Forms, W.N. Naylor and S.M. Watt, Electronic Proc. International Workshop on Mathematical Knowledge Management, (MKM 2001), http://www.emis.de/proceedings/MKM2001, September 24-26 2001, Linz Austria.
On the Relationship Between OpenMath and MathML, W.N. Naylor and S.M. Watt, Electronic Proc. Internet Accessible Mathematical Communication, (IAMC 2001), http://icm.mcs.kent.edu/research/iamc01proceedings.html, July 22 2001, London Canada.
Towards Factoring Bivariate Approximate Polynomials, R.M. Corless, M.W. Giesbrecht, M. van Hoeij, I.S. Kotsireas and S.M. Watt, Proc. International Symposium on Symbolic and Algebraic Computation, (ISSAC 2001), pp. 85-92, July 23-25 2001, London Candada, ACM Press 2001.

2000

S.A. Abramov and H.Q. Le. Applicability of Zeilberger's algorithm to rational functions. Proceedings of the International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC) 2000, Springer-Verlag, pp. 91-102, 2000.
H. Cheng and E. Zima. On Accelerated Methods to Evaluate Sums of Products of Rational Numbers. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2000, ACM Press, pp. 54-61, 2000.
K.O. Geddes. Generating numerical ODE formulas via a symbolic calculus of divided differences. SIGSAM Bulletin, 33 (128), pp. 29-42, 2000.
C.P. Jeannerod. An algorithm for the eigenvalue perturbation problem: reduction of a kappa-matrix to a Lidskii matrix. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2000, ACM Press, pp. 184-191, 2000.
E. Kaltofen, W.-s. Lee and A. Lobo. Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2000, ACM Press, pp. 192-201, 2000.
B. Beckermann and George Labahn. Fraction-free Computation of Matrix Rational Interpolants and Matrix GCD's. SIAM Journal on Matrix Analysis and Applications, 22(1), pp. 114-144, 2000.
B. Beckermann and George Labahn. Effective Computation of Rational Approximants and Interpolants. Reliable Computing, 6, pp. 365-390, 2000.
T. Mulders and Arne Storjohann. Rational Solutions of Singular Linear Systems. Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC) 2000, ACM Press, pp. 242-249, 2000.
W. Eberly and Mark Giesbrecht. Efficient decomposition of associative algebras over finite fields. Journal of Symbolic Computation, 29(1), 2000.
W. Eberly, Mark Giesbrecht and G. Villard. On Computing the Determinant and Smith Form of an Integer Matrix. Proceedings of the Fourty-first Annual IEEE Symposium on Foundations of Computer Science (FOCS) 2000, pp. 675-687, 2000.
R.M. Corless, Mark Giesbrecht, Ilias S. Kotsireas and S.M. Watt. Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra. Proceedings of the Artificial Intelligence and Symbolic Computation (AISC) International Conference 2000, Madrid, Spain, July 17-19, 2000.
"According to Abramowitz and Stegun" or arccoth needn't be uncouth, R.M. Corless, J.H. Davenport, D.J. Jeffrey and S.M. Watt, ACM SIGSAM Bulletin, Vol. 34, No. 2, pp. 58-65, Issue 132 June 2000 (Special Issue on OpenMath).
Reasoning about the Elementary Functions of Complex Analysis, R.M. Corless, J.H. Davenport, D.J. Jeffrey, G. Litt and S.M. Watt, pp. 115-126, Proc. Artificial Intelligence with Symbolic Computation, (AISC 2000), July 17-19 2000, Madrid, Spain, Lecture Notes in Artificial Intelligence, No. 1930, Springer Verlag.
Numerical Implicitization of Parametric Hypersurfaces with Linear Algebra, R.M. Corless, M.W. Giesbrecht, I. Kotsireas and S.M. Watt, pp. 174-183, Proc. Artificial Intelligence with Symbolic Computation, (AISC 2000), July 17-19 2000, Madrid, Spain, Lecture Notes in Artificial Intelligence, No. 1930, Springer Verlag.

See individual researchers' home pages for a complete list of publications.