Rob Janssen

All | Unread | Read

My Love-Hate Relationship with Stack Overflow: Arthur S., Arthur T., and the Soup Nazi

Warning: In the interest of maintaining a coherent stream of consciousness, I’m lowering the setting on my profanity filter for this post. Just wanted to let you know ahead of time. I’ve been a user of Stack Overflow since December of 2008.

Shipping Culture Is Hurting Us

I started writing this post with the intention of discussing Gary Bernhardt’s conclusions in his talk, A Whole New World. Gary makes what I think are some really good points about infrastructure, tooling, and the paralysis we seem to sometimes have around it.

Just how big is Noda Time anyway?

Some years back, I posted a graph showing the growth of Subversion’s codebase over time, and I thought it might be fun to do the same with Noda Time. The Subversion graph shows the typical pattern of linear growth over time, so I was expecting to see the same thing with Noda Time. I didn’t1.

A brief reminder for people teaching themselves programming

Studying on your own can be a fairly daunting task. And by on your own I mean without some sort of structured environment supporting you. Like a college or a programming bootcamp or a mentor (how lucky do you have to be to have a mentor, huh?).

Branch Per Feature in practice

Branch Per Feature is one of the bajillion branching strategies that can be used with modern Version Control Systems (VCSes). I just rotated off a project where I used it for the better part of a year, and even wrote a bit of tooling around it.

Impossible Escape?

The other day I heard a really interesting puzzle. It's one of those proverbial prisoner problems where you are condemned to die unless you can prove your intelligence to a devious jailer. You, and your friend, are incarcerated. Your jailer offers a challenge.

The Myth of RAM, part I — I Like Big Bits

If you have studied computing science, then you know how to do complexity analysis. You'll know that iterating through a linked list is O(N), binary search is O(log(N)) and a hash table lookup is O(1).

Research Blog : Extra, Extra : Read All About It : Nearly All Binary Searches and Mergesorts are Broken

The World’s Email Encryption Software Relies on One Guy, Who is Going Broke

Update, Feb. 5, 2015, 8:10 p.m.: After this article appeared, Werner Koch informed us that last week he was awarded a one-time grant of $60,000 from Linux Foundation's Core Infrastructure Initiative. Werner told us he only received permission to disclose it after our article published.

One Man’s Quest to Rid Wikipedia of Exactly One Grammatical Mistake

On a Friday in July 2012, two employees of the Wikimedia Foundation gave a talk at Wikimania, their organization’s annual conference.

This Read-It-Later-list is just that, bookmarks of stuff I intend to read or have read. I do not necessarily agree with opinions or statements in the bookmarked articles.

This list is compiled from my Pocket list.