Pages that link to "Item:Q2942254"
From MaRDI portal
The following pages link to Alphabet-Dependent String Searching with Wexponential Search Trees (Q2942254):
Displaying 17 items.
- Lempel-Ziv-78 compressed string dictionaries (Q724216) (← links)
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts (Q2309475) (← links)
- Full-fledged real-time indexing for constant size alphabets (Q2408918) (← links)
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506) (← links)
- Alphabet-Dependent String Searching with Wexponential Search Trees (Q2942254) (← links)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- (Q5005170) (← links)
- (Q5088897) (← links)
- Online algorithms for constructing linear-size suffix trie (Q5088922) (← links)
- Engineering Practical Lempel-Ziv Tries (Q5102060) (← links)
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction (Q5136278) (← links)
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries (Q5150931) (← links)
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets (Q6093582) (← links)
- Linear time online algorithms for constructing linear-size suffix trie (Q6614010) (← links)
