- British Columbia, Canada
-
05:45
(UTC -12:00) - https://www.linkedin.com/feed/
Popular repositories Loading
-
concurrentHull
concurrentHull PublicFinds the convex hull of a set of lattice points using a concurrent divide and conquer strategy.
Java 1
-
GettingClose
GettingClose PublicAlgorithm to find the minimum distance between a convex polygon and a line
Python 1
-
LonelyRaymond
LonelyRaymond PublicThis program implements Raymond's tree based solution for distributed mutual exclusion.
Python
Something went wrong, please refresh the page to try again.
If the problem persists, check the GitHub status page or contact support.
If the problem persists, check the GitHub status page or contact support.




