Communication and Streaming Complexity of Approximate Pattern Matching
From MaRDI portal
Publication:5110877
DOI10.4230/LIPIcs.CPM.2017.13zbMath1434.68743OpenAlexW2750924648MaRDI QIDQ5110877
Publication date: 25 May 2020
Full work available at URL: https://hal.science/hal-03942927
communication complexitystreaming algorithmsedit distanceapproximate pattern matchingrandomised algorithms
Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27) Algorithms on strings (68W32) Communication complexity, information complexity (68Q11)
Related Items (1)
This page was built for publication: Communication and Streaming Complexity of Approximate Pattern Matching