Approximate counting of inversions in a data stream
From MaRDI portal
Publication:3579234
DOI10.1145/509907.509964zbMath1192.68455OpenAlexW2085788081MaRDI QIDQ3579234
Miklós Ajtai, T. S. Jayram, Ravi Kumar, D. Sivakumar
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509964
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Approximation algorithms (68W25)
Related Items (7)
An information statistics approach to data stream and communication complexity ⋮ Know when to persist: deriving value from a stream buffer ⋮ Partition arguments in multiparty communication complexity ⋮ Finding longest increasing and common subsequences in streaming data ⋮ Non-submodular streaming maximization with minimum memory and low adaptive complexity ⋮ Non-submodular maximization on massive data streams ⋮ Know When to Persist: Deriving Value from a Stream Buffer
This page was built for publication: Approximate counting of inversions in a data stream
