Ariel Shiftan

12 papers A* 1B 2C 1Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2017 J jnl
A Grouping Approach for Succinct Dynamic Dictionary Matching.
Algorithmica
Guy Feigenblat, Ely Porat, Ariel Shiftan
2017 J jnl
Erratum to: A Grouping Approach for Succinct Dynamic Dictionary Matching.
Algorithmica
Guy Feigenblat, Ely Porat, Ariel Shiftan
2017 J jnl
d-k-min-wise independent family of hash functions.
J. Comput. Syst. Sci.
Guy Feigenblat, Ely Porat, Ariel Shiftan
2016 J jnl
Addendum to 'Exponential time improvement for min-wise based algorithms' [Information and Computation 209 (2011) 737-747].
Inf. Comput.
Guy Feigenblat, Ely Porat, Ariel Shiftan
2016 B conf
Linear Time Succinct Indexable Dictionary Construction with Applications.
DCC
Guy Feigenblat, Ely Porat, Ariel Shiftan
2016 J jnl
Set Intersection and Sequence Matching with mismatch counting.
Theor. Comput. Sci.
Ariel Shiftan, Ely Porat
2014 B conf
An Improved Query Time for Succinct Dynamic Dictionary Matching.
CPM
Guy Feigenblat, Ely Porat, Ariel Shiftan
2012 — conf
Exponential Space Improvement for minwise Based Algorithms.
FSTTCS
Guy Feigenblat, Ely Porat, Ariel Shiftan
2011 J jnl
Even Better Framework for min-wise Based Algorithms
CoRR
Guy Feigenblat, Ely Porat, Ariel Shiftan
2011 A* conf
Exponential Time Improvement for min-wise Based Algorithms.
SODA
Guy Feigenblat, Ely Porat, Ariel Shiftan
2011 J jnl
Exponential time improvement for min-wise based algorithms.
Inf. Comput.
Guy Feigenblat, Ely Porat, Ariel Shiftan
2009 C conf
Set Intersection and Sequence Matching.
SPIRE
Ariel Shiftan, Ely Porat