We use cookies on this site to enhance your experience.
By selecting “Accept” and continuing to use this website, you consent to the use of cookies.
Join us at Laurier
Becoming a Golden Hawk means more than just cheering on our (really good) varsity teams – it means being a student who cares about your community, who works hard in the classroom, and who takes advantage of all the learning opportunities that can happen outside the classroom, too.
-
Connect With Us
-
Show Me the Campus
-
Explore Our Programs
I received my PhD in Computer Science from the Lomonosov Moscow State University (Russia) in 1985 and my MSc in applied mathematics from the Lomonosov Moscow State University (Russia) in 1980. Prior to joining Laurier, I was an associate professor at the University of Waterloo (1997-2004), assistant and associate professor at Lomonosov Moscow State University (1985-1998), and senior researcher at the Computer Center of the Russian Academy of Sciences (1993-1998).
My research is a combination of symbolic and numeric computing that includes both theoretical development and practical applications in computer algebra systems, such as Maple. The main focus of my research is in accelerating of popular symbolic and numeric algorithms. This includes accelerated symbolic summation, accelerated high-precision evaluation of hypergeometric series, accelerated numeric computation over regular intervals with chains of recurrences, and optimized compiling in general.
- World record computation of 2 billion digits of zeta(3), 2007.
- Natural Sciences and Engineering Research Council Synergy Award, with Symbolic Computation Group, University of Waterloo, 2004.
- Best research paper award, International Conference on Parallel Computation and Cellular Automata, Potsdam, Germany, 1994.
I have research assistantships opportunities for undergraduate and graduate students interested in advanced compiling techniques, symbolic computation and high-performance computing.
- Zima, Eugene. “Accelerating indefinite summation: simple classes of summands.” Mathematics in Computer Science, December 2013, Volume 7, Issue 4, pp. 455-472.
- Egorychev G.P., Zima E.V. “Integral representation and algorithms for closed form summation.” Handbook of Algebra, vol. 5, (ed. M.Hazewinkel), Elsevier, 2008, pp. 459 -529.
- Cheng H., Hanrot G., Thome E., Zima E., Zimmermann P. “Time and Space-Efficient Evaluation of Some Hypergeometric Constants”, Proc. of the International Symposium on Symbolic and Algebraic Computations, ISSAC'2007, ACM Press, pp. 85-91.
- Stewart A.M., Zima E.V. “Base-2 Cunningham numbers in modular arithmetic.” Program. Comput. Software, 2007, vol. 33, pp.80 -86.
- Gerhard J., Giesbrecht M., Storjohann A., Zima E.V. “Shiftless decomposition and polynomial-time rational summation. “ In ISSAC '03: Proceedings of the 2003 international symposium on Symbolic and algebraic computation, 119-126, New York, NY, USA, 2003. ACM Press.
- Zima E.V. “On computational properties of chains of recurrences. “ In ISSAC '01: Proceedings of the 2001 international symposium on Symbolic and algebraic computation, 345-352, New York, NY, USA, 2001. ACM Press.
- Kislenkov V., Mitrofanov V., Zima E.V. “Multidimensional chains of recurrences. “ In ISSAC '98: Proceedings of the 1998 international symposium on Symbolic and algebraic computation, 199-206, New York, NY, USA, 1998. ACM Press.
- Zima E.V. “On parallel construction of multidimensional chains of recurrences. “ In PARCELLA'96: Proceedings of the 1996 International Conference on Parallel Computation and Cellular Automata, 158-167. Academy Verlag, 1996.
Contact Info:
E: ezima@wlu.ca
Office location: N2087
Languages spoken: English, Russian, Ukraine
Personal website:
bohr.wlu.ca/ezima