Skip to main content
Book ChapterOPEN ACCESS

Universal hashing via integer arithmetic without primes, revisited

Springer Verlag, (2018), 257-279
DOI: 10.1007/978-3-319-98355-4_15
5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Let u, m≥ 1 be arbitrary integers and let r≥ (u- 1) m be any multiple of m. Consider the multiset (“class”) Hu,m,rlin={ha,b∣0≤a,b

Cite

CITATION STYLE

APA

Dietzfelbinger, M. (2018). Universal hashing via integer arithmetic without primes, revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11011 LNCS, pp. 257–279). Springer Verlag. https://doi.org/10.1007/978-3-319-98355-4_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free