Talking to some folks the other day a couple of fun problems came up: How do you find cycles in a linked list? How do you reverse a linked list? Both of these algorithms can be implemented with very little extra memory, and I thought it would be fun to build them in Go. The ful ...
My buddy and co-worker Blake Caldwell posted a fun little note on Hashtables today. It got me thinking about the simple hash table implementation I have been using for cough cough years. So I thought I would put it up on github and write a bit about it. First, let me introduce ...
I had some time this weekend and discovered the magic that is pandoc, so I decided to convert the chapter on Genetic Algorithms over to my blog for easier reading. There may be some odd formatting due to the conversion, and my quick hand fixes. Please keep in mind that this intr ...
Chapter 4 of the The New Turing Omnibus is about the Monte Carlo method. I spent a fair bit of time learning about Monte Carlo methods for my PhD and have had to explain it to a few people as a result. When I read this chapter, I thought back to my favorite example, and thought I ...
Chapter 2 of the The New Turing Omnibus is about Finite Automata. I wanted to do some of the exercises on the blog so I looked around for a good way to draw finite state diagrams. Looks like graphviz is the standard. I thought it would be easier if I could just write my graphviz ...
I started reading The New Turing Omnibus. I am not sure what blog post pointed me at the book, but I read that it is a great tour of computer science, which sounded interesting so I thought I would jump right in. The first chapter is on Algorithms, which made me think of the firs ...
The last project I worked on at TIBCO was eFTL. eFTL is a bridge between FTL clients and mobile/web clients. The bridge maps FTL messages to web sockets. I designed the initial release of the eFTL as well as the message protocol and Java client library. Perhaps the most interesti ...
sasbury.com
