Pages that link to "Item:Q685487"
From MaRDI portal
The following pages link to Tight comparison bounds for the string prefix-matching problem (Q685487):
Displaying 6 items.
- On the weak prefix-search problem (Q390882) (← links)
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- How the character comparison order shapes the shift function of on-line pattern matching algorithms (Q671355) (← links)
- Exact bounds on the complexity of sequential string matching algorithms (Q1326953) (← links)
- (Q4228434) (← links)
- Optimal parallel algorithms for Prefix Matching (Q4632427) (← links)