Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
I., Tomohiro
Inenaga, Shunsuke
Bannai, Hideo
and
Takeda, Masayuki
2010.
Combinatorial Pattern Matching.
Vol. 6129,
Issue. ,
p.
238.
I, Tomohiro
Inenaga, Shunsuke
Bannai, Hideo
and
Takeda, Masayuki
2010.
String Processing and Information Retrieval.
Vol. 6393,
Issue. ,
p.
135.
Clément, Julien
and
Giambruno, Laura
2014.
LATIN 2014: Theoretical Informatics.
Vol. 8392,
Issue. ,
p.
442.
I, Tomohiro
Inenaga, Shunsuke
Bannai, Hideo
and
Takeda, Masayuki
2014.
Inferring strings from suffix trees and links on a binary alphabet.
Discrete Applied Mathematics,
Vol. 163,
Issue. ,
p.
316.
Nakashima, Yuto
Okabe, Takashi
I, Tomohiro
Inenaga, Shunsuke
Bannai, Hideo
and
Takeda, Masayuki
2014.
Mathematical Foundations of Computer Science 2014.
Vol. 8635,
Issue. ,
p.
565.
Gawrychowski, Paweł
Jeż, Artur
and
Jeż, Łukasz
2014.
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online.
Theory of Computing Systems,
Vol. 54,
Issue. 2,
p.
337.
Gawrychowski, Paweł
Kociumaka, Tomasz
Radoszewski, Jakub
Rytter, Wojciech
and
Waleń, Tomasz
2015.
Algorithms and Data Structures.
Vol. 9214,
Issue. ,
p.
386.
Starikovskaya, Tatiana
and
Vildhøj, Hjalte Wedel
2015.
A suffix tree or not a suffix tree?.
Journal of Discrete Algorithms,
Vol. 32,
Issue. ,
p.
14.
Starikovskaya, Tatiana
and
Vildhøj, Hjalte Wedel
2015.
Combinatorial Algorithms.
Vol. 8986,
Issue. ,
p.
338.
Allen, Emily
Blanchet-Sadri, F.
Bodnar, Michelle
Bowers, Brian
Hidakatsu, Joe
and
Lensmire, John
2016.
Combinatorics on partial word borders.
Theoretical Computer Science,
Vol. 609,
Issue. ,
p.
469.
Gelle, Kitti
and
Iván, Szabolcs
2017.
Descriptional Complexity of Formal Systems.
Vol. 10316,
Issue. ,
p.
152.
Nakashima, Yuto
Okabe, Takashi
I, Tomohiro
Inenaga, Shunsuke
Bannai, Hideo
and
Takeda, Masayuki
2017.
Inferring strings from Lyndon factorization.
Theoretical Computer Science,
Vol. 689,
Issue. ,
p.
147.
CLÉMENT, JULIEN
and
GIAMBRUNO, LAURA
2017.
Representing prefix and border tables: results on enumeration.
Mathematical Structures in Computer Science,
Vol. 27,
Issue. 2,
p.
257.
Gelle, Kitti
and
Iván, Szabolcs
2018.
Recognizing Union-Find trees is NP-complete.
Information Processing Letters,
Vol. 131,
Issue. ,
p.
7.
Gelle, Kitti
and
Iván, Szabolcs
2019.
Recognizing Union-Find Trees is NP-Complete, Even Without Rank Info.
International Journal of Foundations of Computer Science,
Vol. 30,
Issue. 06n07,
p.
1029.
Gawrychowski, Paweł
Kociumaka, Tomasz
Radoszewski, Jakub
Rytter, Wojciech
and
Waleń, Tomasz
2020.
Universal reconstruction of a string.
Theoretical Computer Science,
Vol. 812,
Issue. ,
p.
174.
Kärkkäinen, Juha
Piątkowski, Marcin
and
Puglisi, Simon J.
2023.
String inference from longest-common-prefix array.
Theoretical Computer Science,
Vol. 942,
Issue. ,
p.
180.
Amir, Amihood
Kondratovsky, Eitan
and
Levy, Avivit
2023.
String Processing and Information Retrieval.
Vol. 14240,
Issue. ,
p.
14.
Kumagai, Koshiro
Hendrian, Diptarama
Yoshinaka, Ryo
and
Shinohara, Ayumi
2023.
WALCOM: Algorithms and Computation.
Vol. 13973,
Issue. ,
p.
115.
Amir, Amihood
Kondratovsky, Eitan
and
Levy, Avivit
2024.
On suffix tree detection.
Theoretical Computer Science,
Vol. 1012,
Issue. ,
p.
114728.