The Data Structures [You Think You] Need to Know
ÜberConf
Denver · June 24 - 27, 2014
About this Presentation
If you're like most developers, you can get through most of your projects with just lists and maps. Then every once in a while you read a blog post about a mind-blowing problems that can only be solved efficiently because of a data structure you've never heard of, and you wonder where long years of computer science education really got you. Or better yet, maybe you never
The world is full of interesting data structures like Merkel Trees, Bloom Filters, k-d Trees, Ropes, Tries, and just plain old heaps and graphs. Come to this talk for a fun walk through the composition, purpose, and implementation of a few of the data structures you think you need to know–and might actually be able to use!
VP Developer Relations at IBM
Tim serves as the VP of Developer Relations at IBM, where he and his team work to make certain parts of the IBM portfolio more accessible to developers. He is a regular speaker at conferences and a presence on YouTube explaining complex technology topics in an accessible way. He lives with his wife in Arvada, CO. He has three grown children, three step-children, and four grandchildren, with a fifth on the way.