Arpit’s Newsletter

Arpit’s Newsletter

Home
Career Growth
System Design
Deep Dives
Papers and Musings
Outage Dissections
About

Papers and Musings

Pseudorandom Number Generation using LFSR
A few essays back, we saw how pseudo-random numbers are generated using Cellular Automaton - Rule 30. This essay takes a detailed look into random…
 • 
Arpit Bhayani
Fork Bomb
In this essay, we explore a simple yet effective DoS attack called Fork Bomb, also called Rabbit Virus.
 • 
Arpit Bhayani
A simple recursion visualizer for python
One programming paradigm, that is hardest to visualize, as almost every single programmer out there will agree on, is Recursion. We usually use pen and…
 • 
Arpit Bhayani
Approximate Count-Distinct using Flajolet Martin Algorithm
Measuring distinct elements from a stream of values is one of the most common utilities that finds its application across the spectrum. Most of these…
 • 
Arpit Bhayani
2Q Cache Management Algorithm
LRU is one of the most widely used cache eviction algorithms suffers from a bunch of limitations especially when used for managing caches in disk-backed…
 • 
Arpit Bhayani
Israeli Queues
A queue is a data structure that holds up elements for a brief period of time until a peripheral processing system is ready to process them.
 • 
Arpit Bhayani
1D Procedural Terrain Generation
Terrains are at the heart of every Computer Game - be it Counter-Strike, Age of Empires, or even Minecraft.
 • 
Arpit Bhayani
Set Similarity using Jaccard Similarity Coefficient and MinHash
Set similarity measure finds its application spanning the Computer Science spectrum; some applications being - user segmentation, finding near-duplicate…
 • 
Arpit Bhayani
Time Series Smoothing - Making aberrations stand out
Time series is a collection of numerical data points (often measurements), gathered in discrete time intervals, and indexed in order of the time.
 • 
Arpit Bhayani
4
Constant Time LFU
A common strategy to make any system super-performant is Caching. Almost all software products, operating at scale, have multiple layers of caches in…
 • 
Arpit Bhayani
Morris's Algorithm for Approximate Counting
Approximate Counting algorithms are techniques that allow us to count a large number of events using a very small amount of memory. It was invented by…
 • 
Arpit Bhayani
1
Slowsort - a pessimal sorting algorithm
Slowsort is a sorting algorithm that is designed to be deterministically sub-optimal. The algorithm was published in 1986 by Andrei Broder and Jorge…
 • 
Arpit Bhayani
© 2025 Arpit Bhayani
Privacy ∙ Terms ∙ Collection notice
Start writingGet the app
Substack is the home for great culture