A simple and robust protocol for distributed counting
From MaRDI portal
Cites work
- A deterministic algorithm for balanced cut with applications to dynamic connectivity, flows, and beyond
- A rounds vs. communication tradeoff for multi-party set disjointness
- Adversarial laws of large numbers and optimal regret in online classification
- Adversarially robust streaming via dense-sparse trade-offs
- Algorithmic stability for adaptive data analysis
- Communication-efficient distributed covariance sketch, with application to distributed PCA
- Concentration inequalities. A nonasymptotic theory of independence
- Continuous sampling from distributed streams
- Deterministically maintaining a (2 + )-approximate minimum vertex cover in O(1/^2) amortized update time
- Differential privacy under continual observation
- Dynamic algorithms against an adaptive adversary: generic constructions and lower bounds
- Faster maxflow via improved dynamic spectral vertex sparsifiers
- Functional Monitoring without Monotonicity
- scientific article; zbMATH DE number 7829269 (Why is no real title available?)
- scientific article; zbMATH DE number 7788485 (Why is no real title available?)
- Improved algorithms for distributed entropy monitoring
- Lower bounds for number-in-hand multiparty communication complexity, made easy
- On the complexity of differentially private data release, efficient algorithms and hardness results
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Separating adaptive streaming from oblivious streaming using the bounded storage model
- The communication complexity of addition
- The Communication Complexity of Distributed epsilon-Approximations
This page was built for publication: A simple and robust protocol for distributed counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445557)