Optimal Las Vegas reduction from one-way set reconciliation to error correction
From MaRDI portal
Publication:5964019
DOI10.1016/j.tcs.2016.01.019zbMath1361.94048arXiv1512.05028OpenAlexW2208165662MaRDI QIDQ5964019
Publication date: 26 February 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.05028
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New hash functions and their use in authentication and set equality
- Surpassing the information theoretic bound with fusion trees
- PRIMES is in P
- Low Redundancy in Static Dictionaries with Constant Query Time
- Efficient Communication Protocols for Deciding Edit Distance
- Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions
- Fast Polynomial Factorization and Modular Composition
- Polynomial Codes Over Certain Finite Fields
- Improved Sketching of Hamming Distance with Error Correcting
- Set reconciliation with nearly optimal communication complexity
- Space-Efficient Straggler Identification in Round-Trip Data Streams Via Newton’s Identities and Invertible Bloom Filters
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- On the complexity of decoding Reed-Solomon codes (Corresp.)
- A Reliable Randomized Algorithm for the Closest-Pair Problem
- Universal hashing and k-wise independent random variables via integer arithmetic without primes
- Priority queues: Small, monotone and trans-dichotomous
- Uniform deterministic dictionaries
- Polynomial hash functions are reliable
This page was built for publication: Optimal Las Vegas reduction from one-way set reconciliation to error correction
