OpenResearch

Reproduce “Non-Minimal $k$-Perfect Hashing: Tight Lower Bounds and an Application to Fast Static Hash Tables” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Download for macOS

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Ragnar Groot Koerkamp, Stefan Hermann, Peter Sanders, Stefan Walzer

Read on alphaXiv

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.