Theory

• The Performance Of Run Length Encoding (Rle) Vs. Burrows Wheeler Transform (Bwt) In Text Compression · 2022-03-30

  A comprehensive technical exploration of the performance of run length encoding (rle) vs. burrows wheeler transform (bwt) in text compression, covering key concepts, practical implementations, and real-world applications.

• Implementing A Real Time Anomaly Detection System Using Exponential Weighted Moving Average (Ewma) And Holt Winters · 2022-03-28

  A comprehensive technical exploration of implementing a real time anomaly detection system using exponential weighted moving average (ewma) and holt winters, covering key concepts, practical implementations, and real-world applications.

• The Mathematics Of Pairwise Differencing For Time Series: Self Joins And Online Algorithms For Change Detection · 2022-03-21

  A comprehensive technical exploration of the mathematics of pairwise differencing for time series: self joins and online algorithms for change detection, covering key concepts, practical implementations, and real-world applications.

• Building A Secure Password Authenticated Key Exchange (Pake) From Oblivious Pseudorandom Functions (Oprf) · 2022-03-11

  A comprehensive technical exploration of building a secure password authenticated key exchange (pake) from oblivious pseudorandom functions (oprf), covering key concepts, practical implementations, and real-world applications.

• A Deep Dive Into The Yggdrasil Network: Crypto Based Routing With Dht And Spanning Trees · 2022-03-06

  A comprehensive technical exploration of a deep dive into the yggdrasil network: crypto based routing with dht and spanning trees, covering key concepts, practical implementations, and real-world applications.

• The Implementation Of A Distributed Hash Table Using Chord: Leaf Sets, Stabilization, And Finger Table Maintenance · 2022-02-21

  A comprehensive technical exploration of the implementation of a distributed hash table using chord: leaf sets, stabilization, and finger table maintenance, covering key concepts, practical implementations, and real-world applications.

• Large Deviations Theory: Cramér's Theorem, Importance Sampling, and Rare Event Simulation · 2022-02-13

  A rigorous exploration of large deviations—the theory of exponentially rare events—from Cramér's theorem to Sanov's theorem, and their application to importance sampling for reliable networks.

• Renewal Theory for Computer Science: The Renewal Equation, Key Renewal Theorem, and Applications in Cache Analysis and Failure Recovery · 2022-02-12

  A rigorous journey through renewal theory—the mathematics of recurring events—from the renewal equation and key renewal theorem to applications in garbage collection, cache replacement, and fault-tolerant system analysis.

• Stochastic Processes for Computer Science: Poisson, Brownian Motion, Queueing and Reliability · 2022-02-12

  A rigorous treatment of continuous-time stochastic processes—Poisson processes, CTMCs, Brownian motion with the reflection principle—and their applications in queueing theory, reliability engineering, and network performance.

• Designing A P2P Network For File Sharing: Bittorrent’S Choking Algorithm, Piece Selection, And Rarest First · 2022-02-05

  A comprehensive technical exploration of designing a p2p network for file sharing: bittorrent’s choking algorithm, piece selection, and rarest first, covering key concepts, practical implementations, and real-world applications.

• A Rigorous Proof Of The A* Algorithm Admissibility And Consistency: Manhatten Vs. Euclidean Heuristics · 2022-02-03

  A comprehensive technical exploration of a rigorous proof of the a* algorithm admissibility and consistency: manhatten vs. euclidean heuristics, covering key concepts, practical implementations, and real-world applications.

• Markov Chains for Computer Science: MCMC, Mixing Times, and Randomized Algorithms · 2022-01-31

  A rigorous treatment of Markov chains from a computer science perspective—Metropolis-Hastings, coupling bounds, spectral gaps, and the role of rapid mixing in modern randomized algorithms.

• The Performance Of The Bidibfs Algorithm For Unweighted Shortest Paths In Social Networks · 2022-01-30

  A 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-29

  A 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-26

  A 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-20

  A 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-20

  A 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-20

  A 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-19

  A 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-15

  A 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-10

  A 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-10

  A 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-02

  A 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-01

  An 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.