Approximate shared-memory counting despite a strong adversary
From MaRDI portal
Recommendations
- Approximate shared-memory counting despite a strong adversary
- Approximate counting with m counters: A detailed analysis
- Approximate counting by hashing in bounded arithmetic
- Optimal private halfspace counting via discrepancy
- Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation
- Anonymous and fault-tolerant shared-memory computing
- Efficient maliciously secure multiparty computation for RAM
- Approximate counting with \(m\) counters: a probabilistic analysis
- The topology of shared-memory adversaries
Cited in
(14)- A modular approach to shared-memory consensus, with applications to the probabilistic-write model
- Communication-efficient randomized consensus
- The CB tree: a practical concurrent self-adjusting search tree
- Long-lived counters with polylogarithmic amortized step complexity
- Lower bounds for restricted-use objects
- Randomized consensus in expected \(O(n ^{2})\) total work using single-writer registers
- Approximate shared-memory counting despite a strong adversary
- The strong at-most-once problem
- A tight space bound for consensus
- Concurrent counting (extended abstract)
- Brief announcement: Fast shared counting using \(O(n)\) compare-and-swap registers
- Limited-use atomic snapshots with polylogarithmic step complexity
- Faster randomized consensus with an oblivious adversary
- Combining shared-coin algorithms
This page was built for publication: Approximate shared-memory counting despite a strong adversary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930301)
