What if pointers didn’t have to be log n bits? We explore tiny pointers, the deference table, and the load-factor trade-off that lets fixed-size or variable-size pointers shrink to astonishingly small sizes—and still retrieve data quickly. We’ll cover five practical applications (relaxed retrieval, succinct binary search trees, stable dictionaries, variable-size values, and optimal internal memory stash) and connect the idea to the balls-and-bins intuition.

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

Sponsored by Embersilk LLC