Algorithms

• The Inner Workings Of A Database Query Optimizer: Cost Models, Statistics, And Join Ordering · 2025-05-28

  A comprehensive technical exploration of the inner workings of a database query optimizer: cost models, statistics, and join ordering, covering key concepts, practical implementations, and real-world applications.

• From Sockets To Epoll: Building A Non Blocking Http Server In C · 2025-05-27

  A comprehensive technical exploration of from sockets to epoll: building a non blocking http server in c, covering key concepts, practical implementations, and real-world applications.

• Designing A Distributed Queue With Exactly Once Delivery Using Idempotency Keys · 2025-05-22

  A comprehensive technical exploration of designing a distributed queue with exactly once delivery using idempotency keys, covering key concepts, practical implementations, and real-world applications.

• A Deep Dive Into The Xgboost Algorithm: Gradient Boosting, Regularization, And System Optimization · 2025-05-21

  A comprehensive technical exploration of a deep dive into the xgboost algorithm: gradient boosting, regularization, and system optimization, covering key concepts, practical implementations, and real-world applications.

• Implementing A Secure Multi Party Computation Protocol (garbled Circuits) From Scratch · 2025-05-21

  A comprehensive technical exploration of implementing a secure multi party computation protocol (garbled circuits) from scratch, covering key concepts, practical implementations, and real-world applications.

• The Theory And Implementation Of The Boyer Moore String Search Algorithm (with Galil’s Rule) · 2025-05-11

  A comprehensive technical exploration of the theory and implementation of the boyer moore string search algorithm (with galil’s rule), covering key concepts, practical implementations, and real-world applications.

• Building A Simple Vector Database With Ivf And Hnsw Indexing For Ann Search · 2025-05-07

  A comprehensive technical exploration of building a simple vector database with ivf and hnsw indexing for ann search, covering key concepts, practical implementations, and real-world applications.

• Using Linearizability Checking Tools: How To Prove Your Concurrent Data Structure Is Correct · 2025-05-03

  A comprehensive technical exploration of using linearizability checking tools: how to prove your concurrent data structure is correct, covering key concepts, practical implementations, and real-world applications.

• The Architecture Of A High Performance Message Broker: Design Patterns From Apache Kafka · 2025-04-23

  A comprehensive technical exploration of the architecture of a high performance message broker: design patterns from apache kafka, covering key concepts, practical implementations, and real-world applications.

• Applying Bloom Filters In Practice: From Cache Filtering To Bigtable · 2025-04-20

  A comprehensive technical exploration of applying bloom filters in practice: from cache filtering to bigtable, covering key concepts, practical implementations, and real-world applications.

• Implementing A B Tree From Scratch: Storage, Concurrency, And Recovery · 2025-04-20

  A comprehensive technical exploration of implementing a b tree from scratch: storage, concurrency, and recovery, covering key concepts, practical implementations, and real-world applications.

• Writing A Custom Tcp Stack In Userspace: Performance And Pitfalls · 2025-04-14

  A comprehensive technical exploration of writing a custom tcp stack in userspace: performance and pitfalls, covering key concepts, practical implementations, and real-world applications.

• Designing A Consistent Hashing Ring With Virtual Nodes For Load Balancing · 2025-04-13

  A comprehensive technical exploration of designing a consistent hashing ring with virtual nodes for load balancing, covering key concepts, practical implementations, and real-world applications.

• The Realities Of Implementing A Distributed Transaction Protocol: Percolator Vs. Spanner · 2025-04-13

  A comprehensive technical exploration of the realities of implementing a distributed transaction protocol: percolator vs. spanner, covering key concepts, practical implementations, and real-world applications.

• The Fast Fourier Transform: From Cooley-Tukey to Modern Signal Processing and Fast Multiplication · 2025-04-12

  Master the FFT from first principles: the Cooley-Tukey algorithm as recursive divide-and-conquer, the underlying group theory, modern variants for arbitrary sizes, and applications from polynomial multiplication to GPU signal processing.

• Building A Simple Oauth 2.0 Authorization Server: Tokens, Scopes, And Refresh Flows · 2025-04-11

  A comprehensive technical exploration of building a simple oauth 2.0 authorization server: tokens, scopes, and refresh flows, covering key concepts, practical implementations, and real-world applications.

• A Practical Guide To Implement The C5.0 Decision Tree Algorithm From Scratch · 2025-04-06

  A comprehensive technical exploration of a practical guide to implement the c5.0 decision tree algorithm from scratch, covering key concepts, practical implementations, and real-world applications.

• Optimizing Matrix Multiplication: From Strassen To Coppersmith Winograd And Beyond · 2025-04-03

  A comprehensive technical exploration of optimizing matrix multiplication: from strassen to coppersmith winograd and beyond, covering key concepts, practical implementations, and real-world applications.

• Implementing A Distributed Key Value Store With Conflict Free Replicated Data Types (crdts) · 2025-04-01

  A comprehensive technical exploration of implementing a distributed key value store with conflict free replicated data types (crdts), covering key concepts, practical implementations, and real-world applications.

• The Internals Of A Modern Garbage Collector: Generational, Concurrent, And Compacting (like C4) · 2025-03-30

  A comprehensive technical exploration of the internals of a modern garbage collector: generational, concurrent, and compacting (like c4), covering key concepts, practical implementations, and real-world applications.

• The PCP Theorem: Why Some Problems Are Hard Even to Approximate · 2025-03-30

  Unpack one of theoretical computer science's crown jewels: the PCP theorem, which shows that for many NP-hard problems, even finding an approximate solution is intractable — and how probabilistically checkable proofs revolutionized our understanding of hardness.

• From Code To Silicon: Designing A Simple Risc V Cpu Pipeline In Verilog · 2025-03-15

  A comprehensive technical exploration of from code to silicon: designing a simple risc v cpu pipeline in verilog, covering key concepts, practical implementations, and real-world applications.

• Building A Hybrid Logical Clock For Causal Consistency In Geo Distributed Systems · 2025-03-14

  A comprehensive technical exploration of building a hybrid logical clock for causal consistency in geo distributed systems, covering key concepts, practical implementations, and real-world applications.

• Cache Oblivious Algorithms: Why And How To Optimize For Unknown Cache Hierarchies · 2025-03-05

  A comprehensive technical exploration of cache oblivious algorithms: why and how to optimize for unknown cache hierarchies, covering key concepts, practical implementations, and real-world applications.