Unbounded Searching Algorithms

DOI10.1137/0219035MaRDI QIDQ3476283zbMATH OpenOpenAlexFDO

Authors Richard Beigel

Publication date 1990

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

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

zbMATH Keywords

computabilityparallel algorithmprefix codetable lookupunbounded search

Mathematics Subject Classification ID

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

Recommendations

• More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case
• On Parallel Searching
• More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case
• A generalization of binary search
• scientific article; zbMATH DE number 4201596

Cited in

(12)

• Binary search and recursive graph problems
• More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case
• More Nearly Optimal Algorithms for Unbounded Searching, II:The Transfinite Case
• VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM
• scientific article; zbMATH DE number 2123375 (Why is no real title available?)
• scientific article; zbMATH DE number 861625 (Why is no real title available?)
• A generalization of binary search
• Unbounded search and recursive graph problems
• Collection depots facility location problems in trees
• Searching games with errors -- fifty years of coping with liars
• The complexity of finding SUBSEQ(A)
• On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case

This page was built for publication: Unbounded Searching Algorithms

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