The following pages link to Deterministic Dictionaries (Q2765957):
Displaying 21 items.
- The algorithm for identical object searching with bounded worst-case complexity and linear memory (Q341823) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Substring range reporting (Q517792) (← links)
- Faster query algorithms for the text fingerprinting problem (Q549671) (← links)
- A simple optimal representation for balanced parentheses (Q859854) (← links)
- Matching subsequences in trees (Q1026243) (← links)
- Efficient vertex-label distance oracles for planar graphs (Q1743124) (← links)
- Fast compressed self-indexes with deterministic linear-time construction (Q1986963) (← links)
- Multiple-edge-fault-tolerant approximate shortest-path trees (Q2072097) (← links)
- Compressing dictionary matching index via sparsification technique (Q2354027) (← links)
- Fast and compact regular expression matching (Q2378530) (← links)
- Construct a perfect word hash function in time independent of the size of integers (Q2404612) (← links)
- Faster Lightweight Lempel-Ziv Parsing (Q2946413) (← links)
- A subquadratic algorithm for 3XOR (Q5005162) (← links)
- Real-Time Streaming Multi-Pattern Search for Constant Alphabet (Q5111729) (← links)
- Fast Compressed Self-Indexes with Deterministic Linear-Time Construction (Q5136278) (← links)
- Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations (Q5157397) (← links)
- Tight tradeoffs in searchable symmetric encryption (Q5925503) (← links)
- Tight bound for the number of distinct palindromes in a tree (Q6042101) (← links)
- (Q6065428) (← links)
- Approximate distance sensitivity oracles in subquadratic space (Q6566476) (← links)
