default search action
Francesco Romani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [j36]Paola Favati
, Grazia Lotti, Ornella Menchi, Francesco Romani
A Model for the Frequency Distribution of Multi-Scale Phenomena. Inf. 11(12): 580 (2020) - [j35]Paola Favati
Construction of the similarity matrix for the spectral clustering method: Numerical experiments. J. Comput. Appl. Math. 375: 112795 (2020) - [j34]Gianna M. Del Corso
On computing the density of integers of the form 2n+p. Math. Comput. 89(325): 2365-2386 (2020)
2010 – 2019
- 2019
- [j33]Paola Favati
An Adaptive Procedure for the Global Minimization of a Class of Polynomial Functions. Algorithms 12(5): 109 (2019) - [j32]Paola Favati
Adaptive Clustering via Symmetric Nonnegative Matrix Factorization of the Similarity Matrix. Algorithms 12(10): 216 (2019) - [j31]Gianna M. Del Corso
Adaptive nonnegative matrix factorization and measure comparisons for recommender systems. Appl. Math. Comput. 354: 164-179 (2019) - [i3]Paola Favati, Grazia Lotti, Ornella Menchi, Francesco Romani:
Construction of the similarity matrix for the spectral clustering method: numerical experiments. CoRR abs/1904.11352 (2019) - 2018
- [j30]Paola Favati
Image regularization by nonnegatively constrained Conjugate Gradient. Appl. Math. Comput. 327: 35-45 (2018) - 2016
- [j29]Gianna M. Del Corso
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
- [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) - 2014
- [j28]Paola Favati
Generalized Cross-Validation applied to Conjugate Gradient for discrete ill-posed problems. Appl. Math. Comput. 243: 258-268 (2014) - 2011
- [j27]Paola Favati
A Coupled Model for the Indegree and Outdegree Analysis of the Web. Internet Math. 6(4): 437-459 (2011) - 2010
- [j26]Dario Bini, Gianna M. Del Corso
A combined approach for evaluating papers, authors and scientific journals. J. Comput. Appl. Math. 234(11): 3104-3121 (2010)
2000 – 2009
- 2009
- [c4]Gianna M. Del Corso
A time-aware citation-based model for evaluating scientific products: extended abstract. VALUETOOLS 2009: 15 - 2007
- [j25]Paola Favati
A Stochastic Model for the Link Analysis of the Web. Internet Math. 3(4): 509-531 (2007) - [c3]Francesco Romani, Silvano Chiaradonna, Felicita Di Giandomenico, Luca Simoncini:
Simulation Models and Implementation of a Simulator for the Performability Analysis of Electric Power Systems Considering Interdependencies. HASE 2007: 305-312 - 2005
- [j24]Gianna M. Del Corso
Fast PageRank Computation via a Sparse Linear System. Internet Math. 2(3): 251-273 (2005) - [c2]Gianna M. Del Corso
Ranking a stream of news. WWW 2005: 97-106 - 2004
- [c1]Gianna M. Del Corso, Antonio Gulli
Fast PageRank Computation Via a Sparse Linear System (Extended Abstract). WAW 2004: 118-130 - 2002
- [j23]Paola Favati
Railway Computation for Infinite Linear Systems. Int. J. Parallel Program. 30(6): 419-439 (2002) - 2001
- [j22]Gianna M. Del Corso
Heuristic Spectral Techniques for the Reduction of Bandwidth and Work-Bound of Sparse Matrices. Numer. Algorithms 28(1-4): 117-136 (2001) - 2000
- [j21]Paola Favati, Grazia Lotti, Ornella Menchi, Francesco Romani:
Separable asymptotic cost of evaluating elementary functions. Numer. Algorithms 24(3): 255-274 (2000)
1990 – 1999
- 1999
- [j20]Paola Favati, Grazia Lotti, Ornella Menchi, Francesco Romani:
An infinite precision bracketing algorithm with guaranteed convergence. Numer. Algorithms 20(1): 63-73 (1999) - 1997
- [j19]Paola Favati
Local Error Estimates and Regularity Tests for the Implementation of Double Adaptive Quadrature. ACM Trans. Math. Softw. 23(1): 16-31 (1997) - 1994
- [j18]Paola Favati
Asymptotic Behavior of Automatic Quadrature. J. Complex. 10(3): 296-340 (1994) - 1991
- [j17]Paola Favati
VLSI implementation of the capacitance matrix method. Integr. 11(1): 3-9 (1991) - [j16]Paola Favati
Interpolatory integration formulas for optimal composition. ACM Trans. Math. Softw. 17(2): 207-217 (1991) - [j15]Paola Favati
Algorithm 691: Improving QUADPACK automatic integration routines. ACM Trans. Math. Softw. 17(2): 218-232 (1991) - 1990
- [j14]Bruno Codenotti, Grazia Lotti, Francesco Romani
Area-Time Trade-Offs for Matrix-Vector Multiplication. J. Parallel Distributed Comput. 8(1): 52-59 (1990)
1980 – 1989
- 1987
- [j13]Bruno Codenotti, Francesco Romani
A compact and modular VLSI design for the solution of general sparse linear systems. Integr. 5(1): 77-86 (1987) - 1985
- [j12]Bruno Codenotti, Francesco Romani
VLSI implementation of iterative methods for the solution of linear systems. Integr. 3(3): 211-221 (1985) - [j11]Bruno Codenotti, Francesco Romani
VLSI Implementation of Fast Solvers for Band Linear Systems With Constant Coefficient Matrix. Inf. Process. Lett. 21(3): 159-163 (1985) - 1983
- [j10]Grazia Lotti, Francesco Romani
On the Asymptotic Complexity of Rectangular Matrix Multiplication. Theor. Comput. Sci. 23: 171-185 (1983) - 1982
- [j9]Francesco Romani:
Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication. SIAM J. Comput. 11(2): 263-267 (1982) - 1981
- [j8]Francesco Romani
Author's Reply to S. Moran's Note on the Shortest Path Problem. Inf. Process. Lett. 13(2): 87 (1981) - 1980
- [j7]Francesco Romani:
Shortest-Path Problem is not Harder Than Matrix Multiplication. Inf. Process. Lett. 11(3): 134-136 (1980) - [j6]Dario Bini, Grazia Lotti, Francesco Romani:
Approximate Solutions for the Bilinear Form Computational Problem. SIAM J. Comput. 9(4): 692-697 (1980) - [j5]Grazia Lotti, Francesco Romani
Application of Approximating Algorithms to Boolean Matrix Multiplication. IEEE Trans. Computers 29(10): 927-928 (1980)
1970 – 1979
- 1979
- [j4]Dario Bini, Milvio Capovani, Francesco Romani
O(n2.7799) Complexity for n*n Approximate Matrix Multiplication. Inf. Process. Lett. 8(5): 234-235 (1979) - 1978
- [j3]Francesco Romani
The Parallelism Principle: Speeding Up the Cellular Automata Synchronization. Inf. Control. 36(3): 245-255 (1978) - 1977
- [j2]Francesco Romani
On the fast synchronization of tree connected networks. Inf. Sci. 12(3): 229-244 (1977) - 1976
- [j1]Francesco Romani:
Cellular automata synchronization. Inf. Sci. 10(4): 299-318 (1976)
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-05-08 21:04 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: