The following pages link to Simon J. Puglisi (Q313754):
Displaying 50 items.
- Closed factorization (Q313756) (← links)
- Colored range queries and document retrieval (Q390874) (← links)
- Enhanced string covering (Q393116) (← links)
- New algorithms on wavelet trees and applications to information retrieval (Q418727) (← links)
- Fast, practical algorithms for computing all the repeats in a string (Q626893) (← links)
- How many runs can a string contain? (Q935160) (← links)
- Lempel-Ziv factorization using less time \& space (Q942991) (← links)
- Words with simple Burrows-Wheeler transforms (Q1010806) (← links)
- Algorithms for anti-powers in strings (Q1641162) (← links)
- Fixed block compression boosting in FM-indexes: theory and practice (Q1739099) (← links)
- RLZAP: relative Lempel-Ziv with adaptive pointers (Q1796822) (← links)
- Analyzing relative Lempel-Ziv reference construction (Q1796845) (← links)
- Longest common abelian factors and large alphabets (Q1796849) (← links)
- String inference from longest-common-prefix array (Q2110373) (← links)
- Fast and simple compact hashing via bucketing (Q2165038) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- Lempel-Ziv-like parsing in small space (Q2205632) (← links)
- Tight upper and lower bounds on suffix tree breadth (Q2220861) (← links)
- Block trees (Q2221797) (← links)
- Approximate pattern matching in LZ77-compressed texts (Q2343301) (← links)
- Block graphs in practice (Q2363994) (← links)
- Order-preserving matching (Q2437748) (← links)
- Bidirectional Variable-Order de Bruijn Graphs (Q2802936) (← links)
- General Document Retrieval in Compact Space (Q2828189) (← links)
- A Faster Grammar-Based Self-index (Q2890196) (← links)
- Document Retrieval on Repetitive Collections (Q2921457) (← links)
- Parallel External Memory Suffix Sorting (Q2942270) (← links)
- Hybrid indexes for repetitive datasets (Q2955636) (← links)
- Faster Approximate Pattern Matching in Compressed Repetitive Texts (Q3104667) (← links)
- Relative Lempel-Ziv Compression of Genomes for Large-Scale Storage and Retrieval (Q3162880) (← links)
- Diverse Palindromic Factorization Is NP-complete (Q3451091) (← links)
- Access, Rank, and Select in Grammar-compressed Strings (Q3452777) (← links)
- Fast and Practical Algorithms for Computing All the Runs in a String (Q3506932) (← links)
- Top-k Ranked Document Search in General Text Databases (Q3586396) (← links)
- Medium-Space Algorithms for Inverse BWT (Q3586485) (← links)
- Space-Time Tradeoffs for Longest-Common-Prefix Array Computation (Q3596712) (← links)
- Testing Stream Ciphers by Finding the Longest Substring of a Given Density (Q3634488) (← links)
- Permuted Longest-Common-Prefix Array (Q3637112) (← links)
- Range Predecessor and Lempel-Ziv Parsing (Q4575728) (← links)
- (Q4636645) (← links)
- Document Listing on Repetitive Collections (Q4928565) (← links)
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small (Q4928572) (← links)
- Computing the Antiperiod(s) of a String (Q5088925) (← links)
- A Succinct Solution to Rmap Alignment (Q5090339) (← links)
- Pattern Discovery in Colored Strings (Q5102044) (← links)
- String Inference from Longest-Common-Prefix Array (Q5111393) (← links)
- Disentangled Long-Read De Bruijn Graphs via Optical Maps (Q5111789) (← links)
- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation (Q5150918) (← links)
- On Suffix Tree Breadth (Q5150919) (← links)
- String Range Matching (Q5165609) (← links)