17 citations · 22 across the 5 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019★ 5 cited
Equivalences between triangle and range query problems
Lech Duraj, Krzysztof Kleiner, Adam Polak +1
We define a natural class of range query problems, and prove that all problems within this class have the same time complexity (up to polylogarithmic factors). The equivalence is v…
cs.DS2019
A sub-quadratic algorithm for the longest common increasing subsequence problem
Lech Duraj
The Longest Common Increasing Subsequence problem (LCIS) is a natural variant of the celebrated Longest Common Subsequence (LCS) problem. For LCIS, as well as for LCS, there is an…