1. Home
  2. Projects
    1. bfs
    2. acap
    3. bistring
  4. 2024
    1. Rounding percentages
    2. Bug hunting in Btrfs
  6. 2023
    1. Translucent typedefs in C
    2. bfs 3.0: the fastest find yet!
    3. You could have invented futexes
    4. Irregular expressions
  8. 2022
    1. Fast, Branchless Ray/Bounding Box Intersections, Part 3: Boundaries
    2. Remote reboots with encrypted disks
    3. Parallelizing graph search with Rayon
    4. Long division
  10. 2020
    1. Proving that 1 + 1 = 10 in Rust
    2. OOMify
    3. Makeover
    4. Porting k-d forests to Rust
  12. 2018
    1. spawn() of Satan
    2. Cracking DHCE (Diffie-Hellman color exchange)
  14. 2017
    1. bfs from the ground up, part 3: optimization
    2. bfs from the ground up, part 2: parsing
  16. 2016
    1. A quick trick for faster naïve matrix multiplication
    2. bfs from the ground up, part 1: traversal
    3. The Approximating and Eliminating Search Algorithm
  18. 2015
    1. Java autoboxing performance
    2. Fast, Branchless Ray/Bounding Box Intersections, Part 2: NaNs
  20. 2014
    1. Efficient Integer Exponentiation in C
    2. Standards-compliant* alloca()
    3. The Visitor Pattern in Python
    4. Exact Bounding Boxes for Spheres/Ellipsoids
    5. A Beautiful Ray/Mesh Intersection Algorithm
    6. A Beautiful Ray/Triangle Intersection Method
    7. Announcing Sangria
    8. k-d Forests
    9. Big Numbers
  22. 2013
    1. Java Generics Quirks
    2. Fair and Square, or How to Count to a Googol
  24. 2012
    1. Iterating Over Binary Trees
  26. 2011
    1. Collisions
    2. Ray / Priority R-Tree Intersection
    3. Priority R-Trees
    4. Fast, Branchless Ray/Bounding Box Intersections
    5. Fast Binary-Coded Decimal Addition and Subtraction
    6. Facebook Hacker Cup Qualification Round: Double Squares
  28. 2010
    1. Righteous hack: getting 2⁶³ - 1 points in a silly Facebook game
    2. Solving Cubic Polynomials
    3. Solving Polynomials
    4. .com