Finding repeated elements
From MaRDI portal
Publication:1170891
DOI10.1016/0167-6423(82)90012-0zbMath0497.68041OpenAlexW2006355640WikidataQ29400650 ScholiaQ29400650MaRDI QIDQ1170891
Publication date: 1982
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6345
Related Items (46)
A Turing Machine Resisting Isolated Bursts of Faults ⋮ Dynamically computing approximate frequency counts in sliding window over data stream ⋮ Dynamic range majority data structures ⋮ A general lower bound on the I/O-complexity of comparison-based algorithms ⋮ A Framework for Adversarially Robust Streaming Algorithms ⋮ The exact fitting problem in higher dimensions ⋮ Summary Data Structures for Massive Data ⋮ Indexing for summary queries ⋮ Compressed dynamic range majority and minority data structures ⋮ Finding modes with equality comparisons ⋮ Randomized algorithms for tracking distributed count, frequencies, and ranks ⋮ Unnamed Item ⋮ Randomized counter-based algorithms for frequency estimation over data streams in \(O(\log \log N)\) space ⋮ Forty years of frequent items ⋮ Top-\(k\) frequent items and item frequency tracking over sliding windows of any size ⋮ Do-it-yourself type theory ⋮ On deterministic sketching and streaming for sparse recovery and norm estimation ⋮ Competitive analysis of maintaining frequent items of a stream ⋮ On computing majority by comparisons ⋮ Identifying frequent items in a network using gossip ⋮ Approximating frequent items in asynchronous data stream over a sliding window ⋮ Mining frequent items in data stream using time fading model ⋮ Identifying correlated heavy-hitters in a two-dimensional data stream ⋮ Fast and accurate mining of correlated heavy hitters ⋮ Range Majority in Constant Time and Linear Space ⋮ A parallel space saving algorithm for frequent items and the Hurwitz zeta distribution ⋮ Determining the majority ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ The frequent items problem, under polynomial decay, in the streaming model ⋮ Periodicity in data streams with wildcards ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Finding frequent items over sliding windows with constant update time ⋮ Range majorities and minorities in arrays ⋮ Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy ⋮ Finding Mode Using Equality Comparisons ⋮ Bottom-up evaluation of Datalog programs with arithmetic constraints ⋮ Space‐efficient tracking of persistent items in a massive data stream ⋮ 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 ⋮ Frequent Directions: Simple and Deterministic Matrix Sketching ⋮ Tree path majority data structures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Space-efficient estimation of statistics over sub-sampled streams
This page was built for publication: Finding repeated elements
