308 citations · 462 across the 24 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
cs.DS2017
Faster range minimum queries
Tomasz Kowalski, Szymon Grabowski
Range Minimum Query (RMQ) is an important building brick of many compressed data structures and string matching algorithms. Although this problem is essentially solved in theory, w…
cs.DS2017
Lightweight Fingerprints for Fast Approximate Keyword Matching Using Bitwise Operations
Aleksander Cisłak, Szymon Grabowski
We aim to speed up approximate keyword matching by storing a lightweight, fixed-size block of data for each string, called a fingerprint. These work in a similar way to hash values…
cs.DS2017★ 1 cited
Faster batched range minimum queries
Szymon Grabowski, Tomasz Kowalski
Range Minimum Query (RMQ) is an important building brick of many compressed data structures and string matching algorithms. Although this problem is essentially solved in theory, w…