Algorithms

• A Secure Multi Party Computation Protocol For Private Set Intersection: Oprf And Ot Extensions · 2020-05-06

  A comprehensive technical exploration of a secure multi party computation protocol for private set intersection: oprf and ot extensions, covering key concepts, practical implementations, and real-world applications.

• Implementing A Zero Knowledge Proof Of Knowledge From The Schnorr Protocol: Σ Protocols And Fiat Shamir · 2020-04-27

  A comprehensive technical exploration of implementing a zero knowledge proof of knowledge from the schnorr protocol: σ protocols and fiat shamir, covering key concepts, practical implementations, and real-world applications.

• The Theoretical Foundations Of Paillier Cryptosystem: Homomorphic Encryption For Privacy Preserving Aggregation · 2020-04-14

  A comprehensive technical exploration of the theoretical foundations of paillier cryptosystem: homomorphic encryption for privacy preserving aggregation, covering key concepts, practical implementations, and real-world applications.

• Building A Bloom Filter With Optimal Number Of Hash Functions And Memory Estimation · 2020-04-12

  A comprehensive technical exploration of building a bloom filter with optimal number of hash functions and memory estimation, covering key concepts, practical implementations, and real-world applications.

• An Algorithm For Incremental Topological Ordering Dynamic Dags: Applications In Build Systems · 2020-04-10

  A comprehensive technical exploration of an algorithm for incremental topological ordering dynamic dags: applications in build systems, covering key concepts, practical implementations, and real-world applications.

• Integer Programming: Branch-and-Bound, Gomory Cuts, Lift-and-Project, and Solver Internals · 2020-02-23

  An inside look at integer programming algorithms—branch-and-bound, cutting planes, lift-and-project hierarchies—and how Gurobi and CPLEX solve NP-hard problems.

• Implementing A Patricia Trie For Ip Router Lookup With Tcam Emulation · 2020-02-22

  A comprehensive technical exploration of implementing a patricia trie for ip router lookup with tcam emulation, covering key concepts, practical implementations, and real-world applications.

• The Performance Of Ternary Search Vs. Binary Search On Non Uniform Distribution Keys · 2020-02-19

  A comprehensive technical exploration of the performance of ternary search vs. binary search on non uniform distribution keys, covering key concepts, practical implementations, and real-world applications.

• Convex Optimization: Gradient Descent, Nesterov Acceleration, KKT Conditions, and the ML Stack · 2020-02-18

  A deep investigation of convex optimization—the engine of modern machine learning—from gradient descent and Nesterov momentum to KKT conditions and interior-point methods.

• A Deep Dive Into Suffix Arrays And Suffix Trees: Construction In Linear Time With Dc3 And Ukkonen’S Algorithm · 2020-02-17

  A comprehensive technical exploration of a deep dive into suffix arrays and suffix trees: construction in linear time with dc3 and ukkonen’s algorithm, covering key concepts, practical implementations, and real-world applications.

• Designing A Greedy Algorithm For Maximum Weight Matching In Bipartite Graphs With Augmenting Paths · 2020-02-04

  A comprehensive technical exploration of designing a greedy algorithm for maximum weight matching in bipartite graphs with augmenting paths, covering key concepts, practical implementations, and real-world applications.

• The Complexity Of Approximate Nearest Neighbor Search With Locality Sensitive Hashing: Theoretical Bounds And Practical Tuning · 2020-02-03

  A comprehensive technical exploration of the complexity of approximate nearest neighbor search with locality sensitive hashing: theoretical bounds and practical tuning, covering key concepts, practical implementations, and real-world applications.

• Implementing A Distributed Graph Processing System Using Pregel: Vertex Centric Bsp And Checkpointing · 2020-02-02

  A comprehensive technical exploration of implementing a distributed graph processing system using pregel: vertex centric bsp and checkpointing, covering key concepts, practical implementations, and real-world applications.

• Submodular Optimization: Diminishing Returns, the (1-1/e) Greedy Guarantee, and Machine Learning Applications · 2020-02-01

  A comprehensive study of submodular functions—the discrete analog of convexity—the greedy algorithm's optimal approximation, and applications in active learning and summarization.

• Matroid Theory: The Greedy Exchange Property, Matroid Intersection, and Applications in Spanning Trees and Matching · 2020-01-19

  A thorough exploration of matroid theory—the algebraic abstraction that explains why greedy algorithms work—matroid intersection, and their applications in combinatorial optimization.

• The Analysis Of Consistent Hashing Under Churn: Virtual Nodes, Power Law Distributions, And Load Balancing · 2020-01-17

  A comprehensive technical exploration of the analysis of consistent hashing under churn: virtual nodes, power law distributions, and load balancing, covering key concepts, practical implementations, and real-world applications.

• Fair Division: Cut-and-Choose, Selfridge-Conway, Brams-Taylor, and the Mathematics of Envy-Freeness · 2020-01-15

  A rigorous exploration of fair division—from cake-cutting protocols to envy-free allocations—and their application to cloud resource allocation and beyond.

• A Polynomial Time Algorithm For Minimum Steiner Tree In The Plane Using Dynamic Programming On Decompositions · 2020-01-10

  A comprehensive technical exploration of a polynomial time algorithm for minimum steiner tree in the plane using dynamic programming on decompositions, covering key concepts, practical implementations, and real-world applications.

• Building An Online Algorithm For The K Server Problem Using Work Function And Caching Policies · 2020-01-09

  A comprehensive technical exploration of building an online algorithm for the k server problem using work function and caching policies, covering key concepts, practical implementations, and real-world applications.

• The Numerical Stability Of Fast Fourier Transform Algorithms: Decimation In Time Vs. Frequency With Twiddle Factors · 2020-01-05

  A comprehensive technical exploration of the numerical stability of fast fourier transform algorithms: decimation in time vs. frequency with twiddle factors, covering key concepts, practical implementations, and real-world applications.

• Implementing A Cache Oblivious Matrix Multiplication Algorithm With Block Recursive Layouts · 2019-12-30

  A comprehensive technical exploration of implementing a cache oblivious matrix multiplication algorithm with block recursive layouts, covering key concepts, practical implementations, and real-world applications.

• Mechanism Design: VCG Auctions, the Revelation Principle, and the Architecture of Truthfulness · 2019-12-23

  A deep exploration of mechanism design—the VCG mechanism, Myerson optimal auction, incentive compatibility, and how to design games where truth-telling is a dominant strategy.

• A Quantitative Comparison Of Sorting Algorithms On Modern Cpu Architectures: Radix Sort Vs. Quicksort With Simd · 2019-12-11

  A comprehensive technical exploration of a quantitative comparison of sorting algorithms on modern cpu architectures: radix sort vs. quicksort with simd, covering key concepts, practical implementations, and real-world applications.

• Designing A Mapreduce Framework From Scratch: Job Scheduling, Data Locality, And Fault Tolerance · 2019-12-04

  A comprehensive technical exploration of designing a mapreduce framework from scratch: job scheduling, data locality, and fault tolerance, covering key concepts, practical implementations, and real-world applications.