Bounded branching process and AND/OR tree evaluation

Authors:
Richard M. Karp;Yanjun Zhang
Affiliations:
Univ. of California, Berkeley/ and International Computer Science Institute, Berkeley, CA;Southern Methodist Univ., Dallas, TX
Venue:
Random Structures & Algorithms
Year:
1995

Citing 0
Cited 3

The variance of two game tree algorithms

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Meet and merge: approximation algorithms for confluent flows

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
The Complexity of Algorithms Computing Game Trees on Random Assignments

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract