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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper proposes a modification to the traditional binary search algorithm in which it checks the presence of the input… (More)
Is this relevant?
2011
2011
Several MaxSAT algorithms based on iterative SAT solving have been proposed in recent years. These algorithms are in general the… (More)
  • table 1
  • figure 1
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We study a noisy version of the classic binary search problem of inserting an element into its proper place within an ordered… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We introduce a monoid structure on the set of binary search trees, by a process very similar to the construction of the plactic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
High-speed networks with large delays present a unique environment where TCP may have a problem utilizing the full bandwidth… (More)
Is this relevant?
1998
1998
We incorporate a higher order measurement-based model for printer dot interactions within the iterative direct binary search (DBS… (More)
  • figure 3
  • figure 4
  • figure 1
  • figure 2
  • figure 7
Is this relevant?
Highly Cited
1988
Highly Cited
1988
A technique was developed to automate subjective measurement of the resting states of the eyes. This technique, the Modified… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
1978
Highly Cited
1978
We consider the problem of identifying an unknown value x E (1, Z,..., n} using only comparisons of x to constants when as many… (More)
  • figure 1
Is this relevant?
Highly Cited
1971
Highly Cited
1971
One of the popular methods for retrieving information by its " n a m e " is to store the names in a binary tree. To find if a… (More)
Is this relevant?
1969
1969
In computer science, a binary search or half-interval search algorithm locates the position of an item in a sortedarray. [1][2… (More)
Is this relevant?