AA Second Project - The objective of this project was to design and test a randomized algorithm to solve the combinatorial problem from the first assignment, which was to find a minimum weighted closure for a given vertex-weighted directed graph G(V, E), with n vertices and m edges. This randomized algorithm was based on the Monte Carlo algorithms.
Lecture Notes on Interesting Topics in Computer Science
LaTeX solutions for homework from the "Randomized Algorithms" course at the University of Tehran (Spring 2022), covering probability, sampling, and MSTs.
Formal verification of randomized streaming algorithms for frequency moments.
Homework solutions for EPFL's CS-455 (joint class with NYU's CS-UY 3943 I) Topics in Theoretical Computer Science course
Bloom filter for Randomized Algorithms (INFO—F413)
Add a description, image, and links to the randomized-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the randomized-algorithms topic, visit your repo's landing page and select "manage topics."