The following pages link to Tomohiro I. (Q1671017):
Displaying 50 items.
- (Q313752) (redirect page) (← links)
- Closed factorization (Q313756) (← links)
- Palindrome pattern matching (Q390901) (← links)
- An efficient algorithm to test square-freeness of strings compressed by straight-line programs (Q456098) (← links)
- Inferring strings from suffix trees and links on a binary alphabet (Q496548) (← links)
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399) (← links)
- Verifying and enumerating parameterized border arrays (Q650937) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Faster privacy-preserving computation of edit distance with moves (Q782202) (← links)
- The runs theorem and beyond (Q1622941) (← links)
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← links)
- A faster implementation of online run-length Burrows-Wheeler transform (Q1642727) (← links)
- LZ-ABT: a practical algorithm for \(\alpha \)-balanced grammar compression (Q1671018) (← links)
- Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets (Q1702853) (← links)
- A faster implementation of online RLBWT and its application to LZ77 parsing (Q1711660) (← links)
- Extracting the sparse longest common prefix array from the suffix binary search tree (Q2146135) (← links)
- A separation of \(\gamma\) and \(b\) via Thue-Morse words (Q2146136) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- Space-efficient B trees via load-balancing (Q2169966) (← links)
- Dynamic index and LZ factorization in compressed space (Q2295634) (← links)
- Refining the \(r\)-index (Q2297853) (← links)
- Compressed automata for dictionary matching (Q2344744) (← links)
- Constructing LZ78 tries and position heaps in linear time for large alphabets (Q2346553) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- Detecting regularities on grammar-compressed strings (Q2514148) (← links)
- Deterministic Sparse Suffix Sorting on Rewritable Texts (Q2802962) (← links)
- Detecting Regularities on Grammar-Compressed Strings (Q2849944) (← links)
- Inferring Strings from Lyndon Factorization (Q2922642) (← links)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree (Q2942273) (← links)
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String (Q2949836) (← links)
- Faster Sparse Suffix Sorting (Q2965500) (← links)
- Faster Compact On-Line Lempel-Ziv Factorization (Q2965527) (← links)
- Palindrome Pattern Matching (Q3011857) (← links)
- Arithmetics on Suffix Arrays of Fibonacci Words (Q3449364) (← links)
- Inferring Strings from Full Abelian Periods (Q3459914) (← links)
- Verifying a Parameterized Border Array in O(n 1.5) Time (Q3575251) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- Efficiently Finding All Maximal alpha-gapped Repeats (Q4601891) (← links)
- Fully Dynamic Data Structure for LCE Queries in Compressed Space (Q4608635) (← links)
- Efficient Lyndon Factorization of Grammar Compressed Text (Q4928569) (← links)
- Faster Online Elastic Degenerate String Matching (Q5140772) (← links)
- Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
- Computing Palindromic Factorizations and Palindromic Covers On-line (Q5165601) (← links)
- Compressed Automata for Dictionary Matching (Q5327505) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- A new characterization of maximal repetitions by Lyndon trees (Q5363085) (← links)
- Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction (Q5369533) (← links)
- Deterministic Sparse Suffix Sorting in the Restore Model (Q5888941) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
