2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
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…