fromWIRED2 months agoUndergraduate Upends a 40-Year-Old Data Science ConjectureKrapivin's new exploration led to a novel hash table that dispenses with uniform probing, achieving worst-case query times of (log x)^2, faster than Yao's conjectured x.OMG science