2026 Ely Porat: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	36	11395	11071	179	173	208	4247

Overview

Ely Porat is a researcher affiliated with Bar-Ilan University in Israel. Their scholarly work spans across the fields of Computer Science and Biochemistry, Genetics and Molecular Biology, with a predominant focus on Artificial Intelligence, DNA and Biological Computing, and Computational Theory and Mathematics, among other areas.

The main subfields of their research include:

Artificial Intelligence
Molecular Biology
Computational Theory and Mathematics
Computer Networks and Communications
Genetics

The principal topics addressed in their research involve:

Algorithms and Data Compression
DNA and Biological Computing
Semigroups and Automata Theory
Caching and Content Delivery
Genome Rearrangement Algorithms
Distributed Systems and Fault Tolerance
Internet Traffic Analysis and Secure E-voting

Among Ely Porat's recent publications are the following works:

"Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions" (2021), published in IEEE Transactions on Network and Service Management
"Iterative-Free Quantum Approximate Optimization Algorithm Using Neural Networks" (2022), published on arXiv (Cornell University)
"Locally Consistent Parsing for Text Indexing in Small Space" (2025), published in SIAM Journal on Computing
"Iteration-Free quantum approximate optimization algorithm using neural networks" (2024), published in Quantum Machine Intelligence
"An O(log^{3/2}n) Parallel Time Population Protocol for Majority with O(log n) States" (2020), published on arXiv (Cornell University)

Their work has appeared in notable publication venues, including:

arXiv (Cornell University)
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
SSRN Electronic Journal
IEEE Transactions on Network and Service Management
SIAM Journal on Computing

Ely Porat collaborates frequently with several researchers, with multiple coauthored works alongside:

Tsvi Kopelowitz
Shay Golan
Tomasz Kociumaka
Avivit Levy
B. Riva Shalom

Best Publications

Worst-case Optimal Join Algorithms

Hung Q. Ngo;Ely Porat;Christopher Ré;Atri Rudra

270
Citations
Worst-case optimal join algorithms: [extended abstract]

Hung Q. Ngo;Ely Porat;Christopher Ré;Atri Rudra

233
Citations
Explicit Nonadaptive Combinatorial Group Testing Schemes

E. Porat;A. Rothschild

217
Citations
Explicit Non-Adaptive Combinatorial Group Testing Schemes.

Ely Porat;Amir Rothschild

125
Citations
Higher lower bounds from the 3SUM conjecture

Tsvi Kopelowitz;Seth Pettie;Ely Porat

117
Citations
Exact and Approximate Pattern Matching in the Streaming Model

Benny Porat;Ely Porat

106
Citations
Faster algorithms for string matching with k mismatches

Amihood Amir;Moshe Lewenstein;Ely Porat

104
Citations
Fast moment estimation in data streams in optimal space

Daniel M. Kane;Jelani Nelson;Ely Porat;David P. Woodruff

99
Citations
Overlap matching

Amihood Amir;Richard Cole;Ramesh Hariharan;Moshe Lewenstein

85
Citations
Fast set intersection and two-patterns matching

Hagai Cohen;Ely Porat

84
Citations
Weight Distribution and List-Decoding Size of Reed–Muller Codes

T. Kaufman;S. Lovett;E. Porat

83
Citations
Efficiently decodable error-correcting list disjunct matrices and applications

Hung Q. Ngo;Ely Porat;Atri Rudra

81
Citations
An Optimal Bloom Filter Replacement Based on Matrix Solving

Ely Porat

75
Citations
Approximate sparse recovery: optimizing time and measurements

Anna C. Gilbert;Yi Li;Ely Porat;Martin J. Strauss

70
Citations
Pattern matching with address errors: Rearrangement distances

Amihood Amir;Yonatan Aumann;Gary Benson;Avivit Levy

64
Citations
Improved sketching of hamming distance with error correcting

Ely Porat;Ohad Lipsky

56
Citations
Function matching: algorithms, applications, and a lower bound

Amihood Amir;Yonatan Aumann;Richard Cole;Moshe Lewenstein

55
Citations
Power and stability in connectivity games

Yoram Bachrach;Jeffrey S. Rosenschein;Ely Porat

55
Citations
Pattern matching with don't cares and few errors

Raphaël Clifford;Klim Efremenko;Ely Porat;Amir Rothschild

51
Citations
Approximate Sparse Recovery: Optimizing Time and Measurements

Anna C. Gilbert;Yi Li;Ely Porat;Martin J. Strauss

49
Citations
Higher Lower Bounds from the 3SUM Conjecture

Tsvi Kopelowitz;Seth Pettie;Ely Porat

35
Citations
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract).

Hung Q. Ngo;Ely Porat;Atri Rudra

8
Citations
Overlap matching

Amihood Amir;Richard Cole;Ramesh Hariharan;Moshe Lewenstein

6
Citations

Frequent Co-Authors

Amihood Amir Bar-Ilan University

Yoram Bachrach DeepMind (United Kingdom)

Seth Pettie University of Michigan–Ann Arbor

Martin J. Strauss University of Michigan–Ann Arbor

Atri Rudra University at Buffalo, State University of New York

Hung Q. Ngo University at Buffalo, State University of New York

Anna C. Gilbert Yale University

Hagai Cohen Weizmann Institute of Science

Jeffrey S. Rosenschein Hebrew University of Jerusalem

Piotr Indyk MIT

External Links

Personal website of Ely Porat

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens a world of diverse online degrees and career options. For tech-focused students, an online bachelor’s in electrical engineering offers hands-on skills closely related to computing and emerging digital fields. These programs balance practical knowledge with technical competencies highly sought after by employers.

Not everyone wants a four-year commitment. Many students consider quick certifications that pay well as a fast track into the tech workforce. These targeted programs, such as IT support or cybersecurity certificates, can lead to lucrative entry-level positions without a lengthy degree process.

For those seeking advanced roles, the shortest masters degree options provide a way to upskill or pivot specialties rapidly, sometimes in as little as one year. This is especially appealing for working professionals.

If you’re unsure which discipline to pursue, reviewing what masters program should I do can help you identify high-demand, valuable graduate programs tailored to your background and goals. The tech field is full of possibilities—choosing the right path can ensure a rewarding and future-proof career.