Even Strongly Universal Hashing is Pretty Fast

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Standard

Even Strongly Universal Hashing is Pretty Fast. / Thorup, Mikkel.

Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA). 2000. p. 496-497.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Harvard

Thorup, M 2000, Even Strongly Universal Hashing is Pretty Fast. in Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA). pp. 496-497.

APA

Thorup, M. (2000). Even Strongly Universal Hashing is Pretty Fast. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 496-497)

Vancouver

Thorup M. Even Strongly Universal Hashing is Pretty Fast. In Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA). 2000. p. 496-497

Author

Thorup, Mikkel. / Even Strongly Universal Hashing is Pretty Fast. Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA). 2000. pp. 496-497

Bibtex

@inproceedings{5a83bce31b7b41b59be8025a53675f1f,
title = "Even Strongly Universal Hashing is Pretty Fast",
author = "Mikkel Thorup",
year = "2000",
language = "English",
pages = "496--497",
booktitle = "Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA)",

}

RIS

TY - GEN

T1 - Even Strongly Universal Hashing is Pretty Fast

AU - Thorup, Mikkel

PY - 2000

Y1 - 2000

M3 - Article in proceedings

SP - 496

EP - 497

BT - Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA)

ER -

ID: 98317170