On the communication throughput of buffered multistage interconnection networks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
A collision model for randomized routing in fat-tree networks
Journal of Parallel and Distributed Computing
On Different Models for Packet Flow in Multistage Interconnection Networks
Fundamenta Informaticae
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 ...