Approximating the longest increasing subsequence in a stream
Find how much space a randomized streaming algorithm needs to approximate the longest increasing subsequence within a constant factor.
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.