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!
Tim is a teacher, author, and technology leader with DataStax. He is a conference speaker internationally and in the United States, and contributes to the Denver, Colorado tech community as president of the Denver Open Source User Group. He is the co-presenter of various O’Reilly training videos on topics ranging from Git to Mac OS X Productivity Tips to Apache Cassandra, and is the author of Gradle Beyond the Basics. He blogs very occasionally at timberglund.com, and lives in Littleton, CO, USA with the wife of his youth and their three children.
Comments on this page are now closed.
For exhibition and sponsorship opportunities, contact Sharon Cordesse at firstname.lastname@example.org
For information on trade opportunities with O'Reilly conferences contact email@example.com
For media-related inquiries, contact Maureen Jennings at firstname.lastname@example.org
View a complete list of OSCON contacts