Pages that link to "Item:Q5110877"
From MaRDI portal
The following pages link to Communication and Streaming Complexity of Approximate Pattern Matching (Q5110877):
Displaying 4 items.
- Towards Optimal Approximate Streaming Pattern Matching by Matching Multiple Patterns in Multiple Streams (Q5002743) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313029) (← links)
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (Q5458365) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)