The following pages link to Simon J. Puglisi (Q313754):
Displaying 26 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)
- Range Predecessor and Lempel-Ziv Parsing (Q4575728) (← links)
- (Q4636645) (← links)
- Computing the Antiperiod(s) of a String (Q5088925) (← links)
- A Succinct Solution to Rmap Alignment (Q5090339) (← links)
- String Inference from Longest-Common-Prefix Array (Q5111393) (← links)
- Disentangled Long-Read De Bruijn Graphs via Optical Maps (Q5111789) (← links)
- Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction (Q5369533) (← links)
- (Q6098778) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
- (Q6159899) (← links)
- Fast and simple compact hashing via bucketing (Q6487602) (← links)
- Pattern discovery in colored strings (Q6487605) (← links)
