BIROn - Birkbeck Institutional Research Online
    Up a level
    Export as [feed] Atom [feed] RSS
    Group by: Author(s) | Date | School | No Grouping
    Number of items: 1.

    Charalampopoulos, Panagiotis and Gawrychowski, P. and Mozes, S. and Weimann, O. (2022) On the hardness of computing the edit distance of shallow trees. Lecture Notes in Computer Science 13617 , pp. 290-302. ISSN 0302-9743.

    This list was generated on Fri May 10 02:36:10 2024 BST.