The complexity of searching a sorted array of strings
From MaRDI portal
Publication:2817623
DOI10.1145/195058.195175zbMath1345.68299OpenAlexW2036797527MaRDI QIDQ2817623
No author found.
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195175
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithms on strings (68W32)
Related Items (1)
This page was built for publication: The complexity of searching a sorted array of strings
