research
∙
09/15/2022
Õ(n+poly(k))-time Algorithm for Bounded Tree Edit Distance
Computing the edit distance of two strings is one of the most basic prob...
share
research
∙
09/11/2022
Dynamic Subset Sum with Truly Sublinear Processing Time
Subset sum is a very old and fundamental problem in theoretical computer...
research
∙
05/27/2022
Adaptive Massively Parallel Algorithms for Cut Problems
We study the Weighted Min Cut problem in the Adaptive Massively Parallel...
research
∙
11/02/2021
Adaptive Massively Parallel Constant-round Tree Contraction
Miller and Reif's FOCS'85 classic and fundamental tree contraction algor...
research
∙
10/25/2019
Massively Parallel Algorithms for String Matching with Wildcards
We study distributed algorithms for string matching problem in presence ...
research
∙
05/16/2018
