1.8k citations
- Tel Aviv UniversityIL46 papers
- Boston UniversityUS31 papers
- Ben-Gurion University of the NegevIL28 papers
- Ariel UniversityIL27 papers
- Technion – Israel Institute of TechnologyIL26 papers
- University of Maryland, College ParkUS26 papers
- Centre National de la Recherche ScientifiqueFR23 papers
- Hebrew University of JerusalemIL23 papers
- Weizmann Institute of ScienceIL19 papers
- University of ChicagoUS17 papers
- Harvard UniversityUS16 papers
- Massachusetts Institute of TechnologyUS15 papers
Showing 2010 · cs.DSShow all
3 papers · 2 filters
cs.DS2010★ 8 cited
Fast Pseudo-Random Fingerprints
Yoram Bachrach, Ely Porat
We propose a method to exponentially speed up computation of various fingerprints, such as the ones used to compute similarity and rarity in massive data sets. Rather then maintain…
cs.DS2010★ 4 cited
Fast Moment Estimation in Data Streams in Optimal Space
Daniel M. Kane, Jelani Nelson, Ely Porat +1
We give a space-optimal algorithm with update time O(log^2(1/eps)loglog(1/eps)) for (1+eps)-approximating the pth frequency moment, 0 < p < 2, of a length-n vector updated in a dat…
cs.DS2010
Restricted Common Superstring and Restricted Common Supersequence
Raphaël Clifford, Zvi Gotthilf, Moshe Lewenstein +1
The {\em shortest common superstring} and the {\em shortest common supersequence} are two well studied problems having a wide range of applications. In this paper we consider both…