Table of Contents CommentsPrelims One-to-One One-to-All Report and Count Top-\(K\) A small rant on $τ$-micro-macro trees Ideas for simplificationReplace $τ$-micro-macro tree Heavy-Light-Decomposition (HLD) for \(Count\) queries in \(O(\log n)\) time Finding the largest \(l\) with \(Count(i, l) \geq K\) in \(O(\log n)\) time Reporting matching strings Comparison Closing thoughts \[\newcommand{\dol}{\$}\] These are some comments and new ideas on the paper by Loukides, Pissis, Thankachan, and ...
