Pages that link to "Item:Q2921650"
From MaRDI portal
The following pages link to A categorization theorem on suffix arrays with applications to space efficient text indexes (Q2921650):
Displaying 12 items.
- Succinct representations of permutations and functions (Q441860) (← links)
- A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
- Time-space trade-offs for compressed suffix arrays. (Q1853020) (← links)
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation (Q1944955) (← links)
- When a dollar makes a BWT (Q2220786) (← links)
- On the combinatorics of suffix arrays (Q2445335) (← links)
- Space efficient suffix trees (Q2729650) (← links)
- Deterministic Sparse Suffix Sorting on Rewritable Texts (Q2802962) (← links)
- Combinatorial properties of poly-Bernoulli relatives (Q5384165) (← links)
- REMARKABLE RELATIONS BETWEEN THE CENTRAL BINOMIAL SERIES, EULERIAN POLYNOMIALS, AND POLY-BERNOULLI NUMBERS, LEADING TO STEPHAN'S OBSERVATION (Q6091040) (← links)
- On suffix tree detection (Q6545407) (← links)
- On suffix tree detection (Q6593670) (← links)