Improved range-summable random variable construction algorithms

  title={Improved range-summable random variable construction algorithms},
  author={A. Robert Calderbank and Anna C. Gilbert and Kirill Levchenko and S. Muthukrishnan and Martin Strauss},
Range-summable universal hash functions, also known as range-summable random variables, are binary-valued hash functions which can efficiently hash single values as well as ranges of values from the domain. They have found several applications in the area of data stream processing where they are used to construct sketches---small-space summaries of the input sequence.We present two new constructions of range-summable universal hash functions on <i>n</i>-bit strings, one based on Reed-Muller… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-2 of 2 references

Universal Classes of Hash Functions

J. Comput. Syst. Sci. • 1979
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…