byteCoderAn undergrad student broke a 40-year-old belief in computer science. Since 1985, it was believed th...
Shared by Lior Alexander @LiorOnAI on X
An undergrad student broke a 40-year-old belief in computer science. Since 1985, it was believed that hash tables, when nearly full, must check many spots to find or add data. Andrew Krapivin discovered a new way to organize data inside a hash table that avoids this slowdown. https://t.co/yQU0EDgd9A
An undergrad student broke a 40-year-old belief in computer science. Since 1985, it was believed that hash tables, when nearly full, must check many spots to find or add data. Andrew Krapivin discovered a new way to organize data inside a hash table that avoids this slowdown. https://t.co/yQU0EDgd9A