External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Computational Complexity of Universal Hashing

Yishay Mansour, Noam Nisan, Prasoon Tiwari. The Computational Complexity of Universal Hashing. In Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing, 14-16 May 1990, Baltimore, Maryland, USA. pages 235-243, ACM, 1990.

Abstract

Abstract is missing.

runs on