15 citations · 20 across the 7 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.FL2022
Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance
Gianfranco Bilardi, Michele Schimd
The edit distance is a metric of dissimilarity between strings, widely applied in computational biology, speech recognition, and machine learning. Let denote the average e…
cs.DS2022
The DAG Visit approach for Pebbling and I/O Lower Bounds
Gianfranco Bilardi, Lorenzo De Stefani
We introduce the notion of an -visit of a Directed Acyclic Graph DAG , a sequence of the vertices of the DAG complying with a given rule . A rule specifies for e…