Tolerating linear number of faults in networks of bounded degree
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Perfectly secure message transmission
Journal of the ACM (JACM)
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks
IEEE Transactions on Computers - Special issue on fault-tolerant computing
ACM Transactions on Information and System Security (TISSEC)
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
Efficient reliable communication over partially authenticated networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
The effect of faults on network expansion
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Fast consensus in networks of bounded degree
Distributed Computing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient reliable communication over partially authenticated networks
Distributed Computing - Special issue: PODC 02
Lower bound for scalable Byzantine Agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Robust gossiping with an application to consensus
Journal of Computer and System Sciences
Agreement in synchronous networks with ubiquitous faults
Theoretical Computer Science
On private computation in incomplete networks
Distributed Computing
Optimal secure message transmission by public discussion
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Public discussion must be back and forth in secure message transmission
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
On private computation in incomplete networks
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Majority and unanimity in synchronous networks with ubiquitous dynamic faults
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Fast byzantine agreement in dynamic networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Storage and search in dynamic peer-to-peer networks
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |