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.
Highly Cited
2010
Highly Cited
2010
Three-dimensional beta-shapes and beta-complexes via quasi-triangulation
Highly Cited
2006
Highly Cited
2006
Adaptive searching in succinctly encoded binary relations and tree-structured documents
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… 
Highly Cited
2006
Highly Cited
2006
RTSAT-- An Optimal and Efficient Approach to the Task Allocation Problem in Distributed Architectures
We present an advanced SAT-based approach to the task and message allocation problem of distributed real-time systems. In… 
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… 
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… 
Highly Cited
2004
Highly Cited
2004
In search of the optimum test set - adaptive test methods for maximum defect coverage and lowest test cost
Maintaining product quality at reasonable test cost in very deep sub-micron process has become a major challenge especially due… 
2000
2000
Compact Suux Array ?
Suux array is a data structure that can be used to index a large text le so that queries of its content can be answered quickly… 
Highly Cited
2000
Highly Cited
2000
Minimizing a Convex Cost Closure Set
We study here a convex optimization problem with variables subject to a given partial order. This problem is a generalization of… 
1993
1993
Transient waveform estimation of high-speed MCM networks using complex frequency hopping
The authors point out that moment-matching techniques that have been proposed for efficient transient waveform estimation of… 
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)