Pages that link to "Item:Q3614151"
From MaRDI portal
The following pages link to Uniform Hashing in Constant Time and Optimal Space (Q3614151):
Displaying 20 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Triangle counting in dynamic graph streams (Q334947) (← links)
- Analysis of parallel uniform hashing (Q750157) (← links)
- Universal hash functions for an infinite universe and hash trees (Q987792) (← links)
- The computational complexity of universal hashing (Q1208411) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Unique permutation hashing (Q1939279) (← links)
- PSI from PaXoS: fast, malicious private set intersection (Q2119031) (← links)
- Efficient sampling of non-strict turnstile data streams (Q2348042) (← links)
- Hardness-preserving reductions via cuckoo hashing (Q2423841) (← links)
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security (Q2690521) (← links)
- Balls and bins: smaller hash families and faster evaluation (Q2848208) (← links)
- Sorting and Permuting without Bank Conflicts on GPUs (Q3452764) (← links)
- Bloom Filters in Adversarial Environments (Q3457085) (← links)
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes (Q4640336) (← links)
- (Q5002705) (← links)
- Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations (Q5157397) (← links)
- Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions (Q5219328) (← links)
- Space/time trade-offs in hash coding with allowable errors (Q5591930) (← links)
- Tight tradeoffs in searchable symmetric encryption (Q5925503) (← links)
