Omid Etesami
Omid Etesami
Verified email at ipm.ir - Homepage
Title
Cited by
Cited by
Year
Raptor codes on binary memoryless symmetric channels
O Etesami, A Shokrollahi
IEEE Transactions on Information Theory 52 (5), 2033-2051, 2006
4682006
Dynamics of bid optimization in online advertisement auctions
C Borgs, J Chayes, N Immorlica, K Jain, O Etesami, M Mahdian
Proceedings of the 16th international conference on World Wide Web, 531-540, 2007
2502007
Raptor codes on symmetric channels
O Etesami, M Molkaraie, A Shokrollahi
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 38, 2004
732004
Improved pseudorandom generators for depth 2 circuits
A De, O Etesami, L Trevisan, M Tulsiani
Approximation, randomization, and combinatorial optimization. Algorithms and …, 2010
632010
Mafia: A theoretical study of players and coalitions in a partial information environment
M Braverman, O Etesami, E Mossel
The Annals of Applied Probability 18 (3), 825-846, 2008
532008
Mafia: A theoretical study of players and coalitions in a partial information environment
M Braverman, O Etesami, E Mossel
The Annals of Applied Probability 18 (3), 825-846, 2008
532008
Goldreich’s one-way function candidate and myopic backtracking algorithms
J Cook, O Etesami, R Miller, L Trevisan
Theory of Cryptography Conference, 521-538, 2009
502009
Bid optimization in online advertisement auctions
C Borgs, J Chayes, O Etesami, N Immorlica, K Jain, M Mahdian
Workshop on Sponsored Search Auctions, 2006
302006
On rainbow cycles in edge colored complete graphs
S Akbari, O Etesami, H Mahini, M Mahmoody
Australasian Journal of Combinatorics 37, 33, 2007
192007
On the one-way function candidate proposed by Goldreich
J Cook, O Etesami, R Miller, L Trevisan
ACM Transactions on Computation Theory (TOCT) 6 (3), 1-35, 2014
172014
Irregular product codes
M Alipour, O Etesami, G Maatouk, A Shokrollahi
2012 IEEE Information Theory Workshop, 197-201, 2012
162012
Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources
S Beigi, O Etesami, A Gohari
SIAM Journal on Computing 46 (1), 1-36, 2017
152017
Computational concentration of measure: Optimal bounds, reductions, and more
O Etesami, S Mahloujifar, M Mahmoody
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
92020
Maximal rank correlation
O Etesami, A Gohari
IEEE Communications Letters 20 (1), 117-120, 2015
82015
When an optimal dominating set with given constraints exists
O Etesami, N Ghareghani, M Habib, M Hooshmandasl, R Naserasr, ...
Theoretical Computer Science 780, 54-65, 2019
72019
Transversals in long rectangular arrays
S Akbari, O Etesami, H Mahini, M Mahmoody, A Sharifi
Discrete mathematics 306 (23), 3011-3013, 2006
72006
Optimal deterministic extractors for generalized Santha-Vazirani sources
S Beigi, A Bogdanov, O Etesami, S Guo
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2018
52018
Relations between belief propagation on erasure and symmetric channels
O Etesami
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 209, 2004
42004
Complete classification of generalized Santha-Vazirani sources
S Beigi, A Bogdanov, O Etesami, S Guo
arXiv preprint arXiv:1709.03053, 2017
32017
Claude Shannon and “A Mathematical Theory of Communication”
P Ahammad, K Daskalakis, O Etesami, A Frome
Relation, 1-12, 2004
32004
The system can't perform the operation now. Try again later.
Articles 1–20