Parallel free-text search on the connection machine system
Communications of the ACM - Special issue on parallelism
Perfect hashing for external files
Perfect hashing for external files
Programming pearls: a spelling checker
Communications of the ACM
A second look at bloom filters
Communications of the ACM
Designing a Bloom filter for differential file access
Communications of the ACM
Experience with a space efficient way to store a dictionary
Communications of the ACM
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
IEEE/ACM Transactions on Networking (TON)
A Decentralized, Adaptive Replica Location Mechanism
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Sharing Presence Information and Message Notification in an Ad Hoc Network
PERCOM '03 Proceedings of the First IEEE International Conference on Pervasive Computing and Communications
Virtualizing Transactional Memory
Proceedings of the 32nd annual international symposium on Computer Architecture
ACM SIGMOD Record
Self-organization in peer-to-peer systems
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Agora: a minimal distributed protocol for electronic commerce
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
Less hashing, same performance: building a better bloom filter
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Cooperation among peers in an ad hoc network to support an energy efficient IM service
Pervasive and Mobile Computing
Dynamic adaptive data structures for monitoring data streams
Data & Knowledge Engineering
Double sampling for flow measurement on high speed links
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimizing data popularity conscious bloom filters
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On the false-positive rate of Bloom filters
Information Processing Letters
Efficient access enforcement in distributed role-based access control (RBAC) deployments
Proceedings of the 14th ACM symposium on Access control models and technologies
Efficient flow-aware dynamic link load balancing
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
A Generalized Bloom Filter to Secure Distributed Network Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Setup algorithm of web service composition
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Filtering duplicate items over distributed data streams
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
The universality of iterated hashing over variable-length strings
Discrete Applied Mathematics
Guides for hypertext: an overview
Artificial Intelligence in Medicine
Enhanced authentication for commercial video services
Security and Communication Networks
| Hi-index | 48.22 |
Bloom filter technique of hashing finds several applications, such as in efficient maintenance of differential files, space efficient storage of dictionaries, and parallel free-text searching. The performance of hash transformations with reference to the filter error rate is the focus of this article.