Ely Porat (אלי פורת)

Ely Porat (אלי פורת)

Bar-Ilan University

H-index: 35

Asia-Israel

About Ely Porat (אלי פורת)

Ely Porat (אלי פורת), With an exceptional h-index of 35 and a recent h-index of 22 (since 2020), a distinguished researcher at Bar-Ilan University, specializes in the field of Algorithm, Data Structure.

His recent articles reflect a diverse array of research interests and contributions to the field:

String Factorization via Prefix Free Families

An Improved Algorithm for The k-Dyck Edit Distance Problem

Small-space and streaming pattern matching with edits

Partial Permutations Comparison, Maintenance and Applications

Iterative-free quantum approximate optimization algorithm using neural networks

Avoiding flow size overestimation in Count-Min sketch with Bloom filter constructions

Support optimality and adaptive cuckoo filters

Incremental edge orientation in forests

Ely Porat (אלי פורת) Information

University

Position

___

Citations(all)

4457

Citations(since 2020)

1848

Cited By

3540

hIndex(all)

35

hIndex(since 2020)

22

i10Index(all)

108

i10Index(since 2020)

54

Email

University Profile Page

Bar-Ilan University

Google Scholar

View Google Scholar Profile

Ely Porat (אלי פורת) Skills & Research Interests

Algorithm

Data Structure

Top articles of Ely Porat (אלי פורת)

Title

Journal

Author(s)

Publication Date

String Factorization via Prefix Free Families

Matan Kraus

Moshe Lewenstein

Alexandru Popa

Ely Porat

Yonathan Sadia

2023

An Improved Algorithm for The k-Dyck Edit Distance Problem

ACM Transactions on Algorithms

Dvir Fried

Shay Golan

Tomasz Kociumaka

Tsvi Kopelowitz

Ely Porat

...

2022/8

Small-space and streaming pattern matching with edits

Tomasz Kociumaka

Ely Porat

Tatiana Starikovskaya

2022/2/7

Partial Permutations Comparison, Maintenance and Applications

Avivit Levy

Ely Porat

B Riva Shalom

2022

Iterative-free quantum approximate optimization algorithm using neural networks

arXiv preprint arXiv:2208.09888

Ohad Amosy

Tamuz Danzig

Ely Porat

Gal Chechik

Adi Makmal

2022/8/21

Avoiding flow size overestimation in Count-Min sketch with Bloom filter constructions

IEEE Transactions on Network and Service Management

Ori Rottenstreich

Pedro Reviriego

Ely Porat

S Muthukrishnan

2021/3/25

Support optimality and adaptive cuckoo filters

Tsvi Kopelowitz

Samuel McCauley

Ely Porat

2021/7/31

Incremental edge orientation in forests

arXiv preprint arXiv:2107.02318

Michael A Bender

Tsvi Kopelowitz

William Kuszmaul

Ely Porat

Clifford Stein

2021/7/5

The streaming k-mismatch problem: Tradeoffs between space and total time

arXiv preprint arXiv:2004.12881

Shay Golan

Tomasz Kociumaka

Tsvi Kopelowitz

Ely Porat

2020/4/27

Constructions and applications for accurate counting of the bloom filter false positive free zone

Ori Rottenstreich

Pedro Reviriego

Ely Porat

S Muthukrishnan

2020/3/3

Online recognition of dictionary with one gap

Information and Computation

Amihood Amir

Avivit Levy

Ely Porat

B Riva Shalom

2020/12/1

Locally consistent parsing for text indexing in small space

Or Birenzwige

Shay Golan

Ely Porat

2020

An O(log3/2 n) Parallel Time Population Protocol for Majority with O(log n) States

Stav Ben-Nun

Tsvi Kopelowitz

Matan Kraus

Ely Porat

2020/7/31

Improved Circular -Mismatch Sketches

arXiv preprint arXiv:2006.13673

Shay Golan

Tomasz Kociumaka

Tsvi Kopelowitz

Ely Porat

Przemysław Uznański

2020/6/24

Approximating text-to-pattern Hamming distances

Timothy M Chan

Shay Golan

Tomasz Kociumaka

Tsvi Kopelowitz

Ely Porat

2020/6/22

See List of Professors in Ely Porat (אלי פורת) University(Bar-Ilan University)

Co-Authors

H-index: 87
Christopher Ré

Christopher Ré

Stanford University

H-index: 85
Piotr Indyk

Piotr Indyk

Massachusetts Institute of Technology

H-index: 57
Haim Kaplan

Haim Kaplan

Tel Aviv University

H-index: 56
Richard Cole

Richard Cole

New York University

H-index: 41
Amihood Amir

Amihood Amir

Bar-Ilan University

H-index: 37
Seth Pettie

Seth Pettie

University of Michigan-Dearborn

academic-engine