Pages that link to "Item:Q3521910"
From MaRDI portal
The following pages link to Constructing Efficient Dictionaries in Close to Sorting Time (Q3521910):
Displaying 24 items.
- Optimal encodings for range majority queries (Q270016) (← links)
- Motif matching using gapped patterns (Q401471) (← links)
- A distribution-sensitive dictionary with low space overhead (Q414433) (← links)
- \(k\)-abelian pattern matching (Q491150) (← links)
- Universal compressed text indexing (Q1729689) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- New space/time tradeoffs for top-\(k\) document retrieval on sequences (Q2015136) (← links)
- Suffix trays and suffix trists: structures for faster text indexing (Q2354023) (← links)
- Construct a perfect word hash function in time independent of the size of integers (Q2404612) (← links)
- Dynamic construction of an antidictionary with linear complexity (Q2437769) (← links)
- The parameterized suffix tray (Q2692728) (← links)
- Alphabet-Dependent String Searching with Wexponential Search Trees (Q2942254) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- Dispersing hash functions (Q3055765) (← links)
- Dictionary Matching in a Stream (Q3452800) (← links)
- Approximating LZ77 via Small-Space Multiple-Pattern Matching (Q3452816) (← links)
- Computing runs on a trie (Q5088914) (← links)
- (Q5091065) (← links)
- (Q5091170) (← links)
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet (Q5111729) (← links)
- Elastic-Degenerate String Matching via Fast Matrix Multiplication (Q5864665) (← links)
- Circular pattern matching with \(k\) mismatches (Q5918999) (← links)
- Internal pattern matching queries in a text and applications (Q6621750) (← links)
- Elastic-degenerate string matching with 1 error or mismatch (Q6635705) (← links)
