Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. Sorting, approximate sorting and searching in rounds;Alon;SIAM J. Discrete Math.,1988
2. The average complexity of deterministic and randomized parallel comparison sorting algorithms;Alon;SIAM J. Comput.,1988
3. Parallel comparison algorithms for approximation problems;Alon;Proc. 29th Ann. IEEE Symp. on Foundations of Computer Science,1988
4. Finding an approximate maximum;Alon;SIAM J. Comput.,1989
5. Tight complexity bounds for parallel comparison sorting;Alon;Proc. 27th Ann. IEEE Symp. on Foundations of Computer Science,1986
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献