( en | de | ru )

 

Disambiguation of "Bannai, Hideo"

Author of the publication

copydeleteadd this publication to your clipboard
Fully Dynamic Data Structure for LCE Queries in Compressed Space.

, , , , and . MFCS, volume 58 of LIPIcs, page 72:1-72:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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

Computing All Distinct Squares in Linear Time for Integer Alphabets., , and . CPM, volume 78 of LIPIcs, page 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Counting and Verifying Maximal Palindromes., , , and . SPIRE, volume 6393 of Lecture Notes in Computer Science, page 135-146. Springer, (2010)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)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)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)Computing Longest (Common) Lyndon Subsequences., , , , and . IWOCA, volume 13270 of Lecture Notes in Computer Science, page 128-142. Springer, (2022)Estimating Gene Networks from Expression Data and Binding Location Data via Boolean Networks., , , , , and . ICCSA (3), volume 3482 of Lecture Notes in Computer Science, page 349-356. Springer, (2005)General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations., , , and . ECML/PKDD (2), volume 7524 of Lecture Notes in Computer Science, page 435-450. Springer, (2012)Efficient Computation of Substring Equivalence Classes with Suffix Arrays., , , , and . Algorithmica, 79 (2): 291-318 (2017)