Articles with public access mandates - Alessandro EpastoLearn more
Available somewhere: 14
Triest: Counting local and global triangles in fully dynamic streams with fixed memory size
LD Stefani, A Epasto, M Riondato, E Upfal
ACM Transactions on Knowledge Discovery from Data (TKDD) 11 (4), 43, 2017
Mandates: US National Science Foundation, US National Institutes of Health
Efficient Densest Subgraph Computation in Evolving Graphs
A Epasto, S Lattanzi, M Sozio
Proceedings of the 24th international conference on World Wide Web (WWW), 2015
Mandates: Government of Italy
Ego-net community mining applied to friend suggestion
A Epasto, S Lattanzi, V Mirrokni, IO Sebe, A Taei, S Verma
Proceedings of the VLDB Endowment 9 (4), 324-335, 2015
Mandates: Government of Italy
Fair hierarchical clustering
S Ahmadian, A Epasto, M Knittel, R Kumar, M Mahdian, B Moseley, ...
Advances in Neural Information Processing Systems 33, 21050-21060, 2020
Mandates: US National Science Foundation
Efficient Algorithms for Public-Private Social Networks
F Chierichetti, A Epasto, R Kumar, S Lattanzi, V Mirrokni
Proceedings of the 21st ACM SIGKDD Conference on Knowledge Discovery and …, 2015
Mandates: Government of Italy
Bisect and conquer: Hierarchical clustering via max-uncut bisection
V Chatziafratis, G Yaroslavtsev, E Lee, K Makarychev, S Ahmadian, ...
International Conference on Artificial Intelligence and Statistics, 3121-3132, 2020
Mandates: US National Science Foundation
Incentive-aware learning for large markets
A Epasto, M Mahdian, V Mirrokni, S Zuo
Proceedings of the 2018 World Wide Web Conference, 1369-1378, 2018
Mandates: National Natural Science Foundation of China
Private estimation algorithms for stochastic block models and mixture models
H Chen, V Cohen-Addad, T d’Orsi, A Epasto, J Imola, D Steurer, S Tiegel
Advances in Neural Information Processing Systems 36, 68134-68183, 2023
Mandates: European Commission
Scalable differentially private clustering via hierarchically separated trees
V Cohen-Addad, A Epasto, S Lattanzi, V Mirrokni, A Munoz Medina, ...
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and …, 2022
Mandates: Danish Council for Independent Research, Agence Nationale de la Recherche
Spreading Rumours without the Network
P Brach, A Epasto, A Panconesi, P Sankowski
ACM Conference on Social Network (COSN'14), 2014
Mandates: European Commission
Efficient approximation for restricted biclique cover problems
A Epasto, E Upfal
Algorithms 11 (6), 84, 2018
Mandates: US National Science Foundation, US National Institutes of Health
k-Clustering with Fair Outliers
M Almanza, A Epasto, A Panconesi, G Re
Proceedings of the Fifteenth ACM International Conference on Web Search and …, 2022
Mandates: Government of Italy
Real-time targeted-influence queries over large graphs
A Epasto, A Mahmoody, E Upfal
Proceedings of the 2017 IEEE/ACM International Conference on Advances in …, 2017
Mandates: US National Science Foundation, US National Institutes of Health
Reconstructing hidden permutations using the average-precision (AP) correlation statistic
L De Stefani, A Epasto, E Upfal, F Vandin
Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016
Mandates: US National Science Foundation
Publication and funding information is determined automatically by a computer program