Author:
Heeringa Brent,Iordan Marius Cătălin,Theran Louis
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Ben-Asher, Y., Farchi, E., Newman, I.: Optimal search in trees. SIAM J. Comput. 28(6), 2090–2102 (1999)
2. Carmo, R., Donadelli, J., Kohayakawa, Y., Laber, E.S.: Searching in random partially ordered sets. Theor. Comput. Sci. 321(1), 41–57 (2004)
3. Mozes, S., Onak, K., Weimann, O.: Finding an optimal tree searching strategy in linear time. In: SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1096–1105. Society for Industrial and Applied Mathematics, Philadelphia (2008)
4. Onak, K., Parys, P.: Generalization of binary search: Searching in trees and forest-like partial orders. In: FOCS 2006: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 379–388. IEEE Computer Society, Washington, DC, USA (2006)
5. Dereniowski, D.: Edge ranking and searching in partial orders. Discrete Appl. Math. 156(13), 2493–2500 (2008)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Competitive Online Search Trees on Trees;ACM Transactions on Algorithms;2023-06-24
2. Searching in Dynamic Tree-Like Partial Orders;Lecture Notes in Computer Science;2011