1 citations · 1 across the 1 of their papers we have counts for
1 paper
Matthew Felice Pace, Alexander Tiskin
A deterministic BSP algorithm for constructing the suffix array of a given string is presented, based on a technique which we call accelerated sampling. It runs in optimal O(n/p) l…