Update: I wrote a simulation program, my algorithm appears to perform better compared to the majority-finding algorithm of Yale's university described in the am

Update: I wrote a simulation program, my algorithm appears to perform better compared to the majority-finding algorithm of Yale's university described in the american scientist article even if the algorithm I proposed is O(1) and the Yale's is O(M) (where M is the number of top-items to track). I'll post an article with more details and the source code on YN today.