The following pages link to Masayuki Takeda (Q390900):
Displayed 50 items.
- LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding (Q2942259) (← links)
- Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree (Q2942273) (← links)
- An Opportunistic Text Indexing Structure Based on Run Length Encoding (Q2947038) (← links)
- A Faster Algorithm for Computing Maximal $$\alpha $$-gapped Repeats in a String (Q2949836) (← links)
- Faster Compact On-Line Lempel-Ziv Factorization (Q2965527) (← links)
- Palindrome Pattern Matching (Q3011857) (← links)
- Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts (Q3011864) (← links)
- (Q3024794) (← links)
- (Q3024796) (← links)
- (Q3044513) (← links)
- (Q3044547) (← links)
- Online Linear Optimization over Permutations (Q3104653) (← links)
- (Q3143040) (← links)
- Faster STR-EC-LCS Computation (Q3297762) (← links)
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window (Q3297764) (← links)
- A Possibility of Nuclear Reaction Near the Three-Body Break-Up Threshold (Q3299783) (← links)
- A RUN-TIME EFFICIENT IMPLEMENTATION OF COMPRESSED PATTERN MATCHING AUTOMATA (Q3395142) (← links)
- Inferring Strings from Full Abelian Periods (Q3459914) (← links)
- Efficient Computation of Substring Equivalence Classes with Suffix Arrays (Q3506935) (← links)
- Smooth Boosting for Margin-Based Ranking (Q3529924) (← links)
- REACHABILITY ON SUFFIX TREE GRAPHS (Q3532147) (← links)
- Ternary Directed Acyclic Word Graphs (Q3559790) (← links)
- Verifying a Parameterized Border Array in O(n 1.5) Time (Q3575251) (← links)
- A Run-Time Efficient Implementation of Compressed Pattern Matching Automata (Q3602815) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- Lightweight Parameterized Suffix Array Construction (Q3651558) (← links)
- (Q3933780) (← links)
- (Q3942363) (← links)
- (Q4290657) (← links)
- (Q4420643) (← links)
- (Q4454542) (← links)
- (Q4474138) (← links)
- (Q4547744) (← links)
- (Q4547748) (← links)
- (Q4547750) (← links)
- (Q4608599) (← links)
- Shortest Unique Substring Queries on Run-Length Encoded Strings (Q4608632) (← links)
- Fully Dynamic Data Structure for LCE Queries in Compressed Space (Q4608635) (← links)
- (Q4708582) (← links)
- (Q4736063) (← links)
- (Q4736067) (← links)
- (Q4737697) (← links)
- Efficient LZ78 Factorization of Grammar Compressed Text (Q4913725) (← links)
- Converting SLP to LZ78 in almost Linear Time (Q4928557) (← links)
- Efficient Lyndon Factorization of Grammar Compressed Text (Q4928569) (← links)
- Computing runs on a trie (Q5088914) (← links)
- Faster queries for longest substring palindrome after block edit (Q5088918) (← links)
- On the size of overlapping Lempel-Ziv and Lyndon factorizations (Q5088921) (← links)
- Faster STR-IC-LCS Computation via RLE (Q5110885) (← links)
- Tight bounds on the maximum number of shortest unique substrings (Q5110890) (← links)