New algorithms compute perfect matchings with O(n log n) pulses randomly, O(n) pulses deterministically with neighbor IDs, and a lower bound shows deterministic anonymous methods need Ω(n^2) messages.
Optimal message-passing with noisy beeps
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Perfect Matching with Few Link Activations
New algorithms compute perfect matchings with O(n log n) pulses randomly, O(n) pulses deterministically with neighbor IDs, and a lower bound shows deterministic anonymous methods need Ω(n^2) messages.