The following pages link to Fatima K. Abu Salem (Q975315):
Displaying 11 items.
- An empirical study of cache-oblivious polygon indecomposability testing (Q975317) (← links)
- Parallel methods for absolute irreducibility testing (Q1009361) (← links)
- An efficient sparse adaptation of the polytope method over \(\mathbb F_q\) and a record-high binary bivariate factorisation (Q2482628) (← links)
- A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over \(\mathbb F_2\) (Q2492665) (← links)
- Factoring Sparse Bivariate Polynomials Using the Priority Queue (Q2879344) (← links)
- Fast Jacobian Group Operations for C<sub>3,4</sub> Curves over a Large Finite Field (Q3091950) (← links)
- Factoring polynomials via polytopes (Q4657294) (← links)
- Parallel and cache-efficient Hensel lifting (Q5175287) (← links)
- Parallel Processing and Applied Mathematics (Q5307353) (← links)
- COMMUNICATION BALANCING IN THE PARALLEL GÖTTFERT ALGORITHM (Q5408354) (← links)
- Cache-oblivious Matrix Multiplication for Exact Factorisation (Q6511792) (← links)
