Unbounded Searching Algorithms

DOI10.1137/0219035zbMath0698.68060OpenAlexW1988287732MaRDI QIDQ3476283

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

parallel algorithmprefix codeunbounded searchcomputabilitytable lookup

Mathematics Subject Classification ID

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

Related Items (6)

The complexity of finding SUBSEQ\((A)\) ⋮ Unbounded search and recursive graph problems ⋮ Binary search and recursive graph problems ⋮ On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case ⋮ Collection depots facility location problems in trees ⋮ Searching games with errors -- fifty years of coping with liars

This page was built for publication: Unbounded Searching Algorithms