Subject
Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference20 articles.
1. Fast probabilistic algorithms for Hamiltonian paths and matchings;Angluin;J. Comput. Syst. Sci.,1979
2. S. Chaudhari, T. Hagerup, and, R. Raman, Approximate and exact deterministic parallel selection, in, Proc. 18th Annual Symposium on Mathematical Foundations of Computer Science, 1993.
3. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations;Chernoff;Ann. Math. Statist.,1952
4. A. Aggarwal and C. G. Plaxton, Optimal parallel sorting in multi-level storage, in Proc. Fifth Annual ACM Symposium on Discrete Algorithms, 1994, pp. 659–668.
5. The input/output complexity of sorting and related problems;Aggarwal;Commun. ACM,1988
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献