Finding repeated elements
From MaRDI portal
Cited in
(47)- On computing majority by comparisons
- Finding modes with equality comparisons
- Approximating frequent items in asynchronous data stream over a sliding window
- Identifying correlated heavy-hitters in a two-dimensional data stream
- Fast and accurate mining of correlated heavy hitters
- A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution
- The exact fitting problem in higher dimensions
- A survey of challenges for runtime verification from advanced application domains (beyond software)
- Range majorities and minorities in arrays
- Distributed mining of time-faded heavy hitters
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy
- Compressed dynamic range majority and minority data structures
- Top-\(k\) frequent items and item frequency tracking over sliding windows of any size
- Randomized algorithms for tracking distributed count, frequencies, and ranks
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Space-efficient estimation of statistics over sub-sampled streams
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Finding mode using equality comparisons
- Frequent directions: simple and deterministic matrix sketching
- A Turing machine resisting isolated bursts of faults
- Indexing for summary queries, theory and practice
- Range Majority in Constant Time and Linear Space
- Dynamic range majority data structures
- Robust frequent directions with application in online learning
- Competitive analysis of maintaining frequent items of a stream
- Space‐efficient tracking of persistent items in a massive data stream
- Mining frequent items in data stream using time fading model
- Communication-efficient distributed covariance sketch, with application to distributed PCA
- A general lower bound on the I/O-complexity of comparison-based algorithms
- A Framework for Adversarially Robust Streaming Algorithms
- Adversarially robust property-preserving hash functions
- Simulating random walks on graphs in the streaming model
- Tree path majority data structures
- Bottom-up evaluation of Datalog programs with arithmetic constraints
- Dynamically computing approximate frequency counts in sliding window over data stream
- Summary data structures for massive data
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- Randomized counter-based algorithms for frequency estimation over data streams in O( N) space
- Forty years of frequent items
- Fast identification of heavy hitters by cached and packed group testing
- Identifying frequent items in a network using gossip
- Determining the majority
- Additive noise mechanisms for making randomized approximation algorithms differentially private
- Tree path majority data structures
- Do-it-yourself type theory
- The frequent items problem, under polynomial decay, in the streaming model
- Finding frequent items over sliding windows with constant update time
This page was built for publication: Finding repeated elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1170891)
