default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGianna M. Del Corso
- > Home > Persons > Gianna M. Del Corso
Publications
- 2024
[j23]Anna Bernasconi
, Alessandro Berti, Gianna Maria Del Corso, Alessandro Poggiali:
Quantum Subroutine for Efficient Matrix Multiplication. IEEE Access 12: 116274-116284 (2024)- [j22]Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso, Riccardo Guidotti:
Quantum clustering with k-Means: A hybrid approach. Theor. Comput. Sci. 992: 114466 (2024) - 2023
- [j21]Anna Bernasconi, Alessandro Berti, Valentina Ciriani, Gianna M. Del Corso, Innocenzo Fulginiti:
XOR-AND-XOR Logic Forms for Autosymmetric Functions and Applications to Quantum Computing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 42(6): 1861-1872 (2023) - [c8]Alessandro Poggiali, Anna Bernasconi, Alessandro Berti, Gianna M. Del Corso, Riccardo Guidotti:
Quantum Feature Selection with Variance Estimation. ESANN 2023 - [i5]Paola Boito, Gianna M. Del Corso:
Quantum Hitting Time according to a given distribution. CoRR abs/2302.08871 (2023) - 2022
- [j20]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
Orthogonal Iterations on Companion-Like Pencils. J. Sci. Comput. 91(1): 6 (2022) - [c7]Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna Maria Del Corso, Riccardo Guidotti:
Clustering Classical Data with Quantum k-Means. ICTCS 2022: 188-200 - [c6]Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso, Riccardo Guidotti:
Effect of Different Encodings and Distance Functions on Quantum Instance-Based Classifiers. PAKDD (2) 2022: 96-108 - [i4]Alessandro Poggiali, Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso, Riccardo Guidotti:
Quantum Clustering with k-Means: a Hybrid Approach. CoRR abs/2212.06691 (2022) - 2021
- [i3]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
Orthogonal iterations on Structured Pencils. CoRR abs/2104.10946 (2021) - 2020
- [j19]Gianna M. Del Corso, Ilaria Del Corso, Roberto Dvornicich, Francesco Romani:
On computing the density of integers of the form 2n+p. Math. Comput. 89(325): 2365-2386 (2020) - [j18]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
Fast QR iterations for unitary plus low rank matrices. Numerische Mathematik 144(1): 23-53 (2020) - [j17]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form. SIAM J. Matrix Anal. Appl. 41(3): 984-1003 (2020) - 2019
- [j16]Gianna M. Del Corso, Francesco Romani:
Adaptive nonnegative matrix factorization and measure comparisons for recommender systems. Appl. Math. Comput. 354: 164-179 (2019) - [j15]Gianna M. Del Corso, Federico Poloni, Leonardo Robol, Raf Vandebril:
When is a matrix unitary or Hermitian plus low rank? Numer. Linear Algebra Appl. 26(6) (2019) - 2016
- [j14]Gianna M. Del Corso, Francesco Romani:
A multi-class approach for ranking graph nodes: Models and experiments with incomplete data. Inf. Sci. 329: 619-637 (2016) - [i2]Gianna M. Del Corso, Francesco Romani:
An Adaptive Matrix Factorization Approach for Personalized Recommender Systems. CoRR abs/1607.07607 (2016) - 2015
- [j13]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding. J. Comput. Appl. Math. 278: 326-335 (2015) - [j12]Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani:
A CMV-Based Eigensolver for Companion Matrices. SIAM J. Matrix Anal. Appl. 36(3): 1046-1068 (2015) - [i1]Gianna M. Del Corso, Francesco Romani:
A multi-class approach for ranking graph nodes: models and experiments with incomplete data. CoRR abs/1504.07766 (2015) - 2011
- [j11]Raf Vandebril, Gianna M. Del Corso:
A unification of unitary similarity transforms to compressed representations. Numerische Mathematik 119(4): 641-665 (2011) - [j10]Roberto Bevilacqua, Enrico Bozzo, Gianna M. Del Corso:
qd-Type Methods for Quasiseparable Matrices. SIAM J. Matrix Anal. Appl. 32(3): 722-747 (2011) - 2010
- [j9]Dario Bini, Gianna M. Del Corso, Francesco Romani:
A combined approach for evaluating papers, authors and scientific journals. J. Comput. Appl. Math. 234(11): 3104-3121 (2010) - [j8]Raf Vandebril, Gianna M. Del Corso:
An Implicit Multishift QR-Algorithm for Hermitian Plus Low Rank Matrices. SIAM J. Sci. Comput. 32(4): 2190-2212 (2010) - 2009
- [c5]Gianna M. Del Corso, Francesco Romani:
A time-aware citation-based model for evaluating scientific products: extended abstract. VALUETOOLS 2009: 15 - 2005
- [j7]Gianna M. Del Corso, Antonio Gulli, Francesco Romani:
Fast PageRank Computation via a Sparse Linear System. Internet Math. 2(3): 251-273 (2005) - [c4]Gianna M. Del Corso, Antonio Gulli, Francesco Romani:
Ranking a stream of news. WWW 2005: 97-106 - 2004
- [c3]Gianna M. Del Corso, Antonio Gulli, Francesco Romani:
Fast PageRank Computation Via a Sparse Linear System (Extended Abstract). WAW 2004: 118-130 - 2001
- [j6]Dario Bini, Gianna M. Del Corso, Giovanni Manzini, Luciano Margara:
Inversion of circulant matrices over Zm. Math. Comput. 70(235): 1169-1182 (2001) - [j5]Gianna M. Del Corso, Francesco Romani:
Heuristic Spectral Techniques for the Reduction of Bandwidth and Work-Bound of Sparse Matrices. Numer. Algorithms 28(1-4): 117-136 (2001) - 1999
- [j3]Gianna M. Del Corso, Giovanni Manzini:
Finding Exact Solutions to the Bandwidth Minimization Problem. Computing 62(3): 189-203 (1999) - 1998
- [c2]Dario Bini, Gianna M. Del Corso, Giovanni Manzini, Luciano Margara:
Inversion of Circulant Matrices over Zm. ICALP 1998: 719-730 - 1997
- [j2]Gianna M. Del Corso, Giovanni Manzini:
On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimates. J. Complex. 13(4): 419-456 (1997) - [c1]Gianfranco Bilardi, Bruno Codenotti, Gianna Maria Del Corso, Maria Cristina Pinotti, Giovanni Resta:
Broadcast and Associative Operations on Fat-Trees. Euro-Par 1997: 196-207
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-09-22 00:34 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:
