Essays
Visualizing binary search trees with GraphStream
March 15, 2021
The binary search tree algorithm (BST) is one of the most fundamental algorithms in computer science, enhancing tree structures with characteristics that combine the optimal insert with the efficiency of search in an ordered array. Learn this important algorithm by visualizing BSTs with GraphStream, a graph library for Java.
Reactive in Practice: a complete guide to event sourcing and CQRS
May 24, 2019
Learn how to apply event sourcing and CQRS to a real world system. All material is supported with a reference project to reference called Reactive Stock Trader.
Demystifying machine learning
December 19, 2018
Classical software is primarily based around the notion of decision trees. Any programmer who has coded an if-else-then statement can understand the basics of data science.
Give credit and take blame
June 4, 2017
When success is ultimately achieved, give the credit to others. There will be time for you to internalize your own impact on the success of a project.
Videos
DataOps: Operationalizing Data Science
October 26, 2018 • Reactive Summit 2018
According to Gartner’s Nick Heudecker, 85% of data science projects fail. This is a staggering ratio of failure that deserves consideration from your organization before undertaking your next data science initiative!
