That assumption refers to hash tables, and a conjecture based on work from the 1980s regarding the optimal way to store and query the data in them. The student, formerly of Rutgers University in ...

Making fast hash tables in programming, which don't cause collision trouble, is one of computing's holy grails. Facebook thinks it's created a good one.

I want to have a very large hash table, i.e. so big it won't fit into memory. What's a good way to do that? I could use a database, but since it's only going to be key => value pairs that I am ...

Rainbow tables are password cracking tools with origins dating back to research from the early 1980s. Here's how they work and why they haven't stood the test of time.