default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuca Ganassali
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2022
[b1]Luca Ganassali:
The graph alignment problem: fundamental limits and efficient algorithms. (Alignement de graphes : limites fondamentales et algorithmes efficaces). PSL University, Paris, France, 2022
Conference and Workshop Papers
- 2024
- [c5]Fateme Jamshidi, Luca Ganassali, Negar Kiyavash:
On the sample complexity of conditional independence testing with Von Mises estimator with application to causal discovery. ICML 2024 - 2022
- [c4]Luca Ganassali, Laurent Massoulié, Marc Lelarge:
Correlation Detection in Trees for Planted Graph Alignment. ITCS 2022: 74:1-74:8 - 2021
- [c3]Luca Ganassali, Laurent Massoulié, Marc Lelarge:
Impossibility of Partial Recovery in the Graph Alignment Problem. COLT 2021: 2080-2102 - [c2]Luca Ganassali:
Sharp threshold for alignment of graph databases with Gaussian weights. MSML 2021: 314-335 - 2020
- [c1]Luca Ganassali, Laurent Massoulié:
From tree matching to sparse graph alignment. COLT 2020: 1633-1665
Informal and Other Publications
- 2024
- [i10]Luca Ganassali:
The graph alignment problem: fundamental limits and efficient algorithms. CoRR abs/2404.12418 (2024) - [i9]Mathieu Even, Luca Ganassali, Jakob Maier, Laurent Massoulié:
Aligning Embeddings and Geometric Random Graphs: Informational Results and Computational Approaches for the Procrustes-Wasserstein Problem. CoRR abs/2405.14532 (2024) - 2023
- [i8]Sina Akbari, Luca Ganassali, Negar Kiyavash:
Learning Causal Graphs via Monotone Triangular Transport Maps. CoRR abs/2305.18210 (2023) - [i7]Fateme Jamshidi, Luca Ganassali, Negar Kiyavash:
On sample complexity of conditional independence testing with Von Mises estimator with application to causal discovery. CoRR abs/2310.13553 (2023) - 2022
- [i6]Eric Daoud, Luca Ganassali, Antoine Baker, Marc Lelarge:
SiMCa: Sinkhorn Matrix Factorization with Capacity Constraints. CoRR abs/2203.10107 (2022) - 2021
- [i5]Luca Ganassali, Laurent Massoulié, Marc Lelarge:
Impossibility of Partial Recovery in the Graph Alignment Problem. CoRR abs/2102.02685 (2021) - [i4]Luca Ganassali, Laurent Massoulié, Marc Lelarge:
Correlation detection in trees for partial graph alignment. CoRR abs/2107.07623 (2021) - 2020
- [i3]Luca Ganassali, Laurent Massoulié:
From tree matching to sparse graph alignment. CoRR abs/2002.01258 (2020) - [i2]Luca Ganassali:
Sharp threshold for alignment of graph databases with Gaussian weights. CoRR abs/2010.16295 (2020) - 2019
- [i1]Luca Ganassali, Marc Lelarge, Laurent Massoulié:
Spectral alignment of correlated Gaussian random matrices. CoRR abs/1912.00231 (2019)
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-09-04 01:20 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:
