Andrew Krapivin, an undergraduate at Rutgers University, discovered a new kind of hash table that contradicts a 40-year-old conjecture by Andrew Yao. His design shows that the time required for worst-case queries and insertions can be far faster than previously believed. This breakthrough was validated in a 2025 paper
Sort: