The following pages link to Combinatorial Pattern Matching (Q5315325):
Displaying 8 items.
- Tight and simple web graph compression for forward and reverse neighbor queries (Q496546) (← links)
- A simple optimal representation for balanced parentheses (Q859854) (← links)
- Algorithms to compute the Burrows-Wheeler similarity distribution (Q2420649) (← links)
- Succinct representation of balanced parentheses and static trees (Q2784479) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- Generation of Well-Formed Parenthesis Strings in Constant Worst-Case Time (Q4217306) (← links)
- Totally Balanced Formal Context Representation (Q5255656) (← links)
- Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space (Q5458854) (← links)