Amortized efficiency of list update and paging rules
Communications of the ACM
Efficient parallel algorithms can be made robust
Proceedings of the eighth 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
On the value of information in distributed decision-making (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Achieving optimal CRCW PRAM fault-tolerance
Information Processing Letters
Journal of Algorithms
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Performing work efficiently in the presence of faults
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Work-optimal asynchronous algorithms for shared memory parallel computers
SIAM Journal on Computing
The process group approach to reliable distributed computing
Communications of the ACM
Fault-tolerant and efficient parallel computation
Fault-tolerant and efficient parallel computation
On the complexity of certified write-all algorithms
Journal of Algorithms
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
Parallel algorithms with processor failures and delays
Journal of Algorithms
Communications of the ACM
The Transis approach to high availability cluster communication
Communications of the ACM
Algorithms for the Certified Write-All Problem
SIAM Journal on Computing
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Fault-Tolerant Parallel Computation
Fault-Tolerant Parallel Computation
Optimally work-competitive scheduling for cooperative computing with merging groups
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Controlling memory access concurrency in efficient fault-tolerant parallel algorithms
Nordic Journal of Computing
Distributed Cooperation During the Absence of Communication
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
The Complexity of Synchronous Iterative Do-All with Crashes
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Bounding Work and Communication in Robust Cooperative Computation
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Resolving message complexity of Byzantine Agreement and beyond
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A work-optimal deterministic algorithm for the asynchronous certified write-all problem
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Performing work with asynchronous processors: message-delay-sensitive bounds
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Local Scheduling for Distributed Cooperation
NCA '01 Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA'01)
Distributed scheduling for disconnected cooperation
Distributed scheduling for disconnected cooperation
An algorithm for the asynchronous Write-All problem based on process collision
Distributed Computing
Performing tasks on synchronous restartable message-passing processors
Distributed Computing
| Hi-index | 0.00 |
The problem of cooperatively performing a collection of tasks in a decentralized setting where the computing medium is subject to adversarial perturbations is one of the fundamental problems in distributed computing. Such perturbations can be caused by processor failures, unpredictable delays, and communication breakdowns.(i)~failure-sensitive bounds for distributed cooperation problems for synchronous processors subject to crash failures.These research results are motivated by the earlier work of the third author with Paris C. Kanellakis at Brown University.