2 papers
cs.DS2026
Space-Efficient Text Indexing with Mismatches using Function Inversion
Jackson Bibbens, Levi Borevitz, Samuel McCauley
A classic data structure problem is to preprocess a string T of length so that, given a query , we can quickly find all substrings of T with Hamming distance at most fro…
cs.DS2025
Green Bin Packing
Jackson Bibbens, Cooper Sigrist, Bo Sun +2
The online bin packing problem and its variants are regularly used to model server allocation problems. Modern concerns surrounding sustainability and overcommitment in cloud compu…