Renaming in an asynchronous environment
Journal of the ACM (JACM)
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
New combinatorial topology bounds for renaming: The upper bound
Journal of the ACM (JACM)
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Synchrony weakened by message adversaries vs asynchrony restricted by failure detectors
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Upper bound on the complexity of solving hard renaming
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: pareto optimal solutions to consensus and set consensus
Proceedings of the 2013 ACM symposium on Principles of distributed computing
LSEQ: an adaptive structure for sequences in distributed collaborative editing
Proceedings of the 2013 ACM symposium on Document engineering
Locally Self-Adjusting Tree Networks
IPDPS '13 Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed Processing
Transience bounds for distributed algorithms
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |