May 2, 2026 · 35 minute read
A comprehensive, friendly tour of Efficient Multi-word Compare-and-Swap, the theory behind the k+1 CAS algorithm, and our OCaml 5 implementation with tests and benchmarks.
June 30, 2025 · 20 minute read
Explore computational complexity theory through engaging analogies - understand P vs NP, complexity classes, and algorithm efficiency. Learn why some problems are inherently hard and how complexity theory shapes computing.
October 6, 2024 · 50 minute read
Explore Baker’s Approximation Scheme for planar graphs in depth, covering planar graph structures, approximation algorithms, and dynamic programming techniques. Understand the construction of k-outerplanar graphs, tree decomposition, and slicing methods. Learn how these algorithms solve complex problems like Minimum Vertex Cover, Minimum Edge Dominating Set,...
August 26, 2024 · 50 minute read
This blog provides a comprehensive exploration of parameterized complexity, covering key topics such as Fixed-Parameter Tractable (FPT) algorithms and XP algorithms, with a focus on their definitions, characteristics, and practical applications. It delves into the process of parameterization, explaining how selecting appropriate parameters can significantly...