John P May
A Recent Resume [pdf]
Waterloo, ON
| Office: | 615 Kupf Drive | |
| Phone: | 519-747-1278 x 229 | |
| Fax: | 519-747-5284 | |
| Email: |
jpmay AT uwaterloo.ca |
|
| URL: |
http://www.cs.uwaterloo.ca/~jpmay/ |
|
- Space Efficient Computation of the p-Rank of Large Dense Matrices with Very Low Rank. A poster at ECCAD 2007 in Chestertown, MD. [pdf]
- A Comparison of Heuristics for Solving Problems in Approximate Polynomial Algebra.
A talk at the Joint Mathematics Meeting in the AMS-SIAM Special Session: Symbolic-Numeric Computation and Applications. January 2006, San Antonio, TX. [pdf] - Nearest Polynomials That Factor.
A poster at the December 2006 ORCCA Joint Lab Meeting. [pdf] - Using Riemannian SVD for Problems in Approximate Algebra.
A talk at the Symbolic Numeric Computation (SNC) Workshop. July 2005, Xi'an, China.
- Numerical Techniques for Computing the Inertia of Products of Matricies of Rational Numbers
To appear in Symbolic Numeric Computing 2007. With David Saunders and David Wood. [pdf] - Efficient Matrix Rank Computation with Application to The Study of Strongly Regular Graphs.
To appear in ISSAC 2007 Proceedings 2007 International Symposium on Symbolic Algebraic Computation ACM Press, New York, N.Y., 2007. With David Saunders and Zhendong Wan. [pdf] - Approximate Factorization of Multivariate Polynomials Using
Singular Value Decomposition.
Submitted for journal publication January 2006. With Erich Kaltofen, Zhengfeng Yang, and Lihong Zhi. [pdf] - New Algorithms for Exact and Approximate Polynomial Decomposition.
Proceedings of the SNC Workshop, Xi'an, China, July 2005. With Mark Giesbrecht. [pdf] - Using Riemannian SVD for Problems in Approximate Algebra.
Proceedings of the SNC Workshop, Xi'an, China, July 2005. With Brad Botting and Mark Giesbrecht. [pdf]
- I was a local organizer for ECCAD 2007 at Washington College.
- I am the webmaster for ISSAC 2007 at the University of Waterloo.