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.
2014
2014
Practical Volume-reduction Strategies for Low-power High-frequency Switch Mode Power Supplies
The miniaturization of dc–dc switch-mode power supplies (SMPS) is of a key importance in volume-sensitive portable devices, such… 
2009
2009
Implementation of the Enhanced Binary-SIME method for finding transient stability limits with PSS/E™
The Enhanced Binary-Single Machine Infinite bus Equivalent (Binary-SIME) method is an enhancement of the SIME method. It provides… 
2008
2008
An Enhanced Binary Anti-Collision Algorithm of Backtracking in RFID System
AN ENHANCED BINARY ANTI-COLLISIONALGORITHM OF BACKTRACKING IN RFID SYSTEMX.-L. Shi, X.-W. Shi, Q.-L. Huang, and F. WeiNational… 
2007
2007
Routing in Optical and Non-Optical Networks using Boolean Satisfiability
Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s… 
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… 
2005
2005
Scheduling distributed real-time systems by satisfiability checking
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems. In contrast to the… 
2003
2003
A Pipeline-Based Approach for Scheduling Video Processing Algorithms on NOW
Network Of Workstations (NOW) platforms put together with off-the-shelf workstations and networking hardware have become a cost… 
2003
2003
Multi-objective Binary Search Optimisation
In complex engineering problems, often the objective functions can be very slow to evaluate. This paper introduces a new… 
1999
1999
T-treap and Cache Performance of Indexing Data Structures
As memory becomes cheaper and larger in capacity, more and more databases are being stored entirely in main memory. Furthermore… 
1992
1992
Image Approximation by Self Aane Fractals
This thesis describes a novel method for approximating digital images and similar data. The work is based on deterministic… 
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)