[PDF][PDF] Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
In sparse convolution-type problems, a common technique is to hash the input integers
modulo a random prime p∈[Q/2, Q] for some parameter Q, which reduces the range of the …
modulo a random prime p∈[Q/2, Q] for some parameter Q, which reduces the range of the …
Sumsets, 3SUM, Subset Sum: Now for Real!
N Fischer - arXiv preprint arXiv:2410.21953, 2024 - arxiv.org
We study a broad class of algorithmic problems with an" additive flavor" such as computing
sumsets, 3SUM, Subset Sum and geometric pattern matching. Our starting point is that these …
sumsets, 3SUM, Subset Sum and geometric pattern matching. Our starting point is that these …
Longest common extensions with wildcards: Trade-off and applications
G Bathie, P Charalampopoulos… - arXiv preprint arXiv …, 2024 - arxiv.org
We study the Longest Common Extension (LCE) problem in a string containing wildcards.
Wildcards (also called" don't cares" or" holes") are special characters that match any other …
Wildcards (also called" don't cares" or" holes") are special characters that match any other …