| [1] |
S.A. Abramov.
A note on the number of division steps in the Euclidean algorithm.
SIGSAM Bulletin: Communications on Computer Algebra,
pages 1-2, 2001. [ bib ] |
| [2] |
S.A. Abramov and M. Petkovsek.
Optimal decomposition of indefinite hypergeometric sums.
In Bernard Mourrain, editor, ACM International Symposium on
Symbolic and Algebraic Computation, pages 7-14. ACM Press, New York, 2001. [ bib ] |
| [3] |
S.A. Abramov and M. Petkovsek.
Proof of a conjecture of Wilf and Zeilberger.
Preprint series, University of Ljubljana, 39(748), 2001.
ISSN 1318-4865. [ bib ] |
| [4] |
R. Ausbrooks, S. Buswell, S. Dalmas, S. Devitt, A. Diaz, R. Hunter, B. Smith,
N. Soiffer, R. Sutor, and S. Watt.
Mathematical Markup Language (MathML) Version 2.0.
World Wide Web Consortium W3C Recommendation 21-February 2001,
2001.
http://www.w3.org/TR/2001/REC-MathML2-20010221. [ bib ] |
| [5] |
Yury A. Brychkov.
Evaluation of some classes of integrals.
Integral Transforms and Special Functions, 2001.
Accepted. [ bib ] |
| [6] |
Yury A. Brychkov.
Generalization of Cook's duplication formulas for Bessel
functions.
Fractional Calculus and Applied Analysis, 2001.
Accepted. [ bib ] |
| [7] |
R.F. Burger.
Exact solutions of linear odes having doubly periodic coefficients.
M.Sc. (thesis), University of Waterloo, Waterloo, Canada,
2001. [ bib ] |
| [8] |
Howard Cheng and George Labahn.
Computing all factorizations in Zn[x].
In Bernard Mourrain, editor, ACM International Symposium on
Symbolic and Algebraic Computation, pages 64-71, London, Ontario, 2001. ACM
Press, New York. [ bib ] |
| [9] |
Robert M. Corless.
Symbolic-numeric algorithms for polynomials: some recent results.
In Götz Alefeld, Jiri Rohn, Sigfried Rump, and ? Yamamoto, editors,
Proceedings Dagstuhl-Seminar 99471, Symbolic-algebraic Methods and
Verification Methods - Theory and Applications, pages 21-33. Springer,
2001.
Ontario Research Centre for Computer Algebra Technical Report
TR-00-21, at http://www.orcca.on.ca/TechReports. [ bib ] |
| [10] |
Robert M. Corless.
An elementary solution of a minimax problem arising in algorithms for
automatic mesh selection.
SIGSAM Bulletin: Communications on Computer Algebra,
34(4):7-15, December 2001. [ bib ] |
| [11] |
Robert M. Corless, Mark W. Giesbrecht, Mark van Hoeij, and Stephen M. Watt.
Towards factoring bivariate approximate polynomials.
In Bernard Mourrain, editor, ACM International Symposium on
Symbolic and Algebraic Computation, pages 85-92. ACM Press, New York, 2001. [ bib ] |
| [12] |
Robert M. Corless, James H. Davenport, David J. Jeffrey, R.J. Bradford, and
Stephen M. Watt.
Reasoning about the elementary functions of complex analysis.
Annals of Mathematics and Artificial Intelligence, 2001.
to appear. [ bib ] |
| [13] |
Serge J.D. D'Alessio and Frederick W. Chapman.
The initial flow past a uniformly accelerating inclined elliptic
cylinder.
Canadian Applied Mathematics Quarterly, 8(2), Summer 2001. [ bib ] |
| [14] |
Josef Drexler.
Low-frequency Farley-Buneman Waves in a non-uniform medium.
Technical Report TR-01-04, at http://www.orcca.on.ca/TechReports,
Ontario Research Centre for Computer Algebra, 2001. [ bib | http ] |
| [15] |
K.O. Geddes.
Algorithms for indefinite and definite integration in Maple.
In R. Akerkar, editor, Applications of Computer Algebra
(Proceedings of the International Symposium on Applications of Computer
Algebra, Kolhapur, India, October 2000), pages 51-84. Allied Publishers
Ltd, Mumbai, 2001. [ bib ] |
| [16] |
K.O. Geddes.
Hybrid symbolic-numeric methods applied to definite integrals and
ODEs.
In R. Akerkar, editor, Applications of Computer Algebra
(Proceedings of the International Symposium on Applications of Computer
Algebra, Kolhapur, India, October 2000), pages 85-108. Allied Publishers
Ltd, Mumbai, 2001. [ bib ] |
| [17] |
Mark W. Giesbrecht.
Fast computational of the Smith form of a sparse integer matrix.
Computational Complexity, 10:41-69, 2001. [ bib ] |
| [18] |
Mark W. Giesbrecht, Michael Jacobson, Jr., and Arne Storjohann.
Algorithms for large integer matrix problems.
In Proc. AAECC-14, volume 2227 of Lecture Notes in
Computer Science, pages 297-307, 2001.
Also appears as ORCCA TR-01-01. [ bib ] |
| [19] |
Ilias S. Kotsireas.
Homotopies and polynomial system solving I. Basic principles.
SIGSAM Bulletin, 35(1):19-32, 2001.
March. [ bib ] |
| [20] |
Ilias S. Kotsireas.
Central configurations in the Newtonian n-body problem of
celestial mechanics.
Contemporary Mathematics, 2001.
To appear. [ bib ] |
| [21] |
Ilias S. Kotsireas and Gregory J. Reid.
Alternative ways of solving Polynomial Systems.
Technical Report TR-01-03, at http://www.orcca.on.ca/TechReports,
Ontario Research Centre for Computer Algebra, 2001. [ bib | http ] |
| [22] |
H.Q. Le.
Computing the minimal telescoper for sums of hypergeometric terms.
SIGSAM Bulletin: Communications on Computer Algebra,
35(3):2-10, September 2001. [ bib ] |
| [23] |
H.Q. Le.
A direct algorithm to construct Zeilberger's recurrences for
rational functions.
In Formal Power Series and Algebraic Combinatorics, pages
303-312, 2001. [ bib ] |
| [24] |
H.Q. Le.
On the q-analogue of Zeilberger's algorithm to rational
functions.
Programming and Comput. Software Programmirovanie,
27(1):49-58, Jan-Feb 2001. [ bib ] |
| [25] |
H.Q. Le, S.A. Abramov, and K.O. Geddes.
A direct algorithm to construct the minimal telescopers for rational
functions (q-difference case).
Technical Report CS-2001-25, Department of Computer Science,
University of Waterloo, Ontario, Canada, 2001. [ bib ] |
| [26] |
H.Q. Le, S.A. Abramov, and K.O. Geddes.
Hypergeometricsum: A Maple package for finding closed forms of
indefinite and definite sums of hypergeometric type.
Technical Report CS-2001-24, Department of Computer Science,
University of Waterloo, Ontario, Canada, 2001. [ bib ] |
| [27] |
Wen-shin Lee.
Early Termination Strategies in Sparse Interpolation
Algorithms.
Ph.D. thesis, North Carolina State University, Raleigh, NC
USA, 2001. [ bib ] |
| [28] |
G. Le Mac.
The eccentric trigonometric functions.
M.Sc. (thesis), University of Western Ontario, London,
Canada, 2001. [ bib ] |
| [29] |
Z. Li and F. Schwarz.
Rational solutions of riccati-like partial differential equations.
Journal of Symbolic Computation, 31:691-719, 2001. [ bib ] |
| [30] |
Dicheng Liu.
Notation selection tools for mathematical stylesheets.
M.Sc. (project), University of Western Ontario, London,
Canada, 2001. [ bib ] |
| [31] |
Michael B. Monagan, Keith O. Geddes, K. Michael Heal, George Labahn, Stefan M.
Vorkoetter, James McCarron, and Paul DeMarco.
Maple 7 Programming Guide.
Waterloo Maple Inc., Waterloo, Ontario, Canada, 2001.
628 pages. [ bib ] |
| [32] |
W.N. Naylor and Stephen M. Watt.
Meta stylesheets for the conversion of mathematical documents into
multiple forms.
In Proc. Int'l Workshop on Math. Knowledge Management,
RISC-Linz, 2001. [ bib ] |
| [33] |
W.N. Naylor and Stephen M. Watt.
On the relationship between OpenMath and MathML.
In E-Proc.Internet Accessible Mathematical Communication (IAMC
2001), 2001.
http://icm.mcs.kent.edu/research/iamc2001.papers/nay.pdf. [ bib ] |
| [34] |
N. Obeid.
Simplification of symbolic tensor expressions.
Master's thesis, University of Western Ontario, London,
Canada, 2001. [ bib ] |
| [35] |
Gregory J. Reid, Ping Lin, and Allan D. Wittkopf.
Differential Elimination-Completion Algorithms for DAE and
PDAE.
Studies in Applied Mathematics, 106(1):1-45, 2001. [ bib ] |
| [36] |
I. Rodionov.
Tools for MathML.
Master's thesis, University of Western Ontario, London,
Canada, 2001. [ bib ] |
| [37] |
C. Schnider.
MathML: From computer algebra systems to the web and back.
M.Sc. (thesis), University of Waterloo, Waterloo, Canada,
2001. [ bib ] |
| [38] |
Andrew J. Sommese, Jan Verschelde, and Charles W. Wampler.
Numerical Decomposition of the Solution Sets of Polynomial
Systems into Irreducible Components.
SIAM J. Numer. Anal., 38(6):2022-2046, 2001. [ bib ] |
| [39] |
A. Storjohann.
Deterministic computation of the Frobenius form (Extended
Abstract).
In Proc. 42nd Annual Symp. Foundations of Comp. Sci., pages
368-377, Las Vegas, Nevada, 2001. IEEE Computer Society Press, Los Alamitos,
California. [ bib ] |
| [40] |
Mark van Hoeij.
Factoring polynomials and the knapsack problem.
Journal of Number Theory, 2001.
To appear. [ bib ] |
| [41] |
Bo Wan.
An interactive mathematical handwriting recognizer for the Pocket
PC.
Master's thesis, University of Western Ontario, London,
Canada, 2001. [ bib ] |
| [42] |
Allan D. Wittkopf and Gregory J. Reid.
Fast Differential Elimination in C: The CDiffElim
Environment.
Computer Physics Communications, 139(2):192-217, 2001. [ bib ] |
| [43] |
Xiaofang Xie.
Symbolic circuit analysis in Maple.
Master's thesis, University of Western Ontario, London,
Canada, January 2001. [ bib ] |
| [44] |
Eugene Zima.
On computational properties of chains of recurrences.
In Bernard Mourrain, editor, ACM International Symposium on
Symbolic and Algebraic Computation, pages 345-352, London, Ontario, Canada,
2001. ACM Press, New York. [ bib ] |