Pages that link to "Item:Q2215968"
From MaRDI portal
The following pages link to Fast algorithms for single and multiple pattern Cartesian tree matching (Q2215968):
Displaying 8 items.
- More efficient bottom-up multi-pattern matching in trees (Q685356) (← links)
- An efficient algorithm for some tree matching problems (Q1182118) (← links)
- Position heaps for Cartesian-tree matching on strings and tries (Q2146147) (← links)
- Finding patterns and periods in Cartesian tree matching (Q2207506) (← links)
- TWO RELATED ALGORITHMS FOR ROOT-TO-FRONTIER TREE PATTERN MATCHING (Q3421842) (← links)
- (Q4471382) (← links)
- A Faster CREW PRAM Algorithm for Computing Cartesian Trees (Q4924663) (← links)
- Approximate Cartesian tree matching: an approach using swaps (Q6545412) (← links)