Ely Porat

3.1k total citations
100 papers, 874 citations indexed

About

Ely Porat is a scholar working on Artificial Intelligence, Molecular Biology and Computational Theory and Mathematics. According to data from OpenAlex, Ely Porat has authored 100 papers receiving a total of 874 indexed citations (citations by other indexed papers that have themselves been cited), including 84 papers in Artificial Intelligence, 40 papers in Molecular Biology and 40 papers in Computational Theory and Mathematics. Recurrent topics in Ely Porat's work include Algorithms and Data Compression (67 papers), DNA and Biological Computing (37 papers) and semigroups and automata theory (32 papers). Ely Porat is often cited by papers focused on Algorithms and Data Compression (67 papers), DNA and Biological Computing (37 papers) and semigroups and automata theory (32 papers). Ely Porat collaborates with scholars based in Israel, United States and United Kingdom. Ely Porat's co-authors include Amihood Amir, Moshe Lewenstein, Yoram Bachrach, Ori Rottenstreich, Raphaël Clifford, Haim Kaplan, Klim Efremenko, Jeffrey S. Rosenschein, Isaac Keslassy and Avinatan Hassidim and has published in prestigious journals such as IEEE Transactions on Information Theory, Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences and IEEE/ACM Transactions on Networking.

In The Last Decade

Ely Porat

95 papers receiving 830 citations

Peers

Ely Porat
Ramesh Hariharan India
Moshe Lewenstein Israel
Jacques Cohen United States
Simon J. Puglisi Finland
René Peralta United States
Leszek Gąsieniec United Kingdom
Serap A. Savari United States
Ariful Azad United States
Xuejia Lai China
I. Hal Sudborough United States
Ramesh Hariharan India
Ely Porat
Citations per year, relative to Ely Porat Ely Porat (= 1×) peers Ramesh Hariharan

Countries citing papers authored by Ely Porat

Since Specialization
Citations

This map shows the geographic impact of Ely Porat'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 Ely Porat with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ely Porat more than expected).

Fields of papers citing papers by Ely Porat

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ely Porat. 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 Ely Porat. The network helps show where Ely Porat may publish in the future.

Co-authorship network of co-authors of Ely Porat

This figure shows the co-authorship network connecting the top 25 collaborators of Ely Porat. A scholar is included among the top collaborators of Ely Porat 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 Ely Porat. Ely Porat is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Porat, Ely, et al.. (2024). Iteration-Free quantum approximate optimization algorithm using neural networks. Quantum Machine Intelligence. 6(2). 2 indexed citations
2.
Bender, Michael A., et al.. (2021). Incremental Edge Orientation in Forests. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
3.
Clifford, Raphaël, Tomasz Kociumaka, & Ely Porat. (2019). The streaming k-mismatch problem. Symposium on Discrete Algorithms. 1106–1125. 1 indexed citations
4.
Gilbert, Anna C., Yi Li, Ely Porat, & Martin J. Strauss. (2017). For-All Sparse Recovery in Near-Optimal Time. ACM Transactions on Algorithms. 13(3). 1–26. 6 indexed citations
5.
Alstrup, Stephen, et al.. (2016). Sublinear Distance Labeling. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 57. 15. 2 indexed citations
6.
Alstrup, Stephen, et al.. (2016). Distance labeling schemes for trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 1 indexed citations
7.
Kopelowitz, Tsvi, Seth Pettie, & Ely Porat. (2016). Higher lower bounds from the 3SUM conjecture. Symposium on Discrete Algorithms. 1272–1287. 16 indexed citations
8.
Bachrach, Yoram, Sofia Ceppi, Ian A. Kash, et al.. (2014). Building a personalized tourist attraction recommender system using crowdsourcing. Adaptive Agents and Multi-Agents Systems. 1631–1632. 8 indexed citations
9.
Ngo, Hung Q., Ely Porat, & Atri Rudra. (2011). Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract).. International Colloquium on Automata, Languages and Programming. 557–568. 3 indexed citations
10.
Feigenblat, Guy, et al.. (2011). Exponential time improvement for min-wise based algorithms. Symposium on Discrete Algorithms. 57–66. 8 indexed citations
11.
Porat, Ely, et al.. (2011). Another one flew over the cuckoo's nest. arXiv (Cornell University). 1 indexed citations
12.
Bachrach, Yoram & Ely Porat. (2010). Path disruption games. Adaptive Agents and Multi-Agents Systems. 1123–1130. 18 indexed citations
13.
Bachrach, Yoram, Ely Porat, & Jeffrey S. Rosenschein. (2009). Sketching techniques for collaborative filtering. International Joint Conference on Artificial Intelligence. 2016–2021. 26 indexed citations
14.
Clifford, Raphaël, et al.. (2009). From coding theory to efficient pattern matching. Symposium on Discrete Algorithms. 778–784. 12 indexed citations
15.
Porat, Ely & Klim Efremenko. (2008). Approximating general metric distances between a pattern and a text. arXiv (Cornell University). 419–427. 3 indexed citations
16.
Porat, Ely, et al.. (2008). Approximated Pattern Matching with the L1, L2 and L infinit Metrics.. 212–223. 1 indexed citations
17.
Amir, Amihood, Yonatan Aumann, Gary Benson, et al.. (2006). Pattern matching with address errors: rearrangement distances. Symposium on Discrete Algorithms. 1221–1229. 15 indexed citations
18.
Cole, Richard, Ramesh Hariharan, Moshe Lewenstein, & Ely Porat. (2001). A faster implementation of the Goemans-Williamson clustering algorithm. Symposium on Discrete Algorithms. 17–25. 16 indexed citations
19.
Amir, Amihood, Ely Porat, & Moshe Lewenstein. (2001). Approximate subset matching with Don't Cares. Symposium on Discrete Algorithms. 305–306. 9 indexed citations
20.
Amir, Amihood, Moshe Lewenstein, & Ely Porat. (2000). Faster algorithms for string matching with k mismatches. Symposium on Discrete Algorithms. 50(2). 794–803. 38 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

Breakdown of academic impact, for papers by Ramesh Hariharan Breakdown of academic impact, for papers by Moshe Lewenstein Breakdown of academic impact, for papers by Jacques Cohen Breakdown of academic impact, for papers by Simon J. Puglisi Breakdown of academic impact, for papers by René Peralta Breakdown of academic impact, for papers by Leszek Gąsieniec Breakdown of academic impact, for papers by Serap A. Savari Breakdown of academic impact, for papers by Ariful Azad Breakdown of academic impact, for papers by Xuejia Lai Breakdown of academic impact, for papers by I. Hal Sudborough
Rankless by CCL
2026