The following pages link to Finding repeated elements (Q1170891):
Displaying 47 items.
- Space-efficient estimation of statistics over sub-sampled streams (Q262266) (← links)
- Dynamic range majority data structures (Q306716) (← links)
- Competitive analysis of maintaining frequent items of a stream (Q476837) (← links)
- Mining frequent items in data stream using time fading model (Q498012) (← links)
- Identifying frequent items in a network using gossip (Q666263) (← links)
- Determining the majority (Q688232) (← links)
- Tree path majority data structures (Q784481) (← links)
- Do-it-yourself type theory (Q911744) (← links)
- The frequent items problem, under polynomial decay, in the streaming model (Q986537) (← links)
- Finding frequent items over sliding windows with constant update time (Q991773) (← links)
- On computing majority by comparisons (Q1181015) (← links)
- Finding modes with equality comparisons (Q1680532) (← links)
- Approximating frequent items in asynchronous data stream over a sliding window (Q1736485) (← links)
- Identifying correlated heavy-hitters in a two-dimensional data stream (Q1741250) (← links)
- Fast and accurate mining of correlated heavy hitters (Q1741373) (← links)
- A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution (Q1750526) (← links)
- The exact fitting problem in higher dimensions (Q1917054) (← links)
- A survey of challenges for runtime verification from advanced application domains (beyond software) (Q2008293) (← links)
- Range majorities and minorities in arrays (Q2032347) (← links)
- Distributed mining of time-faded heavy hitters (Q2054052) (← links)
- On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy (Q2056803) (← links)
- Compressed dynamic range majority and minority data structures (Q2182101) (← links)
- Top-\(k\) frequent items and item frequency tracking over sliding windows of any size (Q2201636) (← links)
- Randomized algorithms for tracking distributed count, frequencies, and ranks (Q2414859) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Lower bounds for number-in-hand multiparty communication complexity, made easy (Q2796207) (← links)
- Finding Mode Using Equality Comparisons (Q2803838) (← links)
- Frequent directions: simple and deterministic matrix sketching (Q2821796) (← links)
- A Turing Machine Resisting Isolated Bursts of Faults (Q2891366) (← links)
- Indexing for summary queries (Q2943560) (← links)
- Range Majority in Constant Time and Linear Space (Q3012810) (← links)
- (Q4633059) (← links)
- Space‐efficient tracking of persistent items in a massive data stream (Q4969927) (← links)
- (Q4999000) (← links)
- A general lower bound on the I/O-complexity of comparison-based algorithms (Q5060102) (← links)
- A Framework for Adversarially Robust Streaming Algorithms (Q5066953) (← links)
- (Q5090388) (← links)
- (Q5090424) (← links)
- (Q5091063) (← links)
- Bottom-up evaluation of Datalog programs with arithmetic constraints (Q5210782) (← links)
- Dynamically computing approximate frequency counts in sliding window over data stream (Q5291160) (← links)
- Summary Data Structures for Massive Data (Q5326361) (← links)
- (Q5743415) (← links)
- Periodicity in data streams with wildcards (Q5915573) (← links)
- Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space (Q6140352) (← links)
- Forty years of frequent items (Q6198649) (← links)
- Fast identification of heavy hitters by cached and packed group testing (Q6536258) (← links)
