Short Vitae 


Gianna M. Del Corso received her laurea degree (magna cum laude) in Computer Science from the University of Pisa (Italy) in February 1993.

From 1993 to 1996 she was enrolled in a PhD program in Computational Mathematics at the University of Milano. 

In 1997 she received her PhD defending a thesis about randomized algorithms for the algebraic eigenvalue problem, under the supervison of Bruno Codenotti (IMC, Pisa) and Henryk Wozniakowski (Columbia University, NY, USA). She has been Visiting Scholar at the Computer Science Department of Columbia University, New York, USA from August 1994 to April 1995, and Visiting Researcher at the Department of Compute Science, The Johns Hopkins University, Baltimore, USA in June-August 1995, in August 1996 and in February-March 1997. 

From 1997 up to June 2000 she has been a CNR fellow at the Institute for Computational Mathematics. 

Since June 2000 she is with the Computer Science Department at the University of Pisa as Research Associate. 

In 2005 she has coordinated a INdAM-GNCS Project on the Numerical aspects of Web Search, and within this project she has been co-organaizer of the Workshop: Algorithmic and Numerical Aspects in Web Search. She is guest editor of a Special Issue of Internet Mathematics devoted to the topics of the workshop. 

From 2006-2008 she has coordinated the PE S&T Project Novel aspects and techniques for link analysis in the Web graph with the Athens University of Economics and Business. 

Since 2015 she is Associate Professor of Numerical Analysis at the Department of Computer Science of the University of Pisa. 

In 2019 che has coordinated  the INdAM-GNCS Project Sparse and data-sparse matrices: method and applications.


Main Publications


Journal Papers 

R. Bevilacqua, G. M. Del Corso, L. Gemignani
Orthogonal Iterations on Companion-like Pencils
Journal of Scientific Computing ,to appear, 2022.


R. Bevilacqua, G. M. Del Corso, L. Gemignani
On Computing Efficient Data-Sparse Representations of Unitary plus Low-rank Matrices, 

SIAM J. Matrix. Anal. Appl., (to appear), 2020. 


G. M. Del Corso, I. Del Corso, R. Dvornicich, F. Romani
On computing the density of integers of the form 2^n+p.
Mathematics of Computation, Vol. 89 (325), pp. 2365-2386, 2020.


R. Bevilacqua, G. M. Del Corso, L. Gemignani
Fast QR iterations for unitary plus low rank matrices
Numerische Mathematik, Vol 144(1), pp.25-53, 2020.


G. M. Del Corso, F. Poloni, L. Robol, R. Vandebril
When is a matrix unitary or Hermitian plus low rank?
Numerical Linear Algebra with Applications, Vol. 26(6), 2019.


R. Bevilacqua, G. M. Del Corso, L. Gemignani
A QR based approach for the nonlinear eigenvalue problem
Rendiconti del Seminario Matematico, Vol 76(2) pp. 57--67, 2018.


G. M. Del Corso, F. Romani
Adaptive Nonnegative Matrix Factorization and Measure Comparisons for Recommender Systems
Applied Mathematics and Computation, Vol 354, 164--179, 2019.


G. M. Del Corso, F. Poloni, L. Robol, R. Vandebril.
Factoring block Fiedler Companion Matrices
Springer INdAM series , 30, pp 129--155, 2019.


F. Poloni, G. M. Del Corso.
Counting Fiedler pencils with repetitions
Linear Algebra and Its Applications, Vol 532, 463--499, 2017.


G. M. Del Corso, F. Romani.
A multi-class approach for ranking graph nodes: models and experiments with incomplete data
Information Sciences, Vol 329, 619--637, 2016.


R. Bevilacqua, G. M. Del Corso, L. Gemignani.
A CMV-based Eigensolver for companion matrices
SIAM J. Matrix. Anal. Appl., Vol 36(3), 1046--1068, 2015.


R. Bevilacqua, G. M. Del Corso, L. Gemignani.
Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
Journal of Computational and Applied Mathematics, Vol 278, 326-335 2015.


R. Bevilacqua, G. M. Del Corso, L. Gemignani
Block Tridiagonal Reduction of Perturbed Normal and Rank Structured Matrices
Lin. Alg. and its Appl., Vol 439 (11), 3505-3517, 2013.


R. Bevilacqua, G. M. Del Corso.
A Condensed Representation of Almost Normal Matrices
Lin. Alg. and its Appl., Vol 238(11), 4408-4425, 2013.


R. Vandebril, G. M. Del Corso.
A unification of unitary similarity transforms to compressed representations
Numerische Mathematik, Vol 119(4), 641--665, 2011. DOI 10.1007/s00211-011-0400-5.


R. Bevilacqua, E. Bozzo, G. M. Del Corso.
Qd-type methods for quasiseparable matrices
SIAM J. Matrix. Anal. Appl., Vol 32(3), 722--747, 2011.


R. Vandebril, G. M. Del Corso.
An implicit multishift QR-algorithm for Hermitian plus low rank matrices.
SIAM J. Sci. Comp., Vol 32(4), 2190--2212, 2010.


G. M. Del Corso, F. Romani.
Versatile weighting strategies for a citation-based research evaluation model.
Bulletin of the Belgian Math. Soc., Vol 16(4), 723--743, 2009.


D. A. Bini, G. M. Del Corso, F. Romani.
A combined approach for evaluating papers, authors and scientific journals.
Journal of Comput. and Appl. Math., doi:10.1016/j.cam.2010.02.003, 2009.


D. A. Bini, G. M. Del Corso, F. Romani.
Evaluating Scientific Products by means of Citation-Based Models: a first Analysis and Validation.
Electron. Trans. Numer. Anal., Vol. 33, pp. 1--16, 2008.


G. M. Del Corso, A. Gullì, F. Romani.
Comparison of Krylov Subspace Methods on the PageRank Problem.
Journal of Comput. and Appl. Math., Vol.210, pp. 159--166, 2007.


G. M. Del Corso, A. Gullì, F. Romani.
Efficient Sparse Linear System Solution of the Page_Rank Problem.
UPGRADE, Vol. VIII(1):5--11, 2007. Special issue on Next Generation Web Search.


R. Bevilacqua, E. Bozzo, G. M. Del Corso, D. Fasino.
Rank structure of generalized inverses of rectangular banded matrices.

Calcolo, Vol. 42, 2005.


G. M. Del Corso, A. Gullì, F. Romani.
Fast PageRank Computation Via a Sparse Linear System.

Internet Mathematics, Vol. 2(3), 2005-2006.


R. Bevilacqua, E. Bozzo, G. M. Del Corso.
Transformations to rank structures by unitary similarity.
Linear Algebra and its Applications, Vol. 402:126--134, 2005.


R. Bevilacqua, G.M. Del Corso.
Structural Properties of Matrix Unitary Reduction to Semiseparable Form.
Calcolo, Vol. 41(4):177-202, 2004


C.J. Accettella, G. M. Del Corso, G. Manzini,
Inversion of two-level Circulan Matrices over Zp.
Linear Algebra and its Applications, Vol. 366: 5--23, 2003.


G. M. Del Corso, F. Romani,
Heuristic Spectral Techniques for the reduction of Bandwidth and Work-bound of Sparse Matrices.
Numerical Algorithms, vol 28:117-136, 2001.


L. Bedini, G. M. Del Corso, A. Tonazzini,
Preconditioned Edge-Preserving image deblurring and denoising.
Pattern Recognition Letter, vol 22:1083-1101, 2001.


D. A. Bini, G. M. Del Corso, G. Manzini, L. Margara,
Inversion of Circulant Matrices over Zm.
Mathematics of Computation, vol 70: 1169-1182, 2001.


B. Codenotti, G.M. Del Corso, G. Manzini,
Matrix Rank and Communication Complexity.
Linear Algebra and its Applications, Vol. 304(1-3):193--200, 2000.


G. M. Del Corso.
Randomized Error Estimation for Eigenvalue Approximation.
Calcolo, Vol. 37(1):21--46, 2000.


M. Del Corso, G. Manzini.
Finding Exact Solutions to the Bandwidth Minimization Problem.
Computing, Vol. 62(3): 189--203, 1999.


G. M. Del Corso.
Metodi Probabilistici per il Calcolo di Autovalori ed Autovettori,
Estratto della tesi di Dottorato. Bollettino dell'Unione Matematica Italiana, Sezione A: La matematica nella societa e nella cultura, 1-A Suppl: 185--188, 1998.


G.M. Del Corso, G. Manzini.
On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimate.
Journal of Complexity, Vol. 13(4):419--456, 1997.


G. M. Del Corso.
Estimating an Eigenvector by the Power Method with a Random Start.
SIAM Journal on Matrix Analysis and Applications,Vol. 18(4):913--937, 1997. 


Conference Papers 

G. M. Del Corso.
Randomized Algorithms for the Algebraic Eigenvalue Problem.
Dagstuhl Report 159,(abstract) pp.4-5 Algorithms and Complexity for Continuous Problems, E. Novak, J. Traub, G. Wasilkowski Eds.Saarbrucken, Germania, (1996).


G. Bilardi, B. Codenotti, G. M. Del Corso, C. Pinotti, G. Resta.
Broadcast and Associative Operations on Fat-Trees.
Distinguished paper in Proceedings di EuroPar'97, Passau, Germany. LNCS1300:196--207, 1997.


D. A. Bini, G. M. Del Corso, G. Manzini, L. Margara,
Inversion of Circulant Matrices over Zm.
International Colloquium on Automata Languages and Programming, Aalborg, Danimarca, LNCS 1443:719--730, 1998.


L. Bedini, G. M. Del Corso, A. Tonazzini,
Preconditioning Technique for Edge-Preserving Image Restoration.
IEEE International Conference on Information, Intelligence, Systems Washington, USA, 1--3 Novembre 1999.


G. M. Del Corso, A. Gullì,
Ranking the Web.
Invited tutorial. Fun with Algorithms, Isola d'Elba, Italy 26--28 May 2004.


G. M. Del Corso, A. Gullì, F. Romani.
Fast PageRank Computation via Sparse Linear System.
Third International Workshop, WAW 2004 Roma, Italy LNCS 3243:118--130, 2004.


G. M. Del Corso, A. Gullì, F. Romani.
Ranking a stream of news.
In Proc. of the Fourteenth International World Wide Web Conference (WWW05) Chiba, Japan ACM Press:97--106, 2005.


G. M. Del Corso, F. Romani.
A time-aware citation-based model for evaluating scientific products.
In Proc. of the 4th International Workshop on Tools for solving Structured Markov Chains (SMCTools 2009) Pisa, Italy ACM Digital library, October 19th, 2009.


A. Berti, A. Bernasconi. G. M. Del Corso, R. Guidotti
Effect of Different Encodings and Distance Functions on Quantum Instance-based Classifiers
26th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-22)



Ph.D. Thesis 


G. M. Del Corso
Randomized Methods for Eigenvalue and Eigenvector Approximation.
University of Milano (1997), Advisors: Bruno Codenotti, Henryk Wozniakowski. 


Technical Reports and Submitted papers 

G. M. Del Corso, G. Manzini.
On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimate: Numerical tests.
Technical Report B4-97-1 Istituto di Matematica Computazionale, CNR, Pisa. 


R. Bevilacqua, G.M. Del Corso.
Existence, Uniqueness and Algorithms for Matrix Unitary Reduction to Semiseparable Form.
Technical Report TR-03-12 Dipartimento di Informatica, University of Pisa.


G. M. Del Corso, A. Gullì, F. Romani.
Exploiting Web Matrix Permutations to Speedup PageRank Computations.
Technical Report TR-04/2004 Istituto di Informatica e Telematica, CNR, Pisa.