Author:
Laber Eduardo,Molinaro Marco
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Carmo, R., Donadelli, J., Kohayakawa, Y., Laber, E.: Searching in random partially ordered sets. Theor. Comput. Sci. 321, 41–57 (2004)
2. Lipman, M., Abrahams, J.: Minimum average cost testing for partially ordered components. IEEE Transactions on Information Theory 41, 287–291 (1995)
3. Ben-Asher, Y., Farchi, E., Newman, I.: Optimal search in trees. SIAM Journal on Computing 28 (1999)
4. Onak, K., Parys, P.: Generalization of binary search: Searching in trees and forest-like partial orders. In: FOCS, pp. 379–388 (2006)
5. Mozes, S., Onak, K., Weimann, O.: Finding an Optimal Tree Searching Strategy in Linear Time. In: SODA (2008)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献