Jeanette P. Schmidt, Andrew F. Siegel
Abstract
We consider two hashing models for storing a set S ⊂ {0, 1, 2, …, m - 1} in a table T of size n.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We consider two hashing models for storing a set S ⊂ {0, 1, 2, …, m - 1} in a table T of size n.
Key concepts: Computer science, Hash function, Universal hashing, Hash table, Computer security, Double hashing