The following pages link to Hideo Bannai (Q313750):
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)
- Longest Common Subsequence in at Least k Length Order-Isomorphic Substrings (Q2971148) (← links)
- Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts (Q3011864) (← links)
- (Q3044542) (← links)
- Faster STR-EC-LCS Computation (Q3297762) (← links)
- Minimal Unique Substrings and Minimal Absent Words in a Sliding Window (Q3297764) (← links)
- Diverse Palindromic Factorization Is NP-complete (Q3451091) (← links)
- Inferring Strings from Full Abelian Periods (Q3459914) (← links)
- Efficient Computation of Substring Equivalence Classes with Suffix Arrays (Q3506935) (← links)
- REACHABILITY ON SUFFIX TREE GRAPHS (Q3532147) (← links)
- Verifying a Parameterized Border Array in O(n 1.5) Time (Q3575251) (← links)
- Algorithms for String Pattern Discovery (Q3603421) (← links)
- Counting Parameterized Border Arrays for a Binary Alphabet (Q3618600) (← links)
- A Series of Run-Rich Strings (Q3618614) (← links)
- Lightweight Parameterized Suffix Array Construction (Q3651558) (← links)
- (Q4409168) (← links)
- (Q4420643) (← links)
- (Q4452128) (← 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)
- Diverse Palindromic Factorization is NP-Complete (Q4640035) (← links)
- (Q4708582) (← links)
- (Q4736019) (← links)
- (Q4737698) (← 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)
- Indexing the bijective BWT (Q5088907) (← 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)
- Finding all maximal perfect haplotype blocks in linear time (Q5091735) (← links)
- Faster STR-IC-LCS Computation via RLE (Q5110885) (← links)
- (Q5110887) (← links)
- Tight bounds on the maximum number of shortest unique substrings (Q5110890) (← links)
- Small-space LCE data structure with constant-time queries (Q5111224) (← links)
- Almost linear time computation of maximal repetitions in run length encoded strings (Q5136252) (← links)
- (Q5140763) (← links)
- Online LZ77 Parsing and Matching Statistics with RLBWTs (Q5140769) (← links)
- Faster Online Elastic Degenerate String Matching (Q5140772) (← links)
- Longest substring palindrome after edit (Q5140775) (← links)
- (Q5140779) (← links)
- Longest Lyndon Substring After Edit (Q5140783) (← links)
- Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
- Order Preserving Pattern Matching on Trees and DAGs (Q5150939) (← links)