Efficient parallel algorithms can be made robust
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Early stopping in Byzantine agreement
Journal of the ACM (JACM)
Dynamic node reconfiguration in a parallel-distributed environment
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Time and message efficient reliable broadcasts
Proceedings of the 4th international workshop on Distributed algorithms
Message-optimal protocols for byzantine agreement (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Massively distributed computing and factoring large integers
Communications of the ACM
Performing work efficiently in the presence of faults
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Adaptive parallelism with Piranha
Adaptive parallelism with Piranha
Preemptable remote execution facilities for the V-system
Proceedings of the tenth ACM symposium on Operating systems principles
On the message complexity of binary byzantine agreement under crash failures
Distributed 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
The do-all problem in broadcast networks
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Optimal scheduling for disconnected cooperation
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
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
Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
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
Performing work with asynchronous processors: message-delay-sensitive bounds
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Cooperative computing with fragmentable and mergeable groups
Journal of Discrete Algorithms
Randomization helps to perform independent tasks reliably
Random Structures & Algorithms
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
The Effect of Different Failure Recovery Procedures on the Distribution of Task Completion Times
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17
Performing tasks on synchronous restartable message-passing processors
Distributed Computing
Performing work with asynchronous processors: message-delay-sensitive bounds
Information and Computation
Efficient gossip and robust distributed computation
Theoretical Computer Science
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
Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
ACM Transactions on Algorithms (TALG)
A robust randomized algorithm to perform independent tasks
Journal of Discrete Algorithms
Performing work with asynchronous processors: Message-delay-sensitive bounds
Information and Computation
Emulating shared-memory Do-All algorithms in asynchronous message-passing systems
Journal of Parallel and Distributed Computing
Asynchronous perfectly secure communication over one-time pads
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Time and communication efficient consensus for crash failures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Robust network supercomputing with malicious processes
DISC'06 Proceedings of the 20th international conference on Distributed Computing
| Hi-index | 0.00 |