Time bounds for decision problems in the presence of timing uncertainty and failures

Hundreds of impossibility results for distributed computing

Distributed Computing - Papers in celebration of the 20th anniversary of PODC

Note: Strong order-preserving renaming in the synchronous message passing model

Theoretical Computer Science

Structured derivation of semi-synchronous algorithms

DISC'11 Proceedings of the 25th international conference on Distributed computing

Early deciding synchronous renaming in o( logf) rounds or less

SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity

Randomized loose renaming in o(log log n) time

Proceedings of the 2013 ACM symposium on Principles of distributed computing