My primary research field is algorithms for big data, sub linear algorithms, sketching, streaming algorithms, data structures, coding theory, group testing, compressed sensing and pattern matching.
ABOUT MY WORK
I completed my PhD in 2001, at the age of 21. Thereafter, in parallel to acting as section head of a research group during my extended military service, I was an Assistant Professor at BIU and became an Associate Professor when I was 27 years old. To date, I am a Full Professor. A big part of my work is interdisciplinary, and I have combined methods from different areas on more than one occasion.
SELECTED PUBLICATIONS
1. Hung Q. Ngo, Ely Porat, Christopher Ré, Atri Rudra:
Worst-case Optimal Join Algorithms. J. ACM 65(3): 16:1-16:40 (2018)
2. Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss:
For-All Sparse Recovery in Near-Optimal Time. ACM Trans. Algorithms 13(3): 32:1-32:26 (2017)
3. Guy Feigenblat, Ely Porat, Ariel Shiftan:
d-k-min-wise independent family of hash functions. J. Comput. Syst. Sci. 84: 171-184 (2017)
4. Shay Golan, Ely Porat:
Real-Time Streaming Multi-Pattern Search for Constant Alphabet. ESA 2017: 41:1-41:15
5. Stephen Alstrup, Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Ely Porat:
Sublinear Distance Labeling. ESA 2016: 5:1-5:15
