Recent Posts
- RtlWriteDecodedUcsDataIntoSmartLBlobUcsWritingContext and Other Long Function Names
- The Wire Identification Problem
- Kernighan & Plauger on Programming Style
- On Asymptotic Methods in Analysis: Prof. de Bruijn’s beautiful little book
- Aha! Emacs 23!
- Read wrote Wright… Graph Theorists playing with words
- Solving Project Euler Problems 161 (Trominoes Tiling) and 185 (Number Mind) with ZDDs
- Fun with ZDDs: Notes from Knuth’s 14th Annual Christmas Tree Lecture
- Analytically evaluating a limiting probability (June 2007 Ponder This)
- Certain autorickshaw phenomena
- In lieu of a foreword
Categories
- Emacs (1)
- Humor (3)
- Math (4)
- Ponder (1)
- Programming (3)
- Project Euler (1)
- TAOCP (3)
- Uncategorized (1)
Archives
- February 2010 (1)
- September 2009 (1)
- June 2009 (1)
- May 2009 (1)
- April 2009 (1)
- March 2009 (2)
- December 2008 (4)
My tweetstream
- An MIT Magic Trick: Computing On Encrypted Databases Without Ever Decrypting Them. http://t.co/WaaCx6Ii 07:00:15 PM February 01, 2012 from Instapaper ReplyRetweetFavorite
- An MIT Magic Trick: Computing On Encrypted Databases Without Ever Decrypting Them http://t.co/WaaCx6Ii 07:00:08 PM February 01, 2012 from Instapaper ReplyRetweetFavorite
- Chvatal and Reed's paper on satisfiability had the title -- "Mick gets some (the odds are on his side)" ;-) http://t.co/m2is2ZhQ 11:43:14 PM January 26, 2012 from web ReplyRetweetFavorite
