In a recent breakthrough paper, Chi et al.(STOC'22) introduce an O˜(n 3+ ω 2) time algorithm
to compute Monotone Min-Plus Product between two square matrices of dimensions n× n …

The edit distance (also known as Levenshtein distance) of two strings is the minimum
number of insertions, deletions, and substitutions of characters needed to transform one …

Given two strings of length n over alphabet Σ, and an upper bound k on their edit distance,
the algorithm of Myers (Algorithmica'86) and Landau and Vishkin (JCSS'88) from almost …

We study the online variant of the language distance problem for two classical formal
languages, the language of palindromes and the language of squares, and for the two most …

The Dyck language, which consists of well-balanced sequences of parentheses, is one of
the most fundamental context-free languages. The Dyck edit distance quantifies the number …

Computing the edit distance of two strings is one of the most basic problems in computer
science and combinatorial optimization. Tree edit distance is a natural generalization of edit …

The tree edit distance (TED) between two rooted ordered trees with $ n $ nodes labeled
from an alphabet $\Sigma $ is the minimum cost of transforming one tree into the other by a …

The edit distance of two strings is the minimum number of insertions, deletions, and
substitutions needed to transform one string into the other. The textbook algorithm …

We revisit the problem of multiplying two square matrices over the (min,+) semi-ring, where
all entries are integers from a bounded range [-M: M]∪{∞}. The current state of the art for …

We consider the problem of obtaining approximation algorithms for standard edit distance
and Dyck edit distance that are simple, deterministic and fast, but whose approximation …