RECENT Publications

2018

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

2017

  • Chierichetti F., Kumar R., Lattanzi S., Vassilvitskii S., "Fair Clustering Through Fairlets", to appear in Proceedings of NIPS 2017.
  • Almanza M., Leucci S., Panconesi A., "Trainyard is NP-Hard", Theoretical Computer Science, in Press.
  • De Stefani L., Terolli E., Upfal E., "Tiered Sampling: An Efficient Method for Approximate Counting Sparse Motifs in Massive Graph Streams", to appear 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.

2016

  • 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.

2015

  • 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.

2014

  • 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.

2013

  • 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.