New lower bound techniques for distributed leader finding and other problems on rings of processors

Optimal Elections in Faulty Loop Networks and Applications

IEEE Transactions on Computers

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

Leader election in hierarchical star network

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II

Bit complexity of breaking and achieving symmetry in chains and rings

Journal of the ACM (JACM)