Tight bounds for distributed functional monitoring
From MaRDI portal
Publication:5415527
DOI10.1145/2213977.2214063zbMath1286.68025arXiv1112.5153OpenAlexW2167099561MaRDI QIDQ5415527
Publication date: 13 May 2014
Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.5153
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Related Items (18)
Taylor Polynomial Estimator for Estimating Frequency Moments ⋮ The Simultaneous Communication of Disjointness with Applications to Data Streams ⋮ The Range of Topological Effects on Communication ⋮ Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Improved algorithms for distributed entropy monitoring ⋮ Randomized algorithms for tracking distributed count, frequencies, and ranks ⋮ Towards Optimal Moment Estimation in Streaming and Distributed Models ⋮ Communication-efficient distributed graph clustering and sparsification under duplication models ⋮ When distributed computation is communication expensive ⋮ Communication complexity of approximate maximum matching in the message-passing model ⋮ A survey of challenges for runtime verification from advanced application domains (beyond software) ⋮ Unnamed Item ⋮ Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy ⋮ Unnamed Item ⋮ Algorithms for k-median Clustering over Distributed Streams ⋮ The Communication Complexity of Distributed epsilon-Approximations ⋮ Quantum Chebyshev's Inequality and Applications
This page was built for publication: Tight bounds for distributed functional monitoring
