Tomohiro I

According to our database1, Tomohiro I
  • authored at least 67 papers between 2009 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
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.
Theory Comput. Syst., 2018

Approximate Frequent Pattern Discovery in Compressed Space.
IEICE Transactions, 2018

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

Online LZ77 Parsing and Matching Statistics with RLBWTs.
CoRR, 2018

2017
Inferring strings from Lyndon factorization.
Theor. Comput. Sci., 2017

The "Runs" Theorem.
SIAM J. Comput., 2017

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

A Faster Implementation of Online Run-Length Burrows-Wheeler Transform.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

A Space-Optimal Grammar Compression.
Proceedings of the 25th Annual European Symposium on Algorithms, 2017

Longest Common Extensions with Recompression.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
Faster Lyndon factorization algorithms for SLP and LZ78 compressed text.
Theor. Comput. Sci., 2016

Closed factorization.
Discrete Applied Mathematics, 2016

Deterministic sub-linear space LCE data structures with efficient construction.
CoRR, 2016

Dynamic index and LZ factorization in compressed space.
CoRR, 2016

Fully dynamic data structure for LCE queries in compressed space.
CoRR, 2016

Longest Common Extensions with Recompression.
CoRR, 2016

Online Grammar Compression for Frequent Pattern Discovery.
CoRR, 2016

Dynamic Index and LZ Factorization in Compressed Space.
Proceedings of the Prague Stringology Conference 2016, 2016

Efficiently Finding All Maximal alpha-gapped Repeats.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Fully Dynamic Data Structure for LCE Queries in Compressed Space.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Deterministic Sparse Suffix Sorting on Rewritable Texts.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Online Grammar Compression for Frequent Pattern Discovery.
Proceedings of the 13th International Conference on Grammatical Inference, 2016

Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Compressed automata for dictionary matching.
Theor. Comput. Sci., 2015

Constructing LZ78 tries and position heaps in linear time for large alphabets.
Inf. Process. Lett., 2015

Detecting regularities on grammar-compressed strings.
Inf. Comput., 2015

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

Constructing LZ78 Tries and Position Heaps in Linear Time for Large Alphabets.
CoRR, 2015

Efficiently Finding All Maximal $α$-gapped Repeats.
CoRR, 2015

Lempel Ziv Computation In Small Space (LZ-CISS).
CoRR, 2015

Deterministic Sparse Suffix Sorting on Rewritable Texts.
CoRR, 2015

A Faster Algorithm for Computing Maximal \alpha -gapped Repeats in a String.
Proceedings of the String Processing and Information Retrieval, 2015

Beyond the Runs Theorem.
Proceedings of the String Processing and Information Retrieval, 2015

A new characterization of maximal repetitions by Lyndon trees.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Inferring Strings from Full Abelian Periods.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Arithmetics on Suffix Arrays of Fibonacci Words.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Lempel Ziv Computation in Small Space (LZ-CISS).
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
Inferring strings from suffix trees and links on a binary alphabet.
Discrete Applied Mathematics, 2014

A new characterization of maximal repetitions by Lyndon trees.
CoRR, 2014

Closed Factorization.
Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Faster Compact On-Line Lempel-Ziv Factorization.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Faster Sparse Suffix Sorting.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

Inferring Strings from Lyndon Factorization.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Computing Palindromic Factorizations and Palindromic Covers On-line.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
Palindrome pattern matching.
Theor. Comput. Sci., 2013

Faster Compact On-Line Lempel-Ziv Factorization
CoRR, 2013

Detecting regularities on grammar-compressed strings
CoRR, 2013

Efficient Lyndon factorization of grammar compressed text
CoRR, 2013

Computing convolution on grammar-compressed text
CoRR, 2013

Compressed Automata for Dictionary Matching.
Proceedings of the Implementation and Application of Automata, 2013

Computing Reversed Lempel-Ziv Factorization Online.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Faster Lyndon Factorization Algorithms for SLP and LZ78 Compressed Text.
Proceedings of the String Processing and Information Retrieval, 2013

Detecting Regularities on Grammar-Compressed Strings.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Computing Convolution on Grammar-Compressed Text.
Proceedings of the 2013 Data Compression Conference, 2013

From Run Length Encoding to LZ78 and Back Again.
Proceedings of the 2013 Data Compression Conference, 2013

Efficient Lyndon Factorization of Grammar Compressed Text.
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.
Inf. Process. Lett., 2012

The Position Heap of a Trie.
Proceedings of the String Processing and Information Retrieval, 2012

General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2012

2011
Verifying and enumerating parameterized border arrays.
Theor. Comput. Sci., 2011

Inferring Strings from Suffix Trees and Links on a Binary Alphabet.
Proceedings of the Prague Stringology Conference 2011, 2011

Palindrome Pattern Matching.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010
Counting and Verifying Maximal Palindromes.
Proceedings of the String Processing and Information Retrieval, 2010

Verifying a Parameterized Border Array in O(n1.5) Time.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009
Counting Parameterized Border Arrays for a Binary Alphabet.
Proceedings of the Language and Automata Theory and Applications, 2009

Lightweight Parameterized Suffix Array Construction.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009


  Loading...