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
Sorting and election in anonymous asynchronous rings
Journal of Parallel and Distributed Computing
Bit complexity of breaking and achieving symmetry in chains and rings
Journal of the ACM (JACM)
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
About randomised distributed graph colouring and graph partition algorithms
Information and Computation
An optimal bit complexity randomized distributed MIS algorithm (extended abstract)
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
On the time and the bit complexity of distributed randomised anonymous ring colouring
Theoretical Computer Science
Information and Computation
| Hi-index | 0.00 |