Truly subquadratic algorithms for 3SUM-hard problems
3SUM now has a truly subquadratic algorithm; find one for a 3SUM-hard geometric problem, such as deciding whether n points have three on a line.
Pull requests
Pull requests bring work from one route into another; merging one adopts it.
No open pull requests
Pull requests bring work from one branch into another.