![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Flavio Chierichetti
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c54]Flavio Chierichetti
, Ravi Kumar
, Andrew Tomkins
:
Discrete Choice and Applications. WWW (Companion Volume) 2024: 1258-1259 - 2023
- [c53]Flavio Chierichetti, Mirko Giacchini
, Ravi Kumar, Alessandro Panconesi, Andrew Tomkins:
Approximating a RUM from Distributions on k-Slates. AISTATS 2023: 4757-4767 - [i9]Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi, Andrew Tomkins:
Approximating a RUM from Distributions on k-Slates. CoRR abs/2305.13283 (2023) - 2022
- [j16]Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar:
On additive approximate submodularity. Theor. Comput. Sci. 922: 346-360 (2022) - [c52]Flavio Chierichetti, Alessandro Panconesi, Giuseppe Re, Luca Trevisan:
Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models. AISTATS 2022: 10852-10880 - [c51]Matteo Almanza, Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Andrew Tomkins:
RUMs from Head-to-Head Contests. ICML 2022: 452-467 - [c50]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi:
The Gibbs-Rand Model. PODS 2022: 151-163 - 2021
- [c49]Flavio Chierichetti, Ravi Kumar, Andrew Tomkins:
Light RUMs. ICML 2021: 1888-1897 - [c48]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) - 2020
- [c47]Flavio Chierichetti, Ravi Kumar, Andrew Tomkins:
Asymptotic Behavior of Sequence Models. WWW 2020: 2824-2830 - [i7]Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar:
On Additive Approximate Submodularity. CoRR abs/2010.02912 (2020)
2010 – 2019
- 2019
- [j15]Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Erisa Terolli:
On the Distortion of Locality Sensitive Hashing. SIAM J. Comput. 48(2): 350-372 (2019) - [c46]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Sergei Vassilvitskii:
Matroids, Matchings, and Fairness. AISTATS 2019: 2212-2220 - 2018
- [j14]Flavio Chierichetti, George Giakkoupis, Silvio Lattanzi, Alessandro Panconesi:
Rumor Spreading and Conductance. J. ACM 65(4): 17:1-17:21 (2018) - [j13]Flavio Chierichetti, Jon M. Kleinberg, Sigal Oren:
On discrete preferences and coordination. J. Comput. Syst. Sci. 93: 11-29 (2018) - [j12]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) - [c45]Flavio Chierichetti, Shahrzad Haddadan
:
On the Complexity of Sampling Vertices Uniformly from a Graph. ICALP 2018: 149:1-149:13 - [c44]Flavio Chierichetti, Ravi Kumar, Andrew Tomkins:
Learning a Mixture of Two Multinomial Logits. ICML 2018: 960-968 - [c43]Flavio Chierichetti, Anirban Dasgupta, Shahrzad Haddadan, Ravi Kumar, Silvio Lattanzi:
Mallows Models for Top-k Lists. NeurIPS 2018: 4387-4397 - [c42]Matteo Almanza, Flavio Chierichetti, Alessandro Panconesi, Andrea Vattani:
A Reduction for Efficient LDA Topic Reconstruction. NeurIPS 2018: 7880-7890 - [c41]Flavio Chierichetti, Ravi Kumar, Andrew Tomkins:
Discrete Choice, Permutations, and Reconstruction. SODA 2018: 576-586 - [i6]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Sergei Vassilvitskii:
Fair Clustering Through Fairlets. CoRR abs/1802.05733 (2018) - 2017
- [c40]Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi, Rina Panigrahy, David P. Woodruff:
Algorithms for $\ell_p$ Low-Rank Approximation. ICML 2017: 806-814 - [c39]Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Erisa Terolli:
The Distortion of Locality Sensitive Hashing. ITCS 2017: 54:1-54:18 - [c38]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Sergei Vassilvitskii:
Fair Clustering Through Fairlets. NIPS 2017: 5029-5037 - [c37]Flavio Chierichetti, Ravi Kumar, Bo Pang:
On the Power Laws of Language: Word Frequency Distributions. SIGIR 2017: 385-394 - [c36]Marco Bressan
, Flavio Chierichetti, Ravi Kumar, Stefano Leucci
, Alessandro Panconesi:
Counting Graphlets: Space vs Time. WSDM 2017: 557-566 - [i5]Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar, Silvio Lattanzi, Rina Panigrahy, David P. Woodruff:
Algorithms for $\ell_p$ Low Rank Approximation. CoRR abs/1705.06730 (2017) - [i4]Flavio Chierichetti, Shahrzad Haddadan:
On the Complexity of Sampling Nodes Uniformly from a Graph. CoRR abs/1710.08815 (2017) - 2016
- [c35]Flavio Chierichetti, Anirban Dasgupta
, Ravi Kumar, Silvio Lattanzi, Tamás Sarlós:
On Sampling Nodes in a Network. WWW 2016: 471-481 - 2015
- [j11]Flavio Chierichetti, Ravi Kumar:
LSH-Preserving Functions and Their Applications. J. ACM 62(5): 33:1-33:25 (2015) - [j10]Andrea Vattani, Flavio Chierichetti, Keegan Lowenstein:
Optimal Probabilistic Cache Stampede Prevention. Proc. VLDB Endow. 8(8): 886-897 (2015) - [c34]Flavio Chierichetti, Abhimanyu Das, Anirban Dasgupta
, Ravi Kumar:
Approximate Modularity. FOCS 2015: 1143-1162 - [c33]Flavio Chierichetti, Anirban Dasgupta
, Ravi Kumar, Silvio Lattanzi:
On Learning Mixture Models for Permutations. ITCS 2015: 85-92 - [c32]Flavio Chierichetti, Alessandro Epasto
, Ravi Kumar, Silvio Lattanzi, Vahab S. Mirrokni:
Efficient Algorithms for Public-Private Social Networks. KDD 2015: 139-148 - [c31]Ricardo Baeza-Yates
, Paolo Boldi
, Flavio Chierichetti:
Essential Web Pages Are Easy to Find. WWW 2015: 97-107 - 2014
- [j9]Flavio Chierichetti, Jon M. Kleinberg:
Voting with Limited Information and Many Alternatives. SIAM J. Comput. 43(5): 1615-1653 (2014) - [j8]Flavio Chierichetti, Jon M. Kleinberg, Alessandro Panconesi:
How to Schedule a Cascade in an Arbitrary Graph. SIAM J. Comput. 43(6): 1906-1920 (2014) - [j7]Flavio Chierichetti, Ravi Kumar, Mohammad Mahdian:
The complexity of LSH feasibility. Theor. Comput. Sci. 530: 89-101 (2014) - [c30]Flavio Chierichetti, Anirban Dasgupta
, Ravi Kumar, Silvio Lattanzi:
On Reconstructing a Hidden Permutation. APPROX-RANDOM 2014: 604-617 - [c29]Flavio Chierichetti:
Trace complexity. ICTCS 2014: 9 - [c28]Flavio Chierichetti, Jon M. Kleinberg, Ravi Kumar, Mohammad Mahdian, Sandeep Pandey:
Event Detection via Communication Pattern Analysis. ICWSM 2014 - [c27]Flavio Chierichetti, Nilesh N. Dalvi, Ravi Kumar:
Correlation clustering in MapReduce. KDD 2014: 641-650 - [c26]Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar, Silvio Lattanzi:
Learning Entangled Single-Sample Gaussians. SODA 2014: 511-522 - 2013
- [j6]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan:
Models for the Compressible Web. SIAM J. Comput. 42(5): 1777-1802 (2013) - [c25]Bruno D. Abrahao, Flavio Chierichetti, Robert Kleinberg, Alessandro Panconesi:
Trace complexity of network inference. KDD 2013: 491-499 - [c24]Flavio Chierichetti, Jon M. Kleinberg, Sigal Oren:
On discrete preferences and coordination. EC 2013: 233-250 - [i3]Flavio Chierichetti, Jon M. Kleinberg, Sigal Oren:
On Discrete Preferences and Coordination. CoRR abs/1304.8125 (2013) - [i2]Bruno D. Abrahao, Flavio Chierichetti, Robert Kleinberg, Alessandro Panconesi:
Trace Complexity of Network Inference. CoRR abs/1308.2954 (2013) - 2012
- [c23]Flavio Chierichetti, Jon M. Kleinberg, Alessandro Panconesi:
How to schedule a cascade in an arbitrary graph. EC 2012: 355-368 - [c22]Flavio Chierichetti, Jon M. Kleinberg:
Voting with limited information and many alternatives. SODA 2012: 1036-1055 - [c21]Flavio Chierichetti, Ravi Kumar:
LSH-preserving functions and their applications. SODA 2012: 1078-1094 - [c20]Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan
, Tamás Sarlós:
Are web users really Markovian? WWW 2012: 609-618 - 2011
- [j5]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Rumor spreading in social networks. Theor. Comput. Sci. 412(24): 2602-2610 (2011) - [c19]Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan
:
Markov Layout. FOCS 2011: 492-501 - [c18]Flavio Chierichetti, Jon M. Kleinberg, David Liben-Nowell:
Reconstructing Patterns of Information Diffusion from Incomplete Observations. NIPS 2011: 792-800 - [c17]Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan
:
Optimizing two-dimensional search results presentation. WSDM 2011: 257-266 - [i1]Flavio Chierichetti, Jon M. Kleinberg:
Voting with Limited Information and Many Alternatives. CoRR abs/1110.1785 (2011) - 2010
- [j4]Flavio Chierichetti, Andrea Vattani:
The Local Nature of List Colorings for Graphs of High Girth. SIAM J. Comput. 39(6): 2232-2250 (2010) - [j3]Flavio Chierichetti, Hilary K. Finucane, Zhenming Liu, Michael Mitzenmacher:
Designing floating codes for expected performance. IEEE Trans. Inf. Theory 56(3): 968-978 (2010) - [c16]Flavio Chierichetti, Ravi Kumar, Sandeep Pandey, Sergei Vassilvitskii:
Finding the Jaccard Median. SODA 2010: 293-311 - [c15]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Rumour Spreading and Graph Conductance. SODA 2010: 1657-1663 - [c14]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Almost tight bounds for rumour spreading with conductance. STOC 2010: 399-408 - [c13]Flavio Chierichetti, Ravi Kumar, Andrew Tomkins:
Max-cover in map-reduce. WWW 2010: 231-240 - [c12]Flavio Chierichetti, Ravi Kumar, Andrew Tomkins:
Stochastic models for tabbed browsing. WWW 2010: 241-250
2000 – 2009
- 2009
- [j2]Vicente Acuña, Flavio Chierichetti, Vincent Lacroix, Alberto Marchetti-Spaccamela
, Marie-France Sagot, Leen Stougie:
Modes and cuts in metabolic networks: Complexity and algorithms. Biosyst. 95(1): 51-60 (2009) - [j1]Paolo Boldi
, Flavio Chierichetti, Sebastiano Vigna
:
Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set. Theory Comput. Syst. 44(2): 269-288 (2009) - [c11]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Alessandro Panconesi, Prabhakar Raghavan
:
Models for the Compressible Web. FOCS 2009: 331-340 - [c10]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Rumor Spreading in Social Networks. ICALP (2) 2009: 375-386 - [c9]Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, Michael Mitzenmacher, Alessandro Panconesi, Prabhakar Raghavan
:
On compressing social networks. KDD 2009: 219-228 - [c8]Flavio Chierichetti, Ravi Kumar, Sergei Vassilvitskii:
Similarity caching. PODS 2009: 127-136 - [c7]Sandeep Pandey, Andrei Z. Broder, Flavio Chierichetti, Vanja Josifovski, Ravi Kumar, Sergei Vassilvitskii:
Nearest-neighbor caching for content-match applications. WWW 2009: 441-450 - [c6]Flavio Chierichetti, Ravi Kumar, Prabhakar Raghavan
:
Compressed web indexes. WWW 2009: 451-460 - 2008
- [c5]Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi:
Gossiping (via mobile?) in social networks. DIALM-POMC 2008: 27-28 - [c4]Flavio Chierichetti, Andrea Vattani:
The Local Nature of List Colorings for Graphs of High Girth. ICALP (1) 2008: 320-332 - [c3]Flavio Chierichetti, Silvio Lattanzi, Federico Mari
, Alessandro Panconesi:
On placing skips optimally in expectation. WSDM 2008: 15-24 - 2007
- [c2]Paolo Boldi, Flavio Chierichetti, Sebastiano Vigna:
Pictures from Mongolia - Partial Sorting in a Partial World. FUN 2007: 66-77 - [c1]Flavio Chierichetti, Alessandro Panconesi, Prabhakar Raghavan
, Mauro Sozio, Alessandro Tiberi, Eli Upfal
:
Finding near neighbors through cluster pruning. PODS 2007: 103-112
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-05 21: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