Dr. Fatima K. Abu Salem

Associate 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

Professional Assignments

• Secretary, SIAM Special Activity Interest Group on Supercomputing (January 2012 -- December 2013).
• Associate Editor, Journal of Parallel and Distributed Computing, Elsevier.

Education

• DPhil, Computing Science, Oxford University.
• BS., MS., Mathematics, American University of Beirut.

Research interests

• Computer Algebra, with an emphasis on polynomial factorisation over finite fields..
• Algorithm engineering in Computer Algebra.
• Cache-efficient algorithms.
• Parallel Algorithms.

Publications

• 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)
• 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)
• F. K. Abu Salem
  A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F_2
  Computing (2006), v. 77, no. 2, pp. 179--203.(Here)
• 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, v. 10, 307--328, 2007. (Here)
• 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.
  
• 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, v. 43, issue 5, May 2008, pages 311-341.(Here)
• F. K. Abu Salem and L. T. Yang
  Parallel methods for absolute irreducibility testing
  Journal of Supercomputing, v. 46, no. 3, pp. 181--212, 2008. (Here)
• F. K. Abu Salem
  Cache-Oblivious Polygon Indecomposability Testing
  Proc. PASCO 2010, pp. 150 -- 159, ACM Press, 2010. (Here)
• F. K. Abu Salem and R. N. Soudah
  An empirical study of cache-oblivious polygon indecomposability testing
  Computing, v. 88, issue 1, pp. 55 -- 78, 2010. (Here)
• F. K. Abu Salem
  Parallel and Cache-efficient Hensel Lifting
  ACM Communications in Computer Algebra , 45 (2), Issue 176, pp. 107 -- 108, 2011
• F. K. Abu Salem
  A Cache-Oblivious Engineering of the G2V Algorithm for Computing Grobner Bases
  ACM Communications in Computer Algebra , 46 (3), Issue 181, pp. 72 -- 73, 2012
• F. K. Abu Salem and L. B. Tamim
  Communication balancing in the parallel Gottfert algorithm
  in Parallel Processing Letters, 22 (4), December 2012, http://dx.doi.org/10.1142/S0129626412500119.

Dissertations

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