research
∙
02/23/2021
Conditional Lower Bounds for Variants of Dynamic LIS
In this note, we consider the complexity of maintaining the longest incr...
share
research
∙
11/19/2020
Fully Dynamic Approximation of LIS in Polylogarithmic Time
We revisit the problem of maintaining the longest increasing subsequence...
research
∙
07/12/2020
Efficient Labeling for Reachability in Digraphs
We consider labeling nodes of a directed graph for reachability queries....
research
∙
03/14/2020