Presents a tester for abelian group property testing in the PS-model with time Õ(√|G| + 1/ε), improving on prior linear-time testers.
InProceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC ’05)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Minimizing pigeons for 2-hop and multihop demands is NP-hard, but a polynomial-time demand-aggregation algorithm achieves a 2-approximation.
citing papers explorer
-
Sublinear Time Algorithms for Abelian Group Property Testing
Presents a tester for abelian group property testing in the PS-model with time Õ(√|G| + 1/ε), improving on prior linear-time testers.
-
The Carrier Pigeon Internet Protocol: An Algorithmic (and Lighthearted) Perspective
Minimizing pigeons for 2-hop and multihop demands is NP-hard, but a polynomial-time demand-aggregation algorithm achieves a 2-approximation.