An Efficient Implementation for the BROADCAST Instruction of BSR+
IEEE Transactions on Parallel and Distributed Systems
On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR
IEEE Transactions on Parallel and Distributed Systems
O(1) time algorithm on BSR for constructing a binary search tree with best frequencies
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
| Hi-index | 0.89 |