Author:
Breslauer Dany,Czumaj Artur,Dubhashi Devdatt P.,der Heide Friedhelm Meyer auf
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference26 articles.
1. Optimal parallel selection has complexity O(log log n);Ajtai;J. Comput. System Sci.,1989
2. Finding an approximate maximum;Alon;SIAM J. Comput.,1989
3. Parallel comparison algorithms for approximation problems;Alon;Combinatorica,1991
4. A. Apostolico and D. Breslauer, An optimal O(log log n) time parallel algorithm for detecting all squares in a string, SIAM J. Comput., to appear.
5. Parallel selection;Azar;Discrete Appl. Math.,1990
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献