The following pages link to In-Place Suffix Sorting (Q5428837):
Displaying 11 items.
- Burrows-Wheeler transform and LCP array construction in constant space (Q511147) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
- \(p\)-suffix sorting as arithmetic coding (Q1932361) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Computing the Burrows-Wheeler transform in place and in small space (Q2343299) (← links)
- Lightweight data indexing and compression in external memory (Q2429367) (← links)
- Optimal in-place suffix sorting (Q2672235) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
