Notes concerning “The range minimum query problem”

• Worst-case-logarithmic-time reduction over arbitrary intervals over arbitrary semigroups 2012-12-04 (5 minutes)
• a logarithmic-time alternative to summed-area tables for reducing arbitrary semigroup operations over arbitrary ranges (a generalization of RMQ segment trees) 2012-12-06 (updated 2013-05-17) (10 minutes)
• Robust hashsplitting with sliding Range Minimum Query 2016-09-05 (7 minutes)
• Some notes on morphology, including improvements on Urbach and Wilkinson’s erosion/dilation algorithm 2019-01-04 (updated 2019-11-12) (26 minutes)
• Tabulating your top event of the month efficiently using RMQ algorithms 2019-03-19 (8 minutes)