Login / Signup

On the Communication Complexity of Approximate Pattern Matching.

Tomasz KociumakaJakob NoglerPhilip Wellnitz
Published in: CoRR (2024)
Keyphrases
  • approximate pattern matching
  • pattern matching
  • worst case
  • communication networks
  • computational complexity
  • upper bound
  • data management
  • structured data