Flavio Chierichetti

According to our database1, Flavio Chierichetti authored at least 54 papers between 2007 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
On the Distortion of Locality Sensitive Hashing.
SIAM J. Comput., 2019

Matroids, Matchings, and Fairness.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Motif Counting Beyond Five Nodes.
TKDD, 2018

Rumor Spreading and Conductance.
J. ACM, 2018

Discrete Choice, Permutations, and Reconstruction.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Mallows Models for Top-k Lists.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

A Reduction for Efficient LDA Topic Reconstruction.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Learning a Mixture of Two Multinomial Logits.
Proceedings of the 35th International Conference on Machine Learning, 2018

On the Complexity of Sampling Vertices Uniformly from a Graph.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Counting Graphlets: Space vs Time.
Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, 2017

On the Power Laws of Language: Word Frequency Distributions.
Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2017

Fair Clustering Through Fairlets.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

The Distortion of Locality Sensitive Hashing.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Algorithms for $\ell_p$ Low-Rank Approximation.
Proceedings of the 34th International Conference on Machine Learning, 2017

2016
On Sampling Nodes in a Network.
Proceedings of the 25th International Conference on World Wide Web, 2016

2015
Optimal Probabilistic Cache Stampede Prevention.
PVLDB, 2015

Essential Web Pages Are Easy to Find.
Proceedings of the 24th International Conference on World Wide Web, 2015

Efficient Algorithms for Public-Private Social Networks.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

On Learning Mixture Models for Permutations.
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

Approximate Modularity.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
The complexity of LSH feasibility.
Theor. Comput. Sci., 2014

Learning Entangled Single-Sample Gaussians.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Correlation clustering in MapReduce.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

Event Detection via Communication Pattern Analysis.
Proceedings of the Eighth International Conference on Weblogs and Social Media, 2014

Trace complexity.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

On Reconstructing a Hidden Permutation.
Proceedings of the Approximation, 2014

2013
On discrete preferences and coordination.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Trace complexity of network inference.
Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

2012
Are web users really Markovian?
Proceedings of the 21st World Wide Web Conference 2012, 2012

LSH-preserving functions and their applications.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Voting with limited information and many alternatives.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

How to schedule a cascade in an arbitrary graph.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011
Optimizing two-dimensional search results presentation.
Proceedings of the Forth International Conference on Web Search and Web Data Mining, 2011

Reconstructing Patterns of Information Diffusion from Incomplete Observations.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Markov Layout.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Designing floating codes for expected performance.
IEEE Trans. Information Theory, 2010

Stochastic models for tabbed browsing.
Proceedings of the 19th International Conference on World Wide Web, 2010

Max-cover in map-reduce.
Proceedings of the 19th International Conference on World Wide Web, 2010

Almost tight bounds for rumour spreading with conductance.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Rumour Spreading and Graph Conductance.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Finding the Jaccard Median.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set.
Theory Comput. Syst., 2009

Modes and cuts in metabolic networks: Complexity and algorithms.
Biosystems, 2009

Nearest-neighbor caching for content-match applications.
Proceedings of the 18th International Conference on World Wide Web, 2009

Compressed web indexes.
Proceedings of the 18th International Conference on World Wide Web, 2009

Similarity caching.
Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2009

On compressing social networks.
Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28, 2009

Rumor Spreading in Social Networks.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Models for the Compressible Web.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008
On placing skips optimally in expectation.
Proceedings of the International Conference on Web Search and Web Data Mining, 2008

The Local Nature of List Colorings for Graphs of High Girth.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Gossiping (via mobile?) in social networks.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2008

2007
Finding near neighbors through cluster pruning.
Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Pictures from Mongolia - Partial Sorting in a Partial World.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007


  Loading...