Dr. Mark J. Encarnacion is recognized for his significant achievements in the field of computer algebra, in particular his improvement of the modular algorithm for computing gcd’s of polynomials over algebraic number fields. His algorithm is currently being used in various software systems and is considered to be the best practical algorithm available.
Sex: Male
Education:
- University of the Philippines-Diliman, Quezon City, B.S. Statistics, 1988
- University of the Philippines-Diliman, Quezon City, M.S. Mathematics, 1990
- University of Linz, Austria, Dr. Tech. (Technical Sciences), 1995
Field of Specialization:
Computer Algebra, Design and Analysis of Algorithms, Software Engineering, Computer Software
Researches:
Encarnacion, M.J., (1997) Black-box polynomial resultant
Information Processing Letters Volume 61, No. 4
Encarnacion, M.J., & Collins, G.E., (1996) Improved techniques for factoring univariate polynomials
Journal of Symbolic Computation Volume 21
Encarnacion, M.J., (1995) Computing geds of polynomials over algebraic number fields
Journal of Symbolic Computation Volume 20
Encarnacion, M.J., & Collins, G.E., (1995) Efficient rational number reconstruction
Journal of Symbolic Computation Volume 20
Encarnacion, M.J., (1992) A note on linear regression functions
Communication in Statistics, Theory and Methods Volume 21, No. 3
Encarnacion, M.J., (1998) An efficient method for computing resultant systems
Applicable Algebra in Engineering, Communication and Computing (AAECC) Volume 9, No. 3
Encarnacion, M.J., (1997) Factoring polynomials over algebraic number fields via norms
International Symposium on Symbolic and Algebraic Computation (ISSAC)
Encarnacion, M.J., (1997) ISSAC's 97 polynomials resultants
ACM SIGSAM Bulletin Volume 31, No. 3
Papers Presented:
- On the Monic Factors of a Univariate Polynomial over an Algebraic Number Field, Rhine Workshop on Computer Algebra, Karlsruhe, Germany
- Factoring Polynomials over Algebraic Number Fields via Norms and the Average Number of Modular Factors in Trager's Polynomial Factorization Algorithm, International Symposium on Symbolic and Algebraic Computation, Maui, Hawaii, USA
- On a Modular Algorithm for Computing Geds of Polynomials over Algebraic Number Fields, International Symposium on Symbolic and Algebraic Computation, Oxford, England, UK
- The Average Number of Modular Factors in Trager's Polynomial Factorization Algorithm , RIMS Symposium on Theory and Applications of Computer Algebra