Blog
Posts, notes, and articles.
The Performance Of The Bidibfs Algorithm For Unweighted Shortest Paths In Social Networks
2022-01-30A comprehensive technical exploration of the performance of the bidibfs algorithm for unweighted shortest paths in social networks, covering key concepts, practical implementations, and real-world applications.
Implementing A Minimax Player For Go With Monte Carlo Tree Search (Mcts) And Ucb1 Selection
2022-01-29A comprehensive technical exploration of implementing a minimax player for go with monte carlo tree search (mcts) and ucb1 selection, covering key concepts, practical implementations, and real-world applications.
A Comprehensive Look At The Alpha Beta Pruning Algorithm For Game Trees: Expectiminimax And Heuristic Evaluation
2022-01-26A comprehensive technical exploration of a comprehensive look at the alpha beta pruning algorithm for game trees: expectiminimax and heuristic evaluation, covering key concepts, practical implementations, and real-world applications.
Abstract Interpretation: The Cousot Framework, Galois Connections, and Sound Static Analysis by Construction
2022-01-20A rigorous exploration of abstract interpretation—Patrick and Radhia Cousot's unifying framework for static program analysis, from Galois connections to widening operators and the soundness proofs that guarantee analysis correctness.
Building A Distributed Matrix Factorization Using Alternating Least Squares (Als) In Apache Spark
2022-01-20A comprehensive technical exploration of building a distributed matrix factorization using alternating least squares (als) in apache spark, covering key concepts, practical implementations, and real-world applications.
The Theory Of Online Convex Optimization With Regret Bounds: Follow The Leader Vs. Gradient Descent
2022-01-20A comprehensive technical exploration of the theory of online convex optimization with regret bounds: follow the leader vs. gradient descent, covering key concepts, practical implementations, and real-world applications.
The Implementation Of A Random Forest Training In Mpi: Feature Subsampling And Oob Error Estimation
2022-01-19A comprehensive technical exploration of the implementation of a random forest training in mpi: feature subsampling and oob error estimation, covering key concepts, practical implementations, and real-world applications.
Domain Theory: Scott's D∞ Construction, Denotational Semantics, and the Mathematics of Recursive Types
2022-01-15A rigorous exploration of domain theory—Scott's D∞ construction, continuous lattices, the fixpoint theorem, and how domains provide the mathematical foundation for denotational semantics of programming languages.
A Practical Guide To Gradient Boosting: Xgboost’S Weighted Quantile Sketch And Sparsity Aware Split Finding
2022-01-10A comprehensive technical exploration of a practical guide to gradient boosting: xgboost’s weighted quantile sketch and sparsity aware split finding, covering key concepts, practical implementations, and real-world applications.
Process Calculi: Milner's CCS, the π-Calculus, Bisimulation, and Session Types for Protocol Correctness
2022-01-10A rigorous exploration of process calculi—from CCS to the π-calculus, the theory of bisimulation, and the Curry-Howard line connecting session types to linear logic.
Designing A Lagrangian Relaxation Algorithm For The Traveling Salesman Problem With 1 Trees
2022-01-02A comprehensive technical exploration of designing a lagrangian relaxation algorithm for the traveling salesman problem with 1 trees, covering key concepts, practical implementations, and real-world applications.
Separation Logic: The Frame Rule, Separating Conjunction, and Concurrent Verification
2022-01-01An exploration of separation logic—O'Hearn and Reynolds's revolutionary extension of Hoare logic for local reasoning about mutable state, the frame rule, and concurrent separation logic.
Abstract Interpretation: Cousot's Galois Connection Framework, Widening/Narrowing, and Sound Static Analysis by Construction
2021-12-29A deep exploration of abstract interpretation—the mathematical theory of sound approximation that underpins every modern static analyzer, from the Astrée system to the Rust borrow checker.
The Complexity Of The Network Simplex Algorithm For Minimum Cost Flow
2021-12-23A comprehensive technical exploration of the complexity of the network simplex algorithm for minimum cost flow, covering key concepts, practical implementations, and real-world applications.
Domain Theory: Scott's D∞ Construction, Solving Recursive Domain Equations, and the Foundations of Denotational Semantics
2021-12-19An in-depth exploration of domain theory—Scott's construction of a universal domain D∞ isomorphic to its own function space, continuous lattices, and how these ideas gave birth to denotational semantics.
A Deep Dive Into The Hat Trie: Array Compressed Trie With Efficient Cache Locality
2021-12-18A comprehensive technical exploration of a deep dive into the hat trie: array compressed trie with efficient cache locality, covering key concepts, practical implementations, and real-world applications.
Implementing A Van Emde Boas Tree For Predecessor Queries In O(Log Log U) Time
2021-12-13A comprehensive technical exploration of implementing a van emde boas tree for predecessor queries in o(log log u) time, covering key concepts, practical implementations, and real-world applications.
The Algorithm For Building A Fibonacci Heap With Decrease Key And Meld In Logarithmic Time
2021-12-06A comprehensive technical exploration of the algorithm for building a fibonacci heap with decrease key and meld in logarithmic time, covering key concepts, practical implementations, and real-world applications.
Building A Self Balancing Binary Search Tree With Weighted Average Rotation (Wavl) For Better Worst Case Balance
2021-12-01A comprehensive technical exploration of building a self balancing binary search tree with weighted average rotation (wavl) for better worst case balance, covering key concepts, practical implementations, and real-world applications.
The Performance Of Binary Search Trees: Treap, Splay Tree, Red Black Tree, And Avl Tree Under Random And Sequential Access
2021-11-18A comprehensive technical exploration of the performance of binary search trees: treap, splay tree, red black tree, and avl tree under random and sequential access, covering key concepts, practical implementations, and real-world applications.
A Detailed Analysis Of The Quickunion Disjoint Set Union Data Structure With Path Compression And Union By Rank
2021-11-04A comprehensive technical exploration of a detailed analysis of the quickunion disjoint set union data structure with path compression and union by rank, covering key concepts, practical implementations, and real-world applications.
Implementing An Exact Cover Solver Using Dancing Links (Knuth’S Algorithm X)
2021-10-30A comprehensive technical exploration of implementing an exact cover solver using dancing links (knuth’s algorithm x), covering key concepts, practical implementations, and real-world applications.
The Complexity Of The Isomorphism Problem For Graphs: Subgraph Isomorphism Via Color Refinement
2021-10-19A comprehensive technical exploration of the complexity of the isomorphism problem for graphs: subgraph isomorphism via color refinement, covering key concepts, practical implementations, and real-world applications.
Game Semantics: Fully Abstract Models of PCF, AJM Games, and Strategies as Sheaves
2021-09-30A rigorous exploration of game semantics—the technique that cracked the full abstraction problem for PCF by modeling computation as dialogue between Player and Opponent.