Join us as we unpack succinct data structures—bit vectors, rank and select, and wavelet matrices—that store data compactly without sacrificing speed. We explore real-world heroes like the FM index and the Burrows-Wheeler transform, plus applications to trees via balanced parentheses and practical Rust tools (Verse). We'll see how these ideas help with text search, genomics, and XML representations, all while keeping memory footprints tiny.

Note:  This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information.

Sponsored by Embersilk LLC