# Binary search algorithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- ArXiv
- 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

- AAAI
- 2011

Several MaxSAT algorithms based on iterative SAT solving have been proposed in recent years. These algorithms are in general theâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- SODA
- 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

- Theor. Comput. Sci.
- 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)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE INFOCOM
- 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

- ICASSP
- 1998

We incorporate a higher order measurement-based model for printer dot interactions within the iterative direct binary search (DBSâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- 1988

A technique was developed to automate subjective measurement of the resting states of the eyes. This technique, the Modifiedâ€¦Â (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- J. Comput. Syst. Sci.
- 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)

Is this relevant?

Highly Cited

1971

Highly Cited

1971

- Acta Informatica
- 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

- 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?