17 citations · 91 across the 27 of their papers we have counts for
1 paper · 2 filters
Danny Krizanc, Pat Morin, Michiel Smid
We consider algorithms for preprocessing labelled lists and trees so that, for any two nodes u and v we can answer queries of the form: What is the mode or median label in the sequ…