default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSkander Belhaj
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j11]Fahd Hcini
, Skander Belhaj, Yulin Zhang:
Efficient algorithms for perturbed symmetrical Toeplitz-plus-Hankel systems. J. Comput. Appl. Math. 457: 116333 (2025)- 2021
- [j10]Skander Belhaj, Abdulrahman Alsulami:
Approximate greatest common divisor of several polynomials from Hankel matrices. ACM Commun. Comput. Algebra 55(3): 77-81 (2021) - [j9]Skander Belhaj, Fahd Hcini, Maher Moakher:
A fast method for solving quasi-pentadiagonal Toeplitz linear systems and its application to the Lax-Wendroff scheme. Math. Comput. Simul. 188: 77-86 (2021)
2010 – 2019
- 2018
- [j8]Skander Belhaj, Haïthem Ben Kahla, Marwa Dridi, Maher Moakher:
Blind image deconvolution via Hankel based method for computing the GCD of polynomials. Math. Comput. Simul. 144: 138-152 (2018) - 2017
- [j7]Gema M. Diaz-Toca, Skander Belhaj:
Blind image deconvolution through Bezoutians. J. Comput. Appl. Math. 315: 98-106 (2017) - 2015
- [j6]Skander Belhaj, Marwa Dridi, Ahmed Salam:
A fast algorithm for solving banded Toeplitz systems. Comput. Math. Appl. 70(12): 2958-2967 (2015) - 2014
- [j5]Skander Belhaj, Marwa Dridi:
A note on computing the inverse of a triangular Toeplitz matrix. Appl. Math. Comput. 236: 512-523 (2014) - 2013
- [j4]Skander Belhaj:
Computing the polynomial remainder sequence via Bézout matrices. J. Comput. Appl. Math. 250: 244-255 (2013) - 2012
- [j3]Skander Belhaj, Haïthem Ben Kahla:
On the complexity of computing the GCD of two polynomials via Hankel matrices. ACM Commun. Comput. Algebra 46(3/4): 74-75 (2012) - 2010
- [b1]Skander Belhaj:
Algèbre matricielle rapide en calcul formel et calcul numérique. (Fast algorithms for structured matrices in computer algebra and numerical linear algebra). Tunis El Manar University, Tunisia, 2010 - [j2]Skander Belhaj:
Computing the block factorization of complex Hankel matrices. Computing 87(3-4): 169-186 (2010)
2000 – 2009
- 2008
- [j1]Skander Belhaj:
A fast method to block-diagonalize a Hankel matrix. Numer. Algorithms 47(1): 15-34 (2008)
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-12-02 21:32 CET 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:
