| 2026 | CPM | Hamming Distance Oracles. | Itai Boneh, Dvir Fried, Shay Golan, Matan Kraus, Ely Porat |
| 2026 | CPM | Exploring the Gap Between LCS and LCStr. | Shay Golan, Matan Kraus, Ely Porat, B. Riva Shalom |
| 2026 | CPM | Set Parameterized Matching via Multi-Layer Hashing. | Moshe Lewenstein, Ely Porat |
| 2025 | RV | Monitoring Distributed Systems Based on Partial Order Executions with Global States. | Moran Omer, Doron Peled, Ely Porat, Vijay K. Garg |
| 2025 | SPIRE | Longest Common Subsequence in K-Length Substrings for Run-Length Encoded Strings. | B. Riva Shalom, Eitan Kondratovsky, Ely Porat |
| 2024 | ESA | Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices. | Dvir Fried, Tsvi Kopelowitz, Ely Porat |
| 2024 | SPIRE | Burst Edit Distance. | Itai Boneh, Shay Golan, Avivit Levy, Ely Porat, B. Riva Shalom |
| 2023 | CPM | String Factorization via Prefix Free Families. | Matan Kraus, Moshe Lewenstein, Alexandru Popa, Ely Porat, Yonathan Sadia |
| 2022 | CPM | Partial Permutations Comparison, Maintenance and Applications. | Avivit Levy, Ely Porat, B. Riva Shalom |
| 2022 | SODA | An Improved Algorithm for The k-Dyck Edit Distance Problem. | Dvir Fried, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat, Tatiana Starikovskaya |
| 2021 | ESA | Incremental Edge Orientation in Forests. | Michael A. Bender, Tsvi Kopelowitz, William Kuszmaul, Ely Porat, Clifford Stein |
| 2021 | FOCS | Small-space and streaming pattern matching with $k$ edits. | Tomasz Kociumaka, Ely Porat, Tatiana Starikovskaya |
| 2021 | WADS | Support Optimality and Adaptive Cuckoo Filters. | Tsvi Kopelowitz, Samuel McCauley, Ely Porat |
| 2020 | CPM | The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. | Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat |
| 2020 | PODC | An | Stav Ben-Nun, Tsvi Kopelowitz, Matan Kraus, Ely Porat |
| 2020 | SODA | Locally Consistent Parsing for Text Indexing in Small Space. | Or Birenzwige, Shay Golan, Ely Porat |
| 2020 | STOC | Approximating text-to-pattern Hamming distances. | Timothy M. Chan, Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat |
| 2019 | ISAAC | On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. | Isaac Goldstein, Moshe Lewenstein, Ely Porat |
| 2019 | SODA | The streaming k-mismatch problem. | Raphal Clifford, Tomasz Kociumaka, Ely Porat |
| 2019 | WADS | Dynamic Dictionary Matching in the Online Model. | Shay Golan, Tomasz Kociumaka, Tsvi Kopelowitz, Ely Porat |
| 2018 | CPM | Quasi-Periodicity Under Mismatch Errors. | Amihood Amir, Avivit Levy, Ely Porat |
| 2018 | ESA | Improved Space-Time Tradeoffs for kSUM. | Isaac Goldstein, Moshe Lewenstein, Ely Porat |
| 2018 | ICALP | Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams. | Shay Golan, Tsvi Kopelowitz, Ely Porat |
| 2018 | SODA | A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance. | Tsvi Kopelowitz, Ely Porat |
| 2018 | SPAA | Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest. | Tsvi Kopelowitz, Ely Porat, Yair Rosenmutter |
| 2017 | CPM | Approximate Cover of Strings. | Amihood Amir, Avivit Levy, Ronit Lubin, Ely Porat |
| 2017 | ESA | Real-Time Streaming Multi-Pattern Search for Constant Alphabet. | Shay Golan, Ely Porat |
| 2017 | ISAAC | Orthogonal Vectors Indexing. | Isaac Goldstein, Moshe Lewenstein, Ely Porat |
| 2017 | WADS | Conditional Lower Bounds for Space/Time Tradeoffs. | Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat |
| 2016 | CPM | Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. | Tsvi Kopelowitz, Ely Porat, Yaron Rozen |
| 2016 | DCC | Linear Time Succinct Indexable Dictionary Construction with Applications. | Guy Feigenblat, Ely Porat, Ariel Shiftan |
| 2016 | ESA | Sublinear Distance Labeling. | Stephen Alstrup, Sren Dahlgaard, Mathias Bk Tejs Knudsen, Ely Porat |
| 2016 | ESA | Streaming Pattern Matching with d Wildcards. | Shay Golan, Tsvi Kopelowitz, Ely Porat |
| 2016 | ESA | How Hard is it to Find (Honest) Witnesses?. | Isaac Goldstein, Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat |
| 2016 | ESA | New Parameterized Algorithms for APSP in Directed Graphs. | Ely Porat, Eduard Shahbazian, Roei Tov |
| 2016 | ICALP | Distance Labeling Schemes for Trees. | Stephen Alstrup, Inge Li Grtz, Esben Bistrup Halvorsen, Ely Porat |
| 2016 | ISAAC | Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap. | Amihood Amir, Tsvi Kopelowitz, Avivit Levy, Seth Pettie, Ely Porat, B. Riva Shalom |
| 2016 | SODA | The | Raphal Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya |
| 2016 | SODA | Higher Lower Bounds from the 3SUM Conjecture. | Tsvi Kopelowitz, Seth Pettie, Ely Porat |
| 2016 | SPAA | The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. | Amihood Amir, Oren Kapah, Tsvi Kopelowitz, Moni Naor, Ely Porat |
| 2015 | ESA | Dictionary Matching in a Stream. | Raphal Clifford, Allyx Fontaine, Ely Porat, Benjamin Sach, Tatiana Starikovskaya |
| 2015 | FOCS | Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment. | Tsvi Kopelowitz, Ely Porat |
| 2015 | WADS | Dynamic Set Intersection. | Tsvi Kopelowitz, Seth Pettie, Ely Porat |
| 2014 | CPM | Dictionary Matching with One Gap. | Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom |
| 2014 | CPM | An Improved Query Time for Succinct Dynamic Dictionary Matching. | Guy Feigenblat, Ely Porat, Ariel Shiftan |
| 2014 | ICALP | For-All Sparse Recovery in Near-Optimal Time. | Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss |
| 2014 | ICALP | Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. | Tsvi Kopelowitz, Robert Krauthgamer, Ely Porat, Shay Solomon |
| 2014 | SPAA | (Near) optimal resource-competitive broadcast with jamming. | Seth Gilbert, Valerie King, Seth Pettie, Ely Porat, Jared Saia, Maxwell Young |
| 2013 | FCT | Efficient Sampling of Non-strict Turnstile Data Streams. | Neta Barkay, Ely Porat, Bar Shalem |
| 2013 | ICALP | Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints. | Yoram Bachrach, Ely Porat |
| 2013 | ICALP | ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk. | Anna C. Gilbert, Hung Q. Ngo, Ely Porat, Atri Rudra, Martin J. Strauss |
| 2013 | INFOCOM | On finding an optimal TCAM encoding scheme for packet classification. | Ori Rottenstreich, Isaac Keslassy, Avinatan Hassidim, Haim Kaplan, Ely Porat |
| 2013 | STOC | Homomorphic fingerprints under misalignments: sketching edit and shift distances. | Alexandr Andoni, Assaf Goldberger, Andrew McGregor, Ely Porat |
| 2012 | CPM | Pattern Matching in Multiple Streams. | Raphal Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach |
| 2012 | DCC | A Cuckoo Hashing Variant with Improved Memory Utilization and Insertion Time. | Ely Porat, Bar Shalem |
| 2012 | ISIT | Efficient signature scheme for network coding. | Ely Porat, Erez Waisbard |
| 2012 | PODS | Worst-case optimal join algorithms: [extended abstract]. | Hung Q. Ngo, Ely Porat, Christopher R, Atri Rudra |
| 2012 | SODA | Sublinear time, measurement-optimal, sparse recovery for all. | Ely Porat, Martin J. Strauss |
| 2012 | STACS | Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. | Hung Q. Ngo, Ely Porat, Atri Rudra |
| 2011 | CPM | Space Lower Bounds for Online Pattern Matching. | Raphal Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach |
| 2011 | ESA | Preprocess, Set, Query! | Ely Porat, Liam Roditty |
| 2011 | ICALP | Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract). | Hung Q. Ngo, Ely Porat, Atri Rudra |
| 2011 | ISAAC | Range LCP. | Amihood Amir, Alberto Apostolico, Gad M. Landau, Avivit Levy, Moshe Lewenstein, Ely Porat |
| 2011 | SODA | Exponential Time Improvement for min-wise Based Algorithms. | Guy Feigenblat, Ely Porat, Ariel Shiftan |
| 2011 | STOC | Fast moment estimation in data streams in optimal space. | Daniel M. Kane, Jelani Nelson, Ely Porat, David P. Woodruff |
| 2011 | SPIRE | Persistency in Suffix Trees with Applications to String Interval Problems. | Tsvi Kopelowitz, Moshe Lewenstein, Ely Porat |
| 2010 | FOCS | A Lower Bound for Dynamic Approximate Membership Data Structures. | Shachar Lovett, Ely Porat |
| 2010 | ICALP | Cycle Detection and Correction. | Amihood Amir, Estrella Eisenberg, Avivit Levy, Ely Porat, Natalie Shapira |
| 2010 | LATIN | Fast Set Intersection and Two-Patterns Matching. | Hagai Cohen, Ely Porat |
| 2010 | STOC | Approximate sparse recovery: optimizing time and measurements. | Anna C. Gilbert, Yi Li, Ely Porat, Martin J. Strauss |
| 2010 | SPIRE | Approximate String Matching with Stuck Address Bits. | Amihood Amir, Estrella Eisenberg, Orgad Keller, Avivit Levy, Ely Porat |
| 2009 | CSR | An Optimal Bloom Filter Replacement Based on Matrix Solving. | Ely Porat |
| 2009 | FOCS | Exact and Approximate Pattern Matching in the Streaming Model. | Benny Porat, Ely Porat |
| 2009 | IJCAI | Sketching Techniques for Collaborative Filtering. | Yoram Bachrach, Ely Porat, Jeffrey S. Rosenschein |
| 2009 | ISAAC | Range Non-overlapping Indexing. | Hagai Cohen, Ely Porat |
| 2009 | SODA | From coding theory to efficient pattern matching. | Raphal Clifford, Klim Efremenko, Ely Porat, Amir Rothschild |
| 2009 | SPIRE | Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. | Yoram Bachrach, Ralf Herbrich, Ely Porat |
| 2009 | SPIRE | The Frequent Items Problem, under Polynomial Decay, in the Streaming Model. | Guy Feigenblat, Ofra Itzhaki, Ely Porat |
| 2009 | SPIRE | Set Intersection and Sequence Matching. | Ariel Shiftan, Ely Porat |
| 2008 | CPM | Approximate String Matching with Address Bit Errors. | Amihood Amir, Yonatan Aumann, Oren Kapah, Avivit Levy, Ely Porat |
| 2008 | CPM | A Black Box for Online Approximate Pattern Matching. | Raphal Clifford, Klim Efremenko, Benny Porat, Ely Porat |
| 2008 | ICALP | Explicit Non-adaptive Combinatorial Group Testing Schemes. | Ely Porat, Amir Rothschild |
| 2008 | SODA | Approximating general metric distances between a pattern and a text. | Ely Porat, Klim Efremenko |
| 2008 | SPIRE | Mismatch Sampling. | Raphal Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild |
| 2008 | SPIRE | Approximated Pattern Matching with the L1, L2 and L | Ohad Lipsky, Ely Porat |
| 2008 | SPIRE | Pattern Matching with Pair Correlation Distance. | Benny Porat, Ely Porat, Asaf Zur |
| 2007 | CPM | Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. | Amihood Amir, Oren Kapah, Ely Porat |
| 2007 | CPM | Improved Sketching of Hamming Distance with Error Correcting. | Ely Porat, Ohad Lipsky |
| 2007 | ESA | On the Cost of Interchange Rearrangement in Strings. | Amihood Amir, Tzvika Hartman, Oren Kapah, Avivit Levy, Ely Porat |
| 2007 | ESA | Untitled record | Raphal Clifford, Klim Efremenko, Ely Porat, Amir Rothschild |
| 2007 | ISAAC | Approximate String Matching with Swap and Mismatch. | Ohad Lipsky, Benny Porat, Ely Porat, B. Riva Shalom, Asaf Tsur |
| 2007 | SPIRE | Efficient Computations of | Amihood Amir, Yonatan Aumann, Piotr Indyk, Avivit Levy, Ely Porat |
| 2007 | SPIRE | Jump-Matching with Errors. | Ayelet Butman, Noa Lewenstein, Benny Porat, Ely Porat |
| 2007 | SPIRE | A Filtering Algorithm for | Raphal Clifford, Ely Porat |
| 2007 | SPIRE | Approximate Swap and Mismatch Edit Distance. | Yair Dombb, Ohad Lipsky, Benny Porat, Ely Porat, Asaf Tsur |
| 2006 | CPM | Approximate Matching in Weighted Sequences. | Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat |
| 2006 | SODA | Pattern matching with address errors: rearrangement distances. | Amihood Amir, Yonatan Aumann, Gary Benson, Avivit Levy, Ohad Lipsky, Ely Porat, Steven Skiena, Uzi Vishne |
| 2005 | CPM | Approximate Matching in the L | Amihood Amir, Ohad Lipsky, Ely Porat, Julia Umanski |
| 2005 | SPIRE | L | Ohad Lipsky, Ely Porat |
| 2005 | SPIRE | Approximate Matching in the L | Ohad Lipsky, Ely Porat |
| 2004 | ESA | Swap and Mismatch Edit Distance. | Amihood Amir, Estrella Eisenberg, Ely Porat |
| 2004 | ICALP | Closest Pair Problems in Very High Dimensions. | Piotr Indyk, Moshe Lewenstein, Ohad Lipsky, Ely Porat |
| 2004 | SPIRE | Efficient One Dimensional Real Scaled Matching. | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat, Dekel Tsur |
| 2003 | ICALP | Function Matching: Algorithms, Applications, and a Lower Bound. | Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat |
| 2003 | ICALP | Efficient Pebbling for List Traversal Synopses. | Yossi Matias, Ely Porat |
| 2003 | WADS | Real Two Dimensional Scaled Matching. | Amihood Amir, Ayelet Butman, Moshe Lewenstein, Ely Porat |
| 2001 | SODA | Overlap matching. | Amihood Amir, Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
| 2001 | SODA | Approximate subset matching with Don't Cares. | Amihood Amir, Ely Porat, Moshe Lewenstein |
| 2001 | SODA | A faster implementation of the Goemans-Williamson clustering algorithm. | Richard Cole, Ramesh Hariharan, Moshe Lewenstein, Ely Porat |
| 2000 | SODA | Faster algorithms for string matching with | Amihood Amir, Moshe Lewenstein, Ely Porat |