default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOmid Etesami
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c11]Omid Etesami, Ji Gao, Saeed Mahloujifar, Mohammad Mahmoody:
Polynomial-Time Targeted Attacks on Coin Tossing for Any Number of Corruptions. TCC (2) 2021: 718-750- [i12]Omid Etesami, Ji Gao, Saeed Mahloujifar, Mohammad Mahmoody:
Polynomial-time targeted attacks on coin tossing for any number of corruptions. IACR Cryptol. ePrint Arch. 2021: 1464 (2021) - 2020
- [j9]Omid Etesami, Willem H. Haemers
:
On NP-hard graph properties characterized by the spectrum. Discret. Appl. Math. 285: 526-529 (2020) - [c10]Omid Etesami, Saeed Mahloujifar, Mohammad Mahmoody:
Computational Concentration of Measure: Optimal Bounds, Reductions, and More. SODA 2020: 345-363
2010 – 2019
- 2019
- [j8]Omid Etesami, Narges Ghareghani, Michel Habib, Mohammad Reza Hooshmandasl, Reza Naserasr, Pouyeh Sharifani:
When an optimal dominating set with given constraints exists. Theor. Comput. Sci. 780: 54-65 (2019) - [i11]Omid Etesami, Saeed Mahloujifar, Mohammad Mahmoody:
Computational Concentration of Measure: Optimal Bounds, Reductions, and More. CoRR abs/1907.05401 (2019) - 2018
- [c9]Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources. APPROX-RANDOM 2018: 30:1-30:15 - 2017
- [j7]Salman Beigi, Omid Etesami, Amin Gohari:
The Value of Help Bits in Randomized and Average-Case Complexity. Comput. Complex. 26(1): 119-145 (2017) - [j6]Salman Beigi, Omid Etesami, Amin Gohari:
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. SIAM J. Comput. 46(1): 1-36 (2017) - [i10]Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
Complete Classification of Generalized Santha-Vazirani Sources. CoRR abs/1709.03053 (2017) - [i9]Salman Beigi, Andrej Bogdanov, Omid Etesami, Siyao Guo:
Complete Classi fication of Generalized Santha-Vazirani Sources. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j5]Omid Etesami, Amin Gohari:
Maximal Rank Correlation. IEEE Commun. Lett. 20(1): 117-120 (2016) - 2015
- [c8]Salman Beigi, Omid Etesami, Amin Gohari:
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. ICALP (1) 2015: 143-154 - [c7]Salman Beigi, Omid Etesami, Amin Gohari:
The value of information-theoretic content of help bits for computation. IWCIT 2015: 1-3 - [i8]Omid Etesami, Amin Gohari:
Maximal Rank Correlation. CoRR abs/1511.04191 (2015) - 2014
- [j4]James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
On the One-Way Function Candidate Proposed by Goldreich. ACM Trans. Comput. Theory 6(3): 14:1-14:35 (2014) - [i7]Salman Beigi, Omid Etesami, Amin Gohari:
The Value of Help Bits in Randomized and Average-Case Complexity. CoRR abs/1408.0499 (2014) - [i6]Salman Beigi, Omid Etesami, Amin Gohari:
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. CoRR abs/1412.6641 (2014) - [i5]Salman Beigi, Omid Etesami, Amin Gohari:
The Value of Help Bits in Randomized and Average-Case Complexity. Electron. Colloquium Comput. Complex. TR14 (2014) - [i4]Salman Beigi, Omid Etesami, Amin Gohari:
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. Electron. Colloquium Comput. Complex. TR14 (2014) - 2012
- [c6]Masoud Alipour, Omid Etesami, Ghid Maatouk, Amin Shokrollahi:
Irregular product codes. ITW 2012: 197-201 - [i3]Masoud Alipour, Omid Etesami, Ghid Maatouk, Amin Shokrollahi:
Irregular Product Codes. CoRR abs/1206.2276 (2012) - [i2]James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
On the One-Way Function Candidate Proposed by Goldreich. Electron. Colloquium Comput. Complex. TR12 (2012) - 2010
- [c5]Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani:
Improved Pseudorandom Generators for Depth 2 Circuits. APPROX-RANDOM 2010: 504-517
2000 – 2009
- 2009
- [c4]James Cook, Omid Etesami, Rachel Miller, Luca Trevisan:
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms. TCC 2009: 521-538 - [i1]Anindya De, Omid Etesami, Luca Trevisan, Madhur Tulsiani:
Improved Pseudorandom Generators for Depth 2 Circuits. Electron. Colloquium Comput. Complex. TR09 (2009) - 2007
- [j3]Saieed Akbari, Omid Etesami, H. Mahini, Mohammad Mahmoody:
On rainbow cycles in edge colored complete graphs. Australas. J Comb. 37: 33-42 (2007) - [c3]Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Kamal Jain, Omid Etesami, Mohammad Mahdian:
Dynamics of bid optimization in online advertisement auctions. WWW 2007: 531-540 - 2006
- [j2]Saeed Akbari, Omid Etesami, H. Mahini, Mohammad Mahmoody, Arash Sharifi:
Transversals in long rectangular arrays. Discret. Math. 306(23): 3011-3013 (2006) - [j1]Omid Etesami, Amin Shokrollahi:
Raptor codes on binary memoryless symmetric channels. IEEE Trans. Inf. Theory 52(5): 2033-2051 (2006) - 2004
- [c2]Omid Etesami, Mehdi Molkaraie, Amin Shokrollahi:
Raptor codes on symmetric channels. ISIT 2004: 38 - [c1]Omid Etesami:
Relations between belief propagation on erasure and symmetric channels. ISIT 2004: 209
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
