Ariel Shiftan

According to our database, Ariel Shiftan authored at least 11 papers between 2009 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2017

d-k-min-wise independent family of hash functions.

Guy Feigenblat, Ely Porat, Ariel Shiftan

J. Comput. Syst. Sci., 2017

Erratum to: A Grouping Approach for Succinct Dynamic Dictionary Matching.

Guy Feigenblat, Ely Porat, Ariel Shiftan

Algorithmica, 2017

A Grouping Approach for Succinct Dynamic Dictionary Matching.

Guy Feigenblat, Ely Porat, Ariel Shiftan

Algorithmica, 2017

2016

Set Intersection and Sequence Matching with mismatch counting.

Ariel Shiftan, Ely Porat

Theor. Comput. Sci., 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

Linear Time Succinct Indexable Dictionary Construction with Applications.

Guy Feigenblat, Ely Porat, Ariel Shiftan

Proceedings of the 2016 Data Compression Conference, 2016

2014

An Improved Query Time for Succinct Dynamic Dictionary Matching.

Guy Feigenblat, Ely Porat, Ariel Shiftan

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2012

Exponential Space Improvement for minwise Based Algorithms.

Guy Feigenblat, Ely Porat, Ariel Shiftan

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2011

Exponential time improvement for min-wise based algorithms.

Guy Feigenblat, Ely Porat, Ariel Shiftan

Inf. Comput., 2011

Even Better Framework for min-wise Based Algorithms

Guy Feigenblat, Ely Porat, Ariel Shiftan

CoRR, 2011

2009

Set Intersection and Sequence Matching.

Ariel Shiftan, Ely Porat

Proceedings of the String Processing and Information Retrieval, 2009