In recent years, a new “fine-grained” theory of computational hardness has been developed,
based on “fine-grained reductions” that focus on exact running times for problems …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

The edit distance (aka the Levenshtein distance) between two strings is defined as the
minimum number of insertions, deletions or substitutions of symbols needed to transform …

Consider the following Online Boolean Matrix-Vector Multiplication problem: We are given
an nxn matrix M and will receive n column-vectors of size n, denoted by v1,..., vn, one by …

Wolfgang Dvorák, Paul E. Dunne abstract. In this chapter we give an overview of the core
computational problems arising in formal argumentation together with a complexity analysis …

Two important similarity measures between sequences are the longest common
subsequence (LCS) and the dynamic time war** distance (DTWD). The computations of …

The Fréchet distance is a well-studied and very popular measure of similarity of two curves.
Many variants and extensions have been studied since Alt and Godau introduced this …

Classic similarity measures of strings are longest common subsequence and Levenshtein
distance (ie, The classic edit distance). A classic similarity measure of curves is dynamic …

Large language models (LLMs) have made fundamental changes in human life. The
attention scheme is one of the key components over all the LLMs, such as BERT, GPT-1 …

The radius and diameter are fundamental graph parameters, with several natural definitions
for directed graphs. Each definition is well-motivated in a variety of applications. All versions …