Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference8 articles.
1. W. Aiello and T. Leighton. Optimal speedup for bracktrack search on a butterfly network.Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pages 125?136, July 1991.
2. G. Bennett. Probability inequalities for the sum of independent random variables.Journal of the American Statistical Association, 57:33?45, 1962.
3. S. Bhatt, D. Greenberg, T. Leighton, and P. Liu. Tight bounds for on-line tree embeddings. Manuscript, 1991.
4. W. Hoeffding. Probability inequalities for sums of bounded random variables.Journal of the American Statistical Association, 58:13?30, 1963.
5. R. Karp and Y. Zhang. A randomized parallel branch-and-bound procedure.Proceedings of the ACM Annual Symposium on Theory of Computing, pages 290?300, 1988.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献