The goto wars of the 1960s and 1970s are long over, and goto is dead—except that it isn’t.
TwoHardThingsThere are only two hard things in Computer Science: cache invalidation and naming things. Long a favorite saying of mine, one for which I couldn't find a satisfactory URL.
A little rant about Microsoft Internet Explorer's color parsingAs my profile says, I am one of POPFile's developers. The POPFile team is commited to finding and making sure POPFile is capable of decoding new spammer "tricks". John Graham-Cumming, author and lead developer of POPFile also maintains the spammer's compendium, a catalogue of such spammer tricks.
Performance of Graph vs. Relational DatabasesCurator's Note: Here's a post from back in 2011 that offers a general look at the difference in performance of graph databases and relational databases. A few weeks ago, Emil Eifrem, CEO of Neo Technology gave a webinar introduction to graph databases.
LET’S PLAY: THE CAVEThe Cave is het resultaat van Monkey Island helden Tim Shafer en Ron Gilbert. Natuurlijk kennen de oudere gamers deze 2 namen wel. Gilbert heeft zijn krachten gebundeld met Tim Shafer’s game studio Double Fine.
Why We (Still) Believe in Working RemotelyIt’s 2013, almost three years after we first raised money and started growing beyond the first four employees. At the time, Jeff wrote a great blog post about working remotely, basically laying out our plan for how we were going to make it work.
creative commons : List of freely available programming booksI'm trying to amass a list of programming books that are freely available on the Internet. The books can be about a particular programming language or about computers in general. What are some freely available programming books on the Internet?
ASP.NET Bundling/Minification and Embedded ResourcesIf you want to share your application resources(like css, javascript, images, etc) between different projects then embedded resource is a great choice.
All Your Base Are Belong To UsI have found that the biggest obstacle I face when adopting a new language, technology, or framework is using something I don't fully understand how to implement myself.
Creating a Simple Bloom Filter (Posted on February 2nd, 2013)Bloom filters are super efficient data structures that allow us to tell if an object is most likely in a data set or not by checking a few bits. Bloom filters return some false positives but no false negatives.
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.