#
random-algorithm
Here are 3 public repositories matching this topic...
Select k-smallest item in an array A in nearly 2n time using LAZY-SELECT. Also implemented naive sorting & linear select algorithm.
-
Updated
May 7, 2019 - Python
A memory-efficient Adam optimizer variant that compresses optimizer states (m, v) into compact hash tables via 2-Universal Hashing + Count-Sketch techniques.
-
Updated
Mar 31, 2026 - Python
Improve this page
Add a description, image, and links to the random-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the random-algorithm topic, visit your repo's landing page and select "manage topics."