Space/time trade-offs in hash coding with allowable errors
From MaRDI portal
Publication:5591930
DOI10.1145/362686.362692zbMath0195.47003OpenAlexW2123845384WikidataQ55889030 ScholiaQ55889030MaRDI QIDQ5591930
Publication date: 1970
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/362686.362692
Related Items
MDOPE: efficient multi-dimensional data order preserving encryption scheme, Approximate sorting and its applications in I/O model, An investigation to test spectral segments as bacterial biomarkers, Private join and compute from PIR with default, Faster Privacy-Preserving Location Proximity Schemes, An Almost Non-interactive Order Preserving Encryption Scheme, Bet-or-pass: adversarially robust Bloom filters, Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines, An algorithm for approximate membership checking with application to password security, Compressed string dictionary search with edit distance one, Bloom Filter Trie – A Data Structure for Pan-Genome Storage, Support optimality and adaptive cuckoo filters, Constructing SAT Filters with a Quantum Annealer, HordeSat: A Massively Parallel Portfolio SAT Solver, Explicit-State Model Checking, Verifiable Range Query Processing for Cloud Computing, Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications, Scalable Bloom filters, Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost, Bloom Filters in Adversarial Environments, An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters, 2d random filter and analysis∗, Estimating optimal parameters for parallel database hardware, An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique, Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters, Efficient and robust associative memory from a generalized Bloom filter, Large scale implementations for Twitter sentiment classification, Bloom filter-based secure data forwarding in large-scale cyber-physical systems, Property-preserving hash functions for Hamming distance from standard assumptions, Random filter and its analysis*, A query privacy-enhanced and secure search scheme over encrypted data in cloud computing, Summary Data Structures for Massive Data, A new analysis of the false positive rate of a Bloom filter, On the analysis of Bloom filters, Minimal and Monotone Minimal Perfect Hash Functions, Xor Filters, A survey on design and implementation of protected searchable data in the cloud, Multi-party updatable delegated private set intersection, Flash memory efficient LTL model checking, Hiding the input-size in multi-party private set intersection, Binary Fuse Filters: Fast and Smaller Than Xor Filters, Towards Proofs of Ownership Beyond Bounded Leakage, Encapsulated search index: public-key, sub-linear, distributed, and delegatable, Unnamed Item, Expressive query over outsourced encrypted data, Improving counting Bloom filter performance with fingerprints, Supporting early pruning in top-\(k\) query processing on massive data, PAS: policy-based assistance in sensor networks, CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors, A new protocol for the detection of node replication attacks in mobile wireless sensor networks, Partitioned searchable encryption, Sketching asynchronous data streams over sliding windows, Low-Leakage Secure Search for Boolean Expressions, Skyline-join query processing in distributed databases, Unnamed Item, Hardened bloom filters, with an application to unobservability, Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter, Cooperative private searching in clouds, Improving the performance of invertible Bloom lookup tables, Two 2D search filters and their performance analyses, DNA-inspired information concealing: a survey, Fast Evaluation of Union-Intersection Expressions, DOUBLE HASHING WITH MULTIPLE PASSBITS, Security and Trust in Sensor Networks, Multi-attribute Counterfeiting Tag Identification Protocol in Large-Scale RFID System, Optimal Hashing in External Memory, Deep Reinforcement Learning: A State-of-the-Art Walkthrough, Transactional memory, Implementation tradeoffs in the design of flexible transactional memory support, An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs, Secure deduplication storage systems supporting keyword search, An exact cooperative method for the uncapacitated facility location problem, The Contig Assembly Problem and Its Algorithmic Solutions, Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games, Buffered Count-Min Sketch on SSD: Theory and Experiments, Error analysis for superimposed random coding, Scaling metagenome sequence assembly with probabilistic de Bruijn graphs, Aggregate query processing in the presence of duplicates in wireless sensor networks, Pseudo-random graphs and bit probe schemes with one-sided error, Model checking with bounded context switching, Improving MinHash via the containment index with applications to metagenomic analysis, On the false-positive rate of Bloom filters, Secure and efficient multiparty private set intersection cardinality, Using Fault Screeners for Software Error Detection, Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange, Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms, From Sets to Bits in Coq, Tight bounds for sliding Bloom filters, Minimum-latency aggregation scheduling in wireless sensor network, Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms, Compressing Regular Expressions’ DFA Table by Matrix Decomposition, Server-aided private set intersection based on reputation, Computationally secure pattern matching in the presence of malicious adversaries, Robust property-preserving hash functions for Hamming distance and more, Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes, An Optimal Bloom Filter Replacement Based on Matrix Solving, Upper and lower bounds on black-box steganography, A symmetric cryptographic scheme for data integrity verification in cloud databases, Computing treewidth on the GPU, A Survey of Data Structures in the Bitprobe Model, Minimal and almost minimal perfect hash function search with application to natural language lexicon design, Privacy-preserving authenticated key exchange for constrained devices, Unnamed Item, Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters, Automatic error correction in flexion languages, Adaptive Cuckoo Filters, A Theoretical Perspective on Hyperdimensional Computing
