Misra and Gries defined the heavy-hitters problem (though they did not introduce the term heavy-hitters) and described the first algorithm for it in the...

The algorithm was presented by Misra and Gries alongside a different algorithm for finding frequent elements, the Misra–Gries heavy hitters algorithm. As...

computational model Misra–Gries heavy hitters algorithm and Misra–Gries summary, a natural generalization of the Boyer–Moore majority vote algorithm that stores...

notable algorithms are: Boyer–Moore majority vote algorithm Count-Min sketch Lossy counting Multi-stage Bloom filters Misra–Gries heavy hitters algorithm Misra–Gries...

{\displaystyle n} may be found by a comparison-based algorithm, the Misra–Gries heavy hitters algorithm, in time O ( n log ⁡ k ) {\displaystyle O(n\log k)}...

systems. In collaboration with David Gries, Misra proposed the first algorithm for the heavy-hitters problem. Misra proposed a set of axioms for concurrent...