Modified binary searching for static tables

DOI10.1016/S0304-3975(01)00291-2MaRDI QIDQ1608338zbMATH OpenOpenAlexFDO

Authors Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri

Publication date 5 August 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(01)00291-2

zbMATH Keywords

static dictionary problembinary searching

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 1629858
• Fast search algorithms for look‐up tables
• Compact searchable static binary trees
• An implicit data structure for searching a multikey table in logarithmic time
• Searching Semisorted Tables
• A generalization of binary search
• scientific article; zbMATH DE number 6469129
• scientific article; zbMATH DE number 1254244

Cited in

(1)

• scientific article; zbMATH DE number 1629858 (Why is no real title available?)

This page was built for publication: Modified binary searching for static tables

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