“Omid Etesami”
Tel: (+98-21) 2310 ext. 2100
Fax: (+98- 21) 22290648
Email:
IPM Positions |
||
Faculty Member , School of Mathematics
(2017 - Present (From July 23)) |
||
Past IPM Positions |
||
Post-Doctoral Research Fellow, School of Mathematics
(2013 - 2017) (from October 23, 2013 till July 22, 2017) ) |
||
Research Interests |
||
Computer Science | ||
Related Papers |
1. | O. Etesami (Joint with J. Gao, S. Mahloujifar, and M. Mahmoody) Polynomial-time targeted attacks on coin-tossing for any number of corruptions ( In: The Theory of Cryptography Conference (TCC) 2021) [abstract] |
2. | O. Etesami (Joint with S. Mahloujifar and M. Mahmoody) Computational concentration of measure: Optimal bounds, reductions, and more SODA (2020), DOI: 10.1137/1.9781611975994.21 [abstract] |
3. | O. Etesami (Joint with W. H. Haemers) On NP-hard graph properties characterized by the spectrum Discrete Appl. Math. 285 (2020), 526-529 [abstract] |
4. | O. Etesami, N. Ghareghani and P. Sharifani (Joint with M. Habib, M.R. Hooshmandasl, and R. Naserasr) When an optimal dominating set with given constraints exists Theoretical Computer Science 780 (2019), 54-65 [abstract] |
5. | S. Beigi and O. Etesami (Joint with A. Bogdanov and S. Guo) Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources ( In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques) [abstract] |
6. | S. Beigi, O. Etesami and A. Gohari Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources SIAM J. Comput. 46 (2017), 1-36 [abstract] |
7. | S. Beigi, O. Etesami and A. Gohari The value of help bits in randomized and average-case complexity Comput. Complex. (2016), DOI: 10.1007/s00037-016-0135-x [abstract] |
8. | O. Etessami and A. Gohari Maximal rank correlation IEEE Communications Letters 20 (2016), 117-120 [abstract] |
9. | S. Beigi, O. Etesami and A. Gohari Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources ( In: ICALP 2015) [abstract] |
10. | O. Etesami (Joint with J. Cook, R. Miller, and L. Trevisan) On the one-way function candidate proposed by Goldreich ACM Transactions on Computation Theory (2014), DOI: http://dx.doi.org/10.1145/2633602 [abstract] |
[Back]
|