Pages that link to "Item:Q719256"
From MaRDI portal
The following pages link to Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256):
Displaying 16 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Compressed property suffix trees (Q386003) (← links)
- A faster implementation of online RLBWT and its application to LZ77 parsing (Q1711660) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Approximate query processing over static sets and sliding windows (Q1981762) (← links)
- Faster online computation of the succinct longest previous factor array (Q2106621) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
- Compressed Data Structures for Dynamic Sequences (Q3452849) (← links)
- Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract) (Q3521934) (← links)
- (Q5088897) (← links)
- Approximate query processing over static sets and sliding windows (Q5091046) (← links)
- Succinct Partial Sums and Fenwick Trees (Q5150921) (← links)
- Partial sums on the ultra-wide word RAM (Q5918471) (← links)
- (Q6065455) (← links)
- Random access in persistent strings and segment selection (Q6174650) (← links)