An optimally efficient selection algorithm-Reference-Cited by-同舟云学术

An optimally efficient selection algorithm

Published:1988-01 Issue:6 Volume:26 Page:295-299
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Cole Richard John

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference11 articles.

1. Deterministic selection in O(log log n) parallel time;Ajtai;18th Ann. ACM Symp. on the Theory of Computing,1986

2. The parallel evaluation of general arithmetic expressions;Brent;J. ACM,1974

3. Parallel merge sort;Cole;27th Ann. IEEE Symp. on the Foundations of Computer Science,1986

4. Deterministic coin tossing with application to optimal list ranking;Cole;Inform. and Control,1986

5. Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms;Cole;18th Ann. ACM Symp. on the Theory of Computing,1986

Cited by 53 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithm for K shortest paths in parallel;SEVENTH INTERNATIONAL CONFERENCE ON NEW TRENDS IN THE APPLICATIONS OF DIFFERENTIAL EQUATIONS IN SCIENCES (NTADES 2020);2021

2. Optimal parallel selection;ACM Transactions on Algorithms;2007-11

3. Efficient Parallel Algorithms for Constructing a k-Tree Center and a k-Tree Core of a Tree Network;Algorithms and Computation;2005

4. Finding r-dominating sets and p-centers of trees in parallel;IEEE Transactions on Parallel and Distributed Systems;2004-08

5. Improving the efficiency of parallel minimum spanning tree algorithms;Discrete Applied Mathematics;2003-03