b3r8 / randomized-algorithms Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Implementation of some randomized algorithms from UCSC CSE290A Spring 2020 class

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
LICENSE		LICENSE
README.md		README.md
kargers_with_networkx.ipynb		kargers_with_networkx.ipynb
lecture1.ipynb		lecture1.ipynb
lecture4_and_5.ipynb		lecture4_and_5.ipynb
lecture7.ipynb		lecture7.ipynb

Repository files navigation

Randomized Algorithms

Implementation of some randomized algorithms from UCSC CSE290A Spring 2020 class

Description

Lecture 1: Randomized Quicksort and Karger's min-cut
Lectures 4,5: Karp-Luvy-Madras for enumeration problem
Lecture 7: Walker's alias method

Main reference

[1] Lectures playlist

TO-DO(?)

Estimate the average degree of a graph
Uniformity testing
HyperLogLog algorithm

About

Implementation of some randomized algorithms from UCSC CSE290A Spring 2020 class

Report repository

Releases

No releases published

Packages

No packages published

Languages

Jupyter Notebook 100.0%