A Binary Search with a Parallel Recovery of the Bits

DOI10.1137/0215060zbMATH Open0608.68056OpenAlexW1988575180MaRDI QIDQ3747741FDOQ3747741

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)

Cited In (2)

• Binary search networks: A new method for key searching
• Title not available (Why is that?)

   Recommendations

• A generalization of binary search 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• PARALLEL BINARY SEARCH WITH DELAYED READ CONFLICTS 👍 👎
• Title not available (Why is that?) 👍 👎
• On Parallel Searching 👍 👎

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)