Master thesis
O(n) algorithm for computing longest paths in 2-treesGet wiser
Advice by the guests of The CognicastReFindit
Find biblio-references fastFP with Clojure
Solutions for an University of Helsinki online-courseFMI
Parallel transitive closure (Warshall)Clojure spec Screencast Series
transcription of the code shown in the videos