Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More

arXiv:2403.20326 · cs.DS · Submitted 2024-03-29 · Read on arXiv

cs.DS

Submitted: 2024-03-29

Updated: 2026-10-20

Terminology

• Hamming Distance — 2× in this paper · explained in 2 episodes
• Sparsity — 1× in this paper · explained in 5 episodes

Related papers

• Cascaded Learned Bloom Filter for Optimizing Model-Filter Size Balance and Fast Rejection
• Computational and Statistical Hardness of Calibration Distance
• Edge-Private Matching Kernels Through Local Decoding
• Tight Bounds for Equivalence Testing with Non-Adaptive Conditional Samples
• Local Node Differential Privacy
• Cheaper by the Batch: Shared Traversal for Genotype Graph Editing