A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Probabilistic Pipeline Algorithm for K Selection on the Tree Machine
IEEE Transactions on Computers
Reduction Techniques for Selection in Distributed Files
IEEE Transactions on Computers
Efficient Distributed Selection with Bounded Messages
IEEE Transactions on Parallel and Distributed Systems
Designing Efficient Distributed Algorithms Using Sampling Techniques
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Tight bounds for distributed selection
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Distributed selection: a missing piece of data aggregation
Communications of the ACM - Enterprise information integration: and other tools for merging data
The complexity of data aggregation in directed networks
DISC'11 Proceedings of the 25th international conference on Distributed computing
Proceedings of the Conference on Extreme Science and Engineering Discovery Environment: Gateway to Discovery
| Hi-index | 0.01 |
A methodology for transforming sequential recursive algorithms to distributive ones is suggested. The assumption is that the program segments between recursive calls have a distributive implementation. The methodology is applied to two k-selection algorithms and yields new distributed k-selection algorithms. Some complexity issues of the resulting algorithms are discussed.