The talk is structured as an evolution of hash tables. The first implementation is what I learned in school so many years ago. You have an array of pointers. You take the data, ...

Hash tables are not effective when the number of entries is very small, because despite the fact that operations on a hash table take constant time on average, ... It is useful to examine the ...

Ruby: A Study in Hashes All Over the Freaking Place. As with many dynamic languages, early (for some definition of “early”) implementations of Ruby used hash tables all over the place.

In the world of decentralization, distributed hash tables (DHTs) recently have had a revolutionary effect. The chaotic, ad hoc topologies of the first-generation peer-to-peer architectures have been ...

I want to write a DHT, I've looked at Chord, Pastry and the like but I am not sure which implementation to use. I am looking at Csharp because I am familiar with it but that locks me in on Windows ...

Hash tables are important because some PowerShell commands will understand hash tables as values for their parameters, and one of the most common PowerShell commands you would use in this scenario ...

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.

And while a hash table can find any word in a constant amount of time (usually a tiny fraction of a second), the search time for other methods can go up as the number of words in the dictionary ...