Get our free extension to see links to code for papers anywhere online!

Chrome logo  Add to Chrome

Firefox logo Add to Firefox

Differentially Private Graph Learning via Sensitivity-Bounded Personalized PageRank


Jul 14, 2022
Alessandro Epasto, Vahab Mirrokni, Bryan Perozzi, Anton Tsitsulin, Peilin Zhong


   Access Paper or Ask Questions

  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Smooth Anonymity for Sparse Binary Matrices


Jul 13, 2022
Hossein Esfandiari, Alessandro Epasto, Vahab Mirrokni, Andres Munoz Medina, Sergei Vassilvitskii


   Access Paper or Ask Questions

  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Scalable Differentially Private Clustering via Hierarchically Separated Trees


Jun 17, 2022
Vincent Cohen-Addad, Alessandro Epasto, Silvio Lattanzi, Vahab Mirrokni, Andres Munoz, David Saulpic, Chris Schwiegelshohn, Sergei Vassilvitskii

* To appear at KDD'22 

   Access Paper or Ask Questions

  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Optimal Approximation -- Smoothness Tradeoffs for Soft-Max Functions


Oct 22, 2020
Alessandro Epasto, Mohammad Mahdian, Vahab Mirrokni, Manolis Zampetakis

* Accepted for spotlight presentation at NeurIPS 2020 

   Access Paper or Ask Questions

  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Fair Hierarchical Clustering


Jun 19, 2020
Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, Yuyan Wang


   Access Paper or Ask Questions

  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Fair Correlation Clustering


Mar 02, 2020
Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian


   Access Paper or Ask Questions

  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Clustering without Over-Representation


May 29, 2019
Sara Ahmadian, Alessandro Epasto, Ravi Kumar, Mohammad Mahdian

* in Proceedings of The 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, KDD 2019 
* 10 pages, 6 figures, in KDD 2019 

   Access Paper or Ask Questions

  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts


May 06, 2019
Alessandro Epasto, Bryan Perozzi

* In Proceedings of "The Web Conference" 2019, WWW, 2019 

   Access Paper or Ask Questions

  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email

On a Model for Integrated Information


Dec 31, 2009
Alessandro Epasto, Enrico Nardelli


   Access Paper or Ask Questions

  • Share via Twitter
  • Share via Facebook
  • Share via LinkedIn
  • Share via Whatsapp
  • Share via Messenger
  • Share via Email