A young computer scientist and two colleagues show that searches within data structures called hash tables can be much faster than previously deemed possible.
The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal.