Author:
Ajtai M.,Fredman M.,Komlós J.
Reference4 articles.
1. On the size of separating systems and families of perfect hash functions;Fredman;SIAM J. Algebraic and Discrete Methods,1984
2. Storing a sparse table with O(1) worst case access time;Fredman,1982
3. On the program size of perfect and universal hash functions;Melhorn,1982
4. Should tables be sorted;Yao;J. Assoc. Comput. Mach.,1981
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献