Welcome! | Research Topics | People | Publications | Seminars | Software | On-Line Applications |

## Ha Le's Home Page |

Education | Work experience | Articles, thesis, technical reports | Maple | Links | Addresses |

Ha Le's Curriculum Vitae (ps file, pdf file)

- May 1995: Bachelor degree in Computer Science, Honours, Co-op at the University of Waterloo.
- May 1999: Master degree, Department of Computer Science, University of Waterloo. Supervisor: Prof. G.Labahn.
- June 2003: PhD, Department of Computer Science, University of Waterloo. Co-supervisors: Prof. K.O. Geddes and Prof. S.A. Abramov.
- September 2003: Postdoctoral Fellowship at Algo Projet, INRIA.

- 1991-1994: Four co-op workterms at the Symbolic Computation Group (SCG).
- 1991-1994: Research Assistant (part-time) during five schoolterms also at SCG.
- September 1993 - December 1993: one co-op workterm at Bell Northern Research, Ottawa.
- May, 1994 to November, 1996: full-time software developer at Waterloo Maple Inc.
- September 1997 - December 1997: consultant at Web Pearls Inc.
- May 1999 - September 1999: full-time research associate at SCG.

- S.A. Abramov, H.Q. Le, M. Petkovsek.
Efficient representations of
(q-)hypergeometric terms
and the assignment problem.

- S.A. Abramov, H.Q. Le.
On the order of the recurrence produced by the method of creative
telescoping.
To appear in Discrete Mathematics.
- S.A. Abramov, J.J. Carette, K.O. Geddes, H.Q. Le.
Telescoping in the context of symbolic
summation in Maple.
To appear in Journal of Symbolic Computation.
- S.A. Abramov, H.Q. Le, Z. Li.
Univariate Ore polynomial rings in Computer Algebra.
To appear in Journal of Mathematical Sciences,
a translation of selected Russian-language serial publications in
Mathematics. Kluwer Academic/Consultants Bureau, New York, NY.

- K.O. Geddes, H.Q. Le, Z. Li (2004).
Differential rational normal forms and
a reduction algorithm for hyperexponential functions.
To appear in the Proceedings of the 2004 International
Symposium on Symbolic and Algebraic Computation.
- S.A. Abramov, H.Q. Le (2004).
Utilizing relationships among linear systems generated
by Zeilberger's algorithm.
To appear in the Proceedings of the 2004
Formal Power Series and Algebraic
Combinatorics.
- H.Q. Le, Z. Li (2004). Differential rational normal forms and representations of hyperexponential functions. In Rhine Workshop on Computer Algebra, pages 3--12. Proceedings of RWCA'04, Nijmegen, March 2004.

- S.A. Abramov, H.Q. Le, M. Petkovsek (2003).
Rational canonical forms and
efficient representations of
hypergeometric terms.
In J.R. Sendra, editor, Proceedings of the 2003 International
Symposium on Symbolic and Algebraic Computation, 7--14.
- S.A. Abramov, H.Q. Le (2003).
The sequence of linear algebraic systems generated by Zeilberger's
algorithm.
Proceedings of the 2003 Formal Power Series and Algebraic
Combinatorics, 2003, on CD.
- H.Q. Le (2003).
A direct algorithm to construct the minimal Z-pairs
for rational functions.
Advances in Applied Mathematics, 30, 137--159.
- S.A. Abramov, H.Q. Le, Z. Li (2003).
OreTools: a computer algebra library for univariate Ore polynomial rings.
Technical Report CS-2003-12, School of Computer Science, University
of Waterloo.
- H.Q. Le (2003).
Algorithms for the construction of the minimal telescopers.
PhD thesis, School of Computer Science, University of Waterloo.

- S.A. Abramov, H.Q. Le (2002).
A lower bound for the order of telescopers for a hypergeometric term.
Proceedings of the 2002 Formal Power Series and Algebraic
Combinatorics, 2003, on CD.
- H.Q. Le (2002).
Simplification of definite sums of rational functions
by creative symmetrizing method.
In T. Mora, editor,
Proceedings of the 2002 International
Symposium on Symbolic and Algebraic Computation, 161--167.
- S.A. Abramov, K.O. Geddes, H.Q. Le (2002).
Computer algebra library for the construction of the
minimal telescopers.
In N. Takayama, A.M. Cohen and X. Gao, editors, Proceedings of the
2002 International Congress of Mathematical Software, 319--329.
- K.O. Geddes, H.Q. Le (2002).
An algorithm to compute the
minimal telescopers for rational functions
(differential -- integral Case).
In N. Takayama, A.M. Cohen and X. Gao, editors, Proceedings of the
2002 International Congress of Mathematical Software, 453--463.
- S.A. Abramov, H.Q. Le (2002).
A criterion for the applicability of Zeilberger's algorithm to
rational functions.
Discrete Mathematics, 259:1--17, Dec 2002.
- S.A. Abramov, J.J. Carette, K.O. Geddes, H.Q. Le (2002).
Symbolic summation in Maple.
Technical Report CS-2002-32, School of Computer Science, University
of Waterloo, October 2002.

- H.Q. Le (2001).
Computing the minimal telescoper for sums of hypergeometric terms.
SIGSAM Bulletin, v. 35, no. 3, September, 2--10.
- S.A. Abramov, K.O. Geddes, H.Q. Le (2001).
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.
- S.A. Abramov, K.O. Geddes, H.Q. Le (2001).
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.
- H.Q. Le (2001).
A direct algorithm to construct Zeilberger's
recurrences for rational functions.
In H. Barcelo and V. Welker, editors, Proceedings of the 2001
Formal Power Series and Algebraic Combinatorics, 303--312

- S.A. Abramov, H.Q. Le (2000).
Applicability of Zeilberger's algorithm to rational functions.
In A.A. Mikhalev, D. Krob and A.V. Mikhalev, editors, Proceedings
of the 2000 Formal Power Series and Algebraic Combinatorics, 91--102.
- H.Q. Le (2000).
On the q-analogue of Zeilberger's algorithm to rational functions,
Programming and Comput. Software (Programmirovanie) 27, 2001, 49--58.
- H.Q. Le (2000).
On the differential-integral analogue of Zeilberger's algorithm to
rational functions.
In D. Wang and X. Gao, editors, Proceedings of the 2000 Asian
Symposium on Computer Mathematics, 204--213.
- H.Q. Le (2000).
Mathematical graphical object representation.
Programming and Comput. Software (Programmirovanie), 26(6),
Nov-Dec 2000.
- H.Q. Le (2000).
Communication-oriented representation of
mathematical objects.
Programming and Comput. Software (Programmirovanie), Volume 26,
Number 1, Jan--Feb 2000.

- H.Q. Le, C.R. Howlett (1999).
Client-server communication standards for mathematical computation.
In S. Dooley, editor, Proceedings of the 1999 International
Symposium on Symbolic and Algebraic Computation, 299--306.
- H.Q. Le (1999). Client-server communication standards for mathematical computation. Master's thesis, School of Computer Science, University of Waterloo, 1999.

- SumTools: a package for finding closed forms of definite and indefinite sums.
- geom3d: a package in
three-dimensional Euclidean geometry.
- Some graphics generated by the geom3d package:
- stellating process
- faceting process

- geometry: a package in two-dimensional Euclidean geometry.
- GaussInt: a package for doing arithmetic in Gaussian integer domain.

- The Symbolic Computation Group at the University of Waterloo
- Equipe Calcul Formel
- Combinatorics at RISC
- Seminar on Computer Algebra at Moscow State University
- Symbolic Sculptures and Mathematics
- The Geometry Center Home Page
- The KnotPlot Site

- Work:
INRIA Rocquencourt, B. P. 105, F-78153 Le
Chesnay Cedex, France

Tel: +33 1 39 63 53 21

Fax: +33 1 39 63 55 96

E-mail: ha.le@inria.fr - Home:
79 Antigua Road, Mississauga, Ontario, L5B 2T8, Canada

Tel: 1 905 272 5768