default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFatima K. Abu Salem
Person information
- affiliation: American University of Beirut, Lebanon
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Ravi Sharma
, Norita B. Ahmad, Saqib Ali, Adil Bilal, Samar Fatima, Nir Kshetri, Fatima Abu Salem, Prateek Sibal:
Technomoral Affordances of Artificial Intelligence in Data-Driven Systems. Computer 55(10): 76-81 (2022)- [i5]Beichen Zhang, Fatima K. Abu Salem, Michael J. Hayes, Tsegaye Tadesse:
Quantitative Assessment of Drought Impacts Using XGBoost based on the Drought Impact Reporter. CoRR abs/2211.02768 (2022) - 2021
- [j12]Fatima K. Abu Salem, Roaa Al Feel, Shady Elbassuoni, Hiyam Ghannam, Mohamad Jaber, May Farah:
Meta-learning for fake news detection surrounding the Syrian war. Patterns 2(11): 100369 (2021) - [c12]Yad Fatah, Mark Nourallah, Lynn Wahab, Fatima K. Abu Salem, Shady Elbassuoni:
An RDF Data Management System for Conflict Casualties. CIKM 2021: 4711-4715 - 2020
- [j11]Fatima Abu Salem, Issam W. Damaj, Lama Hamandi, Rached N. Zantout:
Effective Assessment of Computer Science Capstone Projects and Student Outcomes. Int. J. Eng. Pedagog. 10(2): 72-93 (2020) - [j10]Fatima K. Abu Salem, Mira Al Arab, Laurence T. Yang:
Extending the limits for big data RSA cracking: Towards cache-oblivious TU decomposition. J. Parallel Distributed Comput. 138: 65-77 (2020) - [c11]Nancy Sawaya, Shady Elbassuoni, Fatima K. Abu Salem, Roaa Al Feel:
TAGWAR: An Annotated Corpus for Sequence Tagging of War Incidents. KDIR 2020: 243-250 - [c10]Jad Doughman, Fatima Abu Salem, Shady Elbassuoni:
Time-Aware Word Embeddings for Three Lebanese News Archives. LREC 2020: 4717-4725
2010 – 2019
- 2019
- [j9]Fatima K. Abu Salem, Mohamad Jaber, Chadi Abdallah, Omar Mehio, Sara Najem:
A Distributed Spatiotemporal Contingency Analysis for the Lebanese Power Grid. IEEE Trans. Comput. Soc. Syst. 6(1): 162-175 (2019) - [c9]Fatima K. Abu Salem, Roaa Al Feel, Shady Elbassuoni, Mohamad Jaber, May Farah:
FA-KES: A Fake News Dataset around the Syrian War. ICWSM 2019: 573-582 - 2017
- [c8]Fatima K. Abu Salem, Mira Al Arab:
Cache-oblivious Matrix Multiplication for Exact TU Factorisation. PASCO@ISSAC 2017: 13:1-13:10 - [i4]Fatima K. Abu Salem, Mira Al Arab:
Cache-oblivious Matrix Multiplication for Exact Factorisation. CoRR abs/1705.04807 (2017) - 2016
- [c7]Haïdar Safa, Fatima K. Abu Salem, Ali Tawbeh:
Energy-aware sensor-to-sink binding in WSNs. BlackSeaCom 2016: 1-5 - [i3]Fatima K. Abu Salem, Khalil El-Harake, Karl Gemayel:
Efficient sparse polynomial factoring using the Funnel heap. CoRR abs/1612.05403 (2016) - [i2]Fatima K. Abu Salem, Mira Al Arab:
Comparative study of space filling curves for cache oblivious TU Decomposition. CoRR abs/1612.06069 (2016) - 2015
- [c6]Fatima K. Abu Salem, Khalil El-Harake, Karl Gemayel:
Cache oblivious sparse polynomial factoring using the funnel heap. PASCO 2015: 7-15 - [c5]Haïdar Safa, Wassim El-Hajj, Fatima K. Abu Salem, Marwa Moutaweh:
Using K-nearest neighbor algorithm to reduce false negatives in P2P secure routing protocols. IWCMC 2015: 929-934 - 2014
- [c4]Fatima K. Abu Salem, Khalil El-Harake, Karl Gemayel:
Factoring Sparse Bivariate Polynomials Using the Priority Queue. CASC 2014: 388-402 - 2012
- [j8]Fatima K. Abu Salem:
A cache-oblivious engineering of the G2V algorithm for computing Gröbner bases. ACM Commun. Comput. Algebra 46(3/4): 72-73 (2012) - [j7]Fatima K. Abu Salem, Lama B. Tamim:
Communication Balancing in the Parallel GöTtfert Algorithm. Parallel Process. Lett. 22(4) (2012) - 2011
- [j6]Fatima K. Abu Salem:
Parallel and cache-efficient Hensel lifting. ACM Commun. Comput. Algebra 45(1/2): 107-108 (2011) - 2010
- [j5]Fatima K. Abu Salem, Rawan N. Soudah:
An empirical study of cache-oblivious polygon indecomposability testing. Computing 88(1-2): 55-78 (2010) - [c3]Fatima K. Abu Salem:
Cache-oblivious polygon indecomposability testing. PASCO 2010: 150-159
2000 – 2009
- 2008
- [j4]Fatima K. Abu Salem:
An efficient sparse adaptation of the polytope method over I and a record-high binary bivariate factorisation. J. Symb. Comput. 43(5): 311-341 (2008) - [j3]Fatima K. Abu Salem, Laurence Tianruo Yang:
Parallel methods for absolute irreducibility testing. J. Supercomput. 46(3): 181-212 (2008) - 2007
- [j2]Fatima K. Abu Salem, Kamal Khuri-Makdisi:
Fast Jacobian Group Operations for C3, 4 Curves over a Large Finite Field. LMS J. Comput. Math. 10: 307-328 (2007) - 2006
- [j1]Fatima Abu Salem:
A New Sparse Gaussian Elimination Algorithm and the Niederreiter Linear System for Trinomials over F2. Computing 77(2): 179-203 (2006) - [i1]Fatima Abu Salem, Kamal Khuri-Makdisi:
Fast Jacobian group operations for C_{3,4} curves over a large finite field. CoRR abs/math/0610121 (2006) - 2004
- [c2]Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder:
Factoring polynomials via polytopes. ISSAC 2004: 4-11 - 2003
- [c1]Fatima Abu Salem:
A BSP Parallel Model for the Göttfert Algorithm over F2. PPAM 2003: 217-224
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
