Algorithms

• Algorithmic Game Theory: Nash Equilibrium Computation, PPAD-Completeness, and the Computational Lens on Strategy · 2019-11-23

  A rigorous look at algorithmic game theory—computing Nash equilibria, the PPAD complexity class, and how computational constraints reshape strategic reasoning.

• Smoothed Analysis: Why Simplex Works in Practice and the Spielman-Teng Framework · 2019-11-19

  An exploration of smoothed analysis—Spielman and Teng's framework that explains why the simplex method and other algorithms transcend their worst-case bounds.

• The Algebra Of Concurrent Programming: Modeling With Process Calculi Like Csp And Pi Calculus · 2019-11-16

  A comprehensive technical exploration of the algebra of concurrent programming: modeling with process calculi like csp and pi calculus, covering key concepts, practical implementations, and real-world applications.

• Implementing A Work Stealing Task Scheduler With Locality Aware Dequeues In Rust · 2019-11-14

  A comprehensive technical exploration of implementing a work stealing task scheduler with locality aware dequeues in rust, covering key concepts, practical implementations, and real-world applications.

• The Empirical Performance Of Spin Locks, Mutexes, And Sleep Locks On Multicore Systems · 2019-10-30

  A comprehensive technical exploration of the empirical performance of spin locks, mutexes, and sleep locks on multicore systems, covering key concepts, practical implementations, and real-world applications.

• Building A Concurrent B Tree With Optimistic Lock Coupling And Smo Safety · 2019-10-22

  A comprehensive technical exploration of building a concurrent b tree with optimistic lock coupling and smo safety, covering key concepts, practical implementations, and real-world applications.

• Average-Case Complexity: Levin's Distributional Problems, AvgP, and Cryptographic Implications · 2019-10-20

  A deep examination of average-case complexity—Levin's theory of distributional NP-completeness, the class AvgP, and why cryptography needs hard-on-average problems.

• Descriptive Complexity: Fagin's Theorem, Logic, and an Alternative to Turing Machines · 2019-10-12

  An exploration of descriptive complexity—where computational classes are characterized by logical definability—and Fagin's theorem that NP equals existential second-order logic.

• A Deep Dive Into The Memory Model Of C++11: Acquire Release Semantics And Sequential Consistency · 2019-10-11

  A comprehensive technical exploration of a deep dive into the memory model of c++11: acquire release semantics and sequential consistency, covering key concepts, practical implementations, and real-world applications.

• Designing A Transactional Memory System With Hardware Support: Htm Vs. Software Tm On Modern Cpus · 2019-10-02

  A comprehensive technical exploration of designing a transactional memory system with hardware support: htm vs. software tm on modern cpus, covering key concepts, practical implementations, and real-world applications.

• Circuit Complexity: AC0, NC, P/poly, and the PARITY ∉ AC0 Proof · 2019-09-29

  A rigorous journey through circuit complexity classes—AC0, NC, P/poly—and the landmark result that PARITY cannot be computed by constant-depth polynomial-size circuits.

• The Proof Of Correctness Of The Treiber Stack And Its Aba Problem Mitigation Using Stam’S Schemes · 2019-09-26

  A comprehensive technical exploration of the proof of correctness of the treiber stack and its aba problem mitigation using stam’s schemes, covering key concepts, practical implementations, and real-world applications.

• Implementing A Efficient Read Copy Update (Rcu) Mechanism For Linux Kernel Modules · 2019-09-08

  A comprehensive technical exploration of implementing a efficient read copy update (rcu) mechanism for linux kernel modules, covering key concepts, practical implementations, and real-world applications.

• A Comparison Of Concurrent Hash Table Designs: Cuckoo Hashing, Hopscotch Hashing, And Striped Locking · 2019-09-06

  A comprehensive technical exploration of a comparison of concurrent hash table designs: cuckoo hashing, hopscotch hashing, and striped locking, covering key concepts, practical implementations, and real-world applications.

• Communication Complexity: Yao's Two-Party Model, the Rectangle Method, and Lower Bounds Galore · 2019-08-18

  A deep investigation of communication complexity—the mathematics of information exchange between parties—and its far-reaching implications for circuits, data structures, and streaming.

• Building A Lock Free Skip List For Range Queries In Distributed Memory · 2019-08-17

  A comprehensive technical exploration of building a lock free skip list for range queries in distributed memory, covering key concepts, practical implementations, and real-world applications.

• The Performance Impact Of Cache Line Padding In Concurrent Queues On Numa Architectures · 2019-08-16

  A comprehensive technical exploration of the performance impact of cache line padding in concurrent queues on numa architectures, covering key concepts, practical implementations, and real-world applications.

• An In Depth Look At Concurrent Data Structures: Elimination Backoff Stacks, Michael Scott Queues, And Hazard Pointers · 2019-08-04

  A comprehensive technical exploration of an in depth look at concurrent data structures: elimination backoff stacks, michael scott queues, and hazard pointers, covering key concepts, practical implementations, and real-world applications.

• Designing A Scalable Key Value Store With Lsm Trees And Write Amplification Analysis · 2019-08-02

  A comprehensive technical exploration of designing a scalable key value store with lsm trees and write amplification analysis, covering key concepts, practical implementations, and real-world applications.

• A Formal Verification Of Linearizability In A Lock Free Linked List Using Proper Testing · 2019-07-30

  A comprehensive technical exploration of a formal verification of linearizability in a lock free linked list using proper testing, covering key concepts, practical implementations, and real-world applications.

• Implementing A Wait Free Concurrent Hash Map In C++ For High Throughput Systems · 2019-07-30

  A comprehensive technical exploration of implementing a wait free concurrent hash map in c++ for high throughput systems, covering key concepts, practical implementations, and real-world applications.

• The Algorithmic Complexity Of Distributed Graph Algorithms: Bfs, Minimum Spanning Tree, And All Pairs Shortest Paths · 2019-07-24

  A comprehensive technical exploration of the algorithmic complexity of distributed graph algorithms: bfs, minimum spanning tree, and all pairs shortest paths, covering key concepts, practical implementations, and real-world applications.

• Building A Distributed Message Queue With Kafka: Partitioning, Replication, And Exactly Once Semantics · 2019-07-22

  A comprehensive technical exploration of building a distributed message queue with kafka: partitioning, replication, and exactly once semantics, covering key concepts, practical implementations, and real-world applications.

• A Thorough Explanation Of The Google File System’S Master Replication And Shadow Masters · 2019-07-16

  A comprehensive technical exploration of a thorough explanation of the google file system’s master replication and shadow masters, covering key concepts, practical implementations, and real-world applications.