Efficient parallel algorithms can be made robust
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Shared-memory vs. message-passing in an asynchronous distributed environment
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Sharing memory robustly in message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Combining tentative and definite executions for very fast dependable parallel computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient parallel algorithms on restartable fail-stop processors
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Time-optimal message-efficient work performance in the presence of faults
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Modular competitiveness for distributed algorithms
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
“Dynamic-fault-prone BSP”: a paradigm for robust computations in changing environments
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms
Nordic Journal of Computing
distributed cooperation and adversity: complexity trade-offs
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Work-competitive scheduling for cooperative computing with dynamic groups
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The complexity of synchronous iterative Do-All with crashes
Distributed Computing
Performing tasks on synchronous restartable message-passing processors
Distributed Computing
The Do-All problem with Byzantine processor failures
Theoretical Computer Science - Foundations of software science and computation structures
Dynamic load balancing with group communication
Theoretical Computer Science
Robust network supercomputing with malicious processes
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 0.00 |