activity
20182022
most citedFaster Algorithms for Bounded Tree Edit Distance

2 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2022

Tight Dynamic Problem Lower Bounds from Generalized BMM and OMv

Ce Jin, Yinzhan Xu

The main theme of this paper is using -dimensional generalizations of the combinatorial Boolean Matrix Multiplication (BMM) hypothesis and the closely-related Online Matrix Vect…