Searching Semisorted Tables

DOI10.1137/0214059MaRDI QIDQ3700848zbMATH OpenOpenAlexFDO

Authors Helmut Alt, K. Mehlhorn

Publication date 1985

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

Full work available at URL https://doi.org/10.1137/0214059

zbMATH Keywords

comparison treesimplicit data structures

Mathematics Subject Classification ID

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

Recommendations

• Average-Case Lower Bounds for Searching
• Tables should be sorted (on random access machines)
• On Parallel Searching
• A generalization of binary search
• Searching ordered structures

Cited in

(8)

• Sorting and searching revisted
• Modified binary searching for static tables
• No sorting? Better searching!
• A tradeoff between search and update time for the implicit dictionary problem
• Sorting by search intensity
• Tables should be sorted (on random access machines)
• scientific article; zbMATH DE number 1629858 (Why is no real title available?)
• Partial match retrieval in implicit data structures

This page was built for publication: Searching Semisorted Tables

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