Prevent this user from interacting with your repositories and sending you notifications.
Learn more about blocking users.
You must be logged in to block users.
Contact GitHub support about this user’s behavior.
Learn more about reporting abuse.
Project Euler solutions in go, python, c, c++
Ramsey number R(r, s) is the smallest number of nodes n such that for each undirected graph of size n, there is either a complete subgraph of size r, or an empty subgraph of size s
Diplom Thesis: Automatic Profile-Based Characterisation of Performance Traces for Highly Parallel Applications
Minor Thesis: Development and Analysis of Barrier Protocols
Seeing something unexpected? Take a look at the
GitHub profile guide.