Author of the publication

Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings.

, , , , , , , , and . SOFSEM, volume 10139 of Lecture Notes in Computer Science, page 363-374. Springer, (2017)

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.

 

Other publications of authors with the same name

Counterexamples to the long-standing conjecture on the complexity of BDD binary operations., , , , and . Inf. Process. Lett., 112 (16): 636-640 (2012)Preface., , , and . Fundam. Informaticae, 146 (4): i-ii (2016)Sequence binary decision diagram: Minimization, relationship to acyclic automata, and complexities of Boolean set operations., , , and . Discret. Appl. Math., (2016)Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings., , , , , , , , and . SOFSEM, volume 10139 of Lecture Notes in Computer Science, page 363-374. Springer, (2017)Duel and Sweep Algorithm for Order-Preserving Pattern Matching., , , , and . SOFSEM, volume 10706 of Lecture Notes in Computer Science, page 624-635. Springer, (2018)Efficient Parameterized Pattern Matching in Sublinear Space., , , and . SPIRE, volume 14240 of Lecture Notes in Computer Science, page 271-283. Springer, (2023)An Attempt Towards Learning Semantics: Distributional Learning of IO Context-Free Tree Grammars.. TAG, page 90-98. ACL, (2012)PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data., and . ALT, volume 8139 of Lecture Notes in Computer Science, page 143-157. Springer, (2013)AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching., , and . SPIRE, volume 9954 of Lecture Notes in Computer Science, page 110-121. (2016)Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages., , and . LATA, volume 6031 of Lecture Notes in Computer Science, page 596-607. Springer, (2010)