A leader-free Byzantine consensus algorithm
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
A simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function ...