Category:Algorithms

A

• Computer algebra‎ (1 C, 52 P)
• Algorithmic information theory‎ (23 P)
• Algorithmic trading‎ (15 P)
• Approximation algorithms‎ (39 P)

B

• Behavior selection algorithms‎ (2 P)
• Bioinformatics algorithms‎ (4 C, 41 P)

C

• Checksum algorithms‎ (2 C, 31 P)
• Combinatorial algorithms‎ (5 C, 23 P)
• Computer arithmetic algorithms‎ (2 C, 24 P)
• Concurrent algorithms‎ (2 C, 6 P)
• Cryptographic algorithms‎ (5 C, 67 P)

D

• Database algorithms‎ (10 P)
• Digit-by-digit algorithms‎ (26 P)
• Digital signal processing‎ (11 C, 224 P)
• Distributed algorithms‎ (3 C, 52 P)

E

• Error detection and correction‎ (6 C, 129 P)
• External memory algorithms‎ (6 P)

F

• FFT algorithms‎ (18 P)
• Fingerprinting algorithms‎ (9 P)

G

• Graph algorithms‎ (2 C, 138 P)

I

• Iteration in programming‎ (1 C, 13 P)

M

• Machine learning algorithms‎ (1 C, 86 P)
• Memory management algorithms‎ (1 C, 16 P)

N

• Networking algorithms‎ (2 C, 11 P)
• Computational number theory‎ (2 C, 18 P)
• Numerical analysis‎ (20 C, 267 P)

O

• Optimization algorithms and methods‎ (8 C, 185 P)

P

• Pattern matching‎ (3 C, 32 P)
• Computational physics‎ (6 C, 109 P)
• Programming idioms‎ (2 C, 13 P)
• Pseudo-polynomial time algorithms‎ (4 P)
• Pseudorandom number generators‎ (53 P)

Q

• Quantum algorithms‎ (32 P)

R

• Recursion‎ (4 C, 46 P)
• Root-finding algorithms‎ (44 P)
• Routing algorithms‎ (44 P)

S

• Scheduling algorithms‎ (1 C, 26 P)
• Search algorithms‎ (4 C, 130 P)
• Signal processing‎ (13 C, 307 P)
• Sorting algorithms‎ (2 C, 53 P)
• Statistical algorithms‎ (2 C, 28 P)
• Computational statistics‎ (10 C, 53 P)
• Algorithms on strings‎ (5 C, 13 P)

U

• Unicode algorithms‎ (6 P)

• Algorithm
• Coded exposure photography

*

• Hub labels
• List of algorithm general topics
• List of algorithms
• Unrestricted algorithm

A

• Adaptive algorithm
• Algorism
• The Algorithm Auction
• Algorithm characterizations
• Algorithm engineering
• Algorithmic game theory
• Algorithmic logic
• Algorithmic management
• Algorithmic mechanism design
• Algorithmic paradigm
• Algorithmic Puzzles
• Algorithmic transparency
• Algorithms and Combinatorics
• Algorithms of Oppression
• Automate This
• AVT Statistical filtering algorithm

B

• Bartels–Stewart algorithm
• Behavior selection algorithm
• Berlekamp's root finding algorithm
• Berlekamp–Rabin algorithm
• Birkhoff algorithm
• Software:Bisection (software engineering)
• Block swap algorithms
• British Museum algorithm
• Broadcast (parallel pattern)

C

• Physics:Car–Parrinello molecular dynamics
• Certifying algorithm
• Chandy-Misra-Haas algorithm resource model
• Chandy–Misra–Haas algorithm resource model
• Chinese Whispers (clustering method)
• Chinese whispers (clustering method)
• Collaborative diffusion
• Collective operation
• Collective transferable vote
• Collision problem
• Communication-avoiding algorithm
• Communication-avoiding algorithms

D

• Decrease and conquer
• Decrease-and-conquer
• Devex algorithm
• Distributed tree search
• Divide and conquer algorithm
• Divide-and-conquer algorithm
• Domain reduction algorithm
• DONE
• Driver scheduling problem

E

• EdgeRank
• Emergent algorithm
• Enumeration algorithm
• External memory algorithm

F

• Flajolet–Martin algorithm

G

• Generalized distributive law
• Gutmann method

H

• HAKMEM
• Hall circles
• Higuchi dimension
• Hindley–Milner type system
• Holographic algorithm
• How to Solve it by Computer
• Hybrid algorithm
• Hyphenation algorithm

I

• In-place algorithm
• Irish logarithm
• Iteration

J

• Jumble algorithm
• Jump-and-Walk algorithm

K

• Kinodynamic planning
• Biology:KiSAO
• Kleene's algorithm
• Krauss matching wildcards algorithm
• Krauss wildcard-matching algorithm
• Kunerth's algorithm
• Kunstweg

L

• Label Propagation Algorithm
• Lamé's theorem
• Lancichinetti–Fortunato–Radicchi benchmark
• Learning augmented algorithm
• Least-squares spectral analysis
• Lion algorithm
• List of cryptosystems
• Long division

M

• Magic state distillation
• Plotting algorithms for the Mandelbrot set
• Manhattan address algorithm
• The Master Algorithm
• Maze generation algorithm
• Maze solving algorithm
• Maze-solving algorithm
• Medicine:Medical algorithm
• Miller's recurrence algorithm
• Monte Carlo polarization
• Multiplicative weight update method

N

• Neural Style Transfer
• Neural style transfer
• Newest vertex bisection
• Newman–Janis algorithm
• Non-malleable code
• Non-malleable codes
• Note G

O

• One-pass algorithm
• Online optimization

P

• Pan-Tompkins algorithm
• Pan–Tompkins algorithm
• Parallel external memory
• Parameterized approximation algorithm
• Phase-stretch Adaptive Gradient-field Extractor
• PHY-Level Collision Avoidance
• Ping-pong scheme
• Pointer jumping
• Predictor–corrector method
• Proof of authority
• Proof-of-authority

R

• Randomization function
• Randomized rounding
• Reduce (parallel pattern)
• Reduction (complexity)
• Regulation of algorithms
• Rendezvous hashing
• Reservoir sampling
• Right to explanation
• Run to completion scheduling
• Run-time algorithm specialisation
• Run-time algorithm specialization

S

• Sardinas–Patterson algorithm
• Sequential algorithm
• Serial algorithm
• Shapiro - Senapathy Algorithm
• Shapiro Senapathy algorithm
• Shapiro–Senapathy algorithm
• Shuffling algorithm
• Sieve of Eratosthenes
• Sieve of Pritchard
• Physics:Simulation algorithms for atomic DEVS
• Simulation algorithms for coupled DEVS
• Snap rounding
• Sparse identification of non-linear dynamics
• Social:Spreading activation
• Super-recursive algorithm

T

• Tarjan's algorithm
• Text-to-Video model
• Text-to-video model
• Time Warp Edit Distance
• Timeline of algorithms
• Token-based replay
• Tomasulo algorithm
• Tomasulo's algorithm
• Trajectoid

W

• Weak Stability Boundary
• Weak stability boundary
• Whitehead's algorithm
• Women in Data Science Initiative

X

• XOR swap algorithm
• Xulvi-Brunet - Sokolov algorithm
• Xulvi-Brunet–Sokolov algorithm

Z

• Zassenhaus algorithm