Omid Etesami

976 total citations
18 papers, 547 citations indexed

About

Omid Etesami is a scholar working on Computational Theory and Mathematics, Electrical and Electronic Engineering and Computer Networks and Communications. According to data from OpenAlex, Omid Etesami has authored 18 papers receiving a total of 547 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Computational Theory and Mathematics, 5 papers in Electrical and Electronic Engineering and 4 papers in Computer Networks and Communications. Recurrent topics in Omid Etesami's work include Error Correcting Code Techniques (4 papers), semigroups and automata theory (2 papers) and Game Theory and Applications (2 papers). Omid Etesami is often cited by papers focused on Error Correcting Code Techniques (4 papers), semigroups and automata theory (2 papers) and Game Theory and Applications (2 papers). Omid Etesami collaborates with scholars based in Iran, United States and Switzerland. Omid Etesami's co-authors include Amin Shokrollahi, Nicole Immorlica, Christian Borgs, Mohammad Mahdian, Kamal Jain, Jennifer Chayes, Mark Braverman, Elchanan Mossel, Amin Gohari and Saieed Akbari and has published in prestigious journals such as IEEE Transactions on Information Theory, SIAM Journal on Computing and IEEE Communications Letters.

In The Last Decade

Omid Etesami

17 papers receiving 521 citations

Peers

Omid Etesami

CNC

EEE

MSOR

MARKE

AI

Naoki Fukuta Japan

Chaki Ng United States

Zhiying Tu China

Loizos Michael Cyprus

J. Hicks United States

Justin Basilico United States

Pradheep Elango United States

Giridhar Maji India

E. K. Park United States

Naoki Fukuta Japan

Omid Etesami

109 ×0.3

CNC

70 ×0.2

EEE

162 ×1.4

MSOR

93 ×0.9

MARKE

112 ×1.1

AI

Citations per year, relative to Omid Etesami Omid Etesami (= 1×) peers Naoki Fukuta

Countries citing papers authored by Omid Etesami

Since Specialization

Citations

This map shows the geographic impact of Omid Etesami's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Omid Etesami with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Omid Etesami more than expected).

Fields of papers citing papers by Omid Etesami

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Omid Etesami. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Omid Etesami. The network helps show where Omid Etesami may publish in the future.

Co-authorship network of co-authors of Omid Etesami

This figure shows the co-authorship network connecting the top 25 collaborators of Omid Etesami. A scholar is included among the top collaborators of Omid Etesami based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Omid Etesami. Omid Etesami is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

18 of 18 papers shown

1.

Etesami, Omid, et al.. (2019). When an optimal dominating set with given constraints exists. Theoretical Computer Science. 780. 54–65. 1 indexed citations

2.

Beigi, Salman, Andrej Bogdanov, Omid Etesami, & Siyao Guo. (2018). Optimal Deterministic Extractors for Generalized Santha-Vazirani Sources. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

3.

Beigi, Salman, Omid Etesami, & Amin Gohari. (2017). Deterministic Randomness Extraction from Generalized and Distributed Santha--Vazirani Sources. SIAM Journal on Computing. 46(1). 1–36. 2 indexed citations

4.

Etesami, Omid & Amin Gohari. (2015). Maximal Rank Correlation. IEEE Communications Letters. 20(1). 117–120. 7 indexed citations

5.

Etesami, Omid, et al.. (2014). On the One-Way Function Candidate Proposed by Goldreich. 6(3). 1–35. 4 indexed citations

6.

Beigi, Salman, Omid Etesami, & Amin Gohari. (2014). Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources. arXiv (Cornell University). 21. 179. 1 indexed citations

7.

Beigi, Salman, Omid Etesami, & Amin Gohari. (2014). The Value of Help Bits in Randomized and Average-Case Complexity. arXiv (Cornell University). 21. 100.

8.

Etesami, Omid, et al.. (2012). On the One-Way Function Candidate Proposed by Goldreich.. 19. 175. 2 indexed citations

9.

Alipour, Masoud, et al.. (2012). Irregular product codes. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 197–201. 9 indexed citations

10.

De, Anindya, Omid Etesami, Luca Trevisan, & Madhur Tulsiani. (2009). Improved Pseudorandom Generators for Depth 2 Circuits.. Electronic colloquium on computational complexity. 16. 141. 2 indexed citations

11.

Braverman, Mark, Omid Etesami, & Elchanan Mossel. (2008). Mafia: A theoretical study of players and coalitions in a partial information environment. The Annals of Applied Probability. 18(3). 27 indexed citations

12.

Borgs, Christian, Jennifer Chayes, Omid Etesami, et al.. (2007). Bid Optimization in Online Advertisement Auctions. 531–540. 13 indexed citations

13.

Akbari, Saieed, Omid Etesami, Hamid Mahini, & Mohammad Mahmoody. (2007). On rainbow cycles in edge colored complete graphs.. Australas. J Comb.. 37. 33–42. 10 indexed citations

14.

Borgs, Christian, Jennifer Chayes, Nicole Immorlica, et al.. (2007). Dynamics of bid optimization in online advertisement auctions. 531–540. 127 indexed citations

15.

Akbari, Saieed, et al.. (2006). Transversals in long rectangular arrays. Discrete Mathematics. 306(23). 3011–3013. 2 indexed citations

16.

Etesami, Omid & Amin Shokrollahi. (2006). Raptor codes on binary memoryless symmetric channels. IEEE Transactions on Information Theory. 52(5). 2033–2051. 279 indexed citations

17.

Etesami, Omid, et al.. (2004). Raptor codes on symmetric channels. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 38–38. 59 indexed citations

18.

Etesami, Omid. (2004). Relations between belief propagation on erasure and symmetric channels. 207–207. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact