research
∙
08/09/2018
Longest Increasing Subsequence under Persistent Comparison Errors
We study the problem of computing a longest increasing subsequence in a ...
share
research
∙
07/25/2018
Parallel Minimum Cuts in Near-linear Work and Low Depth
We present the first near-linear work and poly-logritharithmic depth alg...
research
∙
04/20/2018
Optimal Sorting with Persistent Comparison Errors
We consider the problem of sorting n elements in the case of persistent ...
research
∙
03/12/2018