Theory

• A Formal Verification Of The Paxos Protocol With Informal Proof And Coq Implementation · 2024-09-15

  A comprehensive technical exploration of a formal verification of the paxos protocol with informal proof and coq implementation, covering key concepts, practical implementations, and real-world applications.

• Designing A Distributed Leader Election For Wsns With Message Optimal And Fault Tolerance · 2024-09-10

  A comprehensive technical exploration of designing a distributed leader election for wsns with message optimal and fault tolerance, covering key concepts, practical implementations, and real-world applications.

• The Mathematics Of Hidden Markov Models For Part Of Speech Tagging: Viterbi Algorithm And Baum Welch · 2024-09-04

  A comprehensive technical exploration of the mathematics of hidden markov models for part of speech tagging: viterbi algorithm and baum welch, covering key concepts, practical implementations, and real-world applications.

• Network Topologies for HPC: Fat-Trees, Dragonfly, Torus, and the Cost-Diameter-Bandwidth Optimization · 2024-08-31

  A rigorous survey of HPC network topologies—fat-tree (InfiniBand), Dragonfly (Cray Cascade), torus (Blue Gene), Slim Fly—analyzing the fundamental tradeoffs in cost, diameter, bisection bandwidth, and fault tolerance.

• Implementing A Robust Checksum Algorithm: Adler 32 Vs. Crc 32C With Galois Field Multiplications · 2024-08-30

  A comprehensive technical exploration of implementing a robust checksum algorithm: adler 32 vs. crc 32c with galois field multiplications, covering key concepts, practical implementations, and real-world applications.

• The Performance Of The Twofish Cipher Vs. Aes In Software Implementation · 2024-08-27

  A comprehensive technical exploration of the performance of the twofish cipher vs. aes in software implementation, covering key concepts, practical implementations, and real-world applications.

• A Deep Dive Into The Blowfish Cipher: P Array, S Boxes, And Key Schedule · 2024-08-22

  A comprehensive technical exploration of a deep dive into the blowfish cipher: p array, s boxes, and key schedule, covering key concepts, practical implementations, and real-world applications.

• Bloom Filters and Probabilistic Data Structures: Trading Certainty for Speed · 2024-08-22

  Explore how Bloom filters, Count-Min sketches, and HyperLogLog sacrifice perfect accuracy for dramatic space and time savings—and learn when that trade-off makes sense.

• Building A Mutation Testing Framework With Code Coverage And Variant Generation · 2024-08-17

  A comprehensive technical exploration of building a mutation testing framework with code coverage and variant generation, covering key concepts, practical implementations, and real-world applications.

• Designing A Dynamic Programming Optimized For The Knapsack Problem With Large Weights · 2024-08-12

  A comprehensive technical exploration of designing a dynamic programming optimized for the knapsack problem with large weights, covering key concepts, practical implementations, and real-world applications.

• The Complexity Of Minimum Spanning Tree On A Sparse Graph: Borůvka’S Algorithm And Parallelization · 2024-08-11

  A comprehensive technical exploration of the complexity of minimum spanning tree on a sparse graph: borůvka’s algorithm and parallelization, covering key concepts, practical implementations, and real-world applications.

• A Rigorous Analysis Of The Internal Hash Table In Redis: Hash Type With Ziplist And Dict · 2024-07-13

  A comprehensive technical exploration of a rigorous analysis of the internal hash table in redis: hash type with ziplist and dict, covering key concepts, practical implementations, and real-world applications.

• The Algorithm Of The Password Hashing Competition Winner Argon2: Memory Hard And Data Independent · 2024-07-05

  A comprehensive technical exploration of the algorithm of the password hashing competition winner argon2: memory hard and data independent, covering key concepts, practical implementations, and real-world applications.

• A Deep Dive Into The Mongodb Storage Engine: Wiredtiger’S B Tree Compression And Document Model · 2024-06-28

  A comprehensive technical exploration of a deep dive into the mongodb storage engine: wiredtiger’s b tree compression and document model, covering key concepts, practical implementations, and real-world applications.

• Building A Distributed Search Engine With Inverted Index: Term Partitioning And Decentralized Crawling · 2024-06-28

  A comprehensive technical exploration of building a distributed search engine with inverted index: term partitioning and decentralized crawling, covering key concepts, practical implementations, and real-world applications.

• The Implementation Of A Virtual Machine For Smart Contracts: Evm Bytecode Execution And Gas Metre · 2024-06-27

  A comprehensive technical exploration of the implementation of a virtual machine for smart contracts: evm bytecode execution and gas metre, covering key concepts, practical implementations, and real-world applications.

• Amdahl’s Law vs. Gustafson’s Law: What They Really Predict · 2024-06-15

  When does parallelism pay off? Compare Amdahl’s and Gustafson’s models, see where each applies, and learn how to reason about speedups in practice.

• Designing A Cache Coherence Protocol For Cpu Gpu Heterogeneous Systems: Hsa With Unified Memory · 2024-06-13

  A comprehensive technical exploration of designing a cache coherence protocol for cpu gpu heterogeneous systems: hsa with unified memory, covering key concepts, practical implementations, and real-world applications.

• A Formal Proof Of The Ranked Pairs Voting System: Condorcet Efficiency And Complexity · 2024-06-02

  A comprehensive technical exploration of a formal proof of the ranked pairs voting system: condorcet efficiency and complexity, covering key concepts, practical implementations, and real-world applications.

• The Performance Of B Tree Vs. Lsm Tree On Write Intensive Workloads In Ssds · 2024-06-02

  A comprehensive technical exploration of the performance of b tree vs. lsm tree on write intensive workloads in ssds, covering key concepts, practical implementations, and real-world applications.

• Building A Reliable Udp Messaging Protocol: Packet Loss Recovery With Fec And Selective Acks · 2024-05-22

  A comprehensive technical exploration of building a reliable udp messaging protocol: packet loss recovery with fec and selective acks, covering key concepts, practical implementations, and real-world applications.

• The Complexity Of The Hungarian Algorithm For Assignment Problem: O(N^3) Implementation Details · 2024-05-18

  A comprehensive technical exploration of the complexity of the hungarian algorithm for assignment problem: o(n^3) implementation details, covering key concepts, practical implementations, and real-world applications.

• Implementing A Minimal Perfect Hash Function For Static Sets Using Seed Chord And Bucket Hashing · 2024-05-09

  A comprehensive technical exploration of implementing a minimal perfect hash function for static sets using seed chord and bucket hashing, covering key concepts, practical implementations, and real-world applications.

• Designing A Social Graph Recommendation Algorithm With Pagerank And Personalized Pagerank · 2024-05-04

  A comprehensive technical exploration of designing a social graph recommendation algorithm with pagerank and personalized pagerank, covering key concepts, practical implementations, and real-world applications.