Author:
Deligkas Argyrios,Mertzios George B.,Spirakis Paul G.
Funder
Engineering and Physical Sciences Research Council
Israel Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference30 articles.
1. Ben-Asher, Y., Farchi, E., Newman, I.: Optimal search in trees. SIAM J. Comput. 28(6), 2090–2102 (1999)
2. Ben-Or, M., Hassidim, A.: The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well). In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, 25–28 Oct 2008, Philadelphia, PA, USA, pp. 221–230 (2008)
3. Boczkowski, L., Korman, A., Rodeh, Y.: Searching a tree with permanently noisy advice (2016). arXiv preprint
arXiv:1611.01403
4. Boczkowski, L., Korman, A., Rodeh, Y.: Searching on trees with noisy memory (2016). CoRR,
arXiv:1611.01403
5. Carmo, R., Donadelli, J., Kohayakawa, Y., Laber, E.S.: Searching in random partially ordered sets. Theor. Comput. Sci. 321(1), 41–57 (2004)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Noisy Tree Data Structures and Quantum Applications;Mathematics;2023-11-20
2. An Interactive Search Game with Two Agents;2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton);2022-09-27
3. Navigating in Trees with Permanently Noisy Advice;ACM Transactions on Algorithms;2021-06
4. An Efficient Noisy Binary Search in Graphs via Median Approximation;Lecture Notes in Computer Science;2021