3 ms·
- information theoretic optimal succinct/compact/implicit data structures - cache oblivious algorithms, especially CO-B-Trees - linear work suffix array constru
by scaramanga 13y ago
- information theoretic optimal succinct/compact/implicit data structures
- cache oblivious algorithms, especially CO-B-Trees
- linear work suffix array construction
- new lower bounds on external store and search
- sure there must be plenty of results on distributed systems techniques too
Plenty of amazing results in the last few years.