Demo Data from EDBT 2026 / reviewers in the wild / expert
Gal Meirom
dblp:437/2831
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures › sequence algorithms › string algorithms
edit distance |
1.0 | 1 | 2026 | Asymptotic Hausdorff and Language Similarity · ICALP 2026 |
Algorithms and data structures › sequence algorithms › string algorithms › edit distance
normalized edit distance |
1.0 | 1 | 2026 | Asymptotic Hausdorff and Language Similarity · ICALP 2026 |
Algorithms and data structures › sequence algorithms
string algorithms |
1.0 | 1 | 2026 | Asymptotic Hausdorff and Language Similarity · ICALP 2026 |
Methods — techniques the papers use, named apart from their topics
metric lifting · 1.0hausdorff distance · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Asymptotic Hausdorff and Language SimilarityabstractWe introduce the Asymptotic Hausdorff lifting, denoted AH_d, a general method for lifting an element-level metric d to a (pseudo-) metric on sets, that captures asymptotic similarity in infinite domains equipped with a notion of size. The construction is designed to be insensitive to finite deviations and to avoid the limitations of classical Hausdorff-based approaches, which are often overly sensitive to outliers and fail to reflect asymptotic behavior. Formal languages provide a central motivating instance of this framework, where elements are words and sets are languages. When applied to normalized edit distances, the Asymptotic Hausdorff lifting yields metric-valued distances between languages that reflect asymptotic edit behavior while preserving metric structure. We study the equivalence classes of regular languages induced by AH_d for normalized edit distances d, and characterize their asymptotic essence. Focusing in particular on the normalized edit distance of Marzal and Vidal, ned, we investigate the computation of AH_ned for regular languages and for bounded context-free languages. Dana Fisman, Gal Meirom |
ICALP | 2 |