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
Generating fast indulgent algorithms
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Renaming in message passing systems with byzantine failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Fully-adaptive algorithms for long-lived renaming
DISC'06 Proceedings of the 20th 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
Byzantine renaming in synchronous systems with t
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 5.23 |