Especially in the analysis of randomized algorithms, probabilistic bounds play a pivotal role in the proving of probabilistic theorems. This blog aims to be a reference for such key results that will be used in the randomized analyses conducted in upcoming blogs. Foremost, we cover the all-important Markov and Chebyshev
The most prominent randomized algorithm that almost everyone who has taken an algorithms course knows to their heart is the very famous Randomized QuickSort sorting algorithm. Since there are countless resources for this algorithm, I provide this blog to be a foundation for an upcoming post on the detailed analysis
Hi! I am Balaram. Currently, I am a third-year undergraduate student at the University of California, Santa Cruz (UCSC) where I am studying Computer Science and Mathematics. Passionate of many topics in Theoretical Computer Science, I decided to create this blog where I can post things I learn. Hopefully, you
Recent Comments