efficient.github.io - Efficient Computing at Carnegie Mellon

Example domain paragraphs

A list of recent open-source research systems developed by the research group of Professor David G. Andersen and Dr. Michael Kaminsky in the Carnegie Mellon University Computer Science Department . Data structures Feed-Forward Bloom Filter Memory efficient and cache-optimized algorithm for simultaneously searching for a large number of patterns in a very large corpus [ SIAM ALENEX 2011 ]

Reference implementation

Rank & select structures that use a cache-centric design approach to achieve performance competitive with the highest-performance prior designs while imposing space overhead as low as the most space-efficient, but slower, prior designs [ SEA 2013 ]