All articles
Every article on kipu, in one list.
1335
- 2-SAT vs 3-SAT
- 2048
- 3D Gaussian Splatting
- 3SUM Hardness
- A* Search
- Abelian Sandpiles
- Abstract Interpretation: Proving Programs Safe Without Running Them
- Abstract Syntax Trees
- Active Contours (Snakes)
- Active Learning
- Active Queue Management
- Adaptive Noise Cancellation
- Adaptive Radix Tree
- Adaptive Step-Size Integration
- Address Space Layout Randomization
- ADMM
- ADMM: Splitting Problems to Solve Them Together
- Adversarial Examples
- AES
- Aho-Corasick
- AKS Primality
- Alpha Shapes
- AlphaGo and Self-Play
- Ambient Occlusion
- American Options (Longstaff-Schwartz)
- Amplitude Amplification
- Angle trisection
- Angry Birds
- Ant Colony Optimization
- Anti-Aliasing
- Apportionment
- Approximation Algorithms
- APSP Equivalences
- ARIES Crash Recovery
- Arithmetic Coding
- Arrow-Debreu: When Markets Find Equilibrium
- Arrow's Theorem
- Arthur-Merlin Protocols
- Artificial Bee Colony
- Assortative Mixing
- Asymmetric Numeral Systems
- Attribute-Based Encryption
- Auctions & Mechanism Design
- Authenticated Encryption (AEAD)
- Autoencoders
- Automatic Differentiation
- Autotune (PSOLA)
- Average-Case Complexity
- Baby-Step Giant-Step
- Backpressure
- Backpropagation
- Balanced Search Trees
- Balancing an Inverted Pendulum
- Barnes-Hut N-Body
- Barrington's Theorem
- Barycentric Coordinates
- Batch Normalization
- Battleship Puzzle
- Bayes' Theorem
- Bayesian Networks
- Bayesian Optimization
- Bayesian Optimization
- BB84 Quantum Key Distribution
- BBR Congestion Control
- BCH Codes
- Beam Search
- Beat Detection
- Belief Propagation
- Bell Inequalities
- Bellman-Ford
- Benders Decomposition
- Benford's Law
- Berlekamp–Massey
- Berlekamp's Factorization
- Betweenness Centrality
- Bézier Curves
- BFGS & Quasi-Newton Methods
- BGP Path Selection
- Bidirectional Type Checking
- Bilevel Optimization
- Bin Packing
- Binary Decision Diagrams
- Binary Decision Diagrams
- Binomial Option Pricing
- Biquad Filters
- Birch and Swinnerton-Dyer
- Bisimulation
- Blind Signatures
- Block Cipher Modes
- Blockchain Consensus
- Bloom Filter Variants
- Bloom Filters
- Bloom-Filter Spellcheck
- BLS Signatures
- BM25 Ranking
- Bode, Nyquist & Stability Margins
- Boolean Pythagorean Triples
- Boolean Satisfiability
- Booth's Multiplier
- Boson Sampling
- Bounded Arithmetic
- Bounded Model Checking
- Bounding Volume Hierarchies
- Boyer-Moore Majority Vote
- Boyer-Moore Search
- BPP: Does Randomness Help?
- BQP: Quantum-Efficient Problems
- Braess's Paradox
- Branch and Bound
- Branch Prediction
- Branch-and-Cut
- Bresenham's Circle
- Bresenham's Line Algorithm
- Bridges and Articulation Points
- Buchberger's Algorithm
- Büchi Automata
- Buffer Overflow
- Buffer Pool Management
- Buffon's Needle
- Buffon's Noodle
- Bug Algorithms
- Bulgarian Solitaire
- Bulletproofs
- Bundle Methods
- Burrows-Wheeler Compression
- Burrows-Wheeler Transform
- Byte-Pair Encoding
- Byte-Pair Encoding Tokenization
- Bytecode Interpreters
- Byzantine Generals
- Cache Coherence (MESI)
- Cache Eviction Policies
- Cache-Oblivious Algorithms
- Calvin: Deterministic Transactions
- Candy Crush
- Canny Edge Detection
- CAP Theorem
- CAPM & Beta
- Cardinality Estimation
- Carry-Lookahead Adder
- Catalan Numbers
- Catmull-Rom Splines
- Causal Consistency
- CDCL Clause Learning
- CEGAR
- Cellular Automata
- Centroid Decomposition
- Chain Replication
- Chain-of-Thought Reasoning
- Chaitin's Omega
- Chan's Algorithm
- Chance-Constrained Optimization
- Chandy-Lamport Global Snapshot
- Change Data Capture
- Checkers
- Chernoff Bounds
- Chinese Remainder Theorem
- Cholesky Decomposition
- Chomp
- Chord DHT
- Christofides Algorithm
- Cipolla's Algorithm
- Circle Packing
- Circuit Complexity
- Classifier-Free Guidance
- Cliques and Strangers
- Closest Pair of Points
- Closest Pair of Points
- CMA-ES
- Coalescent Theory
- Coin Change
- Collaborative Filtering
- Colonel Blotto: Splitting Forces Across Battlefields
- Color Quantization (Median Cut)
- Coloring the Plane
- Column Generation
- Column Generation
- Columnar Compression
- Combinatorial Auctions
- Combinatorial Clock Auction
- Commitment Schemes
- Common-Subexpression Elimination
- Communication Complexity
- Community Detection
- Community Detection (Louvain)
- Competitive Coevolution
- Compressed Sensing
- Computing Nash Equilibria
- Concatenated Codes
- Concentration Inequalities
- Configuration Space
- Conflict-Free Replicated Data Types
- Conformal Prediction
- Congestion Games
- Connect Four
- Connected-Components Labeling
- Consistent Hashing
- Constant Propagation
- Constraint Satisfaction
- Contact Tracing
- Content Delivery Networks
- Continuation-Passing Style
- Continued Fractions
- Contrastive Learning
- Contrastive Learning (SimCLR)
- Control-Flow Integrity
- Controllability & Observability
- Convex Hull
- Convolution Reverb
- Convolutional Codes and Viterbi Decoding
- Convolutional Neural Networks
- Conway's Game of Life
- Cook–Levin Theorem
- Coordinate Descent
- Copulas & Tail Dependence
- Copy-on-Write
- Coresets
- Correlated Equilibrium
- Cost-Based Query Optimization
- Count-Min Sketch
- Count-Min Sketch for Heavy Hitters
- Counting (#P)
- Counting Distinct Elements
- Counting Sort and Radix Sort
- Counting Spanning Trees
- Coverage-Guided Fuzzing
- CPS Transformation
- CPU Scheduling
- Craig Interpolation
- CRC Checksums
- CRF Sequence Labeling
- CRISPR Guide Design
- Cross-Entropy Optimization
- Crossword Construction
- Cryptography's Hidden Lock
- CSRF and XSS
- Cuckoo Hashing
- Cuckoo Search
- Cutting Planes
- Cutting Without Waste
- CYK Parsing
- Cylindrical Algebraic Decomposition
- D* Lite
- Dancing Links (DLX)
- Dantzig-Wolfe Decomposition
- Database Reconstruction
- Davenport-Schinzel Sequences
- De Bruijn Graph Assembly
- De Casteljau's Algorithm
- Deadlock Detection
- Decision Trees
- Deferred Acceptance
- Degree-Preserving Rewiring
- Delaunay Triangulation
- Density Functional Theory
- Dependency Parsing
- Dependent Types: When Types Carry Proofs
- Descriptive Complexity
- Determinant vs Permanent
- Deutsch–Jozsa Algorithm
- DFA Minimization (Hopcroft's Algorithm)
- Dichotomy Theorems
- Difference of Convex
- Differential Evolution
- Differential Power Analysis
- Differential Privacy
- Differentially Private SGD
- Diffie-Hellman
- Diffusion Models
- Digital Signatures
- Dijkstra's Algorithm
- Dimensionality Reduction
- Dinic's Algorithm
- Dining Philosophers
- Diophantine Equations
- Direct Preference Optimization (DPO)
- Distributed Consensus
- Distributed Key Generation
- DNS Resolution
- Do Two Programs Do the Same Thing?
- Docking Scoring Functions
- Dominating Set
- Dots and Boxes
- Doubling the Cube
- Douglas-Peucker Simplification
- DP on DAGs
- DP Synthetic Data
- DPLL and CDCL
- DPLL SAT Solving
- Dropout
- Dual Contouring
- Dubins Paths
- Duration & Convexity
- E-graphs & Equality Saturation
- Ear Clipping Triangulation
- Earley Parser
- ECDSA
- Edge Coloring
- Edge Cover
- Edit Distance Is SETH-Hard
- Edmonds' Blossom Algorithm
- Effect Systems
- EKF-SLAM
- Electronic Band Structure
- ElGamal Encryption
- Elias Gamma Coding
- Elliptic-Curve Cryptography
- Endgame Tablebases
- Energy-Based Models
- Entropy Coding: Huffman vs Arithmetic vs ANS
- Envy-Free Cake Cutting
- EPaxos (Egalitarian Paxos)
- Epidemics on Networks
- Epsilon-Nets
- Erasure Coding
- Erdős Conjecture on Arithmetic Progressions
- Erdős–Rényi Random Graphs
- Error-Correcting Memory (ECC)
- Escape Analysis
- Estimation of Distribution Algorithms
- Euclid's Algorithm
- Euler Tour Trees
- Euler vs Hamilton
- Euler's 36 Officers
- Evolutionarily Stable Strategies
- Ewald Summation
- Exact Cover
- Exact Exponential Algorithms
- Expander Codes
- Expectation-Maximization
- Exponential Histograms
- Exponential Time Hypothesis
- External-Memory Algorithms
- Facility Location (p-median)
- Fair Division
- Fair Queueing
- Fairness in Machine Learning
- Fast Fourier Transform
- Fast Multiplication
- Fault-Injection Attacks
- FDTD for Maxwell's Equations
- Federated Averaging
- Federated Learning
- Feedback Vertex Set
- Feistel Networks
- Fibonacci Heaps
- Fine-Grained Complexity
- Finite Automata: DFA and NFA
- Firefly Algorithm
- Fisher Markets: Competitive Equilibrium with Budgets
- Fitness Landscapes
- Fixed-Parameter Tractability
- FlashAttention
- Floating Point (IEEE 754)
- Floating-Point Pitfalls
- Flood-It
- Flow Free
- Floyd-Warshall
- FLP Impossibility
- Format-Preserving Encryption
- Format-String Vulnerability
- Fortune's Algorithm
- Fortune's Algorithm
- Forward Error Correction
- Fountain Codes
- Fountain Codes (LT)
- FreeCell
- Fusion Trees
- Futexes
- Fuzzy Autocomplete
- Gabor Filters
- Gambler's Ruin
- GANs
- Garbage Collection
- Garbled Circuits
- GARCH Volatility
- Gaussian Elimination
- Gaussian Processes
- Gaussian Quadrature
- Genetic Algorithms
- Genetic Programming
- Geometric Brownian Motion
- Geometric Duality
- Gerrymandering
- Gibbard-Satterthwaite
- Gibbs Sampling
- Gift Wrapping (Jarvis March)
- Givens Rotations
- GMRES
- GMRES & Krylov Methods
- Go
- Gödel Incompleteness
- Goldbach's Conjecture
- Golomb-Rice Coding: Optimal Compression for Small Integers
- Gomoku
- Gomory-Hu Tree
- Gossip & Anti-Entropy
- Gossip Protocols
- GPU Warps and Divergence
- Gradient Boosting
- Gradient Descent
- Gradual Typing
- Graham Scan
- Gram-Schmidt Orthogonalization
- Granular Synthesis
- Graph Coloring
- Graph Coloring and Spilling
- Graph Minors
- Graph Neural Networks
- Graph Partitioning
- GRASP
- GRASP: Greedy Randomized Adaptive Search
- Gray Codes
- Gröbner Bases
- Grover's Algorithm
- Grover's Algorithm
- Guided Local Search
- Half-Plane Intersection
- Hamiltonian Cycle
- Hamiltonian Monte Carlo
- Hamiltonian Simulation
- Hamming Codes
- Haplotype Phasing
- Happy Eyeballs
- Hardness vs Randomness
- Harmony Search
- Harris Corner Detection
- Hartree-Fock Theory
- Hash Collisions
- Hash-Based Signatures
- Hashing
- Håstad's Switching Lemma
- Heaps
- Heavy Hitters
- Heavy-Light Decomposition
- Hensel Lifting
- Hex
- Hidden Markov Models
- Hill Climbing
- Hindley-Milner Type Inference
- HMAC
- HMM Gene Finding
- HMM Part-of-Speech Tagging
- Hoare Logic: Proving Programs Correct
- Hodge conjecture
- HOG Descriptor
- Holographic Algorithms
- Homomorphic Encryption
- Hopcroft-Karp
- Horn-Clause Verification
- Horner's Method
- HotStuff
- House Allocation and Top Trading Cycles
- Householder QR
- How Databases Find the Fast Path
- How Hard Is It to Compute π?
- How Life Folds
- How Much Data to Learn?
- Huffman Coding
- Hybrid Logical Clocks
- Hyperheuristics: Choosing Which Heuristic to Apply
- HyperLogLog
- I/O Schedulers
- IC3 / PDR
- Identity-Based Encryption
- Image Pyramids
- Immerman-Szelepcsényi Theorem
- Implied Volatility
- In-Context Learning
- Inapproximability
- Inclusion-Exclusion: Counting by Overlaps
- Index Calculus
- Influence Maximization
- Inlining Heuristics
- Instruction Scheduling
- INT8 Model Quantization
- Integer Factorization
- Integral Windup & Anti-Windup
- Interior-Point Methods
- Interval Arithmetic
- Interval Trees
- Inverse Kinematics
- IP = PSPACE
- Is N Prime?
- Island-Model GA
- Isogeny Cryptography (and SIKE's Fall)
- Iterated Local Search
- Jigsaw Puzzles
- JIT Compilation
- Job-Shop Scheduling
- Join Algorithms
- Join Ordering
- JPEG and the Cosine Transform
- Just Enough Tests
- k-Anonymity
- K-d Tree Nearest Neighbor
- k-d Trees
- k-Induction
- k-means Clustering
- k-Nearest Neighbors
- Kademlia DHT
- Karatsuba Multiplication
- Karger's Min-Cut
- Karplus–Strong Synthesis
- Katz Centrality
- Kernelization
- Key Derivation Functions
- Key Transparency: Auditable Public-Key Directories
- Kinetic Monte Carlo
- KKT Conditions: Optimality with Constraints
- Klee's Measure Problem
- Klondike Solitaire
- Knowledge Distillation
- Knuth-Morris-Pratt
- Kolmogorov Complexity
- Kyber & Dilithium (Post-Quantum)
- l-Diversity & t-Closeness
- Ladner's Theorem
- Lagrange Interpolation
- Lagrangian Relaxation
- Lambda Calculus
- Lamport One-Time Signatures
- Lamport's Bakery Algorithm
- Lanczos & Arnoldi
- Langton's Ant: Chaos Then Order
- Large Neighborhood Search
- Latent Dirichlet Allocation
- Latent Semantic Analysis
- Lattice Problems
- LDPC, Turbo & Polar Codes
- Learned Indexes
- Learning With Errors
- Lemmings
- Lenstra's ECM
- Levenshtein Automata
- Lights Out
- Lights Out as Linear Algebra
- Line Arrangements
- Linear Logic
- Linear programming
- Linear Programming Duality
- Linear Programming in Linear Time
- Linear Types
- Linear-Quadratic Regulator
- Link-Cut Trees
- Liquid Democracy
- List Decoding
- Liveness Analysis
- LL and LR Parsing
- LLL Lattice Reduction
- LLL Lattice Reduction
- Local vs Central DP
- Locality-Sensitive Hashing
- Locally Decodable Codes
- Lock-Free Queues
- Log-Structured Merge Trees
- Logistic Regression
- Longest Common Subsequence
- Longest Increasing Subsequence
- Loop-Invariant Code Motion
- LoRA & Parameter-Efficient Fine-Tuning
- Lot Sizing (Wagner-Whitin)
- LSM Trees and Compaction
- LSTM and GRU
- LTL and CTL
- LTL to Büchi Automata
- LZ77
- LZW Compression
- LZW Compression
- Magic State Distillation
- Mahaney's Theorem
- Mahjong Solitaire
- Malware Polymorphism
- Manacher's Algorithm
- MAP-Elites
- MapReduce
- Marching Cubes
- Markov Chains
- Markov Decision Processes
- Markov State Models
- Martingales
- Mass-Spec Peptide ID
- Matching Markets
- Matching with Couples
- Matrix Chain Multiplication
- Matrix Multiplication
- Matroid Intersection
- Matroids: When Greedy Is Optimal
- MAX-SAT
- Maximum Cut
- Maximum Flow
- Maximum-Likelihood Phylogenetics
- Maze Generation
- MCMC & the Metropolis Algorithm
- MCMC in Physics
- MD Thermostats
- Mean Reversion (Ornstein-Uhlenbeck)
- Mean-Shift Segmentation
- Mean-Variance Portfolios
- Measurement-Based Quantum Computing
- Mechanistic Interpretability
- Median in Linear Time
- Median of Medians (BFPRT)
- Membership Inference Attacks
- Memetic Algorithms
- Memory Allocators
- Memory Barriers
- Memory Interleaving
- Merging HyperLogLog Sketches
- Merkle Trees
- MFCC
- Minesweeper
- MinHash & LSH
- Minimal Perfect Hashing
- Minimizer Sketching
- Minimum Arborescence
- Minimum Description Length
- Minimum Spanning Tree
- Minkowski Sums
- Mipmapping
- Mirror Descent
- Mix Networks
- Mixture Density Networks
- Mixture of Experts
- Mixture-of-Depths
- Mo's Algorithm
- Möbius Inversion & Dirichlet Convolution
- Model Checking
- Model Checking (CTL)
- Model Predictive Control
- Model Quantization
- Modular Exponentiation
- Molecular Docking
- Molecular Dynamics
- Molecular Dynamics Integrators
- Monotone Polygon Triangulation
- Monte Carlo Integration
- Monte Carlo Option Pricing
- Monte Carlo Tree Search
- Mortal Matrices
- Motion Planning
- MP3 Psychoacoustics
- Multi-Armed Bandits
- Multi-Armed Bandits (UCB)
- Multi-Objective Optimization
- Multi-Version Concurrency Control
- Multicommodity Flow
- Multidimensional FFT
- Multigrid Methods
- Multigrid Methods
- Multipath TCP
- Multiple Sequence Alignment
- Multiprocessor Scheduling
- N-Body Simulation
- N-gram Language Models
- Naive Bayes
- Naive Bayes Text Classification
- Nash Bargaining: The Math of Negotiation
- Nash Equilibrium
- NAT Traversal
- Navier-Stokes Existence
- NC vs P
- NEAT Neuroevolution
- Needleman-Wunsch Alignment
- Nelder-Mead: Optimizing Without Gradients
- Network Coding: Mixing Packets at Intermediate Nodes
- Network Robustness
- Network Simplex
- Neural Architecture Search
- Neural ODEs
- Neural Radiance Fields (NeRF)
- Neural Scaling Laws
- Neural Tangent Kernel
- Newcomb's Paradox
- Newton Fractals
- Newton vs Bisection
- Newton-Raphson for Systems
- Newton's Method
- Nim
- No Free Lunch
- Noisy-Channel Spelling Correction
- Non-Local Means
- Nonogram (Picross)
- Normal Mapping
- Normalizing Flows
- Novelty Search
- NTRU
- Numerical Stability
- Nurse Rostering
- Oblivious RAM
- Oblivious Transfer
- Occupancy-Grid Mapping
- One-Time Pad
- One-Way Functions
- Onion Routing
- Online Bipartite Matching
- Online Convex Optimization
- Optical Flow (Lucas-Kanade)
- Optimal Market Making
- Optimal Sorting Networks
- Orthogonal Vectors Problem
- Othello Solved
- Otsu's Thresholding
- Out-of-Order Execution
- Overlap-Add STFT
- P vs NP
- P-Completeness
- Pac-Man
- Packet Scheduling (EDF)
- Packrat Parsing
- Padé Approximants
- Page Replacement
- PageRank
- Paging & LRU
- Pairs Trading
- Pangenome Graphs
- Panorama Stitching
- Partial Fraction Decomposition
- Partial-Order Reduction
- Particle Filters
- Particle Swarm Optimization
- Particle Swarm Optimization
- Particle-Filter Localization
- Password Hashing
- Path Tracing
- Paxos
- PBFT (Practical Byzantine Fault Tolerance)
- Pedersen Commitments
- Peephole Optimization
- Peg Solitaire
- Peg Solitaire Invariants
- Pell's Equation
- Penrose Tilings
- Percolation
- Percolator
- Perfect Hashing
- Perfect Numbers
- Perlin Noise
- Persistent Data Structures
- Petri Nets
- Phong Shading
- Photon Mapping
- Phylogenetic Trees
- Pick's Theorem
- PID Control
- Pipelining Hazards
- Pitch Detection (Autocorrelation)
- Planarity Testing
- PLS & Local Search
- Pohlig-Hellman
- Point in Polygon
- Point Location
- Poisson Image Editing
- Pollard's Rho Factoring
- Pollard's Rho for Discrete Log
- Polygon Clipping
- Polygon Triangulation
- Polynomial Identity Testing
- Polynomial Long Division
- Portfolio Optimization
- Post Correspondence Problem
- Post-Quantum Signatures (SPHINCS+)
- Potential Field Navigation
- Potential Fields
- Potential Games: When Selfishness Leads to Equilibrium
- Power Diagrams
- Power Iteration
- PPAD: The Complexity of Finding Nash Equilibria
- PPM: Prediction by Partial Matching
- Preconditioning
- Preferential Attachment
- Presburger Arithmetic: The Decidable Fragment of Number Theory
- Primitive Recursion
- Principal Component Analysis
- Priority Inversion
- Privacy Budget Composition
- Private Histograms
- Private Information Retrieval
- Private Information Retrieval
- Private Quantiles
- Private Set Intersection
- Private Set Union
- Probabilistic Roadmaps
- Profile-Guided Optimization
- Promise Problems
- Proof Complexity
- Proof of Stake
- Proof of Work
- Property Testing
- Proportional Apportionment
- Protein Design
- Proximal Gradient (ISTA / FISTA)
- Proximal Policy Optimization
- Pseudorandom Generators
- Pure Pursuit
- Pure Pursuit Path Tracking
- Push-Relabel Maximum Flow
- Pushdown Automata
- Q-Learning
- QAOA
- QBF and PSPACE
- QMA – Quantum Merlin Arthur
- Quadratic Assignment
- Quadric Mesh Simplification
- Quadtrees & Octrees
- Quantal Response Equilibrium
- Quantum Annealing
- Quantum Counting
- Quantum Error Correction
- Quantum Fourier Transform
- Quantum Machine Learning
- Quantum Money: Uncopyable Currency
- Quantum Phase Estimation
- Quantum Supremacy
- Quantum Teleportation
- Quantum Walks
- Quasi-Monte Carlo
- QuickHull
- Quickselect
- Quorum Systems
- R-Trees
- R₀ & the Epidemic Threshold
- Rabin-Karp Search
- Radiosity
- Raft Consensus
- Ramanujan Graphs
- Ramsey Theory
- Random Forests & Boosting
- Random Forests & Boosting
- Random Number Generation
- Random Projection (JL)
- Random Walks
- Randomized Algorithms
- Randomized Response
- Randomized Rounding
- Range Coding
- Range Trees
- RANSAC
- Rapidly-Exploring Random Trees
- RAPPOR (Local DP)
- Rasterization
- Rate Limiting (GCRA)
- Rate-Distortion Theory
- Ray Marching
- Ray Tracing
- Razborov–Smolensky
- Read Mapping
- Read-Copy-Update (RCU)
- Reasoning Under Uncertainty
- Recommendation
- Recurrent Neural Networks
- Reed-Muller Codes
- Reed-Solomon Codes
- Reeds-Shepp Paths
- Refinement Types
- Regex Matching Hardness
- Register Allocation
- Regular Expressions and Finite Automata
- Reinforcement Learning
- Relativization and Oracle Separations
- Relevance Feedback (Rocchio)
- Reliable Broadcast
- Rely-Guarantee Reasoning
- Rendezvous Hashing
- Rent Division
- Rényi Differential Privacy
- Reservoir Sampling
- Resolution and Prolog
- Retrieval-Augmented Generation (RAG)
- Return-Oriented Programming
- Reverse-Mode Automatic Differentiation
- Reversible and Universal Gates
- Rice's Theorem
- Richardson Extrapolation
- Ridge and Lasso Regression
- Ring Signatures
- Risk Parity
- RLHF & Alignment
- RNA Folding
- RNA Folding (Nussinov)
- Robbins Conjecture
- Robin Hood Hashing
- Robust Optimization
- Rotary Position Embeddings (RoPE)
- Rotary Position Embeddings (RoPE)
- Rotating Calipers
- Rowhammer
- RRT Motion Planning
- RRT*
- RSA
- RSA Accumulators
- RSA Accumulators
- Rubik's Cube
- Rule 110: A Universal Computer in One Dimension
- Run-Length Encoding
- Runge-Kutta Methods
- Rush Hour
- Same Graph in Disguise?
- Sample-Rate Conversion
- Sandboxing with seccomp
- Savitch's Theorem
- Savitch's Theorem
- Scale-Free Networks
- Scatter Search
- Scheduling
- Schnorr Signatures
- Schoof's Algorithm
- Screen-Space Reflections
- Seam Carving
- Secure Aggregation
- Secure Multiparty Computation
- Segment & Fenwick Trees
- Segment & Fenwick Trees
- Segment Intersection
- Segment Intersection Test
- Self-Organized Criticality
- Semidefinite Programming
- Semidefinite Relaxation
- Separation Logic
- Seqlocks
- Sequence Alignment
- Sequent Calculus
- Serializability
- Serializable Snapshot Isolation
- Session Types
- Set Cover
- Set Packing
- Shadow Mapping
- Shamir's Secret Sharing
- Shannon Entropy
- Shannon Source Coding
- Sharing the Load
- Shor's Algorithm
- Shortest Paths Around Obstacles
- Shortest vs Longest Path
- Side-Channel Attacks
- SIFT Features
- Sigma Protocols
- Signed Distance Fields
- SIMD Vectorization
- Simon's Algorithm
- Simpson's Paradox
- Simulated Annealing
- Simulated Annealing for the TSP
- Simulated Annealing Schedules
- Simulating the Quantum World
- Single-Cell Clustering
- Singular Value Decomposition
- Sipser-Lautemann (BPP in PH)
- Ski Rental
- Skip Lists
- SLAM
- Slepian-Wolf: Compressing Correlated Sources Separately
- Sliding Mode Control
- Sliding-Window Counting
- Slitherlink & NP-Complete Pencil Puzzles
- Small-World Networks
- Small-World Networks
- Smallest Enclosing Circle
- Smith-Waterman Alignment
- Smoothed Analysis
- Smoothed-Particle Hydrodynamics
- SMT Solvers
- SMT Solving
- Snake
- Snap Rounding
- Snapshot Isolation
- Sokoban
- Soundex & Phonetic Matching
- Space-Saving Heavy Hitters
- Spanner and TrueTime
- Sparse Direct Solvers
- Sparse Sets and Dense Sets
- Spatially-Coupled Codes
- Spectral Graph Theory
- Spectral Methods
- Spectral Methods
- Speculative Decoding
- Speculative Execution
- Speculative Side Channels (Spectre)
- Sperner's Lemma
- Spirograph Roulettes
- Splay Trees
- SQL Injection
- Sqrt Decomposition
- Squarefree Factorization
- Squaring the Circle
- Squeezing Data
- SSA Form
- Stable Marriage
- Stable Roommates
- Stackelberg Games
- State-Space Models (S4 / Mamba)
- Stochastic Gradient Descent
- Stochastic Programming
- Strassen's Algorithm
- Stream Ciphers: XOR and the Nonce
- Streaming Graph Sketches
- Strength Reduction
- Strip Packing
- Strongly Connected Components
- Structure from Motion
- Stuck in the Wrong Valley
- Sturm's Theorem
- Subexponential Algorithms
- Subgraph Isomorphism
- Submodular Optimization and Diminishing Returns
- Subset Sum
- Succinct Rank/Select
- Sudoku
- Suffix Array Construction
- Super Mario Bros
- Support Vector Machines
- Surface Codes
- Sutherland-Hodgman Clipping
- Symbolic Differentiation
- Symbolic Execution
- Symbolic Execution
- Synthetic Division (Ruffini's Rule)
- Systolic Arrays
- t-SNE & UMAP
- Tabu Search
- Tail-Call Optimization
- Tarjan's Offline LCA
- Tarski's Real Arithmetic Is Decidable
- TCP Congestion Control
- TCP CUBIC
- Temporal Networks
- Tendermint
- Termination Analysis
- Tetris
- Texture Mapping
- TF-IDF
- The 15-Puzzle
- The 17-Clue Sudoku
- The abc Conjecture
- The Ackermann Function
- The Adam Optimizer
- The AI Mathematical Olympiad Prize
- The AMS Sketch
- The Aperiodic Monotile
- The ARC Prize
- The Art Gallery Problem
- The Art Gallery Problem
- The Art Gallery Theorem
- The Assignment Problem
- The Auction Algorithm
- The Banach-Tarski Paradox
- The Beal Conjecture
- The Bentley-Ottmann Sweep
- The Berman-Hartmanis Conjecture
- The Bernstein-Vazirani Algorithm
- The Best Possible Pairing
- The Bias-Variance Tradeoff
- The Bilateral Filter
- The Birthday Attack
- The Bitap Algorithm
- The Bitcoin Puzzle Transaction
- The Black-Litterman Model
- The Black-Scholes Model
- The Borsuk-Ulam Theorem
- The Bridges of Königsberg
- The Burrows-Wheeler Aligner
- The Busy Beaver
- The Bw-Tree
- The Cantor-Zassenhaus Algorithm
- The Central Limit Theorem
- The Cepstrum
- The Chain That Saves Lives
- The Cheapest Flow
- The Chinese Postman
- The Church-Turing Thesis
- The Circuit Breaker Pattern
- The Collatz Conjecture
- The Collatz Conjecture
- The Complementary Filter
- The Condition Number
- The Conjugate Gradient Method
- The Constant-Q Transform
- The Continuum Hypothesis
- The Counting Hierarchy
- The Coupon Collector
- The Cross-Entropy Method
- The Curry-Howard Correspondence
- The Distance Transform
- The DNA Jigsaw
- The Dominator Tree
- The Double Descent Curve
- The Double Pendulum
- The Douglas-Peucker Algorithm
- The EFF Cooperative Computing Prime Prize
- The Ekert E91 Protocol
- The Ellipsoid Method
- The Entscheidungsproblem
- The epoll Reactor
- The Erdős Unit-Distance Problem
- The Exponential Mechanism
- The Extended Kalman Filter
- The Fast Multipole Method
- The Fast Multipole Method
- The Fiat-Shamir Transform
- The Finite Difference Method
- The Finite Element Method
- The Finite Volume Method
- The FM-Index
- The Fold-and-Cut Theorem
- The Folk Theorem: How Cooperation Survives Repeated Play
- The Four Color Theorem
- The Frank-Wolfe Algorithm
- The Friendship Paradox
- The Gaussian Mechanism
- The Generalized Assignment Problem
- The Gilbreath Principle
- The Gillespie Algorithm
- The GJK Collision Algorithm
- The Goertzel Algorithm
- The Gottesman-Knill Theorem
- The GPS That Recalculates Instantly
- The Great Deluge Algorithm
- The Greeks & Hedging
- The Grey Wolf Optimizer
- The Hadwiger–Nelson Problem
- The Halting Problem
- The Ham-Sandwich Theorem
- The Happy Ending Problem
- The HHL Algorithm
- The Hilbert Curve
- The Hilbert Transform
- The Hough Transform
- The Hutter Prize
- The Impossible Timetable
- The Independent Cascade Model
- The Inverted Index
- The Ising Model
- The Jacobi Eigenvalue Algorithm
- The Kaczmarz Method
- The Kalman Filter
- The Karp–Lipton Theorem
- The Kelly Criterion
- The Kepler Conjecture
- The Knapsack Problem
- The Knight's Tour
- The Language of Optimization
- The Laplace Mechanism
- The Largest Empty Rectangle
- The Lattice Boltzmann Method
- The Law of Large Numbers
- The Leaky Bucket
- The Limit Order Book
- The Limits of Sorting
- The Linear Threshold Model
- The Logistic Map
- The Lorenz Attractor
- The Lottery Ticket Hypothesis
- The Lovász Local Lemma
- The Lucas–Lehmer Test
- The Luenberger Observer
- The Madgwick Filter
- The Mandelbrot Set
- The Matrix Multiplication Exponent ω
- The McEliece Cryptosystem
- The Medial Axis
- The Merkle–Damgård Construction
- The Miller-Rabin Test
- The Misra-Gries Summary
- The Monty Hall Problem
- The Moser-Tardos Algorithm
- The Myhill-Nerode Theorem
- The Natural Proofs Barrier
- The Needle in the Text
- The Network Time Protocol
- The Nisan–Wigderson Generator
- The No-Cloning Theorem
- The Nucleolus: Fairest Distribution in Cooperative Games
- The Number Field Sieve
- The Paillier Cryptosystem
- The Painter's Algorithm
- The Palindromic Tree
- The Partition Function
- The PCP Theorem
- The Perceptron
- The Phase Vocoder
- The Pigeonhole Principle
- The Planar Separator Theorem
- The Poincaré Conjecture
- The Polynomial GCD
- The Polynomial Hierarchy
- The Polynomial Hierarchy
- The Price of Anarchy
- The Prisoner's Dilemma
- The Probabilistic Method
- The Pumping Lemma
- The QR Algorithm
- The Quadratic Sieve
- The Quantum PCP Conjecture
- The QUIC Protocol
- The Resultant
- The Riemann Hypothesis
- The Risch Algorithm
- The Root Locus
- The Saga Pattern
- The Secretary Problem
- The SEIR Model
- The Shapley Value
- The Shoelace Formula
- The Shortest Network
- The Shuffle Model
- The Sieve of Eratosthenes
- The Simplest Possible Machine
- The Simplex Method
- The SIR Model
- The SIS Model
- The Sleeping Beauty Problem
- The Solovay-Kitaev Theorem
- The Sparse Vector Technique
- The Spectral Epidemic Threshold
- The Sponge & Keccak (SHA-3)
- The St. Petersburg Paradox
- The Stein Paradox
- The Stoer-Wagner Algorithm
- The Straight Skeleton
- The Suffix Automaton
- The t-digest
- The Tents Puzzle
- The Thomas Algorithm
- The Three-Body Problem
- The Time & Space Hierarchies
- The Time Hierarchy Theorem
- The Transportation Problem
- The Traveling Salesman
- The Two Envelopes Paradox
- The Unscented Kalman Filter
- The Vesuvius Challenge
- The Viterbi Algorithm
- The Voronoi Diagram
- The Voter Model
- The W-Hierarchy
- The Wolff Cluster Algorithm
- The Word Problem for Groups
- The Z-Algorithm
- The Z-Buffer
- The ZAB Protocol
- Three-Phase Commit
- Threshold Cryptography
- Threshold Signatures (FROST)
- Tic-Tac-Toe
- Timing Side Channels
- TLA+ Specifications
- Toda's Theorem
- Token Bucket Rate Limiting
- Tonelli-Shanks
- Toom-Cook Multiplication
- Top Trading Cycles
- Top Trading Cycles
- Topic-Sensitive PageRank
- Topological Quantum Computing: Braiding Anyons as Gates
- Topological Sort
- Towers of Hanoi
- Trajectory Optimization
- Transactional Memory
- Transformers & Attention
- Treaps
- Treewidth
- Tries & Suffix Trees
- Twin Primes
- Two-Phase Commit
- Two-Phase Commit vs Sagas
- Two-Phase Locking
- Type Inference
- Type Soundness
- Typestate Analysis
- UCB and Thompson Sampling
- Ukkonen's Banded Edit Distance
- Ukkonen's Suffix Tree
- Unification
- Union-Find
- Unique Games Conjecture
- Valiant-Vazirani Lemma
- Value at Risk
- Van Emde Boas Trees
- Variable Neighborhood Search
- Variational Autoencoders
- Variational Inference
- Variational Inference & the ELBO
- Variational Quantum Eigensolver
- VC Dimension
- VCG Mechanisms: Making Auctions Truthful
- Vector Clocks
- Vectorized Execution
- Vehicle Routing
- Vehicle Routing (Savings)
- Velocity Obstacles (ORCA)
- Verifiable Delay Functions
- Verifiable Random Functions
- Verifiable Secret Sharing
- Vertex Cover
- Viewstamped Replication
- Virtual Memory and Paging
- Vision Transformers (ViT)
- Voronoi & Delaunay
- Voronoi Shattering
- VP vs VNP
- Wallace Tree
- Wang Tiles
- Wang Tiles
- Watershed Segmentation
- Wavelet Trees
- Wavelets
- Wavetable Synthesis
- Weakest Preconditions
- Weighted Reservoir Sampling
- Well-Separated Pair Decomposition
- When Code Writes Itself
- Where to Build the Hospital?
- Why Chess Is Hard for Machines
- Why Convexity Makes Problems Easy
- Why HyperLogLog Works
- Why Training AI Isn't Exact
- Winding Number & Point-in-Polygon
- Word Embeddings (Skip-gram)
- Word Segmentation
- Word2Vec
- Wordle
- Work-Stealing Schedulers
- Write-Ahead Logging
- Y-Fast Tries
- Yang-Mills Mass Gap
- Yield Curve Bootstrapping
- Z-Order Curve (Morton Code)
- Zero-Knowledge Proofs
- Zero-Knowledge Range Proofs
- Ziegler-Nichols Tuning
- Zipf's Law: The Surprising Power Law Everywhere
- zk-SNARKs
- zk-STARKs
