default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco M. Malvestuto
Person information
- affiliation: Sapienza University of Rome, Italy
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j34]Marina Moscarini, Francesco M. Malvestuto:
Two classes of graphs in which some problems related to convexity are efficiently solvable. Discret. Math. Algorithms Appl. 10(3): 1850042:1-1850042:22 (2018)- 2017
- [j33]Francesco M. Malvestuto:
A new notion of convexity in digraphs with an application to Bayesian networks. Discret. Math. Algorithms Appl. 9(2): 1750016:1-1750016:22 (2017) - 2016
- [j32]Francesco M. Malvestuto:
Compositional models, Bayesian models and recursive factorization models. Kybernetika 52(5): 696-723 (2016) - 2015
- [j31]Francesco M. Malvestuto, Marina Moscarini
:
Decomposability of abstract and path-induced convexities in hypergraphs. Discuss. Math. Graph Theory 35(3): 493-515 (2015) - [j30]Francesco M. Malvestuto:
Erratum: Equivalence of compositional expressions and independence relations in compositional models. Kybernetika 51(2): 387-388 (2015) - [j29]Francesco M. Malvestuto:
Marginalization in models generated by compositional expressions. Kybernetika 51(4): 541-570 (2015) - 2014
- [j28]Francesco M. Malvestuto:
Equivalence of compositional expressions and independence relations in compositional models. Kybernetika 50(3): 322-362 (2014) - [j27]Francesco M. Malvestuto:
A Join-Like Operator to Combine Data Cubes and Answer Queries from Multiple Data Cubes. ACM Trans. Database Syst. 39(3): 24:1-24:31 (2014) - 2013
- [j26]Francesco M. Malvestuto:
The sum-product algorithm: algebraic independence and computational aspects. Kybernetika 49(1): 4-22 (2013) - 2012
- [j25]Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini:
Characteristic Properties and Recognition of Graphs in which Geodesic and Monophonic convexities are Equivalent. Discret. Math. Algorithms Appl. 4(4) (2012) - [j24]Francesco M. Malvestuto:
A backward selection procedure for approximating a discrete probability distribution by decomposable models. Kybernetika 48(5): 825-844 (2012) - 2011
- [j23]Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini:
Computing simple-path convex hulls in hypergraphs. Inf. Process. Lett. 111(5): 231-234 (2011) - 2010
- [j22]Francesco M. Malvestuto:
Tree and local computations in a cross-entropy minimization problem with marginal constraints. Kybernetika 46(4): 621-654 (2010)
2000 – 2009
- 2009
- [j21]Francesco M. Malvestuto:
Canonical and monophonic convexities in hypergraphs. Discret. Math. 309(13): 4287-4298 (2009) - 2008
- [c20]Francesco M. Malvestuto:
Auditing Categorical SUM, MAX and MIN Queries. Privacy in Statistical Databases 2008: 247-256 - 2007
- [j20]Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini:
An analytical approach to the inference of summary data of additive type. Theor. Comput. Sci. 385(1-3): 264-285 (2007) - 2006
- [j19]Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini:
Minimal invariant sets in a vertex-weighted graph. Theor. Comput. Sci. 362(1-3): 140-161 (2006) - [j18]Francesco M. Malvestuto, Mauro Mezzini, Marina Moscarini:
Auditing sum-queries to make a statistical database secure. ACM Trans. Inf. Syst. Secur. 9(1): 31-60 (2006) - 2005
- [c19]Francesco M. Malvestuto, Elaheh Pourabbas:
Local Computation of Answers to Table Queries on Summary Databases. SSDBM 2005: 263-270 - 2004
- [c18]Francesco M. Malvestuto, Mauro Mezzini:
Privacy Preserving and Data Mining in an On-Line Statistical Database of Additive Type. Privacy in Statistical Databases 2004: 353-365 - [c17]Francesco M. Malvestuto, Elaheh Pourabbas:
Customized Answers to Summary Queries via Aggregate Views. SSDBM 2004: 193-202 - 2003
- [c16]Francesco M. Malvestuto, Mauro Mezzini:
Auditing Sum Queries. ICDT 2003: 126-142 - [p1]Francesco M. Malvestuto, Marina Moscarini:
Privacy in Multidimensional Databases. Multidimensional Databases 2003: 310-360 - 2002
- [j17]Francesco M. Malvestuto:
From Conditional Independences to Factorization Constraints with Discrete Random Variables. Ann. Math. Artif. Intell. 35(1-4): 253-285 (2002) - [j16]Francesco M. Malvestuto, Mauro Mezzini:
A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph. SIAM J. Comput. 31(5): 1438-1455 (2002) - 2001
- [j15]Francesco M. Malvestuto:
A hypergraph-theoretic analysis of collapsibility and decomposability for extended log-linear models. Stat. Comput. 11(2): 155-169 (2001) - 2000
- [j14]Francesco M. Malvestuto, Marina Moscarini:
Decomposition of a hypergraph by partial-edge separators. Theor. Comput. Sci. 237(1-2): 57-79 (2000)
1990 – 1999
- 1998
- [j13]Francesco M. Malvestuto:
A Complete Axiomatization of Full Acyclic Join Dependencies. Inf. Process. Lett. 68(3): 133-139 (1998) - [j12]Francesco M. Malvestuto, Marina Moscarini:
A Fast Algorithm for Query Optimization in Universal-Relation Databases. J. Comput. Syst. Sci. 56(3): 299-309 (1998) - [c15]Francesco M. Malvestuto, Marina Moscarini:
Computational Issues Connected with the Protection of Sensitive Statistics by Auditing Sum Queries. SSDBM 1998: 134-144 - 1997
- [j11]Francesco M. Malvestuto, Marina Moscarini:
Suppressing marginal totals from a two-dimensional table to protect sensitive information. Stat. Comput. 7(2): 101-114 (1997) - [c14]Francesco M. Malvestuto:
Query Processing in Probabilistic Data Bases. SEBD 1997: 87-100 - 1996
- [j10]Francesco M. Malvestuto:
Testing implication of hierarchical log-linear models for probability distributions. Stat. Comput. 6(2): 169-176 (1996) - [c13]Francesco M. Malvestuto, Marina Moscarini:
Censoring Statistical Tables to Protect Sensitive Information: Easy and Hard Problems. SSDBM 1996: 12-21 - 1995
- [c12]Francesco M. Malvestuto:
An Axiomatization of Loglinear Models with an Application to the Model-Search Problem. AISTATS 1995: 175-184 - [c11]Francesco M. Malvestuto, Marina Moscarini:
A Fast Algorithm for Query Optimization in Universal Relation Databases. SEBD 1995: 343-361 - [c10]Francesco M. Malvestuto:
Formal Theories of Probabilistic Dependency Models. WOCFAI 1995: 241-252 - 1994
- [c9]Francesco M. Malvestuto:
Statistical vs. Relational Reasoning about Join Dependancies. SEBD 1994: 229-248 - [c8]Francesco M. Malvestuto:
Statistical versus Relational Join Dependencies. SSDBM 1994: 64-73 - 1993
- [j9]Francesco M. Malvestuto:
A Universal-Scheme Approach to Statistical Databases Containing Homogeneous Summary Tables. ACM Trans. Database Syst. 18(4): 678-708 (1993) - 1992
- [j8]Francesco M. Malvestuto:
A unique formal system for binary decompositions of database relations, probability distributions, and graphs. Inf. Sci. 59(1-2): 21-52 (1992) - [j7]Francesco M. Malvestuto, Milan Studený:
Comment on "A unique formal system for binary decompositions of database relations, probability distributions, and graphs". Inf. Sci. 63(1-2): 1-2 (1992) - 1991
- [j6]Francesco M. Malvestuto:
Approximating discrete probability distributions with decomposable models. IEEE Trans. Syst. Man Cybern. 21(5): 1287-1294 (1991) - [c7]Francesco M. Malvestuto, Marina Moscarini, Maurizio Rafanelli:
Suppressing Marginal Cells to Protect Sensitive Information in a Two-Dimensional Statistical Table. PODS 1991: 252-258 - 1990
- [j5]Francesco M. Malvestuto, Marina Moscarini:
Query Evaluability in Statistical Databases. IEEE Trans. Knowl. Data Eng. 2(4): 425-430 (1990)
1980 – 1989
- 1989
- [j4]Francesco M. Malvestuto:
A universal table model for categorical databases. Inf. Sci. 49(1-3): 203-223 (1989) - [c6]Francesco M. Malvestuto, Marina Moscarini:
Aggregate Evaluability in Statistical Databases. VLDB 1989: 279-286 - 1988
- [j3]Francesco M. Malvestuto:
Existence of extensions and product extensions for discrete probability distributions. Discret. Math. 69(1): 61-77 (1988) - [c5]Francesco M. Malvestuto:
The Derivation Problem for Summary Data. SIGMOD Conference 1988: 82-89 - [c4]Francesco M. Malvestuto, C. Zuffada:
The Classification Problem with Semantically Heterogeneous Data. SSDBM 1988: 157-176 - 1987
- [c3]Francesco M. Malvestuto:
Answering Queries in Categorial Data Bases. PODS 1987: 87-96 - 1986
- [j2]Francesco M. Malvestuto:
Statistical treatment of the information content of a database. Inf. Syst. 11(3): 211-223 (1986) - [c2]Francesco M. Malvestuto:
Modelling Large Bases of Categorial Data With Acyclic Schemes. ICDT 1986: 323-340 - [c1]Francesco M. Malvestuto:
Decomposing Complex Contingency Tables to Reduce Storage Requirements. SSDBM 1986: 66-71 - 1983
- [j1]Francesco M. Malvestuto:
Theory of random observables in relational data bases. Inf. Syst. 8(4): 281-289 (1983)
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-07-06 23:39 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:
