Obserwuj
Hossein Esfandiari
Hossein Esfandiari
Senior Research Scientist at Google
Zweryfikowany adres z seas.harvard.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Kernelization via sampling with applications to finding matchings and related problems in dynamic graph streams
R Chitnis, G Cormode, H Esfandiari, MT Hajiaghayi, A McGregor, ...
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
144*2016
Prophet secretary
H Esfandiari, MT Hajiaghayi, V Liaghat, M Monemizadeh
SIAM Journal on Discrete Mathematics 31 (3), 1685-1701, 2017
1122017
Streaming algorithms for estimating the matching size in planar graphs and beyond
H Esfandiari, M Hajiaghayi, V Liaghat, M Monemizadeh, K Onak
ACM Transactions on Algorithms (TALG) 14 (4), 1-23, 2018
1112018
Beating 1-1/e for ordered prophets
M Abolhassani, S Ehsani, H Esfandiari, MT Hajiaghayi, R Kleinberg, ...
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
922017
Regret bounds for batched bandits
H Esfandiari, A Karbasi, A Mehrabian, V Mirrokni
Proceedings of the AAAI Conference on Artificial Intelligence 35 (8), 7340-7348, 2021
70*2021
Near-optimal massively parallel graph connectivity
S Behnezhad, L Dhulipala, H Esfandiari, J Lacki, V Mirrokni
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
562019
Online allocation with traffic spikes: Mixing adversarial and stochastic models
H Esfandiari, N Korula, V Mirrokni
Proceedings of the Sixteenth ACM Conference on Economics and Computation …, 2015
452015
Almost optimal streaming algorithms for coverage problems
MH Bateni, H Esfandiari, V Mirrokni
arXiv preprint arXiv:1610.08096, 2016
442016
Massively parallel computation via remote memory access
S Behnezhad, L Dhulipala, H Esfandiari, J Łącki, V Mirrokni, W Schudy
ACM Transactions on Parallel Computing 8 (3), 1-25, 2021
402021
Brief announcement: Applications of uniform sampling: Densest subgraph and beyond
H Esfandiari, MT Hajiaghayi, DP Woodruff
Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and …, 2016
37*2016
Adaptivity in adaptive submodularity
H Esfandiari, A Karbasi, V Mirrokni
Conference on Learning Theory, 1823-1846, 2021
362021
Finding large matchings in semi-streaming
H Esfandiari, MT Hajiaghayi, M Monemizadeh
2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW …, 2016
362016
Parallel and streaming algorithms for k-core decomposition
H Esfandiari, S Lattanzi, V Mirrokni
international conference on machine learning, 1397-1406, 2018
332018
Optimal distributed submodular optimization via sketching
MH Bateni, H Esfandiari, V Mirrokni
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge …, 2018
28*2018
Improved approximations for Euclidean k-means and k-median, via nested quasi-independent sets
V Cohen-Addad, H Esfandiari, V Mirrokni, S Narayanan
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
262022
Online pandora’s boxes and bandits
H Esfandiari, MT HajiAghayi, B Lucier, M Mitzenmacher
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1885-1892, 2019
212019
Seeding with costly network information
D Eckles, H Esfandiari, E Mossel, MA Rahimian
Proceedings of the 2019 ACM Conference on Economics and Computation, 421-422, 2019
202019
Allocation with traffic spikes: Mixing adversarial and stochastic models
H Esfandiari, N Korula, V Mirrokni
ACM Transactions on Economics and Computation (TEAC) 6 (3-4), 1-23, 2018
202018
Label differential privacy via clustering
H Esfandiari, V Mirrokni, U Syed, S Vassilvitskii
International Conference on Artificial Intelligence and Statistics, 7055-7075, 2022
182022
Almost tight approximation algorithms for explainable clustering
H Esfandiari, V Mirrokni, S Narayanan
Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022
182022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20