An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Logarithmic time cost optimal parallel sorting is not yet fast in practice!
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
An O(log N) deterministic packet-routing scheme
Journal of the ACM (JACM)
A survey of PRAM simulation techniques
ACM Computing Surveys (CSUR)
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
| Hi-index | 0.01 |