default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlessandro Panconesi
- > Home > Persons > Alessandro Panconesi
Publications
- 2023
[c71]Flavio Chierichetti, Mirko Giacchini
, Ravi Kumar, Alessandro Panconesi, Andrew Tomkins:
Approximating a RUM from Distributions on k-Slates. AISTATS 2023: 4757-4767- [i10]Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi, Andrew Tomkins:
Approximating a RUM from Distributions on k-Slates. CoRR abs/2305.13283 (2023) - 2022
- [c69]Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re, Luca Trevisan:
Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models. AISTATS 2022: 10852-10880 - [c68]Matteo Almanza, Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Andrew Tomkins:
RUMs from Head-to-Head Contests. ICML 2022: 452-467 - 2021
- [c64]Matteo Almanza, Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi, Giuseppe Re:
Online Facility Location with Multiple Advice. NeurIPS 2021: 4661-4673 - [i8]Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re, Luca Trevisan:
Correlation Clustering Reconstruction in Semi-Adversarial Models. CoRR abs/2108.04729 (2021) - 2019
- [j45]Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Erisa Terolli:
On the Distortion of Locality Sensitive Hashing. SIAM J. Comput. 48(2): 350-372 (2019) - 2018
- [j44]Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, Alessandro Panconesi:
Rumor Spreading and Conductance. J. ACM 65(4): 17:1-17:21 (2018) - [j42]Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi:
Motif Counting Beyond Five Nodes. ACM Trans. Knowl. Discov. Data 12(4): 48:1-48:25 (2018) - [c58]Matteo Almanza, Flavio Chierichetti, Alessandro Panconesi, Andrea Vattani:
A Reduction for Efficient LDA Topic Reconstruction. NeurIPS 2018: 7880-7890 - 2017
- [c57]Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Erisa Terolli:
The Distortion of Locality Sensitive Hashing. ITCS 2017: 54:1-54:18 - [c56]Marco Bressan, Flavio Chierichetti, Ravi Kumar, Stefano Leucci, Alessandro Panconesi:
Counting Graphlets: Space vs Time. WSDM 2017: 557-566 - 2014
- [j39]Flavio Chierichetti, Jon M. Kleinberg, Alessandro Panconesi:
How to Schedule a Cascade in an Arbitrary Graph. SIAM J. Comput. 43(6): 1906-1920 (2014) - 2013
- [j38]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan:
Models for the Compressible Web. SIAM J. Comput. 42(5): 1777-1802 (2013) - [c51]Bruno D. Abrahao, Flavio Chierichetti, Robert Kleinberg, Alessandro Panconesi:
Trace complexity of network inference. KDD 2013: 491-499 - [i2]Bruno D. Abrahao, Flavio Chierichetti, Robert Kleinberg, Alessandro Panconesi:
Trace Complexity of Network Inference. CoRR abs/1308.2954 (2013) - 2012
- [c49]Flavio Chierichetti, Jon M. Kleinberg, Alessandro Panconesi:
How to schedule a cascade in an arbitrary graph. EC 2012: 355-368 - 2011
- [j35]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Rumor spreading in social networks. Theor. Comput. Sci. 412(24): 2602-2610 (2011) - 2010
- [c47]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Rumour Spreading and Graph Conductance. SODA 2010: 1657-1663 - [c46]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Almost tight bounds for rumour spreading with conductance. STOC 2010: 399-408 - 2009
- [c44]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan:
Models for the Compressible Web. FOCS 2009: 331-340 - [c43]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Rumor Spreading in Social Networks. ICALP (2) 2009: 375-386 - [c42]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan:
On compressing social networks. KDD 2009: 219-228 - 2008
- [c41]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Gossiping (via mobile?) in social networks. DIALM-POMC 2008: 27-28 - [c38]Flavio Chierichetti, Silvio Lattanzi, Federico Mari, Alessandro Panconesi:
On placing skips optimally in expectation. WSDM 2008: 15-24 - 2007
- [c36]Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan, Mauro Sozio, Alessandro Tiberi, Eli Upfal:
Finding near neighbors through cluster pruning. PODS 2007: 103-112
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:36 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:
