Eran Omri
- Artificial Intelligence
- Computational Theory and Mathematics
- Information Systems
- Computer Networks and Communications
- Geometry and Topology
- Co-authors
- Yehuda LindellIftach HaitnerAmos BeimelAnat Paskin-CherniavskyAndreas WeiermannBoaz Ben‐MosheMichael ElkinLee-Ad Gottlieb
- Topics
- Cryptography and Data Security (15 papers)Privacy-Preserving Technologies in Data (8 papers)Complexity and Algorithms in Graphs (6 papers)
- Cited by
- Artificial IntelligenceComputational Theory and MathematicsDiscrete Mathematics and Combinatorics
- Journals
- SIAM Journal on ComputingTheoretical Computer ScienceJournal of Combinatorial Theory Series A
- Partner nations
- IsraelUnited StatesBelgium
In The Last Decade
Eran Omri
17 papers receiving 94 citations
Peers
Comparison fields: 5 of 23
- Artificial Intelligence 82
- Computational Theory and Mathematics 33
- Information Systems 20
- Computer Networks and Communications 11
- Geometry and Topology 8
Countries citing papers authored by Eran Omri
This map shows the geographic impact of Eran Omri'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 Eran Omri with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eran Omri more than expected).
Fields of papers citing papers by Eran Omri
This network shows the impact of papers produced by Eran Omri. 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 Eran Omri. The network helps show where Eran Omri may publish in the future.
Co-authorship network of co-authors of Eran Omri
This figure shows the co-authorship network connecting the top 25 collaborators of Eran Omri. A scholar is included among the top collaborators of Eran Omri 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 Eran Omri. Eran Omri is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 0 | |
| 4 | 11 | |
| 5 | 1 | |
| 6 | Computational Two-Party Correlation. | 2 |
| 7 | 2 | |
| 8 | 2 | |
| 9 | Tighter Bounds on Multi-Party Coin Flipping, via Augmented Weak Martingales and Di erentially Private Sampling. | 2 |
| 10 | 1 | |
| 11 | 2 | |
| 12 | 42 | |
| 13 | 4 | |
| 14 | 6 | |
| 15 | 7 | |
| 16 | On the Power of Random Oracles. | 1 |
| 17 | Optimizing Budget Allocation in Graphs | 2 |
| 18 | 4 | |
| 19 | 2 | |
| 20 | 5 |
About Eran Omri
Eran Omri is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics, having authored 20 papers that have together received 96 indexed citations. Recurring topics across this work include Cryptography and Data Security (15 papers), Privacy-Preserving Technologies in Data (8 papers) and Complexity and Algorithms in Graphs (6 papers). The work is most often cited by research in Artificial Intelligence (82 citations), Computational Theory and Mathematics (33 citations) and Discrete Mathematics and Combinatorics (3 citations). Eran Omri has collaborated with scholars based in Israel, United States and Belgium. Frequent co-authors include Yehuda Lindell, Iftach Haitner, Amos Beimel, Anat Paskin-Cherniavsky, Andreas Weiermann, Boaz Ben‐Moshe, Michael Elkin, Lee-Ad Gottlieb, Kobbi Nissim and Ronen Shaltiel. Their work appears in journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Combinatorial Theory Series A.
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.