B
Benjamin Rossman
Researcher at University of Toronto
Publications - 70
Citations - 1732
Benjamin Rossman is an academic researcher from University of Toronto. The author has contributed to research in topics: Upper and lower bounds & Monotone polygon. The author has an hindex of 20, co-authored 69 publications receiving 1576 citations. Previous affiliations of Benjamin Rossman include Duke University & University of Cambridge.
Papers
More filters
Journal ArticleDOI
An optimal decomposition algorithm for tree edit distance
TL;DR: This article presents a worst-case O(n) 3-time algorithm for the problem when the two trees have size n, and proves the optimality of the algorithm among the family of decomposition strategy algorithms—which also includes the previous fastest algorithms—by tightening the known lower bound.
Journal ArticleDOI
Homomorphism preservation theorems
TL;DR: It is proved that the h.p.t. remains valid when restricted to finite structures (unlike many other classical preservation theorems, including the Łoś--Tarski theorem and Lyndon's positivity theorem).
Journal ArticleDOI
Semantic essence of AsmL
TL;DR: The design rationale of AsmL is explained, static and dynamic semantics for a kernel of the language are provided, and high-level mathematical data-structures are provided.
Proceedings ArticleDOI
On the constant-depth complexity of k-clique
TL;DR: The m-variable fragment of first-order logic, denoted by FOm, consists of the first- order sentences which involve at most m variables and implies that the bounded variable hierarchy FO1 ⊂ FO2 ... ⊁ FOm ... is strict in terms of expressive power on finite ordered graphs.
Journal ArticleDOI
An O(n^3)-Time Algorithm for Tree Edit Distance
TL;DR: In this paper, a worst-case algorithm for the edit distance between two ordered trees with vertex labels is presented, which requires a novel adaptive strategy for deciding how a dynamic program divides into subproblems, and a deeper understanding of the previous algorithms for the problem.