SkillsCast
Lost in Space: Binary Search Trees beyond 1D and CRDTs
SkillsCast
About the Speaker
We'll also touch on some surprising applications of these algorithms and even have a quick chat about the Curse of Dimensionality. The talk keeps evolving, but it's a safe bet that we'll at least discuss range trees, KD-trees, and higher dimensional Voronoi diagrams.
YOU MAY ALSO LIKE:
Lost in Space: Binary Search Trees beyond 1D and CRDTs
Jeff Abrahamson
Jeff Abrahamson collects advanced degrees while roaming the globe doing computer science and writing software. He currently hangs his (virtual) hat at Google London, where he is called site reliability engineer. In autumn 2014 he embarks on a new chapter in his professional life based mostly in France.