Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,211,764 papers from all fields of science
Search
Sign In
Create Free Account
Binary search algorithm
Known as:
Binary chop
, Binary search
, Bsearch
In computer science, binary search, also known as half-interval search or logarithmic search, is a search algorithm that finds the position of a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
ALGOL 60
Algorithmic efficiency
Amortized analysis
Analysis of algorithms
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Two approaches for solving the buffer allocation problem in unreliable production lines
Leyla Demir
,
S. Tunali
,
D. Eliiyi
,
A. Løkketangen
Computers & Operations Research
2013
Corpus ID: 27220866
2012
2012
Estimating Collision Set Size in Framed Slotted Aloha Wireless Networks and RFID Systems
A. Zanella
IEEE Communications Letters
2012
Corpus ID: 7630355
In wireless networks and RFID systems, a collision set is a group of nodes such that the simultaneous transmission of two or more…
Expand
Highly Cited
2006
Highly Cited
2006
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Jérémy Félix Barbay
,
Alexander Golynski
,
J. Munro
,
S. Rao
Theoretical Computer Science
2006
Corpus ID: 7426055
Highly Cited
2006
Highly Cited
2006
Enhanced binary search with cut-through operation for anti-collision in RFID systems
Tsan-Pin Wang
IEEE Communications Letters
2006
Corpus ID: 35598385
RFID systems allow contactless identification of objects using radio frequency. When there is more than one transponder within…
Expand
Highly Cited
2005
Highly Cited
2005
A wide-range and fast-locking all-digital cycle-controlled delay-locked loop
Hsiang-Hui Chang
,
Shen-Iuan Liu
IEEE Journal of Solid-State Circuits
2005
Corpus ID: 25695048
An all-digital cycle-controlled delay-locked loop (DLL) is presented to achieve wide range operation, fast lock and process…
Expand
2004
2004
Speed and accuracy comparison of techniques for multiuser detection in synchronous CDMA
F. Hasegawa
,
Jie Luo
,
K. Pattipati
,
P. Willett
,
D. Pham
IEEE Transactions on Communications
2004
Corpus ID: 2036254
In this letter, we compare the complexity and efficiency of several methods used for multiuser detection in a synchronous code…
Expand
Highly Cited
2000
Highly Cited
2000
Minimizing a Convex Cost Closure Set
D. Hochbaum
,
M. Queyranne
SIAM Journal on Discrete Mathematics
2000
Corpus ID: 16510963
We study here a convex optimization problem with variables subject to a given partial order. This problem is a generalization of…
Expand
1995
1995
Automated reasoning with contour maps
T. Cronin
1995
Corpus ID: 62172633
1993
1993
Transient waveform estimation of high-speed MCM networks using complex frequency hopping
E. Chiprout
,
M. Nakhla
Proceedings IEEE Multi-Chip Module Conference…
1993
Corpus ID: 56954903
The authors point out that moment-matching techniques that have been proposed for efficient transient waveform estimation of…
Expand
1969
1969
Randomized binary search technique
S. Arora
,
W. Dent
CACM
1969
Corpus ID: 14362636
A mathematical model is developed for the mean and variance of the number of trials to recover a given document in a randomly…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE