A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.

According to Quanta, the paper demonstrates that for Krapivin's hash table method, the time required for worst-case queries and insertions is proportional to (log x)2, which is much faster than ...