Paper Reading: Efficient Path Profiling
Recently I’ve been going through CS 6120 from Cornell (compilers), and one of the papers listed in the course was quite interesting, namely Efficient Path Pr...
Recent Posts
Random Heap Updates Are Cheap
A while ago I encountered an algorithmic challenge at work. Basically, the idea is that we have a bag of numbers, and we’d like to be able to update each num...
Building an AVL Tree From a Sorted Sequence in One Pass
Recently I came across the function Map.of_increasing_sequence in the base library of OCaml. It might sound like a very simple and common function, but the i...
What I Learned in Two Years’ Tech Work in Finance
It’s been two years since I started working full time as a software engineer. As I accumulated experience, I became a lot more hesitant to write, because I s...
Thoughts on Fooled by Randomness
Just finished Nassim Nicholas Taleb’s well-known book, Fooled by Randomness. Here are some brief thoughts, in no particular order.
Fast RNG in an Interval
https://arxiv.org/abs/1805.10941 - Fast Random Integer Generation in an Interval
Catenary Inversion: Curves of Sagrada Familia
Sagrada Familia is stunning and beautiful. If you ever go visit, don’t miss out on the bottom level: there are exhibitions about the constructions and histor...
Theoretically Or Practically Fast: Two Types of Hash Tables
When people say a program is fast, they usually mean it takes a short time to execute; but when computer scientists say an algorithm is efficient, they mean ...