Ragnar {Groot Koerkamp} 🦋
1.8K posts

Ragnar {Groot Koerkamp} 🦋
@curious_coding
PhD on high troughput bioinformatics @ ETH Zurich; IMO, ICPC, Xoogler, Rust, road-cycling, hiking, wild camping, photography https://t.co/wBv2zN4F80

SimdQuickHeap: The QuickHeap Reconsidered Johannes Breitling, Ragnar Groot Koerkamp, Marvin Williams arxiv.org/abs/2604.25681 [𝚌𝚜.𝙳𝚂]

We've been working hard behind the scenes to bring you an unforgettable P99CONF 2026. Registration is now open, so take a look at who is coming back and the new speakers we have on board > p99conf.io/2026/04/01/be-… #ScyllaDB #P99CONF







One of my favourite tricks of CS algorithms Theory vs Practice is binary search optimisation for cache-friendliness. The standard algorithm looks at the middle of array and jumps back and forth. This destroys cache. Instead, store a pre-order traversal of a sorted array represented as a tree. This way you always hit the first elements of the array, and they can be safely cached.





