A Binary Search with a Parallel Recovery of the Bits

DOI10.1137/0215060MaRDI QIDQ3747741zbMATH OpenOpenAlexFDO

Authors Benjamin Arazi

Publication date 1986

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

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

zbMATH Keywords

finite fieldsmodular arithmeticlocation recovery in ordered sets

Mathematics Subject Classification ID

Searching and sorting (68P10) Galois theory (11S20) Finite fields and commutative rings (number-theoretic aspects) (11T99) Ordered fields (12J15)

Recommendations

• A generalization of binary search
• scientific article; zbMATH DE number 975424
• scientific article; zbMATH DE number 4078826
• PARALLEL BINARY SEARCH WITH DELAYED READ CONFLICTS
• scientific article; zbMATH DE number 3860406
• On Parallel Searching

Cited in

(2)

• Binary search networks: A new method for key searching
• scientific article; zbMATH DE number 910960 (Why is no real title available?)

This page was built for publication: A Binary Search with a Parallel Recovery of the Bits

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