Relations between belief propagation on erasure and symmetric channels. - Omid Etesami (ISIT, 2004)

Raptor codes on symmetric channels. - Omid Etesami; Mehdi Molkaraie; Amin Shokrollahi (ISIT, 2004)

Transversals in long rectangular arrays. - Saeed Akbari; Omid Etesami; H. Mahini; Mohammad Mahmoody; Arash Sharifi (Discret. Math., 2006)

Raptor codes on binary memoryless symmetric channels. - Omid Etesami; Amin Shokrollahi (IEEE Trans. Inf. Theory, 2006)

Dynamics of bid optimization in online advertisement auctions. - Christian Borgs; Jennifer T. Chayes; Nicole Immorlica; Kamal Jain; Omid Etesami; Mohammad Mahdian (WWW, 2007)

On rainbow cycles in edge colored complete graphs. - Saieed Akbari; Omid Etesami; H. Mahini; Mohammad Mahmoody (Australas. J Comb., 2007)

Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms. - James Cook; Omid Etesami; Rachel Miller; Luca Trevisan 001 (TCC, 2009)

Improved Pseudorandom Generators for Depth 2 Circuits. - Anindya De; Omid Etesami; Luca Trevisan 001; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2009)

Irregular product codes. - Masoud Alipour; Omid Etesami; Ghid Maatouk; Amin Shokrollahi (ITW, 2012)

On the One-Way Function Candidate Proposed by Goldreich. - James Cook; Omid Etesami; Rachel Miller; Luca Trevisan 001 (Electron. Colloquium Comput. Complex., 2012)

The value of information-theoretic content of help bits for computation. - Salman Beigi; Omid Etesami; Amin Gohari (IWCIT, 2015)

Maximal Rank Correlation. - Omid Etesami; Amin Gohari (IEEE Commun. Lett., 2016)

The Value of Help Bits in Randomized and Average-Case Complexity. - Salman Beigi; Omid Etesami; Amin Gohari (Comput. Complex., 2017)

Complete Classification of Generalized Santha-Vazirani Sources. - Salman Beigi; Andrej Bogdanov; Omid Etesami; Siyao Guo (CoRR, 2017)

Complete Classi fication of Generalized Santha-Vazirani Sources. - Salman Beigi; Andrej Bogdanov; Omid Etesami; Siyao Guo (Electron. Colloquium Comput. Complex., 2017)

Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. - Salman Beigi; Omid Etesami; Amin Gohari (SIAM J. Comput., 2017)

Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources. - Salman Beigi; Andrej Bogdanov; Omid Etesami; Siyao Guo (APPROX-RANDOM, 2018)

When an optimal dominating set with given constraints exists. - Omid Etesami; Narges Ghareghani; Michel Habib; Mohammad Reza Hooshmandasl; Reza Naserasr; Pouyeh Sharifani (Theor. Comput. Sci., 2019)

Computational Concentration of Measure: Optimal Bounds, Reductions, and More. - Omid Etesami; Saeed Mahloujifar; Mohammad Mahmoody (SODA, 2020)

On NP-hard graph properties characterized by the spectrum. - Omid Etesami; Willem H. Haemers (Discret. Appl. Math., 2020)

Polynomial-time targeted attacks on coin tossing for any number of corruptions. - Omid Etesami; Ji Gao; Saeed Mahloujifar; Mohammad Mahmoody (IACR Cryptol. ePrint Arch., 2021)