PyData submission.

gistfile1.txt

Title: Implementing Awesome Big Data Algorithms Effectively

C. Titus Brown* and Eric McDonald

Random algorithms and probabilistic data structures are algorithmically
efficient and can provide shockingly good practical results.  I will briefly
cover a few commonly used probabilistic data structures, then describe their
implementation in Cython and C++.  The bulk of the talk will be spent 
discussing performance considerations of implementations, including caching and 
approaches to threadsafety.  This will be a in-depth extension of my "Awesome
Big Data Algorithms" presentation at PyCon.