Author:
Berkman Omer,Matias Yossi,Vishkin Uzi
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference33 articles.
1. N. Alon andY. Azar, The average complexity of deterministic and randomized parallel comparison-sorting algorithms,SIAM Journal on Computing,17 (1988), 1178?1192.
2. Tech. Rep. 71/87;N. Alon,1987
3. A. Amir, G. M. Landau, and U. Vishkin, Efficient pattern matching with scaling, inProc. of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, 344?357.
4. D. Angluin andL. G. Valiant, Fast probabilistic algorithms for hamiltonian paths and matchings,Journal of Computer and System Sciences,18 (1979), 155?193.
5. Y. Azar andU. Vishkin, Tight comparison bounds on the complexity of parallel sorting,SIAM Journal on Computing,16 (1987), 458?464.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献