40-Year-Old Conjecture Shattered: New Hash Table Outperforms Expectations
2025-02-10
Graduate student Krapivin (University of Cambridge), along with Farach-Colton and Kuszmaul (New York University), have overturned Yao's conjecture, a long-held belief in computer science. Their novel hash table achieves a worst-case time complexity of (log x)² for element lookups, significantly faster than the previously believed optimal x. This groundbreaking research not only solves a classic problem in hash table design but also dramatically improves data storage efficiency, sparking significant interest within the academic community.
Development
hash table