Lower bounds for randomized mutual exclusion
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
Assigning labels in unknown anonymous networks (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Sorting and election in anonymous asynchronous rings
Journal of Parallel and Distributed Computing
Leader election in rings with nonunique labels
Fundamenta Informaticae
On the round complexity of Byzantine agreement without initial set-up
Information and Computation
How much memory is needed for leader election
DISC'10 Proceedings of the 24th international conference on Distributed computing
Distributed tree comparison with nodes of limited memory
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Communication complexity of consensus in anonymous message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Leader Election in Rings with Nonunique Labels
Fundamenta Informaticae
| Hi-index | 0.00 |