( en | de | ru )

 

Disambiguation of "Hirata, Kouichi"

Author of the publication

copydeleteadd this publication to your clipboard
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes.

, , and . Fundam. Informaticae, 101 (3): 157-171 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alessandro Hirata

Carlos Eiji Hirata Ventura

 

Other publications of authors with the same name

Prediction-hardness of acyclic conjunctive queries.. Theor. Comput. Sci., 348 (1): 84-94 (2005)Tractable and Intractable variations of Unordered Tree Edit Distance., , and . Int. J. Found. Comput. Sci., 25 (3): 307-330 (2014)Heavy Caterpillar Distances for Rooted Labeled Unordered Trees., , and . ICPRAM, page 198-204. SCITEPRESS, (2020)Subcaterpillar Isomorphism Between Caterpillars: Subtree Isomorphism Restricted Text and Pattern Trees to Caterpillars., and . ICPRAM, page 89-94. SCITEPRESS, (2023)Caterpillar Inclusion: Inclusion Problem for Rooted Labeled Caterpillars., , and . ICPRAM, page 280-287. SCITEPRESS, (2022)Path Histogram Distance for Rooted Labeled Caterpillars., , and . ACIIDS (1), volume 10751 of Lecture Notes in Computer Science, page 276-286. Springer, (2018)A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences., , and . PAKDD, volume 5476 of Lecture Notes in Computer Science, page 172-183. Springer, (2009)Fast Hilbert Sort Algorithm Without Using Hilbert Indices., , , and . SISAP, volume 9939 of Lecture Notes in Computer Science, page 259-267. (2016)Extracting Minimal and Closed Monotone DNF Formulas., , , and . Discovery Science, volume 3245 of Lecture Notes in Computer Science, page 298-305. Springer, (2004)Extracting Mutually Dependent Multisets., , and . DS, volume 10558 of Lecture Notes in Computer Science, page 267-280. Springer, (2017)