REAL
Home
About
Categories
Project
Archives
Tags
Search
Nice! 55 posts in total. Keep on posting.
2026
Dynamic Programming: RNA Secondary Structure and Bellman-Ford
06-03
Complexity Theory: Polynomial-Time Reductions
06-03
NP-Completeness: Nondeterminism and 3-Dimensional Matching
06-03
Maximum Flow: Ford-Fulkerson and the Max-Flow Min-Cut Theorem
06-03
Maximum Subarray Sum and Closest Pair of Points
06-03
Karatsuba Integer Multiplication
06-03
Greedy Algorithms: Interval Scheduling and Minimizing Maximum Lateness
06-03
Dynamic Programming: Hotel Scheduling, LNS, and Sequence Alignment
06-03
Efficient Maximum Flow Algorithms and Bipartite Matching
06-03
3-SAT, Independent Set, and the P vs. NP Question
06-03
2026
Arbitrary-Precision Integer: NTT + Karatsuba Hybrid Multiplication
06-02
2023
Maximum Sum of a Contiguous Subarray
06-18
Master's Theorem
06-18
Fibonacci Sequence
06-18
Sum of the Beatty Sequence
01-30
Rayleigh's Theorem (Beatty's Theorem)
01-30
2021
Stack and Queue
08-13
Array and List
08-12
Algorithm Complexity Analysis
08-10
Introduction to Algorithms
08-02
2021
Hardness of Approximation
05-28
Approximation Algorithm (13): Buy-at-Bulk Network Design
05-26
Approximating Metrics by Tree Metrics
05-19
Useful Mathematical Tools
05-19
Graph Coloring
05-15
Markov's Inequality
05-14
Semidefinite Programming
05-12
Approximation Algorithm (12): Uncapacitated Facility Location (2)
05-07
Approximation Algorithm (11): Generalized Steiner Tree Problem
05-01
Approximation Algorithm (10): Uncapacitated Facility Location (1)
04-25
2021
LP Duality
04-20
Approximation Algorithm (9): Survivable Network Design
04-17
Approximation Algorithm (8): Integer Multicommodity Flows
04-04
Chernoff Bounds
04-03
Network Flow Decomposition
04-02
Approximation Algorithm (7): Minimizing Sum of Completion Times
03-26
Linear Programming
03-24
Approximation Algorithm (6): Minimum-Degree Spanning Tree
03-24
Parallel PageRank and BFS
03-19
MPI: Message Passing Interface
03-18
2021
Families of Approximation Algorithms
03-17
Approximation Algorithm (5): K-Center Clustering
03-17
Approximation Algorithm (4): Knapsack
03-17
CUDA: Basic GPU Programming
03-16
Kronecker Product
03-15
Matrix Representation of Graphs
03-14
Approximation Algorithm (3): Set Cover
03-14
Approximation Algorithm (2): Set Cover
03-12
Approximation Algorithm (1): Set Cover
03-07
2020
The ABA Problem
11-22
2020
The Monty Hall Problem and Monte Carlo Method
11-21
Sorting Algorithm Analysis
11-15
Heap Sort
11-15
Quick Sort and Quick Select
11-14
Merge Sort
11-14