Omid Etesami

According to our database, Omid Etesami authored at least 21 papers between 2004 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

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

2020

On NP-hard graph properties characterized by the spectrum.

Omid Etesami, Willem H. Haemers

Discret. Appl. Math., 2020

Computational Concentration of Measure: Optimal Bounds, Reductions, and More.

Omid Etesami, Saeed Mahloujifar, Mohammad Mahmoody

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

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

2018

Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources.

Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo

Proceedings of the Approximation, 2018

2017

Complete Classi fication of Generalized Santha-Vazirani Sources.

Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo

Electron. Colloquium Comput. Complex., 2017

Complete Classification of Generalized Santha-Vazirani Sources.

Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo

CoRR, 2017

The Value of Help Bits in Randomized and Average-Case Complexity.

Salman Beigi, Omid Etesami, Amin Gohari

Comput. Complex., 2017

2016

Maximal Rank Correlation.

Omid Etesami, Amin Gohari

IEEE Commun. Lett., 2016

2015

The value of information-theoretic content of help bits for computation.

Salman Beigi, Omid Etesami, Amin Gohari

Proceedings of the Iran Workshop on Communication and Information Theory, 2015

2014

Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources.

Salman Beigi, Omid Etesami, Amin Gohari

Electron. Colloquium Comput. Complex., 2014

2012

On the One-Way Function Candidate Proposed by Goldreich.

James Cook, Omid Etesami, Rachel Miller, Luca Trevisan

Electron. Colloquium Comput. Complex., 2012

Irregular product codes.

Masoud Alipour, Omid Etesami, Ghid Maatouk, Amin Shokrollahi

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

2009

Improved Pseudorandom Generators for Depth 2 Circuits.

Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani

Electron. Colloquium Comput. Complex., 2009

Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms.

James Cook, Omid Etesami, Rachel Miller, Luca Trevisan

Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

2007

On rainbow cycles in edge colored complete graphs.

Saieed Akbari, Omid Etesami, H. Mahini, Mohammad Mahmoody

Australas. J Comb., 2007

Dynamics of bid optimization in online advertisement auctions.

Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Kamal Jain, Omid Etesami, Mohammad Mahdian

Proceedings of the 16th International Conference on World Wide Web, 2007

2006

Raptor codes on binary memoryless symmetric channels.

Omid Etesami, Amin Shokrollahi

IEEE Trans. Inf. Theory, 2006

Transversals in long rectangular arrays.

Saeed Akbari, Omid Etesami, H. Mahini, Mohammad Mahmoody, Arash Sharifi

Discret. Math., 2006

2004

Raptor codes on symmetric channels.

Omid Etesami, Mehdi Molkaraie, Amin Shokrollahi

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Relations between belief propagation on erasure and symmetric channels.

Omid Etesami

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004