Human Folly about “RMQ”

index

Debs17 tutorial (hirzels.com):
#PDF #paper #toread on #sliding-window-aggregation #algorithms, a generalization of #RMQ
on 02026-01-06
Range mode query (en.wikipedia.org):
The #RMQ #algorithms analogue for finding the modal element of a given range.
on 02015-08-10
The range minimum query problem (codinghighway.com):
Another #RMQ #algorithms #tutorial, this one in #C++.
on 02015-08-10
Range minimum query and lowest common ancestor (topcoder.com):
#RMQ via LCA #tutorial. #algorithms
on 02015-08-10
Range query %28data structures%29 (en.wikipedia.org):
Generalizations of #RMQ to arbitrary semigroups and other things, including range mode query and range median query. #algorithms
on 02015-08-10
Range minimum query (github.com):
apparently an implementation of #RMQ via LCA? #algorithms
on 02015-08-10
Analysis of range minimum query implementations (streamsandpatterns.wordpress.com):
different #RMQ #algorithms, including RMQ via least common ancestor (LCA)
on 02015-08-10
Range minimum query (wcipeg.com):
#RMQ #algorithms I didn’t know about.
on 02015-08-10
Sliding range minimum query (wcipeg.com):
Among #RMQ #algorithms there’s a special case that’s linear-time when the range in question is a sliding window.
on 02015-08-10
How does one decide when to use a segment tree or Fenwick tree (quora.com):
Hmm, I hadn’t heard of this “binary indexed tree” or “Fenwick tree” alternative to the segment tree (#algorithms) that can’t handle #RMQ problems, in half the space and less time. It sounds like #mipmapping of #sumtables?
on 02015-08-10
Msg00298 (mail-archive.com):
“a logarithmic-time alternative to summed-area tables for reducing arbitrary semigroup operations over arbitrary ranges (a generalization of #RMQ segment trees)” #cumsum #algorithms #sumtables
on 02015-08-10