default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLilia Ziane Khodja
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j7]Thierry Garcia, Pierre Spitéri, Lilia Ziane Khodja, Raphaël Couturier:
Solution of univalued and multivalued pseudo-linear problems using parallel asynchronous multisplitting methods combined with Krylov methods. Adv. Eng. Softw. 153: 102929 (2021)- [j6]Thierry Garcia
, Pierre Spitéri, Lilia Ziane Khodja, Raphaël Couturier:
Coupling parallel asynchronous multisplitting methods with Krylov methods to solve pseudo-linear evolution 3D problems. J. Comput. Sci. 51: 101303 (2021)
2010 – 2019
- 2016
- [j5]Raphaël Couturier, Lilia Ziane Khodja, Christophe Guyeux:
TSIRM: A two-stage iteration with least-squares residual minimization algorithm to solve large sparse linear and nonlinear systems. J. Comput. Sci. 17: 535-546 (2016) - [c5]Kahina Ghidouche, Abderrahmane Sider, Lilia Ziane Khodja, Raphaël Couturier:
Two Parallel Implementations of Ehrlich-Aberth Algorithm for Root-Finding of Polynomials on Multiple GPUs with OpenMP and MPI. CSE/EUC/DCABES 2016: 270-277 - 2015
- [j4]Raphaël Couturier, Lilia Ziane Khodja:
A scalable multisplitting algorithm to solve large sparse linear systems. J. Supercomput. 71(4): 1345-1356 (2015) - [c4]Raphaël Couturier, Lilia Ziane Khodja, Christophe Guyeux:
TSIRM: A Two-Stage Iteration with Least-Squares Residual Minimization Algorithm to Solve Large Sparse Linear Systems. IPDPS Workshops 2015: 990-997 - 2014
- [j3]Lilia Ziane Khodja, Raphaël Couturier, Arnaud Giersch, Jacques M. Bahi:
Parallel sparse linear solver with GMRES method using minimization techniques of communications for GPU clusters. J. Supercomput. 69(1): 200-224 (2014) - [j2]Mohand Yazid, Louiza Bouallouche-Medjkoune, Djamil Aïssani, Lilia Ziane Khodja:
Analytical analysis of applying packet fragmentation mechanism on IEEE 802.11b DCF network in non ideal channel with infinite load conditions. Wirel. Networks 20(5): 917-934 (2014) - [c3]Charles Emile Ramamonjisoa, Lilia Ziane Khodja, David Laiymani, Arnaud Giersch, Raphaël Couturier:
Simulation of Asynchronous Iterative Algorithms Using SimGrid. HPCC/CSS/ICESS 2014: 890-895 - 2013
- [b1]Lilia Ziane Khodja:
Résolution de systèmes linéaires et non linéaires creux sur grappes de GPUs. (Solving sparse linear and nonlinear systems on GPU clusters). University of Franche-Comté, Besançon, France, 2013 - [j1]Lilia Ziane Khodja, Ming Chau, Raphaël Couturier, Jacques M. Bahi, Pierre Spitéri:
Parallel solution of American option derivatives on GPU clusters. Comput. Math. Appl. 65(11): 1830-1848 (2013) - 2011
- [c2]Jacques M. Bahi, Raphaël Couturier, Lilia Ziane Khodja:
Parallel Sparse Linear Solver GMRES for GPU Clusters with Compression of Exchanged Data. Euro-Par Workshops (1) 2011: 471-480 - [c1]Jacques M. Bahi, Raphaël Couturier, Lilia Ziane Khodja:
Parallel GMRES implementation for solving sparse linear systems on GPU clusters. SpringSim (HPC) 2011: 12-19
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:23 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:
