Long long ago, I had posted a patch to lkml for O(1) estimation of slab size estimation.
Here is the original email and the thread. This morning, I saw the following threads
In the latest thread, both myself and Steven Rostedt have posted our analysis to prove that the O(1) algorithm works. Interested? Check all the three emails and their threads.
As usual comments are welcome, this time clarifications too!
Subscribe to:
Post Comments (Atom)
Ranking and Unranking permutations
I've been a big fan of Skiena's Algorithm Design Manual , I recently found my first edition of the book (although I own the third ed...
-
(Photo from http://content-usa.cricinfo.com/indvaus2008/content/current/player/28114.html) Dravid's dismal form continues in test crick...
-
I've been reading up on Fast Fourier Transform (FFT) from several books on algorithms that I have, TCLR, Tamassia, Sahni, Numerical Rec...
-
The book is almost out there . There is code and selected solutions as well. The book is supposed to be in full colour from what I heard....
2 comments:
Awesome!
Few things are more inspiring than knowing that your work is used, right?
Gops,
Yes. It is and the fact that other respected people in the community accept and acknowledge such small things.
I love my analysis as well, I think I got it right
Post a Comment