News for hackers. Stuff that matters.
Re:Show HN: Array with Constant Time Access and Fast Inserti... by igushev on Wednesday September 04, 2019 @01:10PM (#20879228)
I mentioned that extension in the published paper, but complexity of access becomes O(d) where d is number of dimensions.

There are no comments on this comment yet.