On the Size of Separating Systems and Families of Perfect Hash Functions
- 1 March 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 5 (1), 61-68
- https://doi.org/10.1137/0605009
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- On the program size of perfect and universal hash functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- The Complexity of Maintaining an Array and Computing Its Partial SumsJournal of the ACM, 1982
- Should Tables Be Sorted?Journal of the ACM, 1981
- Universal Single Transition Time Asynchronous State AssignmentsIEEE Transactions on Computers, 1969