\> After sorting, BGR is linear for fixed `R`. XDP's core scan is `O(nT) = O(n log n)`; BGR's repair core is `O(n + T)` per pass. The sort still dominates when input is unsorted.…
Anonymous readers can preview up to 1024 characters here. Log in to unlock the full article once ingest succeeds.