Combinatorial techniques for universal hashing
- 1 April 1994
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 48 (2) , 337-346
- https://doi.org/10.1016/s0022-0000(05)80007-8
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Applications of combinatorial designs in computer scienceACM Computing Surveys, 1989
- Graph isomorphism is in the low hierarchyJournal of Computer and System Sciences, 1988
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- A probabilistic distributed algorithm for set intersection and its analysisTheoretical Computer Science, 1987
- NP is as easy as detecting unique solutionsTheoretical Computer Science, 1986
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981
- A note on universal classes of hash functionsInformation Processing Letters, 1980
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Affine resolvable balanced incomplete block designs: A surveyAequationes mathematicae, 1976
- THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTSBiometrika, 1946