Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets.

[BibT_eX]

[DOI]

Pawel Gawrychowski

Tomohiro I

Shunsuke Inenaga

Dominik Köppl

Florin Manea

Theory Comput. Syst., 2018

A faster implementation of online RLBWT and its application to LZ77 parsing.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2018

Approximate Frequent Pattern Discovery in Compressed Space.

[BibT_eX]

[DOI]

IEICE Trans. Inf. Syst., 2018

Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes.

[BibT_eX]

[DOI]

Tomohiro I

Dominik Köppl

CoRR, 2018

Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees.

[BibT_eX]

[DOI]

Algorithmica, 2018

Block Palindromes: A New Generalization of Palindromes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

Privacy-Preserving String Edit Distance with Moves.

[BibT_eX]

[DOI]

Proceedings of the Similarity Search and Applications - 11th International Conference, 2018

LZ-ABT: A Practical Algorithm for α-Balanced Grammar Compression.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

The Runs Theorem and Beyond.

[BibT_eX]

[DOI]

Tomohiro I

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Lyndon Factorization of Grammar Compressed Texts Revisited.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Online LZ77 Parsing and Matching Statistics with RLBWTs.

[BibT_eX]

[DOI]

Hideo Bannai

Travis Gagie

Tomohiro I

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

Faster Online Elastic Degenerate String Matching.

[BibT_eX]

[DOI]

Proceedings of the Annual Symposium on Combinatorial Pattern Matching, 2018

2017

Inferring strings from Lyndon factorization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The "Runs" Theorem.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

A Faster Implementation of Online Run-Length Burrows-Wheeler Transform.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

A Space-Optimal Grammar Compression.

[BibT_eX]

[DOI]

Yoshimasa Takabatake

Tomohiro I

Hiroshi Sakamoto

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Longest Common Extensions with Recompression.

[BibT_eX]

[DOI]

Tomohiro I

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Closed factorization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Efficiently Finding All Maximal alpha-gapped Repeats.

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Fully Dynamic Data Structure for LCE Queries in Compressed Space.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Deterministic Sparse Suffix Sorting on Rewritable Texts.

[BibT_eX]

[DOI]

Johannes Fischer

Tomohiro I

Dominik Köppl

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Online Grammar Compression for Frequent Pattern Discovery.

[BibT_eX]

[DOI]

Proceedings of the 13th International Conference on Grammatical Inference, 2016

Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

Compressed automata for dictionary matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Constructing LZ78 tries and position heaps in linear time for large alphabets.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Detecting regularities on grammar-compressed strings.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Dynamic index, LZ factorization, and LCE queries in compressed space.

[BibT_eX]

[DOI]

CoRR, 2015

Efficiently Finding All Maximal $α$-gapped Repeats.

[BibT_eX]

[DOI]

CoRR, 2015

A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

Beyond the Runs Theorem.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

A new characterization of maximal repetitions by Lyndon trees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Inferring Strings from Full Abelian Periods.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Arithmetics on Suffix Arrays of Fibonacci Words.

[BibT_eX]

[DOI]

Dominik Köppl

Tomohiro I

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Lempel Ziv Computation in Small Space (LZ-CISS).

[BibT_eX]

[DOI]

Johannes Fischer

Tomohiro I

Dominik Köppl

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

Inferring strings from suffix trees and links on a binary alphabet.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Faster Compact On-Line Lempel-Ziv Factorization.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Faster Sparse Suffix Sorting.

[BibT_eX]

[DOI]

Tomohiro I

Juha Kärkkäinen

Dominik Kempa

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Computing Palindromic Factorizations and Palindromic Covers On-line.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013

Palindrome pattern matching.

[BibT_eX]

[DOI]

Tomohiro I

Shunsuke Inenaga

Masayuki Takeda

Theor. Comput. Sci., 2013

Computing Reversed Lempel-Ziv Factorization Online.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Computing Convolution on Grammar-Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the 2013 Data Compression Conference, 2013

From Run Length Encoding to LZ78 and Back Again.

[BibT_eX]

[DOI]

Proceedings of the 2013 Data Compression Conference, 2013

Efficient Lyndon Factorization of Grammar Compressed Text.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012

An efficient algorithm to test square-freeness of strings compressed by straight-line programs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

The Position Heap of a Trie.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

2011

Verifying and enumerating parameterized border arrays.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

2010

Counting and Verifying Maximal Palindromes.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2010

Verifying a Parameterized Border Array in O(n1.5) Time.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

Counting Parameterized Border Arrays for a Binary Alphabet.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

Lightweight Parameterized Suffix Array Construction.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

Tomohiro I

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...