Dr. Fatima K. Abu Salem

Assistant Professor, DPhil Oxon
Computer Science Department
American University of Beirut
P. O. Box 11-0236
Riad El Solh
Beirut 1107 2020
Lebanon

e-mail: fatima.abusalem "at" aub.edu.lb

Tel.: +961-1-350000 ext. 4224
Fax: +961-1-744461

Education

• BS., MS., Mathematics, American University of Beirut.
• DPhil, Computing Science, Oxford University (under the supervision of Prof. Richard P. Brent).

Research interests

• Computer Algebra, with an emphasis on polynomial factorisation over finite fields.
• Parallel memory-hierarchical models.
• Software engineering in Computer Algebra, with an emphasis on cache-oblivious algorithms and parallel algorithms for multi-cores.

Publications

1. F. Abu Salem, A BSP parallel model of the Gottfert algorithm over F_2, Proc. PPAM 2003, Lecture Notes in Computer Science, Vol. 3019, pp. 217-224, Springer-Verlag, 2004. (Here)
2. F. Abu Salem, S. Gao, and A. Lauder, Factoring polynomials via polytopes, Proc. ISSAC 2004 (International Symposium on Symbolic and Algebraic Computation), pp. 4-11, ACM Press, 2004. (Here)
3. F. K. Abu Salem, A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F_2, Journal of Computing (2006), v. 77, no. 2, pp. 179--203.(Here)
4. F. K. Abu Salem and K. Khuri-Makdisi, Fast Jacobian group operations for C_{3,4} curves over a large finite field, London Mathematical Society Journal of Computation and Mathematics, 10 (2007) 307--328. (Author's preliminary version)
5. A. Nasri, F. K. Abu Salem and G. Turkiyyah, Subdivision for Graphics and Visualization, in Graphics and Visualization: Principles & Algorithms, T. Theoharis, G. Papaioannou, N. Platis, N.M. Patrikalakis eds., AK Peters publishers, January 2008. (Author's preliminary version)
6. F. K. Abu Salem, An efficient sparse adaptation of the polytope method over F_p and a record high binary bivariate factorisation, Journal of Symbolic Computation, vol. 43, issue 5, May 2008, pages 311-341.(Author's preliminary version)
7. F. K. Abu Salem and L. T. Yang, Parallel methods for absolute irreducibility testing, accepted for publication in the Journal of Supercomputing, 2008. (Author's preliminary version)
8. F. K. Abu Salem and R. N. Soudah, Cache-oblivious absolute irreducibility testing of bivariate polynomials, submitted to London Mathematical Society Journal of Computation and Mathematics. (Author's preliminary version)
9. F. K. Abu Salem and L. B. Tamim, Communication balancing in the parallel Gottfert algorithm, submitted to International Journal of High Performance Computing and Networking. (Author's preliminary version)

Dissertations

1. Factorisation Algorithms for Univariate and Bivariate Polynomials over Finite Fields,
   Doctor of Philosophy thesis, Oxford University, September 2004. (Here)
2. Integer Factorization and the Quadratic Sieve,
   Masters thesis, American University of Beirut, June 2001. (Here)

Ongoing research

• Cache oblivious exact block-recursive LU decomposition over F_2.
• Cache oblivious Cholesky decomposition algorithm.
• Space-filling techniques for minimising I/O latency in sparse matrix vector multiplication.