Deterministic and probabilistic binary search in graphs
暂无分享,去创建一个
David Kempe | Ehsan Emamjomeh-Zadeh | Vikrant Singhal | D. Kempe | Vikrant Singhal | E. Emamjomeh-Zadeh
[1] Marco Molinaro,et al. On the complexity of searching in trees and partially ordered structures , 2011, Theor. Comput. Sci..
[2] Joel H. Spencer,et al. Coping with Errors in Binary Search Procedures , 1980, J. Comput. Syst. Sci..
[3] R. H. Farrell. Asymptotic Behavior of Expected Sample Size in Certain One Sided Tests , 1964 .
[4] Salil P. Vadhan,et al. Computational Complexity , 2005, Encyclopedia of Cryptography and Security.
[5] Javed A. Aslam,et al. Noise tolerant algorithms for learning and searching , 1995 .
[6] Tak Wah Lam,et al. Edge Ranking of Graphs Is Hard , 1998, Discret. Appl. Math..
[7] Ruy Luiz Milidiú,et al. On binary searching with non-uniform costs , 2001, SODA '01.
[8] Krzysztof Onak,et al. Finding an optimal tree searching strategy in linear time , 2008, SODA '08.
[9] Tara Javidi,et al. Active learning from noisy and abstention feedback , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[10] Andrzej Pelc,et al. Searching games with errors - fifty years of coping with liars , 2002, Theor. Comput. Sci..
[11] S. Rao Kosaraju,et al. Comparison-based search in the presence of errors , 1993, STOC.
[12] Marvin Künnemann,et al. Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[13] Russell Impagliazzo,et al. The Complexity of Satisfiability of Small Depth Circuits , 2009, IWPEC.
[14] Ferdinando Cicalese,et al. The binary identification problem for weighted trees , 2012, Theor. Comput. Sci..
[15] Michael Horstein,et al. Sequential transmission using noiseless feedback , 1963, IEEE Trans. Inf. Theory.
[16] Tak Wah Lam,et al. Optimal Edge Ranking of Trees in Linear Time , 1998, SODA '98.
[17] Ugo Vaccaro,et al. Least adaptive optimal search with unreliable tests , 2000, Theor. Comput. Sci..
[18] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[19] Andrzej PELC,et al. Searching with Known Error Probability , 1989, Theor. Comput. Sci..
[20] Journal für die reine und angewandte Mathematik , 1893 .
[21] Avinatan Hassidim,et al. The Bayesian Learner is Optimal for Noisy Binary Search (and Pretty Good for Quantum as Well) , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[22] Robert D. Nowak,et al. Noisy Generalized Binary Search , 2009, NIPS.
[23] Peter Winkler,et al. On playing “Twenty Questions” with a liar , 1992, SODA '92.
[24] Mark Braverman,et al. Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis , 2015, Electron. Colloquium Comput. Complex..
[25] H. D. Ratliff,et al. Optimal Node Ranking of Trees , 1988, Inf. Process. Lett..
[26] Krzysztof Onak,et al. Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[27] Joel H. Spencer,et al. Families of k-independent sets , 1973, Discret. Math..
[28] Richard M. Karp,et al. Noisy binary search and its applications , 2007, SODA '07.
[29] Yosi Ben-Asher,et al. Optimal search in trees , 1997, SODA '97.
[30] Dariusz Dereniowski,et al. Edge ranking and searching in partial orders , 2008, Discret. Appl. Math..
[31] Russell Impagliazzo,et al. Complexity of k-SAT , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).
[32] Michael E. Saks,et al. Searching Ordered Structures , 1985, J. Algorithms.
[33] Tara Javidi,et al. Bayesian Active Learning With Non-Persistent Noise , 2015, IEEE Transactions on Information Theory.
[34] Yoshiharu Kohayakawa,et al. Searching in random partially ordered sets , 2004, Theor. Comput. Sci..
[35] Alejandro A. Schäffer,et al. Optimal Node Ranking of Trees in Linear Time , 1989, Inf. Process. Lett..
[36] Peter I. Frazier,et al. Twenty Questions with Noise: Bayes Optimal Policies for Entropy Loss , 2012, Journal of Applied Probability.
[37] Amir Abboud,et al. Tight Hardness Results for LCS and Other Sequence Similarity Measures , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.
[38] Eli Upfal,et al. Computing with Noisy Information , 1994, SIAM J. Comput..
[39] Peter I. Frazier,et al. Bisection Search with Noisy Responses , 2013, SIAM J. Control. Optim..
[40] C. Jordan. Sur les assemblages de lignes. , 1869 .
[41] S. Ulam,et al. Adventures of a Mathematician , 2019, Mathematics: People · Problems · Results.
[42] A. P EDROTTI,et al. Searching with a Constant Rate of Malicious Lies , 2007 .