首页 | 本学科首页   官方微博 | 高级检索  
     


A parallel median algorithm
Authors:Richard Cole  Chee K. Yap
Affiliation:Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, NY 10012, U.S.A.
Abstract:
We give a deterministic algorithm for finding the kth smallest item in a set of n items, running in O((log log n)2) parallel time on O(n) processors in Valiant's comparison model.
Keywords:Parallel algorithm  median  selection  comparison model
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号