Funder
OTKA
Hungarian Academy of Sciences
NSF
Centre of Excellence – Inst. for Theor. Comp. Sci.
Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Search Problems;Ahlswede,1987
2. Combinatorial Search;Aigner,1988
3. Optimal search in trees;Ben-Asher;SIAM J. Comput.,1999
4. The binary identification problem for weighted trees;Cicalese;Theoret. Comput. Sci.,2012
5. Optimal edge ranking of trees in polynomial time;de la Torre;Algorithmica,1995
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Partial Order Multiway Search;ACM Transactions on Database Systems;2023-11-13
2. Competitive Online Search Trees on Trees;ACM Transactions on Algorithms;2023-06-24
3. Edge and Pair Queries-Random Graphs and Complexity;The Electronic Journal of Combinatorics;2023-06-02
4. The complexity of bicriteria tree-depth;Theoretical Computer Science;2023-02
5. Optimal Algorithms for Multiway Search on Partial Orders;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12