Approximate Swapped Matching. - Amihood Amir; Moshe Lewenstein; Ely Porat (FSTTCS, 2000)

Faster algorithms for string matching with k mismatches. - Amihood Amir; Moshe Lewenstein; Ely Porat (SODA, 2000)

Overlap matching. - Amihood Amir; Richard Cole 001; Ramesh Hariharan; Moshe Lewenstein; Ely Porat (SODA, 2001)

Approximate subset matching with Don't Cares. - Amihood Amir; Ely Porat; Moshe Lewenstein (SODA, 2001)

A faster implementation of the Goemans-Williamson clustering algorithm. - Richard Cole 001; Ramesh Hariharan; Moshe Lewenstein; Ely Porat (SODA, 2001)

Function Matching: Algorithms, Applications, and a Lower Bound. - Amihood Amir; Yonatan Aumann; Richard Cole 001; Moshe Lewenstein; Ely Porat (ICALP, 2003)

Efficient Pebbling for List Traversal Synopses. - Yossi Matias; Ely Porat (ICALP, 2003)

Real Two Dimensional Scaled Matching. - Amihood Amir; Ayelet Butman; Moshe Lewenstein; Ely Porat (WADS, 2003)

Swap and Mismatch Edit Distance. - Amihood Amir; Estrella Eisenberg; Ely Porat (ESA, 2004)

Closest Pair Problems in Very High Dimensions. - Piotr Indyk; Moshe Lewenstein; Ohad Lipsky; Ely Porat (ICALP, 2004)

Efficient One Dimensional Real Scaled Matching. - Amihood Amir; Ayelet Butman; Moshe Lewenstein; Ely Porat; Dekel Tsur (SPIRE, 2004)

Faster algorithms for string matching with k mismatches. - Amihood Amir; Moshe Lewenstein; Ely Porat (J. Algorithms, 2004)

Approximate Matching in the L1 Metric. - Amihood Amir; Ohad Lipsky; Ely Porat; Julia Umanski (CPM, 2005)

Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. - Tsvi Kopelowitz; Ely Porat (ICTCS, 2005)

L1 Pattern Matching Lower Bound. - Ohad Lipsky; Ely Porat (SPIRE, 2005)

Approximate Matching in the Linfinity Metric. - Ohad Lipsky; Ely Porat (SPIRE, 2005)

Approximate Matching in Weighted Sequences. - Amihood Amir; Costas S. Iliopoulos; Oren Kapah; Ely Porat (CPM, 2006)

LTS: The List-Traversal Synopses System. - Michael Furman; Yossi Matias; Ely Porat (NGITS, 2006)

Pattern matching with address errors: rearrangement distances. - Amihood Amir; Yonatan Aumann; Gary Benson; Avivit Levy; Ohad Lipsky; Ely Porat; Steven Skiena; Uzi Vishne (SODA, 2006)

Finding the Position of the k-Mismatch and Approximate Tandem Repeats. - Haim Kaplan; Ely Porat; Nira Shafrir (SWAT, 2006)

Function Matching. - Amihood Amir; Yonatan Aumann; Moshe Lewenstein; Ely Porat (SIAM J. Comput., 2006)

Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications. - Amihood Amir; Oren Kapah; Ely Porat (CPM, 2007)

Improved Sketching of Hamming Distance with Error Correcting. - Ely Porat; Ohad Lipsky (CPM, 2007)

On the Cost of Interchange Rearrangement in Strings. - Amihood Amir; Tzvika Hartman; Oren Kapah; Avivit Levy; Ely Porat (ESA, 2007)

k -Mismatch with Don't Cares. - Raphaël Clifford; Klim Efremenko; Ely Porat; Amir Rothschild (ESA, 2007)

Approximate String Matching with Swap and Mismatch. - Ohad Lipsky; Benny Porat; Ely Porat; B. Riva Shalom; Asaf Tsur (ISAAC, 2007)

Efficient Computations of l1 and linfinity Rearrangement Distances. - Amihood Amir; Yonatan Aumann; Piotr Indyk; Avivit Levy; Ely Porat (SPIRE, 2007)

Jump-Matching with Errors. - Ayelet Butman; Noa Lewenstein; Benny Porat; Ely Porat (SPIRE, 2007)

A Filtering Algorithm for k -Mismatch with Don't Cares. - Raphaël Clifford; Ely Porat (SPIRE, 2007)

Approximate Swap and Mismatch Edit Distance. - Yair Dombb; Ohad Lipsky; Benny Porat; Ely Porat; Asaf Tsur (SPIRE, 2007)

Efficient pebbling for list traversal synopses with application to program rollback. - Yossi Matias; Ely Porat (Theor. Comput. Sci., 2007)

Power and stability in connectivity games. - Yoram Bachrach; Jeffrey S. Rosenschein; Ely Porat (AAMAS (2), 2008)

Computing a Longest Increasing Subsequence of Length k in Time O(n log log k). - Maxime Crochemore; Ely Porat (BCS Int. Acad. Conf., 2008)

Approximate String Matching with Address Bit Errors. - Amihood Amir; Yonatan Aumann; Oren Kapah; Avivit Levy; Ely Porat (CPM, 2008)

A Black Box for Online Approximate Pattern Matching. - Raphaël Clifford; Klim Efremenko; Benny Porat; Ely Porat (CPM, 2008)

Approximating general metric distances between a pattern and a text. - Ely Porat; Klim Efremenko (SODA, 2008)

Mismatch Sampling. - Raphaël Clifford; Klim Efremenko; Benny Porat; Ely Porat; Amir Rothschild (SPIRE, 2008)

Approximated Pattern Matching with the L1, L2 and Linfinit Metrics. - Ohad Lipsky; Ely Porat (SPIRE, 2008)

Pattern Matching with Pair Correlation Distance. - Benny Porat; Ely Porat; Asaf Zur (SPIRE, 2008)

Improved Deterministic Length Reduction - Amihood Amir; Klim Efremenko; Oren Kapah; Ely Porat; Amir Rothschild (CoRR, 2008)

An Optimal Bloom Filter Replacement Based on Matrix Solving. - Ely Porat (CSR, 2009)

Pattern matching with don't cares and few errors. - Raphaël Clifford; Klim Efremenko; Ely Porat; Amir Rothschild (Search Methodologies, 2009)

Explicit Non-Adaptive Combinatorial Group Testing Schemes. - Ely Porat; Amir Rothschild (Search Methodologies, 2009)

Exact and Approximate Pattern Matching in the Streaming Model. - Benny Porat; Ely Porat (FOCS, 2009)

Sketching Techniques for Collaborative Filtering. - Yoram Bachrach; Ely Porat; Jeffrey S. Rosenschein (IJCAI, 2009)

Range Non-overlapping Indexing. - Hagai Cohen; Ely Porat (ISAAC, 2009)

From coding theory to efficient pattern matching. - Raphaël Clifford; Klim Efremenko; Ely Porat; Amir Rothschild (SODA, 2009)

Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems. - Yoram Bachrach; Ralf Herbrich; Ely Porat (SPIRE, 2009)

The Frequent Items Problem, under Polynomial Decay, in the Streaming Model. - Guy Feigenblat; Ofra Itzhaki; Ely Porat (SPIRE, 2009)

Set Intersection and Sequence Matching. - Ariel Shiftan; Ely Porat (SPIRE, 2009)

Efficient computations of l1 and l∞ rearrangement distances. - Amihood Amir; Yonatan Aumann; Piotr Indyk; Avivit Levy; Ely Porat (Theor. Comput. Sci., 2009)

Path disruption games. - Yoram Bachrach; Ely Porat (AAMAS, 2010)

A Lower Bound for Dynamic Approximate Membership Data Structures. - Shachar Lovett; Ely Porat (FOCS, 2010)

Cycle Detection and Correction. - Amihood Amir; Estrella Eisenberg; Avivit Levy; Ely Porat; Natalie Shapira (ICALP (1), 2010)

Weight Distribution and List-Decoding Size of Reed-Muller Codes. - Tali Kaufman; Shachar Lovett; Ely Porat (ICS, 2010)

Fast Set Intersection and Two-Patterns Matching. - Hagai Cohen; Ely Porat (LATIN, 2010)

Approximate String Matching with Stuck Address Bits. - Amihood Amir; Estrella Eisenberg; Orgad Keller; Avivit Levy; Ely Porat (SPIRE, 2010)

Approximate sparse recovery: optimizing time and measurements. - Anna C. Gilbert; Yi Li 002; Ely Porat; Martin J. Strauss (STOC, 2010)

On the hardness of distance oracle for sparse graph - Hagai Cohen; Ely Porat (CoRR, 2010)

Fast Pseudo-Random Fingerprints - Yoram Bachrach; Ely Porat (CoRR, 2010)

Fast computation of a longest increasing subsequence and application. - Maxime Crochemore; Ely Porat (Inf. Comput., 2010)

String matching with up to k swaps and mismatches. - Ohad Lipsky; Benny Porat; Ely Porat; B. Riva Shalom; Asaf Tsur (Inf. Comput., 2010)

A filtering algorithm for k-mismatch with don't cares. - Raphaël Clifford; Ely Porat (Inf. Process. Lett., 2010)

Toward Real Time Internet Traffic Monitoring. - Benny Porat; Ely Porat (Web Intelligence and Security - Advances in Data and Text Mining Techniques for Detecting and Preventing Terrorist Activities on the Web, 2010)

Space Lower Bounds for Online Pattern Matching. - Raphaël Clifford; Markus Jalsenius; Ely Porat; Benjamin Sach (CPM, 2011)

Preprocess, Set, Query! - Ely Porat; Liam Roditty (ESA, 2011)

Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract). - Hung Q. Ngo 001; Ely Porat; Atri Rudra (ICALP (1), 2011)

Range LCP. - Amihood Amir; Alberto Apostolico; Gad M. Landau; Avivit Levy; Moshe Lewenstein; Ely Porat (ISAAC, 2011)

Camouflaged Private Communication. - Amir Herzberg; Ely Porat; Nir Soffer; Erez Waisbard (SocialCom/PASSAT, 2011)

Exponential Time Improvement for min-wise Based Algorithms. - Guy Feigenblat; Ely Porat; Ariel Shiftan (SODA, 2011)

Persistency in Suffix Trees with Applications to String Interval Problems. - Tsvi Kopelowitz; Moshe Lewenstein; Ely Porat (SPIRE, 2011)

Fast moment estimation in data streams in optimal space. - Daniel M. Kane; Jelani Nelson; Ely Porat; David P. Woodruff (STOC, 2011)

Approximate Pattern Matching with the L1, L2 and L∞ Metrics. - Ohad Lipsky; Ely Porat (Algorithmica, 2011)

Even Better Framework for min-wise Based Algorithms - Guy Feigenblat; Ely Porat; Ariel Shiftan (CoRR, 2011)

Another one flew over the cuckoo's nest - Ely Porat; Bar Shalem (CoRR, 2011)

Explicit Nonadaptive Combinatorial Group Testing Schemes. - Ely Porat; Amir Rothschild (IEEE Trans. Inf. Theory, 2011)

Pattern Matching in Multiple Streams. - Raphaël Clifford; Markus Jalsenius; Ely Porat; Benjamin Sach (CPM, 2012)

A Cuckoo Hashing Variant with Improved Memory Utilization and Insertion Time. - Ely Porat; Bar Shalem (DCC, 2012)

Exponential Space Improvement for minwise Based Algorithms. - Guy Feigenblat; Ely Porat; Ariel Shiftan (FSTTCS, 2012)

Efficient signature scheme for network coding. - Ely Porat; Erez Waisbard (ISIT, 2012)

Worst-case optimal join algorithms: [extended abstract]. - Hung Q. Ngo 001; Ely Porat; Christopher Ré; Atri Rudra (PODS, 2012)

Sublinear time, measurement-optimal, sparse recovery for all. - Ely Porat; Martin J. Strauss (SODA, 2012)

Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. - Hung Q. Ngo 001; Ely Porat; Atri Rudra (STACS, 2012)

Feasible Sampling of Non-strict Turnstile Data Streams - Neta Barkay; Ely Porat; Bar Shalem (CoRR, 2012)

Efficient Sampling of Non-strict Turnstile Data Streams. - Neta Barkay; Ely Porat; Bar Shalem (FCT, 2013)

Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints. - Yoram Bachrach; Ely Porat (ICALP (2), 2013)

ℓ2/ℓ2-Foreach Sparse Recovery with Low Risk. - Anna C. Gilbert; Hung Q. Ngo 001; Ely Porat; Atri Rudra; Martin J. Strauss (ICALP (1), 2013)

On finding an optimal TCAM encoding scheme for packet classification. - Ori Rottenstreich; Isaac Keslassy; Avinatan Hassidim; Haim Kaplan; Ely Porat (INFOCOM, 2013)

Homomorphic fingerprints under misalignments: sketching edit and shift distances. - Alexandr Andoni; Assaf Goldberger; Andrew McGregor 001; Ely Porat (STOC, 2013)

Guest Editorial for "Group Testing: models and applications". - Ferdinando Cicalese; Ely Porat (Algorithmica, 2013)

Sharing Rewards in Cooperative Connectivity Games. - Yoram Bachrach; Ely Porat; Jeffrey S. Rosenschein (J. Artif. Intell. Res., 2013)

Pattern Matching under Polynomial Transformation. - Ayelet Butman; Peter Clifford; Raphaël Clifford; Markus Jalsenius; Noa Lewenstein; Benny Porat; Ely Porat; Benjamin Sach (SIAM J. Comput., 2013)

A Space Lower Bound for Dynamic Approximate Membership Data Structures. - Shachar Lovett; Ely Porat (SIAM J. Comput., 2013)

Building a personalized tourist attraction recommender system using crowdsourcing. - Yoram Bachrach; Sofia Ceppi; Ian A. Kash; Peter B. Key; Filip Radlinski; Ely Porat; Michael Armstrong; Vijay Sharma (AAMAS, 2014)

Dictionary Matching with One Gap. - Amihood Amir; Avivit Levy; Ely Porat; B. Riva Shalom (CPM, 2014)

An Improved Query Time for Succinct Dynamic Dictionary Matching. - Guy Feigenblat; Ely Porat; Ariel Shiftan (CPM, 2014)

For-All Sparse Recovery in Near-Optimal Time. - Anna C. Gilbert; Yi Li 002; Ely Porat; Martin J. Strauss (ICALP (1), 2014)

Orienting Fully Dynamic Graphs with Worst-Case Time Bounds. - Tsvi Kopelowitz; Robert Krauthgamer; Ely Porat; Shay Solomon (ICALP (2), 2014)

(Near) optimal resource-competitive broadcast with jamming. - Seth Gilbert; Valerie King; Seth Pettie; Ely Porat; Jared Saia; Maxwell Young (SPAA, 2014)

Polynomials: a new tool for length reduction in binary discrete convolutions. - Amihood Amir; Oren Kapah; Ely Porat; Amir Rothschild (CoRR, 2014)

Word-packing Algorithms for Dynamic Connectivity and Dynamic Sets. - Casper Kejlberg-Rasmussen; Tsvi Kopelowitz; Seth Pettie; Ely Porat (CoRR, 2014)

3SUM Hardness in (Dynamic) Data Structures. - Tsvi Kopelowitz; Seth Pettie; Ely Porat (CoRR, 2014)

Dictionary Matching in a Stream. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (ESA, 2015)

Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment. - Tsvi Kopelowitz; Ely Porat (FOCS, 2015)

Dynamic Set Intersection. - Tsvi Kopelowitz; Seth Pettie; Ely Porat (WADS, 2015)

Sublinear distance labeling for sparse graphs. - Stephen Alstrup; Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Ely Porat (CoRR, 2015)

Online Dictionary Matching with One Gap. - Amihood Amir; Tsvi Kopelowitz; Avivit Levy; Seth Pettie; Ely Porat; B. Riva Shalom (CoRR, 2015)

The k-mismatch problem revisited. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (CoRR, 2015)

Breaking the Variance: Approximating the Hamming Distance in $ tilde O(1/ε)$ Time Per Alignment. - Tsvi Kopelowitz; Ely Porat (CoRR, 2015)

Fingerprints for highly similar streams. - Yoram Bachrach; Ely Porat (Inf. Comput., 2015)

A PTAS for the Square Tiling Problem. - Amihood Amir; Alberto Apostolico; Gad M. Landau; Ely Porat; Oren Sar Shalom (Theor. Comput. Sci., 2015)

Dictionary matching with a few gaps. - Amihood Amir; Avivit Levy; Ely Porat; B. Riva Shalom (Theor. Comput. Sci., 2015)

Succinct Online Dictionary Matching with Improved Worst-Case Guarantees. - Tsvi Kopelowitz; Ely Porat; Yaron Rozen (CPM, 2016)

Linear Time Succinct Indexable Dictionary Construction with Applications. - Guy Feigenblat; Ely Porat; Ariel Shiftan (DCC, 2016)

Sublinear Distance Labeling. - Stephen Alstrup; Søren Dahlgaard; Mathias Bæk Tejs Knudsen; Ely Porat (ESA, 2016)

Streaming Pattern Matching with d Wildcards. - Shay Golan 001; Tsvi Kopelowitz; Ely Porat (ESA, 2016)

How Hard is it to Find (Honest) Witnesses?. - Isaac Goldstein; Tsvi Kopelowitz; Moshe Lewenstein; Ely Porat (ESA, 2016)

New Parameterized Algorithms for APSP in Directed Graphs. - Ely Porat; Eduard Shahbazian; Roei Tov (ESA, 2016)

Distance Labeling Schemes for Trees. - Stephen Alstrup; Inge Li Gørtz; Esben Bistrup Halvorsen; Ely Porat (ICALP, 2016)

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 (ISAAC, 2016)

The k-mismatch problem revisited. - Raphaël Clifford; Allyx Fontaine; Ely Porat; Benjamin Sach; Tatiana Starikovskaya (SODA, 2016)

Higher Lower Bounds from the 3SUM Conjecture. - Tsvi Kopelowitz; Seth Pettie; Ely Porat (SODA, 2016)

The Family Holiday Gathering Problem or Fair and Periodic Scheduling of Independent Sets. - Amihood Amir; Oren Kapah; Tsvi Kopelowitz; Moni Naor; Ely Porat (SPAA, 2016)

Addendum to 'Exponential time improvement for min-wise based algorithms' [Information and Computation 209 (2011) 737-747]. - Guy Feigenblat; Ely Porat; Ariel Shiftan (Inf. Comput., 2016)

Special issue in honor of the 60th birthday of Amihood Amir. - Gary Benson; Martin Farach-Colton; Moshe Lewenstein; Ely Porat (Theor. Comput. Sci., 2016)

Corrigendum to "The frequent items problem, under polynomial decay, in the streaming model" [Theoret. Comput. Sci. 411(34-36) (2010) 3048-3054]. - Guy Feigenblat; Ofra Itzhaki; Ely Porat (Theor. Comput. Sci., 2016)

Set Intersection and Sequence Matching with mismatch counting. - Ariel Shiftan; Ely Porat (Theor. Comput. Sci., 2016)

Optimal In/Out TCAM Encodings of Ranges. - Ori Rottenstreich; Isaac Keslassy; Avinatan Hassidim; Haim Kaplan; Ely Porat (IEEE/ACM Trans. Netw., 2016)

Approximate Cover of Strings. - Amihood Amir; Avivit Levy; Ronit Lubin; Ely Porat (CPM, 2017)

Real-Time Streaming Multi-Pattern Search for Constant Alphabet. - Shay Golan 001; Ely Porat (ESA, 2017)

Simultaneously Load Balancing for Every p-norm, With Reassignments. - Aaron Bernstein; Tsvi Kopelowitz; Seth Pettie; Ely Porat; Clifford Stein 001 (ITCS, 2017)

Orthogonal Vectors Indexing. - Isaac Goldstein; Moshe Lewenstein; Ely Porat (ISAAC, 2017)

Online Recognition of Dictionary with One Gap. - Amihood Amir; Avivit Levy; Ely Porat; B. Riva Shalom (PSC, 2017)

Conditional Lower Bounds for Space/Time Tradeoffs. - Isaac Goldstein; Tsvi Kopelowitz; Moshe Lewenstein; Ely Porat (WADS, 2017)

A Grouping Approach for Succinct Dynamic Dictionary Matching. - Guy Feigenblat; Ely Porat; Ariel Shiftan (Algorithmica, 2017)

Erratum to: A Grouping Approach for Succinct Dynamic Dictionary Matching. - Guy Feigenblat; Ely Porat; Ariel Shiftan (Algorithmica, 2017)

d-k-min-wise independent family of hash functions. - Guy Feigenblat; Ely Porat; Ariel Shiftan (J. Comput. Syst. Sci., 2017)

Quasi-Periodicity Under Mismatch Errors. - Amihood Amir; Avivit Levy; Ely Porat (CPM, 2018)

Improved Space-Time Tradeoffs for kSUM. - Isaac Goldstein; Moshe Lewenstein; Ely Porat (ESA, 2018)

Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams. - Shay Golan 001; Tsvi Kopelowitz; Ely Porat (ICALP, 2018)

A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance. - Tsvi Kopelowitz; Ely Porat (SOSA, 2018)

Improved Worst-Case Deterministic Parallel Dynamic Minimum Spanning Forest. - Tsvi Kopelowitz; Ely Porat; Yair Rosenmutter (SPAA, 2018)

Worst-case Optimal Join Algorithms. - Hung Q. Ngo 001; Ely Porat; Christopher Ré; Atri Rudra (J. ACM, 2018)

Identification of Parallel Passages Across a Large Hebrew/Aramaic Corpus. - Avi Shmidman; Moshe Koppel; Ely Porat (J. Data Min. Digit. Humanit., 2018)

On the Hardness of Set Disjointness and Set Intersection with Bounded Universe. - Isaac Goldstein; Moshe Lewenstein; Ely Porat (ISAAC, 2019)

The streaming k-mismatch problem. - Raphaël Clifford; Tomasz Kociumaka; Ely Porat (SODA, 2019)

Dynamic Dictionary Matching in the Online Model. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (WADS, 2019)

Mind the Gap! - Online Dictionary Matching with One Gap. - Amihood Amir; Tsvi Kopelowitz; Avivit Levy; Seth Pettie; Ely Porat; B. Riva Shalom (Algorithmica, 2019)

The Strong 3SUM-INDEXING Conjecture is False. - Tsvi Kopelowitz; Ely Porat (CoRR, 2019)

{-1, 0, 1}-APSP and (min, max)-Product Problems. - Hodaya Barr; Tsvi Kopelowitz; Ely Porat; Liam Roditty (CoRR, 2019)

Improved Circular k-Mismatch Sketches. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Przemyslaw Uznanski (APPROX-RANDOM, 2020)

The Streaming k-Mismatch Problem: Tradeoffs Between Space and Total Time. - Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (CPM, 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 (PODC, 2020)

Locally Consistent Parsing for Text Indexing in Small Space. - Or Birenzwige; Shay Golan 001; Ely Porat (SODA, 2020)

Constructions and Applications for Accurate Counting of the Bloom Filter False Positive Free Zone. - Ori Rottenstreich; Pedro Reviriego; Ely Porat; S. Muthukrishnan 001 (SOSR, 2020)

Approximating text-to-pattern Hamming distances. - Timothy M. Chan; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat (STOC, 2020)

An O(log3/2n) Parallel Time Population Protocol for Majority with O(log n) States. - Stav Ben-Nun; Tsvi Kopelowitz; Matan Kraus; Ely Porat (CoRR, 2020)

Incremental Edge Orientation in Forests. - Michael A. Bender; Tsvi Kopelowitz; William Kuszmaul; Ely Porat; Clifford Stein 001 (ESA, 2021)

Small-space and streaming pattern matching with $k$ edits. - Tomasz Kociumaka; Ely Porat; Tatiana Starikovskaya (FOCS, 2021)

Support Optimality and Adaptive Cuckoo Filters. - Tsvi Kopelowitz; Samuel McCauley; Ely Porat (WADS, 2021)

Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions. - Ori Rottenstreich; Pedro Reviriego; Ely Porat; S. Muthukrishnan 001 (IEEE Trans. Netw. Serv. Manag., 2021)

Partial Permutations Comparison, Maintenance and Applications. - Avivit Levy; Ely Porat; B. Riva Shalom (CPM, 2022)

An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (SODA, 2022)

String Factorization via Prefix Free Families. - Matan Kraus; Moshe Lewenstein; Alexandru Popa 001; Ely Porat; Yonathan Sadia (CPM, 2023)

FiSSC: Finding smallest sequence covers to sets of degenerate reads with applications to RNA editing. - Ido Tziony; Jonathan Mandl; Kobi Shapira; Eli Eisenberg; Ely Porat; Yaron Orenstein (BCB, 2024)

Removing the log Factor from (min, +)-Products on Bounded Range Integer Matrices. - Dvir Fried; Tsvi Kopelowitz; Ely Porat (ESA, 2024)

Burst Edit Distance. - Itai Boneh; Shay Golan 001; Avivit Levy; Ely Porat; B. Riva Shalom (SPIRE, 2024)

An Improved Algorithm for The k-Dyck Edit Distance Problem. - Dvir Fried; Shay Golan 001; Tomasz Kociumaka; Tsvi Kopelowitz; Ely Porat; Tatiana Starikovskaya (ACM Trans. Algorithms, 2024)

Iteration-Free quantum approximate optimization algorithm using neural networks. - Ohad Amosy; Tamuz Danzig; Ohad Lev; Ely Porat; Gal Chechik; Adi Makmal (Quantum Mach. Intell., 2024)

Monitoring Distributed Systems Based on Partial Order Executions with Global States. - Moran Omer; Doron Peled; Ely Porat; Vijay K. Garg (RV, 2025)

Longest Common Subsequence in K-Length Substrings for Run-Length Encoded Strings. - B. Riva Shalom; Eitan Kondratovsky; Ely Porat (SPIRE, 2025)