2 papers
cs.DS2026
Nearly Optimal Internal Dictionary Matching
Jingbang Chen, Jiangqi Dai, Qiuyang Mang +2
We study the internal dictionary matching (IDM) problem where a dictionary containing substrings of a text is given, and each query concerns the occurrences o…
cs.DS2025
Constant Approximation of Arboricity in Near-Optimal Sublinear Time
Jiangqi Dai, Mohsen Ghaffari, Julian Portmann
We present a randomized algorithm that computes a constant approximation of a graph's arboricity, using queries to adjacency lists and in the same time bound. Her…