Tag
expected-analysis
- Oct 29, 2025 Universal Hashing and Guarantees That Hold for Every Input How choosing a hash function at random from a pairwise-independent family removes the adversary s advantage, and what a family costs to evaluate and to build. algorithms
- Mar 15, 2025 Randomized Recurrences and the Indicator Variable Method How expected cost is derived from indicator variables and conditional expectations, and why a recurrence over the random split point needs a different treatment from a deterministic one. algorithms
- Oct 11, 2023 Randomized Incremental Construction and Backward Analysis How building a structure by inserting elements in random order turns a quadratic insertion cost into an expected linear one, and why the analysis runs the process backwards. algorithms
- Oct 5, 2022 Randomized Quicksort and the Expected Comparison Count How choosing the pivot uniformly at random makes the 2n ln n comparison bound hold for every input, and where the expectation stops describing a single run. algorithms