Phil Bagwell and Concurrent Hash Tries October 3, 2011

I am totally stoked that Phil Bagwell is be presenting his research and implementation of Concurrent Hash Tries at the Scala Lift Off London 2011:

Concurrent Hash Tries are a new data structure that allow non-blocking concurrent update from multiple threads. It forms the basis of a general technique to slide between the speed of mutable and the thread safety of immutable structures. The talk will explain how the non-blocking data structure is achieved. A new fast hash function will be discussed. 

You may know Phil as the marketing guy from TypeSafe and from the guy that made the Scala web site awesome.  But Phil is an amazing computer scientist in his own right.  His work has made its way into many commercial and open source projects including Clojure.  Wow!