[vld_lzr]

I implemented a bunch of cache oblivious search trees and benchmarked them against their classical counterparts. The results showed that while the cache oblivious ones were more cache efficient, they were slower overall.

The implementations and benchmarks can be found here if anyone is curious: https://gitlab.com/VladLazar/cache-oblivious-data-structures

[corysama]

Your readme lists the cache-oblivious data structures you tested. But, it would be nice to also list what baselines you tested them against. I’m curious if they were explicitly cache-aware.

[herbstein]

I don't really have anything to add, other than pointing out how weird it is seeing a lecturer I've interacted with over the course of my studies (Gerth Brodal) casually mentioned in a "random" git repo.