Fast universal hashing with small keys and no preprocessing: The PolyR construction.

From MaRDI portal
















This page was built for publication: Fast universal hashing with small keys and no preprocessing: The PolyR construction.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2763025)