Ehsan Emamjomeh-Zadeh
Cited by
Cited by
Mixture selection, mechanism design, and signaling
Y Cheng, HY Cheung, S Dughmi, E Emamjomeh-Zadeh, L Han, SH Teng
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1426-1445, 2015
Deterministic and probabilistic binary search in graphs
E Emamjomeh-Zadeh, D Kempe, V Singhal
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
The Minimum Vulnerability Problem
S Assadi, E Emamjomeh-Zadeh, A Norouzi-Fard, S Yazdanbod, ...
Algorithms and Computation 7676, 382-391, 2012
Adaptive hierarchical clustering using ordinal queries
E Emamjomeh-Zadeh, D Kempe
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete …, 2018
A novel probabilistic key management algorithm for large-scale manets
M Gharib, E Emamjomeh-Zadeh, A Norouzi-Fard, A Movaghar
2013 27th International Conference on Advanced Information Networking and …, 2013
A general framework for robust interactive learning
E Emamjomeh-Zadeh, D Kempe
arXiv preprint arXiv:1710.05422, 2017
On the Rectangle Escape Problem.
S Assadi, E Emamjomeh-Zadeh, S Yazdanbod, H Zarrabi-Zadeh
CCCG, 2013
Unit covering in color-spanning set model
E Emamjomeh-Zadeh, M Ghodsi, H Homapour, M Seddighin
International Workshop on Algorithms and Computation, 44-52, 2015
The Complexity of Interactively Learning a Stable Matching by Trial and Error
E Emamjomeh-Zadeh, YA Gonczarowski, D Kempe
arXiv preprint arXiv:2002.07363, 2020
On the rectangle escape problem
A Ahmadinejad, S Assadi, E Emamjomeh-Zadeh, S Yazdanbod, ...
Theoretical Computer Science, 2017
Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds
E Emamjomeh-Zadeh, CY Wei, H Luo, D Kempe
Algorithmic Learning Theory, 599-618, 2021
Interactive Learning of a Dynamic Structure
E Emamjomeh-Zadeh, D Kempe, M Mahdian, RE Schapire
Algorithmic Learning Theory, 277-296, 2020
The system can't perform the operation now. Try again later.
Articles 1–12