arc

"Approximating a RUM from Distributions on k-Slates" by Flavio Chierichetti, Mirko Giacchini, Ravi Kumar, Alessandro Panconesi and Andrew Tomkins. To appear in Proceedings of AISTATS 2023

"Errare humanum est? A Pilot Study to Evaluate the Human-Likeness of an AI Othello Playing Agent" by Beatrice Biancardi, Enrico Lauletta, Antonio Norelli, Maurizio Mancini and Alessandro Panconesi. To appear in Proceedings of the 22nd ACM International Conference on Intelligent virtual Agents (IVA'22)

"RUMs from Head-to-Head Contest" by Matteo Almanza, Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, Andrew Tomkins. To appear in Proceedings of ICML 2022

"The Gibbs-Rand Model" by Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi. In Proceedings of PODS 2022

"OLIVAW: Mastering Othello without Human Knowledge, nor a Penny" by Antonio Norelli and Alessandro Panconesi. Accepted for publication in IEEE Transactions on Games

"Spectral Algorithms for Correlation Clustering Reconstruction in Semi-Adversarial Models" by Flavio Chierichetti, Luca Trevisan, Alessandro Panconesi and Giuseppe Re. To appear in Proceedings of AISTATS 2022

"k-Clustering with Fair Outliers" by Matteo Almanza, Alessandro Epasto, Alessandro Panconesi and Giuseppe Re. To appear in Proceedings of WSDM 2022

"On Additive Approximate Submodularity" by Flavio Chierichetti, Anirban Dasgupta, Ravi Kumar. In Theoretical Computer Science

"On the number of trials needed to distinguish similar alternatives" by Flavio Chierichetti, Ravi Kumar, Andrew Tomkins. In Proceedings of the National Academy of Sciences, Volume 119, 2022

"Online Facility Location with Multiple Advice" by Matteo Almanza, Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi and Giuseppe Re. In Proceedings of NeurIPS 2021

"Light RUMs" by Flavio Chierichetti, Ravi Kumar, Andrew Tomkins to appear in Proceedings of ICML 2021

"Twin Peaks, a Model for Recurring Cascades" by Matteo Almanza, Silvio Lattanzi, Giuseppe Re, and Alessandro Panconesi. To appear in the Proceedings of The Web Conference 2021 (formerly WWW)

"Online Facility Location with Multiple Advice" by Matteo Almanza, Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi and Giuseppe Re. In Proceedings of NeurIPS 2021

"Light RUMs" by Flavio Chierichetti, Ravi Kumar, Andrew Tomkins to appear in Proceedings of ICML 2021

"Twin Peaks, a Model for Recurring Cascades" by Matteo Almanza, Silvio Lattanzi, Giuseppe Re, and Alessandro Panconesi. To appear in the Proceedings of The Web Conference 2021 (formerly WWW)

"Faster motif counting via succinct color coding and adaptive sampling" by Marco Bressan, Stefano Leucci and Alessandro Panconesi. Accepted for publication in the ACM Transactions on Knowledge Discovery from Data (TKDD)

"Exact Recovery of Mangled Clusters with Same-Cluster Queries" by Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, and Andrea Paudice. To appear in Proceedings of NeurIPS 2020 (formerly NIPS).

"Asymptotic Behavior of Sequence Models" by Flavio Chierichetti, Ravi Kumar, and Andrew Tomkins. In Proceedings of The Web Conference 2020 (formerly WWW)

"On Approximating the Stationary Distribution of Time-Reversible Markov Chains" by Marco Bressan, Enoch Peserico, and Luca Pretto, Theory of Computing Systems, April 2020.

"Tracks from hell-- when finding a proof may be easier than checking it" by Matteo Almanza, Stefano Leucci and Alessandro Panconesi is published in Theoretical Computer Science

"Flattening a Hierarchical Clustering through Active Learning" by Fabio Vitale, Anand Rajagopalan, and Claudio Gentile to appear in the proceedings of NeurIPS 2019

"Correlation Clustering with Adaptive Similarity Queries" by Marco Bressan, Nicolò Cesa-Bianchi, Andrea Paudice, and Fabio Vitale to appear in the Proceedings of NeurIPS 2019.

"Mixing time bounds for graphlet random walks" by Matteo Agostini, Marco Bressan, Shahrzad Haddadan to appear in Information Processing Letters.

"Counting subgraphs via DAG tree decompositions" by Marco Bressan to appear in Proceedings of IPEC 2019.

"Motivo: fast motif counting via succinct color coding and adaptive sampling" by Marco Bressan, Stefano Leucci, and Alessandro Panconesi, to appear in Proceedings of VLDB 2019

"On the Distortion of Locality Sensitive Hashing" by Flavio Chierichetti, Ravi Kumar, Alessandro Panconesi, and Erisa Terolli, SIAM Journal on Computing 48(2), 350–372.

"MaxHedge: Maximising a Maximum Online with Theoretical Performance Guarantees" by Stephen Pasteris, Fabio Vitale, Kevin Chan, and Shiqiang Wang, in Proceedings of AISTATS 2019

"Matroids, Matchings and Fairness" by Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii, in Proceedings of AISTATS 2019

Matteo Almanza, Flavio Chierichetti, Alessandro Panconesi, Andrea Vattani, "A Reduction for Efficient LDA Topic Reconstruction" in Proceedings of NeurIPS 2018 (formerly the NIPS conference)

Flavio Chierichetti, Anirban Dasgupta, Shahrzad Haddadan, Ravi Kumar, Silvio Lattanzi, "Top-k Lists: Models and Algorithms" in Proceedings of NeurIPS 2018 (formerly the NIPS conference)

by Fabio Vitale, Nikos Parotsidis, Claudio Gentile, "Online Reciprocal Recommendation with Theoretical Performance Guarantees" in Proceedings of NeurIPS 2018 (formerly the NIPS conference)

Marco Bressan, Enoch Peserico, and Luca Pretto, "Sublinear algorithms for local graph centrality estimation" in Proceedings of FOCS 2018

Flavio Chierichetti, Ravi Kumar, Andrew Tomkins, "Learning a Mixture of Two Multinomial Logits" in Proceedings of ICML 2018

Bressan M., Chierichetti F., Kumar R., Leucci S., Panconesi A., "Motif Counting Beyond Five Nodes" in ACM Transactions on Knowledge Discovery from Data (TKDD) Volume 12 Issue 4, April 2018, [online version]

Chierichetti F., Haddadan S., "On the Complexity of Sampling Vertices Uniformly from a Graph" in Proceedings of ICALP 2018.

Antenore M., Panconesi A., Terolli E., "Songs of the Future Past, an Experimental Study of Online Persuaders" in Proceedings of ICWSM 2018.

Almanza M., Leucci S., Panconesi A., "Tracks from hell-- when when finding a proof may be easier than checking it" in Proceedings of FUN 2018.

Chierichetti F., Giakkoupis G., Lattanzi S., Panconesi A., "Rumor Spreading and Conductance", in Journal of the ACM, April 2018, 65:4, Article No. 17 [online version].

Pasteris S., Vitale F., Gentili C., Herbster M., "On Similarity Prediction and Pairwise Clustering" in proceedings of ALT 2018.

Bressan M., Peserico E., Pretto L., "On approximating the stationary distribution of time-reversible Markov chains" in Proceedings of STACS 2018.

Chierichetti F., Kumar R., Tomkins A., "Discrete Choice, Permutations, and Reconstruction", in Proceedings of SODA 2018.

Flavio Chierichetti, Jon Kleinberg, Sigal Oren, "On Discrete Preferences and Coordination", in Journal of Computer and System Sciences, Volume 93, 2018.

Chierichetti F., Kumar R., Lattanzi S., Vassilvitskii S., "Fair Clustering Through Fairlets", in Proceedings of NIPS 2017.

Almanza M., Leucci S., Panconesi A., "Trainyard is NP-Hard", in Theoretical Computer Science, [online version].

De Stefani L., Terolli E., Upfal E., "Tiered Sampling: An Efficient Method for Approximate Counting Sparse Motifs in Massive Graph Streams", in Proceedings of IEEE Conference in Big Data 2017, [pdf].

Chierichetti F., Gollapudi S., Kumar R., Lattanzi S., Panigrahy R., Woodruff D., "Algorithms for ℓ_p Low-Rank Approximation", in Proceedings of ICML 2017, [pdf].

Chierichetti F., Kumar R., Pang B., "On the Power Laws of Languages, Word Frequency Distributions", in Proceedings of SIGIR 2017, [pdf].

Chierichetti F., Kumar R., Panconesi A., Terolli E., "The Distortion of Locality Sensitive hashing", in Proceedings of ITCS 2017, [pdf].

Bressan M., Chierichetti F., Kumar R., Leucci S., Panconesi A., "Counting Graphlets: Time vs Space", in Proceedings of WSDM 2017, [pdf].

Haddadan S., Winkler P., "Mixing of permutations by biased transposition", in Proceedings of STACS 2017.

Bressan M., Leucci S., Panconesi A., Raghavan P., Terolli E. , "The Limits of Popularity-Based Recommendations, and the Role of Social Ties", in 22nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining KDD 2016, [pdf]

Chierichetti F., Dasgupta A., Kumar R., Lattanzi S., Sarlós T., "On Sampling Nodes in a Network", in Proceeding of WWW2016.

Almanza M., Leucci S., Panconesi A., "Trainyard is NP-Hard", in Proceedings of FUN 2016.

Chierichetti F., Das A., Dasgupta A., Kumar R., "Approximate Modularity", in Proceedings of FOCS 2015.

Chierichetti F., Epasto A., Kumar R. , Lattanzi S., Mirrokni V. ,"Efficient Algorithms for Public-Private Social Networks", in Proceedings of KDD 2015. (Best Paper Award).

Vattani A., Chierichetti F., Lowenstein K., "Optimal Probabilistic Cache Stampede Prevention, in Proceedings of VLDB 2015.

Baeza-Yates R., Boldi P., Chierichetti F., "Essential Web Pages Are Easy to Find", in Proceedings of WWW 2015.

Chierichetti F., Dasgupta A., Kumar R., Lattanzi S., "On Learning Mixture Models for Permutations", in Proceedings of ITCS 2015.

Chierichetti F., Kumar R. , "LSH-Preserving Functions and Their Applications", in Journal of the ACM, Volume 62, Issue 5, 2015.

Chierichetti F., Dasgupta A., Kumar R., Lattanzi S., "On Reconstructing a Hidden Permutation", in Proceedings of RANDOM 2014.

Chierichetti F., Dalvi N., Kumar R., "Correlation Clustering in MapReduce", in Proceedings of KDD 2014.

Chierichetti F., Kleinberg J., Kumar R., Mahdian M., Pandey S., "Event Detection via Communication Pattern Analysis", in Proceedings of ICWSM 2014.

Chierichetti F., Dasgupta A., Kumar R., Lattanzi S., "Learning Entangled Single-Sample Gaussians" , in Proceedings of SODA 2014.

Alvisi L. , Clement A., Epasto A., Lattanzi S., Panconesi A., "Communities, Random Walks, and Social Sybil Defense", Internet Mathematics 10(3-4): 360-420 (2014).

Brach P., Epasto A., Panconesi A., Sankowski P. "Spreading rumours without the network", COSN 2014.

Abrahao B. , Chierichetti F. , Kleinberg R. , Panconesi A, "Trace Complexity of Network Inference", in Proceedings of KDD 2013.

Chierichetti F., Kleinberg J., Oren S., "On Discrete Preferences and Coordination", in Proceedings of EC 2013.

Chierichetti F., Kumar R., Lattanzi S., Panconesi A., Raghavan P., "Models for the Compressible Web" in SIAM Journal of Computing 42(5): 1777-1802.

Clementi A., Kumar R., Doerr C., Fraigniaud P., Isopi M., Panconesi A., Pasquale F., Silvestri R., "Rumor Spreading in Random Evolving Graphs", in Proceeding of ESA 2013.

Alvisi L., Clement A., Epasto A., Lattanzi S., Panconesi A., "SoK: The Evolution of Sybil Defense in Social Networks" in IEEE Symposium on Security and Privacy 2013: 382-396.