Seguir
Alessandro Epasto
Alessandro Epasto
Staff Research Scientist at Google
Dirección de correo verificada de google.com - Página principal
Título
Citado por
Citado por
Año
SoK: The Evolution of Sybil Defense via Social Networks
L Alvisi, A Clement, A Epasto, S Lattanzi, A Panconesi
IEEE Symposium on Security and Privacy, 382-396, 2013
2152013
Signals from the Crowd: Uncovering Social Relationships through Smartphone Probes
MV Barbera, A Epasto, A Mei, VC Perta, J Stefa
Proceedings of the 2013 conference on Internet measurement conference, 265-276, 2013
1762013
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
1562017
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
1392015
Clustering without over-representation
S Ahmadian, A Epasto, R Kumar, M Mahdian
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge …, 2019
1232019
Is a Single Embedding Enough? Learning Node Representations that Capture Multiple Social Contexts
A Epasto, B Perozzi
The Web Conference 2019, WWW'19, 2019
1122019
Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters
A Epasto, L Silvio, RP Leme
KDD 2017, 2017
942017
Fair Correlation Clustering
S Ahmadian, A Epasto, R Kumar, M Mahdian
The Twenty Third International Conference on Artificial Intelligence and …, 2020
742020
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
692015
Submodular Optimization over Sliding Windows
A Epasto, S Lattanzi, S Vassilvitskii, M Zadimoghaddam
Proceedings of the 26th International World Wide Web Conference WWW, 2017
602017
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
502020
Systems and methods for detecting online attacks
A Altman, A Epasto
US Patent 9,183,387, 2015
472015
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
452015
Efficient similarity ranking for bipartite graphs
SVM Banadaki, S Lattanzi, JE Feldman, A Epasto, S Leonardi, H Lynch, ...
US Patent 10,152,557, 2018
372018
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
31*2020
CRAWDAD dataset sapienza/probe-requests (v. 2013-09-10)
MV Barbera, A Epasto, A Mei, S Kosta, VC Perta, J Stefa
Sep, 2013
272013
Sliding window algorithms for k-clustering problems
M Borassi, A Epasto, S Lattanzi, S Vassilvitskii, M Zadimoghaddam
Advances in Neural Information Processing Systems 33, 8716-8727, 2020
262020
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
232018
Differentially private continual releases of streaming frequency moment estimations
A Epasto, J Mao, AM Medina, V Mirrokni, S Vassilvitskii, P Zhong
14th Innovations in Theoretical Computer Science Conference (ITCS 2023)., 2023
222023
Bicriteria Distributed Submodular Maximization in a Few Rounds
A Epasto, M Zadimoghaddam, V Mirrokni
SPAA 2017, 2017
222017
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20