| | Hybridising SBCL's GENCGC with Mark and Sweep (pvk.ca) |
| 36 points by jsnell on Sept 14, 2014 | past | 5 comments |
|
| | How to Define New Intrinsics in SBCL (pvk.ca) |
| 92 points by chiachun on Aug 18, 2014 | past | 20 comments |
|
| | Integer Division, Step 0: No Remainder (pvk.ca) |
| 33 points by chiachun on May 12, 2014 | past | 4 comments |
|
| | Number Systems for Implicit Data Structures (pvk.ca) |
| 1 point by chiachun on April 14, 2014 | past |
|
| | Refactoring with LZ77: compression is compilation (pvk.ca) |
| 4 points by mbrubeck on March 31, 2014 | past |
|
| | Refactoring With LZ77: Compression Is Compilation (?) (pvk.ca) |
| 3 points by hyp0 on March 31, 2014 | past |
|
| | SBCL: The Ultimate Assembly Code Breadboard (pvk.ca) |
| 159 points by kryptiskt on March 16, 2014 | past | 75 comments |
|
| | How Bad Can 1 GB Pages Be? (pvk.ca) |
| 72 points by jetlej on Feb 23, 2014 | past | 40 comments |
|
| | How Bad Can 1GB Pages Be? (pvk.ca) |
| 3 points by nkurz on Feb 19, 2014 | past |
|
| | So you want to write a Linear Programming Solver (pvk.ca) |
| 11 points by momo-reina on Dec 23, 2013 | past |
|
| | The weaknesses of SBCL's type propagation (pvk.ca) |
| 2 points by wglb on Nov 25, 2013 | past |
|
| | All You Need Is call/cc (pvk.ca) |
| 2 points by PuercoPop on Nov 12, 2013 | past |
|
| | Steel Bank Common Lisp Compiler Internals (pvk.ca) |
| 4 points by juliangamble on Oct 19, 2013 | past |
|
| | All you need is call/cc (pvk.ca) |
| 4 points by saurabh on Sept 20, 2013 | past |
|
| | All you need is call/cc (pvk.ca) |
| 2 points by p4bl0 on Sept 19, 2013 | past |
|
| | Bitsets Match Regular Expressions, Compactly (pvk.ca) |
| 2 points by agentultra on July 2, 2013 | past |
|
| | Tabasco Sort: A Super-optimal Merge Sort (pvk.ca) |
| 2 points by neeee on June 19, 2013 | past |
|
| | Robin Hood Hashing (pvk.ca) |
| 2 points by objectivefs on May 25, 2013 | past |
|
| | Starting to Hack on Steel Bank Common Lisp (pvk.ca) |
| 88 points by avodonosov on April 14, 2013 | past | 20 comments |
|
| | The eight useful polynomial approximations of `sinf(3)' (pvk.ca) |
| 3 points by MaysonL on Oct 9, 2012 | past |
|
| | The eight useful polynomial approximations of `sinf(3)' (pvk.ca) |
| 2 points by wglb on Oct 9, 2012 | past |
|
| | Tabasco Sort: a super-optimal merge sort (pvk.ca) |
| 109 points by dduck on Aug 29, 2012 | past | 5 comments |
|
| | Tabasco Sort: A Super-optimal Merge Sort (pvk.ca) |
| 10 points by swannodette on Aug 27, 2012 | past | 1 comment |
|
| | Engineering a List Merge Sort (pvk.ca) |
| 1 point by l0stman on Aug 18, 2012 | past |
|
| | Binary search eliminates branch misprediction (pvk.ca) |
| 1 point by EdiX on Aug 6, 2012 | past |
|
| | Binary search is a pathological case for caches (pvk.ca) |
| 80 points by kinetik on July 30, 2012 | past | 13 comments |
|
| | Binary search eliminates branch mispredictions (pvk.ca) |
| 7 points by wglb on July 4, 2012 | past |
|
| | There's more to locality than caches (pvk.ca) |
| 1 point by ahalan on June 27, 2012 | past |
|
| | Fitting polynomials by generating linear constraints (pvk.ca) |
| 1 point by wglb on May 30, 2012 | past |
|
| | Napa-FFT in SBCL implementation notes (pvk.ca) |
| 1 point by aerique on Jan 5, 2012 | past |
|
|
| More |
