Pattern Matching on Grammar-Compressed Strings in Linear Time | 0 | 0.34 | 2022 |
The Dynamic k-Mismatch Problem. | 0 | 0.34 | 2022 |
Sublinear Dynamic Interval Scheduling (On One or Multiple Machines) | 0 | 0.34 | 2022 |
Finding the KT Partition of a Weighted Graph in Near-Linear Time. | 0 | 0.34 | 2022 |
Lower Bounds for the Number of Repetitions in 2D Strings. | 0 | 0.34 | 2021 |
Matching Patterns with Variables Under Hamming Distance. | 0 | 0.34 | 2021 |
Fault-Tolerant Distance Labeling for Planar Graphs | 0 | 0.34 | 2021 |
An Almost Optimal Edit Distance Oracle | 0 | 0.34 | 2021 |