Tight lower bounds for probabilistic solitude verification on anonymous rings
Journal of the ACM (JACM)
Computing on Anonymous Networks: Part I-Characterizing the Solvable Cases
IEEE Transactions on Parallel and Distributed Systems
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM (JACM)
| Hi-index | 0.00 |