pvk.ca 29. 12. 2022Fixing the hashing in "Hashing modulo α-equivalence" – pvk.ca 12. 7. 2022Plan B for UUIDs: double AES-128 – pvk.ca 2. 6. 2022Hacking tips for Linux perf porcelain – pvk.ca 20. 12. 2021Bounded dynamicism with cross-modifying code – pvk.ca 1. 8. 2021Slitter: a slab allocator that trusts, but verifies – pvk.ca 7. 6. 2021Entomological solutions – pvk.ca 14. 5. 2021Baseline implementations should be predictable – pvk.ca 11. 1. 2021Stuff your logs! – pvk.ca 31. 10. 20201.5x the PH bits for one more CLMUL – pvk.ca 24. 8. 2020UMASH: a fast and universal enough hash – pvk.ca 7. 7. 2020Flatter wait-free hazard pointers – pvk.ca 2. 5. 2020Check for borrows in bitwise operations – pvk.ca 11. 3. 2020How hard is it to guide test case generators with branch coverage feedback? – pvk.ca 1. 2. 2020Too much locality... for stores to forward – pvk.ca 21. 1. 2020Lazy Linear Knapsack – pvk.ca 1. 12. 2019A Multiset of Observations With Constant-time Sample Mean and Variance – pvk.ca 29. 9. 2019A Couple of (Probabilistic) Worst-case Bounds for Robin Hood Linear Probing – pvk.ca 24. 4. 2019Fractional Set Covering With Experts – pvk.ca 24. 4. 2019Fractional Set Covering With Experts – pvk.ca 26. 2. 2019The Unscalable, Deadlock-prone, Thread Pool – pvk.ca 26. 2. 2019The Unscalable, Deadlock-prone, Thread Pool – pvk.ca 9. 1. 2019Preemption Is GC for Memory Reordering – pvk.ca 9. 1. 2019Preemption Is GC for Memory Reordering – pvk.ca 26. 8. 2018Restartable Sequences With the Polysemic Null Segment Selector – pvk.ca 26. 8. 2018Restartable Sequences With the Polysemic Null Segment Selector – pvk.ca 7. 7. 2018The Confidence Sequence Method: A Computer-age Test for Statistical SLOs – pvk.ca 7. 7. 2018The Confidence Sequence Method: A Computer-age Test for Statistical SLOs – pvk.ca 25. 6. 2018An Old Conjecture on Stream Transducers – pvk.ca
29. 12. 2022Fixing the hashing in "Hashing modulo α-equivalence" – pvk.ca 12. 7. 2022Plan B for UUIDs: double AES-128 – pvk.ca 2. 6. 2022Hacking tips for Linux perf porcelain – pvk.ca 20. 12. 2021Bounded dynamicism with cross-modifying code – pvk.ca 1. 8. 2021Slitter: a slab allocator that trusts, but verifies – pvk.ca 7. 6. 2021Entomological solutions – pvk.ca 14. 5. 2021Baseline implementations should be predictable – pvk.ca 11. 1. 2021Stuff your logs! – pvk.ca 31. 10. 20201.5x the PH bits for one more CLMUL – pvk.ca 24. 8. 2020UMASH: a fast and universal enough hash – pvk.ca 7. 7. 2020Flatter wait-free hazard pointers – pvk.ca 2. 5. 2020Check for borrows in bitwise operations – pvk.ca 11. 3. 2020How hard is it to guide test case generators with branch coverage feedback? – pvk.ca 1. 2. 2020Too much locality... for stores to forward – pvk.ca 21. 1. 2020Lazy Linear Knapsack – pvk.ca 1. 12. 2019A Multiset of Observations With Constant-time Sample Mean and Variance – pvk.ca 29. 9. 2019A Couple of (Probabilistic) Worst-case Bounds for Robin Hood Linear Probing – pvk.ca 24. 4. 2019Fractional Set Covering With Experts – pvk.ca 24. 4. 2019Fractional Set Covering With Experts – pvk.ca 26. 2. 2019The Unscalable, Deadlock-prone, Thread Pool – pvk.ca 26. 2. 2019The Unscalable, Deadlock-prone, Thread Pool – pvk.ca 9. 1. 2019Preemption Is GC for Memory Reordering – pvk.ca 9. 1. 2019Preemption Is GC for Memory Reordering – pvk.ca 26. 8. 2018Restartable Sequences With the Polysemic Null Segment Selector – pvk.ca 26. 8. 2018Restartable Sequences With the Polysemic Null Segment Selector – pvk.ca 7. 7. 2018The Confidence Sequence Method: A Computer-age Test for Statistical SLOs – pvk.ca 7. 7. 2018The Confidence Sequence Method: A Computer-age Test for Statistical SLOs – pvk.ca 25. 6. 2018An Old Conjecture on Stream Transducers – pvk.ca