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

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

Exponential time improvement for min-wise based algorithms. - Guy Feigenblat; Ely Porat; Ariel Shiftan (Inf. Comput., 2011)

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

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

Linear Time Succinct Indexable Dictionary Construction with Applications. - Guy Feigenblat; Ely Porat; Ariel Shiftan (DCC, 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)

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

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)