On the complexity of certified write-all algorithms

A wait-free sorting algorithm

PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing

The do-all problem in broadcast networks

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing

Controlling memory access concurrency in efficient fault-tolerant parallel algorithms

Nordic Journal of Computing

Randomization Helps to Perform Tasks on Processors Prone to Failures

Proceedings of the 13th International Symposium on Distributed Computing

The Complexity of Synchronous Iterative Do-All with Crashes

DISC '01 Proceedings of the 15th International Conference on Distributed 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

A work-optimal deterministic algorithm for the asynchronous certified write-all problem

Proceedings of the twenty-second annual symposium on Principles of distributed computing

Deterministic computations on a PRAM with static processor and memory faults

Fundamenta Informaticae

Hundreds of impossibility results for distributed computing

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

Writing-all deterministically and optimally using a non-trivial number of asynchronous processors

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures

The complexity of synchronous iterative Do-All with crashes

Distributed Computing

Cooperative asynchronous update of shared memory

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

A tight analysis and near-optimal instances of the algorithm of Anderson and Woll

Theoretical Computer Science

The Do-All problem with Byzantine processor failures

Theoretical Computer Science - Foundations of software science and computation structures

Writing-all deterministically and optimally using a nontrivial number of asynchronous processors

ACM Transactions on Algorithms (TALG)

Robust network supercomputing with malicious processes

DISC'06 Proceedings of the 20th international conference on Distributed Computing

Deterministic Computations on a PRAM with Static Processor and Memory Faults

Fundamenta Informaticae

The strong at-most-once problem

DISC'12 Proceedings of the 26th international conference on Distributed Computing