A fast method to block-diagonalize a Hankel matrix. - Skander Belhaj (Numer. Algorithms, 2008)

Computing the block factorization of complex Hankel matrices. - Skander Belhaj (Computing, 2010)

Algèbre matricielle rapide en calcul formel et calcul numérique. (Fast algorithms for structured matrices in computer algebra and numerical linear algebra). - Skander Belhaj (2010)

On the complexity of computing the GCD of two polynomials via Hankel matrices. - Skander Belhaj; Haïthem Ben Kahla (ACM Commun. Comput. Algebra, 2012)

Computing the polynomial remainder sequence via Bézout matrices. - Skander Belhaj (J. Comput. Appl. Math., 2013)

A note on computing the inverse of a triangular Toeplitz matrix. - Skander Belhaj; Marwa Dridi (Appl. Math. Comput., 2014)

A fast algorithm for solving banded Toeplitz systems. - Skander Belhaj; Marwa Dridi; Ahmed Salam (Comput. Math. Appl., 2015)

Blind image deconvolution through Bezoutians. - Gema M. Diaz-Toca; Skander Belhaj (J. Comput. Appl. Math., 2017)

Blind image deconvolution via Hankel based method for computing the GCD of polynomials. - Skander Belhaj; Haïthem Ben Kahla; Marwa Dridi; Maher Moakher (Math. Comput. Simul., 2018)

Approximate greatest common divisor of several polynomials from Hankel matrices. - Skander Belhaj; Abdulrahman Alsulami (ACM Commun. Comput. Algebra, 2021)

A fast method for solving quasi-pentadiagonal Toeplitz linear systems and its application to the Lax-Wendroff scheme. - Skander Belhaj; Fahd Hcini; Maher Moakher (Math. Comput. Simul., 2021)

Efficient algorithms for perturbed symmetrical Toeplitz-plus-Hankel systems. - Fahd Hcini; Skander Belhaj; Yulin Zhang (J. Comput. Appl. Math., 2025)