Pages that link to "Item:Q5591930"
From MaRDI portal
The following pages link to Space/time trade-offs in hash coding with allowable errors (Q5591930):
Displaying 50 items.
- Compressed string dictionary search with edit distance one (Q270017) (← links)
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters (Q323016) (← links)
- Efficient and robust associative memory from a generalized Bloom filter (Q353819) (← links)
- Cooperative private searching in clouds (Q455980) (← links)
- DNA-inspired information concealing: a survey (Q465664) (← links)
- Secure deduplication storage systems supporting keyword search (Q494049) (← links)
- An exact cooperative method for the uncapacitated facility location problem (Q495932) (← links)
- Aggregate query processing in the presence of duplicates in wireless sensor networks (Q527209) (← links)
- Model checking with bounded context switching (Q539429) (← links)
- Flash memory efficient LTL model checking (Q617930) (← links)
- Transactional memory (Q666225) (← links)
- Implementation tradeoffs in the design of flexible transactional memory support (Q666246) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- A symmetric cryptographic scheme for data integrity verification in cloud databases (Q781030) (← links)
- Automatic error correction in flexion languages (Q805262) (← links)
- Support optimality and adaptive cuckoo filters (Q832904) (← links)
- Scalable Bloom filters (Q845946) (← links)
- Improving counting Bloom filter performance with fingerprints (Q903373) (← links)
- On the false-positive rate of Bloom filters (Q975449) (← links)
- Upper and lower bounds on black-box steganography (Q1027982) (← links)
- Minimal and almost minimal perfect hash function search with application to natural language lexicon design (Q1055206) (← links)
- Non-expansive hashing (Q1307346) (← links)
- An algorithm for approximate membership checking with application to password security (Q1327313) (← links)
- Large scale implementations for Twitter sentiment classification (Q1662631) (← links)
- Bloom filter-based secure data forwarding in large-scale cyber-physical systems (Q1664778) (← links)
- A new analysis of the false positive rate of a Bloom filter (Q1675763) (← links)
- A survey on design and implementation of protected searchable data in the cloud (Q1686146) (← links)
- PAS: policy-based assistance in sensor networks (Q1700864) (← links)
- Skyline-join query processing in distributed databases (Q1712432) (← links)
- An effective and efficient MapReduce algorithm for computing BFS-based traversals of large-scale RDF graphs (Q1736757) (← links)
- Supporting early pruning in top-\(k\) query processing on massive data (Q1944943) (← links)
- Sketching asynchronous data streams over sliding windows (Q1954256) (← links)
- Improving MinHash via the containment index with applications to metagenomic analysis (Q2011091) (← links)
- Secure and efficient multiparty private set intersection cardinality (Q2025374) (← links)
- Robust property-preserving hash functions for Hamming distance and more (Q2056796) (← links)
- Privacy-preserving authenticated key exchange for constrained devices (Q2096615) (← links)
- Property-preserving hash functions for Hamming distance from standard assumptions (Q2170070) (← links)
- Expressive query over outsourced encrypted data (Q2198021) (← links)
- Pseudo-random graphs and bit probe schemes with one-sided error (Q2254500) (← links)
- Server-aided private set intersection based on reputation (Q2293036) (← links)
- A query privacy-enhanced and secure search scheme over encrypted data in cloud computing (Q2403229) (← links)
- On the analysis of Bloom filters (Q2410578) (← links)
- A new protocol for the detection of node replication attacks in mobile wireless sensor networks (Q2434545) (← links)
- Hardened bloom filters, with an application to unobservability (Q2442961) (← links)
- Improving the performance of invertible Bloom lookup tables (Q2445904) (← links)
- CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors (Q2692341) (← links)
- Partitioned searchable encryption (Q2697909) (← links)
- Two 2D search filters and their performance analyses (Q2710757) (← links)
- From Sets to Bits in Coq (Q2798253) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
