Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ALGOL 60Algorithmic efficiencyAmortized analysisAnalysis of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Continuous Optimization Optimal algorithms for the a -neighbor p -center problem
Assigning multiple service facilities to demand points is important when demand points are required to withstand service facility… 
2012
2012
Estimating Collision Set Size in Framed Slotted Aloha Wireless Networks and RFID Systems
In wireless networks and RFID systems, a collision set is a group of nodes such that the simultaneous transmission of two or more… 
Highly Cited
2006
Highly Cited
2006
Adaptive searching in succinctly encoded binary relations and tree-structured documents
2006
2006
Content-based image retrieval using association rule mining with soft relevance feedback
Highly Cited
2006
Highly Cited
2006
Enhanced binary search with cut-through operation for anti-collision in RFID systems
RFID systems allow contactless identification of objects using radio frequency. When there is more than one transponder within… 
2006
2006
The distance trisector curve
Given points P and Q in the plane, we are interested in separating them by two curves C<sub>1</sub> and C<sub>2</sub> such that… 
Highly Cited
2005
Highly Cited
2005
A wide-range and fast-locking all-digital cycle-controlled delay-locked loop
An all-digital cycle-controlled delay-locked loop (DLL) is presented to achieve wide range operation, fast lock and process… 
2005
2005
An ultra-low-power fast-lock-in small-jitter all-digital DLL
Using binary-weighted differential-delay cells and an asynchronous binary search circuit, the proposed 1.0V 0.25 /spl mu/m all… 
2004
2004
Speed and accuracy comparison of techniques for multiuser detection in synchronous CDMA
In this letter, we compare the complexity and efficiency of several methods used for multiuser detection in a synchronous code… 
1972
1972
Dynamic Memories with Enhanced Data Access
Dynamic memories are commonly constructed as circulating shift registers, and thus have access times that are proportional to the… 
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)