Hossein Esfandiari
Hossein Esfandiari
Research Scientist at Google
Verified email at seas.harvard.edu - Homepage
Title
Cited by
Cited by
Year
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
78*2016
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
682018
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
612016
Prophet secretary
H Esfandiari, MT Hajiaghayi, V Liaghat, M Monemizadeh
SIAM Journal on Discrete Mathematics 31 (3), 1685-1701, 2017
422017
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
392017
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
232015
Almost optimal streaming algorithms for coverage problems
MH Bateni, H Esfandiari, V Mirrokni
arXiv preprint arXiv:1610.08096, 2016
222016
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
22*2016
Optimal distributed submodular optimization via sketching
MH Bateni, H Esfandiari, V Mirrokni
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge …, 2018
14*2018
Beating ratio 0.5 for weighted oblivious matching problems
M Abolhassani, THH Chan, F Chen, H Esfandiari, MT Hajiaghayi, ...
24th annual European symposium on algorithms (ESA 2016), 2016
122016
Finding large matchings in semi-streaming
H Esfandiari, MT Hajiaghayi, M Monemizadeh
2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW …, 2016
112016
A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
RH Chitnis, H Esfandiari, MT Hajiaghayi, R Khandekar, G Kortsarz, ...
International Symposium on Parameterized and Exact Computation, 159-171, 2014
92014
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
72019
A bounded-risk mechanism for the kidney exchange game
H Esfandiari, G Kortsarz
Discrete Applied Mathematics 243, 46-53, 2018
7*2018
Brief announcement: Graph matching in massive datasets
S Behnezhad, M Derakhshan, H Esfandiari, E Tan, H Yami
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017
72017
Online stochastic reordering buffer scheduling
H Esfandiari, MT Hajiaghayi, MR Khani, V Liaghat, H Mahini, H Räcke
International Colloquium on Automata, Languages, and Programming, 465-476, 2014
72014
Massively parallel computation via remote memory access
S Behnezhad, L Dhulipala, H Esfandiari, J Łącki, V Mirrokni, W Schudy
The 31st ACM Symposium on Parallelism in Algorithms and Architectures, 59-68, 2019
62019
Brief announcement: New streaming algorithms for parameterized maximal matching & beyond
R Chitnis, G Cormode, H Esfandiari, MT Hajiaghayi, M Monemizadeh
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and …, 2015
62015
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
52018
A bounded-risk mechanism for the kidney exchange game
H Esfandiari, G Kortsarz
Latin American Symposium on Theoretical Informatics, 416-428, 2016
42016
The system can't perform the operation now. Try again later.
Articles 1–20