Category:Search algorithms
![]() | Computing portal |
Here is a list of articles in the Search algorithms category of the Computing portal that unifies foundations of mathematics and computations using computers.
Subcategories
This category has the following 3 subcategories, out of 3 total.
C
H
I
Pages in category "Search algorithms"
The following 122 pages are in this category, out of 122 total.
- Combinatorial search (computing)
- Search algorithm (computing)
(
- (1+ε)-approximate nearest neighbor search (computing)
A
- A* search algorithm (computing)
- All nearest smaller values (computing)
- Alpha–beta pruning (computing)
- Amplitude amplification (computing)
- Any-angle path planning (computing)
- Anytime A* (computing)
- Anytime algorithm (computing)
B
- B* (computing)
- Backjumping (computing)
- Backtracking (computing)
- Bayesian search theory (computing)
- Beam search (computing)
- Beam stack search (computing)
- Best bin first (computing)
- Best Node Search (computing)
- Best node search (computing)
- Best-first search (computing)
- Bidirectional search (computing)
- Binary search algorithm (computing)
- BitFunnel (computing)
- Breadth-first search (computing)
- Brute-force search (computing)
C
- Contraction hierarchies (computing)
- Cuckoo hashing (computing)
D
- D* (computing)
- Dancing Links (computing)
- Depth-first search (computing)
- Dichotomic search (computing)
- Difference-map algorithm (computing)
- Dijkstra's algorithm (computing)
- Disjoint-set data structure (computing)
- Double hashing (computing)
- Dynamic perfect hashing (computing)
E
- Expectiminimax (computing)
- Expectiminimax tree (computing)
- Exponential search (computing)
- Extendible hashing (computing)
F
- Fibonacci search technique (computing)
- Finger search (computing)
- Finger search tree (computing)
- Fractional cascading (computing)
- Fringe search (computing)
G
- Genetic algorithm (computing)
- Geometric hashing (computing)
- Gestalt Pattern Matching (computing)
- God's algorithm (computing)
- Golden-section search (computing)
- Graphplan (computing)
- Grover's algorithm (computing)
H
- Hash function (computing)
- Hash table (computing)
- Hill climbing (computing)
- Hopscotch hashing (computing)
I
- Iterative deepening A* (computing)
- Incremental heuristic search (computing)
- Index mapping (computing)
- Interpolation search (computing)
- Inversion list (computing)
- Inverted index (computing)
- Iterative deepening depth-first search (computing)
J
- Johnson's algorithm (computing)
- Jump point search (computing)
- Jump search (computing)
K
- K-independent hashing (computing)
- K-nearest neighbors algorithm (computing)
- Knuth's Algorithm X (computing)
L
- Late move reductions (computing)
- Late Move Reductions (computing)
- Lexicographic breadth-first search (computing)
- Lifelong Planning A* (computing)
- Linear hashing (computing)
- Linear probing (computing)
- Linear search (computing)
- Locality-sensitive hashing (computing)
- Look-ahead (backtracking) (computing)
M
- MaMF (computing)
- Minimax (computing)
- Mobilegeddon (computing)
- MTD-f (computing)
- Multi-Prob Cut (computing)
- Multiplicative binary search (computing)
N
- Nearest neighbor search (computing)
- NewsRx (company)
- Null-move heuristic (computing)
P
- Parallel metaheuristic (computing)
- Perfect hash function (computing)
- Phrase search (computing)
- Proof of O(log*n) time complexity of union–find (computing)
- Proof-number search (computing)
Q
- Quadratic probing (computing)
- Query expansion (computing)
R
- Rainbow table (computing)
- Range minimum query (computing)
- Rapidly exploring dense trees (computing)
- Rapidly-exploring random tree (computing)
- Rocchio algorithm (computing)
S
- Search game (computing)
- Search tree (computing)
- Search-based software engineering (computing)
- Siamese method (computing)
- Similarity search (computing)
- SMA* (computing)
- Spreading activation (computing)
- SSS* (computing)
- Stack search (computing)
- State space search (computing)
- Sudoku solving algorithms (computing)
T
- Tabu search (computing)
- Ternary search (computing)
- Ternary search tree (computing)
- Theta* (computing)
- Thought vector (computing)
- Trigram search (computing)
U
- Uniform binary search (computing)
- Universal hashing (computing)
- UUHash (computing)
V
- Variable neighborhood search (computing)
- Variation (game tree) (software)
Y
- Yandex Search (computing)