8 citations · 8 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2008★ 8 cited
An Optimal Bloom Filter Replacement Based on Matrix Solving
Ely Porat
We suggest a method for holding a dictionary data structure, which maps keys to values, in the spirit of Bloom Filters. The space requirements of the dictionary we suggest are much…
cs.DS2008
Approximating General Metric Distances Between a Pattern and a Text
Klim Efremenko, Ely Porat
Let be a text and a pattern taken from some finite alphabet set , and let $\dist$ be a metric on . We consider the problem of calcul…
cs.DS2008
Improved Deterministic Length Reduction
Amihood Amir, Klim Efremenko, Oren Kapah +2
This paper presents a new technique for deterministic length reduction. This technique improves the running time of the algorithm presented in \cite{LR07} for performing fast convo…