On the Complexity of Searching a Set of Vectors

DOI10.1137/0209012MaRDI QIDQ3891774zbMATH OpenOpenAlexFDO

Authors Daniel S. Hirschberg

Publication date 1980

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/fa2b927053f852977d1956898a7ce8f0003d2317

zbMATH Keywords

lower boundsvector searching problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• Supporting random access in files of variable length records
• A quick tour on suffix arrays and compressed suffix arrays

This page was built for publication: On the Complexity of Searching a Set of Vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3891774)