One article by Daniel Albert accepted at CPM 2026
One article by Daniel Albert has been accepted at CPM 2026.
The article "Longest Common Extension of a Dynamic String in Parallel Constant Time" by Daniel Albert from the LogiDAC group has been accepted at the 37th Annual Symposium on Combinatorial Pattern Matching (CPM 2026).
The full version of the article is available on arxiv: https://arxiv.org/abs/2604.12696