Pages that link to "Item:Q5415527"

The following pages link to Tight bounds for distributed functional monitoring (Q5415527):

Displaying 20 items.

• When distributed computation is communication expensive (Q1689746) (← links)
• Monitoring threshold functions over distributed data streams with node dependent constraints (Q1736519) (← links)
• A survey of challenges for runtime verification from advanced application domains (beyond software) (Q2008293) (← links)
• Communication complexity of approximate maximum matching in the message-passing model (Q2220400) (← links)
• Improved algorithms for distributed entropy monitoring (Q2408102) (← links)
• Randomized algorithms for tracking distributed count, frequencies, and ranks (Q2414859) (← links)
• Lower bounds for number-in-hand multiparty communication complexity, made easy (Q2796207) (← links)
• Algorithms for k-median Clustering over Distributed Streams (Q2817895) (← links)
• (Q3174906) (← links)
• Algorithms for distributed functional monitoring (Q3189003) (← links)
• Taylor Polynomial Estimator for Estimating Frequency Moments (Q3448814) (← links)
• The Simultaneous Communication of Disjointness with Applications to Data Streams (Q3448862) (← links)
• The Range of Topological Effects on Communication (Q3449503) (← links)
• Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568) (← links)
• The Communication Complexity of Distributed epsilon-Approximations (Q4978194) (← links)
• Quantum Chebyshev's Inequality and Applications (Q5091227) (← links)
• (Q5091258) (← links)
• (Q5116486) (← links)
• Towards Optimal Moment Estimation in Streaming and Distributed Models (Q5875483) (← links)
• Model counting meets \(F_0\) estimation (Q6535267) (← links)