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.
- Performance/Security Tradeoffs for Content-Based Routing Supported by Bloom Filters (Q2868639) (← links)
- Minimal and Monotone Minimal Perfect Hash Functions (Q2946321) (← links)
- Towards Proofs of Ownership Beyond Bounded Leakage (Q2953871) (← links)
- Low-Leakage Secure Search for Boolean Expressions (Q2975821) (← links)
- Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter (Q2980879) (← links)
- Error analysis for superimposed random coding (Q3008348) (← links)
- Using Fault Screeners for Software Error Detection (Q3058774) (← links)
- Compressing Regular Expressions’ DFA Table by Matrix Decomposition (Q3073647) (← links)
- Explicit-State Model Checking (Q3176363) (← links)
- Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters (Q3194620) (← links)
- Multi-attribute Counterfeiting Tag Identification Protocol in Large-Scale RFID System (Q3297520) (← links)
- The Contig Assembly Problem and Its Algorithmic Solutions (Q3305536) (← links)
- An Optimal Bloom Filter Replacement Based on Matrix Solving (Q3392960) (← links)
- Constructing SAT Filters with a Quantum Annealer (Q3453216) (← links)
- HordeSat: A Massively Parallel Portfolio SAT Solver (Q3453220) (← links)
- Spatial Bloom Filters: Enabling Privacy in Location-Aware Applications (Q3454570) (← links)
- Efficient Zero-Knowledge Proofs of Non-algebraic Statements with Sublinear Amortized Cost (Q3457064) (← links)
- Bloom Filters in Adversarial Environments (Q3457085) (← links)
- Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games (Q3556623) (← links)
- 2d random filter and analysis<sup>∗</sup> (Q3989750) (← links)
- Estimating optimal parameters for parallel database hardware (Q3990933) (← links)
- Random filter and its analysis* (Q4009760) (← links)
- Scaling metagenome sequence assembly with probabilistic de Bruijn graphs (Q4907496) (← links)
- Optimal Hashing in External Memory (Q5002712) (← links)
- Buffered Count-Min Sketch on SSD: Theory and Experiments (Q5009602) (← links)
- A Theoretical Perspective on Hyperdimensional Computing (Q5026180) (← links)
- Verifiable Range Query Processing for Cloud Computing (Q5056027) (← links)
- An Insight Review on Bloom Filter and Its Variants with Applications: An Emerging Hash Based Membership Querying Technique (Q5069671) (← links)
- Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes (Q5089193) (← links)
- Binary Fuse Filters: Fast and Smaller Than Xor Filters (Q5102066) (← links)
- Computing treewidth on the GPU (Q5111889) (← links)
- Deep Reinforcement Learning: A State-of-the-Art Walkthrough (Q5145831) (← links)
- Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms (Q5200029) (← links)
- Bloom Filter Trie – A Data Structure for Pan-Genome Storage (Q5283830) (← links)
- Summary Data Structures for Massive Data (Q5326361) (← links)
- Fast Evaluation of Union-Intersection Expressions (Q5387808) (← links)
- Security and Trust in Sensor Networks (Q5391135) (← links)
- Using Bloom Filters to Speed Up HITS-Like Ranking Algorithms (Q5458312) (← links)
- DOUBLE HASHING WITH MULTIPLE PASSBITS (Q5696961) (← links)
- (Q5743385) (← links)
- (Q5874553) (← links)
- Bloom filter encryption and applications to efficient forward-secret 0-RTT key exchange (Q5918309) (← links)
- Tight bounds for sliding Bloom filters (Q5963376) (← links)
- Minimum-latency aggregation scheduling in wireless sensor network (Q5963622) (← links)
- Xor Filters (Q6039922) (← links)
- Adaptive Cuckoo Filters (Q6039930) (← links)
- Hiding the input-size in multi-party private set intersection (Q6048707) (← links)
- (Q6084356) (← links)
- Encapsulated search index: public-key, sub-linear, distributed, and delegatable (Q6113958) (← links)
- MDOPE: efficient multi-dimensional data order preserving encryption scheme (Q6118667) (← links)
