Category:Algorithms

A

• Computer algebra (2 C, 52 P)
• Algorithm description languages (1 C, 7 P)
• Algorithmic information theory (22 P)
• Algorithmic trading (1 C, 14 P)
• Approximation algorithms (39 P)

B

• Bioinformatics algorithms (4 C, 39 P)

C

• Calendar algorithms (8 P)
• Checksum algorithms (2 C, 25 P)
• Combinatorial algorithms (5 C, 24 P)
• Compression algorithms (3 C, 4 P)
• Computer arithmetic algorithms (3 C, 20 P)
• Concurrent algorithms (2 C, 5 P)
• Cryptographic algorithms (13 C, 55 P)

D

• Data mining algorithms (2 C, 7 P)
• Database algorithms (1 C, 11 P)
• Digit-by-digit algorithms (24 P)
• Digital signal processing (15 C, 208 P)
• Distributed algorithms (6 C, 41 P)
• Divide-and-conquer algorithms (10 P)

E

• Error detection and correction (6 C, 128 P)
• External memory algorithms (1 C, 6 P)

F

• Fair division protocols (1 C, 42 P)
• Fast Fourier transforms (17 P)
• Fingerprinting algorithms (1 C, 10 P)

G

• Government by algorithm (3 C, 47 P)
• Graph algorithms (3 C, 138 P)
• Greedy algorithms (10 P)
• Computational group theory (13 P)

H

• Heuristic algorithms (1 C, 16 P)

I

• Iteration in programming (1 C, 13 P)

L

• Line clipping algorithms (4 P)

M

• Machine learning algorithms (1 C, 95 P)
• Memory management algorithms (1 C, 15 P)

N

• Networking algorithms (2 C, 12 P)
• Computational number theory (2 C, 17 P)
• Numerical analysis (23 C, 238 P)

O

• Online algorithms (2 C, 17 P)
• Optimization algorithms and methods (11 C, 168 P)

P

• Pattern matching (5 C, 30 P)
• Computational physics (11 C, 100 P)
• Programming idioms (2 C, 13 P)
• Pseudo-polynomial time algorithms (4 P)
• Pseudorandom number generators (1 C, 50 P)

Q

• Quantum algorithms (33 P)

R

• Recursion (5 C, 46 P)
• Reduction (complexity) (19 P)
• Root-finding algorithms (2 C, 24 P)
• Routing algorithms (1 C, 42 P)

S

• Scheduling algorithms (4 C, 19 P)
• Search algorithms (6 C, 118 P)
• Selection algorithms (8 P)
• Signal processing (19 C, 300 P, 1 F)
• Sorting algorithms (5 C, 48 P)
• Statistical algorithms (2 C, 29 P)
• Computational statistics (11 C, 53 P)
• Streaming algorithms (6 P)
• Algorithms on strings (9 C, 10 P)

U

• Unicode algorithms (5 P)

• Algorithm

*

• 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–Rabin algorithm
• Birkhoff algorithm
• Bisection (software engineering)
• Block swap algorithms
• British Museum algorithm
• Broadcast (parallel pattern)

C

• Car–Parrinello molecular dynamics
• Catalytic computing
• Certifying algorithm
• Chandy–Misra–Haas algorithm resource model
• Collaborative diffusion
• Collective operation
• Collision problem
• Communication-avoiding algorithm
• Symposium on Experimental Algorithms

D

• Decrease-and-conquer
• Dependency network (graphical model)
• Devex algorithm
• Distributed tree search
• Divide-and-conquer algorithm
• Domain reduction algorithm
• DONE
• Driver scheduling problem

E

• EdgeRank
• Education by algorithm
• Emergent algorithm
• Enumeration algorithm
• External memory algorithm

F

• Flajolet–Martin algorithm
• Free Spaced Repetition Scheduler

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
• KiSAO
• Kleene's algorithm
• Knuth–Eve algorithm
• Knuth–Plass line-breaking algorithm
• Kunstweg

L

• Lancichinetti–Fortunato–Radicchi benchmark
• Learning augmented algorithm
• Least-squares spectral analysis
• Leiden algorithm
• Lion algorithm
• List of cryptosystems
• Long division

M

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

N

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

O

• Online optimization

P

• Pan–Tompkins algorithm
• Parallel external memory
• Parameterized approximation algorithm
• PHY-Level Collision Avoidance
• Ping-pong scheme
• Pointer algorithm
• Pointer jumping
• Pol.is
• Predictor–corrector method
• Proof of authority

R

• Randomized rounding
• Regulation of algorithms
• Rendezvous hashing
• Reservoir sampling
• Right to explanation
• Run-time algorithm specialization
• Run-to-completion scheduling

S

• Sardinas–Patterson algorithm
• Sequential algorithm
• Serial algorithm
• Shapiro–Senapathy algorithm
• Shuffling algorithm
• Sieve of Eratosthenes
• Sieve of Pritchard
• Sikidy
• Snap rounding
• Sparse identification of non-linear dynamics
• Spreading activation

T

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

U

• Recommender system
• Upper Confidence Bound

W

• Weak stability boundary
• Whitehead's algorithm
• Wiki survey

X

• XOR swap algorithm
• Xulvi-Brunet–Sokolov algorithm

Z

• Zassenhaus algorithm