( en | de | ru )

 

Disambiguation of "Bannai, Hideo"

Author of the publication

copydeleteadd this publication to your clipboard
Tight Bounds on the Maximum Number of Shortest Unique Substrings.

, , , and . CPM, volume 78 of LIPIcs, page 24:1-24:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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.

Hideo Baba

Hideo Ohashi

Hideo Andreas Baba

Hideo Ikezawa-Hanada

 

Other publications of authors with the same name

Estimating gene networks from gene expression data by combining Bayesian network model with promoter element detection., , , , , , and . ECCB, page 227-236. (2003)Generalized pattern matching and periodicity under substring consistent equivalence relations., , , , and . Theor. Comput. Sci., (2016)Efficient Computation of Substring Equivalence Classes with Suffix Arrays., , , , and . Algorithmica, 79 (2): 291-318 (2017)Faster Compact On-Line Lempel-Ziv Factorization, , , , and . CoRR, (2013)Finding Characteristic Substrings from Compressed Texts., and . Stringology, page 40-54. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2009)Bit-parallel Algorithms for Computing all the Runs in a String., , , , and . Stringology, page 203-213. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2009)Computing Reversed Lempel-Ziv Factorization Online., , , , and . Stringology, page 107-118. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2013)New Lower Bounds for the Maximum Number of Runs in a String., , , , and . Stringology, page 140-145. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2008)NP-Completeness for the Space-Optimality of Double-Array Tries., , , and . CoRR, (2024)Computing Longest (Common) Lyndon Subsequences., , , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 128-142. Springer, (2022)