Author:
Czech Zbigniew J.,Havas George,Majewski Bohdan S.
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference31 articles.
1. Random Graphs;Bollobás,1985
2. On the expected behaviour of disjoint set union algorithms;Bollobás;Proc. 17th Ann. ACM Symp. on Theory of Computing - STOC'85,1985
3. Near-perfect hashing of large word sets;Brain;Software - Practice and Experience,1989
4. Perfect hashing using sparse matrix packing;Brain;Inform. Systems,1990
5. An interactive system for finding perfect hash functions;Cercone;IEEE Software,1985
Cited by
53 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Compression algorithm for colored de Bruijn graphs;Algorithms for Molecular Biology;2024-05-26
2. Bloomier Filters on 3-Hypergraphs;Lecture Notes in Computer Science;2024
3. APIASO: A Novel API Call Obfuscation Technique Based on Address Space Obscurity;Applied Sciences;2023-08-08
4. Compression algorithm for colored de Bruijn graphs;2023-05-14
5. MapEmbed;Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining;2021-08-14