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.
In 2020 she received the qualification for full professor (ASN 2018-2020).
Main Publications
A. Bernasconi, A. Berti,V. Ciriani, G. M. Del Corso, I. Fulginiti
XOR-AND-XOR Logic Forms for Autosymmetric Functions and Applications to Quantum Computing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pp. 1-12, 2022.
R. Bevilacqua, G. M. Del Corso, L. Gemignani R. Bevilacqua, G. M. Del Corso, L. Gemignani G. M. Del Corso, I. Del Corso, R. Dvornicich, F. Romani R. Bevilacqua, G. M. Del Corso, L. Gemignani G. M. Del Corso, F. Poloni, L. Robol, R. Vandebril R. Bevilacqua, G. M. Del Corso, L. Gemignani G. M. Del Corso, F. Romani G. M. Del Corso, F. Poloni, L. Robol, R. Vandebril. F. Poloni, G. M. Del Corso. G. M. Del Corso, F. Romani. R. Bevilacqua, G. M. Del Corso, L. Gemignani. R. Bevilacqua, G. M. Del Corso, L. Gemignani. R. Bevilacqua, G. M. Del Corso, L. Gemignani R. Bevilacqua, G. M. Del Corso. R. Vandebril, G. M. Del Corso. R. Bevilacqua, E. Bozzo, G. M. Del Corso. R. Vandebril, G. M. Del Corso. G. M. Del Corso, F. Romani. D. A. Bini, G. M. Del Corso, F. Romani. D. A. Bini, G. M. Del Corso, F. Romani. G. M. Del Corso, A. Gullì, F. Romani. G. M. Del Corso, A. Gullì, F. Romani. R. Bevilacqua, E. Bozzo, G. M. Del Corso, D. Fasino. G. M. Del Corso, A. Gullì, F. Romani. R. Bevilacqua, E. Bozzo, G. M. Del Corso. R. Bevilacqua, G.M. Del Corso. C.J. Accettella, G. M. Del Corso, G. Manzini, G. M. Del Corso, F. Romani, L. Bedini, G. M. Del Corso, A. Tonazzini, D. A. Bini, G. M. Del Corso, G. Manzini, L. Margara, B. Codenotti, G.M. Del Corso, G. Manzini, G. M. Del Corso. M. Del Corso, G. Manzini. G. M. Del Corso. G.M. Del Corso, G. Manzini. G. M. Del Corso. G. M. Del Corso. G. Bilardi, B. Codenotti, G. M. Del Corso, C. Pinotti, G. Resta. D. A. Bini, G. M. Del Corso, G. Manzini, L. Margara, L. Bedini, G. M. Del Corso, A. Tonazzini, G. M. Del Corso, A. Gullì, G. M. Del Corso, A. Gullì, F. Romani. G. M. Del Corso, A. Gullì, F. Romani. G. M. Del Corso, F. Romani. A. Berti, A. Bernasconi. G. M. Del Corso, R. Guidotti A. Poggiali, A. Berti, A. Bernasconi. G. M. Del Corso, R. Guidotti G. M. Del Corso P. Boito, G. M. Del Corso. A. Poggiali, A. Berti, A. Bernasconi. G. M. Del Corso, R. Guidotti
Orthogonal Iterations on Companion-like Pencils
Journal of Scientific Computing
91(6), 2022.
Efficient reduction of compressed unitary plus low rank matrices to Hessenberg form
SIAM J. Matrix. Anal. Appl.,41(3), pp. 984--1003, 2020.
On computing the density of integers of the form 2^n+p.
Mathematics of Computation, Vol. 89 (325), pp. 2365-2386, 2020.
Fast QR iterations for unitary plus low rank matrices
Numerische Mathematik, Vol 144(1), pp.25-53, 2020.
When is a matrix unitary or Hermitian plus low rank?
Numerical Linear Algebra with Applications, Vol. 26(6), 2019.
A QR based approach for the nonlinear eigenvalue problem
Rendiconti del Seminario Matematico, Vol 76(2) pp. 57--67, 2018.
Adaptive Nonnegative Matrix Factorization and Measure Comparisons for Recommender Systems
Applied Mathematics and Computation, Vol 354, 164--179, 2019.
Factoring block Fiedler Companion Matrices
Springer INdAM series , 30, pp 129--155, 2019.
Counting Fiedler pencils with repetitions
Linear Algebra and Its Applications, Vol 532, 463--499, 2017.
A multi-class approach for ranking graph nodes: models and experiments with incomplete data
Information Sciences, Vol 329, 619--637, 2016.
A CMV-based Eigensolver for companion matrices
SIAM J. Matrix. Anal. Appl., Vol 36(3), 1046--1068, 2015.
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.
Block Tridiagonal Reduction of Perturbed Normal and Rank Structured Matrices
Lin. Alg. and its Appl., Vol 439 (11), 3505-3517, 2013.
A Condensed Representation of Almost Normal Matrices
Lin. Alg. and its Appl., Vol 238(11), 4408-4425, 2013.
A unification of unitary similarity transforms to compressed representations
Numerische Mathematik, Vol 119(4), 641--665, 2011. DOI 10.1007/s00211-011-0400-5.
Qd-type methods for quasiseparable matrices
SIAM J. Matrix. Anal. Appl., Vol 32(3), 722--747, 2011.
An implicit multishift QR-algorithm for Hermitian plus low rank matrices.
SIAM J. Sci. Comp., Vol 32(4), 2190--2212, 2010.
Versatile weighting strategies for a citation-based research evaluation model.
Bulletin of the Belgian Math. Soc., Vol 16(4), 723--743, 2009.
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.
Evaluating Scientific Products by means of Citation-Based Models: a first Analysis and Validation.
Electron. Trans. Numer. Anal., Vol. 33, pp. 1--16, 2008.
Comparison of Krylov Subspace Methods on the PageRank Problem.
Journal of Comput. and Appl. Math., Vol.210, pp. 159--166, 2007.
Efficient Sparse Linear System Solution of the Page_Rank Problem.
UPGRADE, Vol. VIII(1):5--11, 2007. Special issue on Next Generation Web Search.
Rank structure of generalized inverses of rectangular banded matrices.
Calcolo, Vol. 42, 2005.
Fast PageRank Computation Via a Sparse Linear System.
Internet Mathematics, Vol. 2(3), 2005-2006.
Transformations to rank structures by unitary similarity.
Linear Algebra and its Applications, Vol. 402:126--134, 2005.
Structural Properties of Matrix Unitary Reduction to Semiseparable Form.
Calcolo, Vol. 41(4):177-202, 2004
Inversion of two-level Circulan Matrices over Zp.
Linear Algebra and its Applications, Vol. 366: 5--23, 2003.
Heuristic Spectral Techniques for the reduction of Bandwidth and Work-bound of Sparse Matrices.
Numerical Algorithms, vol 28:117-136, 2001.
Preconditioned Edge-Preserving image deblurring and denoising.
Pattern Recognition Letter, vol 22:1083-1101, 2001.
Inversion of Circulant Matrices over Zm.
Mathematics of Computation, vol 70: 1169-1182, 2001.
Matrix Rank and Communication Complexity.
Linear Algebra and its Applications, Vol. 304(1-3):193--200, 2000.
Randomized Error Estimation for Eigenvalue Approximation.
Calcolo, Vol. 37(1):21--46, 2000.
Finding Exact Solutions to the Bandwidth Minimization Problem.
Computing, Vol. 62(3): 189--203, 1999.
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.
On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimate.
Journal of Complexity, Vol. 13(4):419--456, 1997.
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
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).
Broadcast and Associative Operations on Fat-Trees.
Distinguished paper in Proceedings di EuroPar'97, Passau, Germany. LNCS1300:196--207, 1997.
Inversion of Circulant Matrices over Zm.
International Colloquium on Automata Languages and Programming, Aalborg, Danimarca, LNCS 1443:719--730, 1998.
Preconditioning Technique for Edge-Preserving Image Restoration.
IEEE International Conference on Information, Intelligence, Systems Washington, USA, 1--3 Novembre 1999.
Ranking the Web.
Invited tutorial. Fun with Algorithms, Isola d'Elba, Italy 26--28 May 2004.
Fast PageRank Computation via Sparse Linear System.
Third International Workshop, WAW 2004 Roma, Italy LNCS 3243:118--130, 2004.
Ranking a stream of news.
In Proc. of the Fourteenth International World Wide Web Conference (WWW05) Chiba, Japan ACM Press:97--106, 2005.
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.
Effect of Different Encodings and Distance Functions on Quantum Instance-based Classifiers
26th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD-22)
Clustering Classical Data with Quantum k-Means
CEUR Workshop Proceedings, 3284, pp. 188-200, 2022 .
Ph.D. Thesis
Randomized Methods for Eigenvalue and Eigenvector Approximation.
University of Milano (1997), Advisors: Bruno Codenotti, Henryk Wozniakowski.
ArXiv and Submitted papers
Quantum Hitting Time according to a given distribution
arXiv: 2302.08871 [quant-ph.], 2023.
Quantum Clustering with k-Means: a Hybrid Approach
arXiv:2212.06691 [quant-ph.], 2023.