Tight Bounds for Searching a Sorted Array of Strings
From MaRDI portal
Publication:2706125
DOI10.1137/S0097539797329889zbMath0976.68076WikidataQ56959054 ScholiaQ56959054MaRDI QIDQ2706125
No author found.
Publication date: 19 March 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Adaptive search over sorted sets ⋮ A quick tour on suffix arrays and compressed suffix arrays ⋮ Dichotomic Selection on Words: A Probabilistic Analysis
This page was built for publication: Tight Bounds for Searching a Sorted Array of Strings
