Cell-probe bounds for online edit distance and other pattern matching problems

From MaRDI portal

Revision as of 00:25, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5362986

Jump to:navigation, search

DOI10.1137/1.9781611973730.37zbMath1371.68337arXiv1407.6559OpenAlexW2949935342MaRDI QIDQ5362986

Markus Jalsenius, Benjamin Sach, Raphaël Clifford

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.6559

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)

This page was built for publication: Cell-probe bounds for online edit distance and other pattern matching problems

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5362986&oldid=20070049"