Wing
John Mauchly, 1946
Efficiently finds a target value in a sorted array by repeatedly halving the search range.
Edward F. Moore, 1959
Explores a graph level by level, visiting all neighbors of each node before moving deeper.
Robert Tarjan, 1968
Explores a graph by diving as deep as possible along each branch before backtracking.
W. W. Peterson, 1970
Searches a sorted array by estimating the target's position proportionally within the value range.
Folklore, 1970
Repeats depth-first search with increasing depth bounds, gaining BFS-like completeness on finite branching factors.