Michal Dobrogost Engineer Manager at Snap Inc. MSc BMath Computer Science MSc Advisor: Christopher Anand

Publications

Here are links to some articles and papers that I have published. Some of them contain additional resources such as source code or test set data.

• Solving Maximum Flow Problems in J (Journal of J, 2013)
     Looks at formulating the push-relabel algorithm for maximum flow in the J programming language.
• Verified Multicore Parallelism Using Atomic Verifiable Operations (Book Chapter, 2013)
     With Christopher Anand and Wolfram Kahl
• Verifying Permutation Rewritable Hazard Free Loops (MSc Thesis, 2011)
     Methods for verifying deterministic execution of parallel algoirthms.

Talks

• Generating a Fast GPU Median Filter with Haskell (Vancouver Haskell Meetup, 2014)
     Looks at generating register based sorting algorithms for GPUs with Haskell.

Puzzles

• RegHex.
• One Rude Passenger's Contagion.
• The condemned prisoners and the boxes (original here).

Interests

I have spent a lot of time studying constraint satisfaction problems. I was lead into this by trying to solve the Eternity II puzzle. At one point I even had 20 computers networked up in my garage with a giant fan frantically trying to keep them cool as they churned away trying to solve it. If you invite me for a beer I'll tell you more about it.

I am motivated by projects with ambitious performance goals or challenging algorithmic requirements. I tend to dive into graph theory, optimization, statistics. I enjoy leveraging automated, randomized software testing, like quickcheck, to produce working software in less time.

For functional programming I enjoy the safety, readability and refactorability of strongly typed languages like Haskell. It's hard to beat C/C++ for speed of execution, J for speed of exploration or Python for hacking.