Searching games with errors - fifty years of coping with liars
暂无分享,去创建一个
[1] Joel H. Spencer,et al. Coping with Errors in Binary Search Procedures , 1980, J. Comput. Syst. Sci..
[2] Andrzej Pelc,et al. Searching with a Forbidden Lie Pattern in Responses , 1991, Inf. Process. Lett..
[3] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[4] Martin Aigner,et al. Searching with Lies , 1996, J. Comb. Theory, Ser. A.
[5] D. Du,et al. Combinatorial Group Testing and Its Applications , 1993 .
[6] Andrew Chi-Chih Yao,et al. An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..
[7] Marek Piotrów. Depth optimal sorting networks resistant to k passive faults , 1996, SODA '96.
[8] Bala Ravikumar,et al. Coping with Known Patterns of Lies in a Search Game , 1984, Theor. Comput. Sci..
[9] Claire Mathieu,et al. On Boolean Decision Trees with Faulty Nodes , 1992, Random Struct. Algorithms.
[10] Andrzej Pelc,et al. Searching with Local Constraints on Error Patterns , 1994, Eur. J. Comb..
[11] Matteo Sereno,et al. Binary Search with Errors and Variable Cost Queries , 1998, Inf. Process. Lett..
[12] Andris Ambainis,et al. Playing twenty questions with a procrastinator , 1999, SODA '99.
[13] Eli Upfal,et al. Fault Tolerant Sorting Networks , 1991, SIAM J. Discret. Math..
[14] Matteo Sereno,et al. Solution of Ulam's Problem on Binary Search with Three Lies , 1992, J. Comb. Theory, Ser. A.
[15] Grzegorz Stachowiak. Fibonacci Correction Networks , 2000, SWAT.
[16] Valmir Carneiro Barbosa,et al. An introduction to distributed algorithms , 1996 .
[17] Duncan Innes. Searching with a lie using only comparison questions , 1992, Proceedings ICCI `92: Fourth International Conference on Computing and Information.
[18] Javed A. Aslam,et al. Searching in the presence of linearly bounded errors , 1991, STOC '91.
[19] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .
[20] Peter Winkler,et al. On playing “Twenty Questions” with a liar , 1992, SODA '92.
[21] Andrzej Pelc,et al. Prefix search with a lie , 1988, J. Comb. Theory, Ser. A.
[22] Andrzej Pelc,et al. Lie Patterns in Search Procedures , 1986, Theor. Comput. Sci..
[23] E. Szemerédi,et al. O(n LOG n) SORTING NETWORK. , 1983 .
[24] J. Pierce,et al. Optical Channels: Practical Limits with Photon Counting , 1978, IEEE Trans. Commun..
[25] Daniele Mundici. Ulam Games, Lukasiewicz Logic, and AF C*-Algebras , 1993, Fundam. Informaticae.
[26] Ugo Vaccaro,et al. Least adaptive optimal search with unreliable tests , 2000, Theor. Comput. Sci..
[27] Andrzej Pelc. Fault-tolerant broadcasting and gossiping in communication networks , 1996, Networks.
[28] Maria Luisa Dalla Chiara,et al. Knowledge, Belief, and Strategic Interaction , 1992 .
[29] Andrzej Pelc,et al. Ulam's searching game with lies , 1989, J. Comb. Theory, Ser. A.
[30] Peter Rowlinson. Surveys in combinatorics, 1995 , 1995 .
[31] Kenneth E. Batcher,et al. Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.
[32] A. Negro,et al. Ulam's searching game with three lies , 1992 .
[33] S. Muthukrishnan,et al. On optimal strategies for searching in presence of errors , 1994, SODA '94.
[34] S. Ulam,et al. Adventures of a Mathematician , 2019, Mathematics: People · Problems · Results.
[35] Philip M. Long. SORTING AND SEARCHING WITH A FAULTY COMPARISON ORACLE , 1992 .
[36] Ferdinando Cicalese,et al. Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound , 2000, COCOON.
[37] Andrzej Pelc,et al. Weakly Adaptive Comparison Searching , 1989, Theor. Comput. Sci..
[38] Krzysztof Diks,et al. Reliable Minimum Finding Comparator Networks , 1994, MFCS.
[39] J. von Neumann,et al. Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components , 1956 .
[40] G. Katona. Search With Small Sets in Presence of a Liar , 2002 .
[41] Daniele Mundici,et al. Fault-Tolerance and Rota-Metropolis Cubic Logic , 2002 .
[42] Daniele Mundici. Lukasiewicz normal forms and toric desingularizations , 1996 .
[43] R. Ahlswede,et al. Search Problems , 1987 .
[44] Evangelos Kranakis,et al. Searching with Uncertainty , 1999, SIROCCO.
[45] Anthony J. Macula. A nonadaptive version of Ulam's problem with one lie , 1997 .
[46] Rüdiger Reischuk,et al. Reliable computation with noisy circuits and decision trees-a general n log n lower bound , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[47] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.
[48] GERNOT METZE,et al. On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..
[49] Annalisa De Bonis,et al. Group Testing with Unreliable Tests , 1997, Inf. Sci..
[50] Christian Deppe,et al. Solution of Ulam's searching game with three lies or an optimal adaptive strategy for binary three-error-correcting codes , 2000, Discret. Math..
[51] J. Spencer. Guess a number - with lying , 1984 .
[52] Martin Aigner. Finding the Maximum and Minimum , 1997, Discret. Appl. Math..
[53] Ugo Vaccaro,et al. An improved heuristic for "Ulam-Rényi game" , 2000, Inf. Process. Lett..
[54] Alberto Negro,et al. Solution of Ulam s Problem on Binary Search with Four Lies , 1993 .
[55] Eyal Kushilevitz,et al. Computation in noisy radio networks , 2005, SODA '98.
[56] Wojciech Guzicki,et al. Ulam's searching game with two lies , 1990, J. Comb. Theory, Ser. A.
[57] R. L. Dobrushin,et al. Information Transmission in a Channel with Feedback , 1958 .
[58] Bala Ravikumar,et al. Coping with Erroneous Information while Sorting , 1991, IEEE Trans. Computers.
[59] C. G. Plaxton,et al. Breaking the (n Log 2 N) Barrier for Sorting with Faults , 1997 .
[60] Thomas M. Cover,et al. Probability and Information. , 1986 .
[61] Eli Upfal,et al. Fault tolerant sorting network , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[62] D. Mundici,et al. Rota-Metropolis cubic logic and Ulam-Rényi games , 2001 .
[63] Eli Upfal,et al. Computing with Noisy Information , 1994, SIAM J. Comput..
[64] Andrzej Pelc,et al. Detecting errors in searching games , 1989, J. Comb. Theory, Ser. A.
[65] Edward M. Reingold,et al. Generalized Kraft's Inequality and Discrete k-Modal Search , 1996, SIAM J. Comput..
[66] Daniele Mundici,et al. Ulam Game, the Logic of Maxsat, and Many-Valued Partitions , 1999 .
[67] Brunella Gerla. Conditioning a State by a Lukasiewicz Event: A Probabilistic Approach to Ulam Games , 2000, Theor. Comput. Sci..
[68] Daniele Mundici. The Complexity of Adaptive Error-Correcting Codes , 1990, CSL.
[69] Claire Mathieu,et al. On Evaluating Boolean Functions with Unreliable Tests , 1990, Int. J. Found. Comput. Sci..
[70] Alberto Trombetta,et al. Optimal Comparison Strategies in Ulam's Searching Game with Two Errors , 1997, Theor. Comput. Sci..
[71] Dhiraj K. Pradhan,et al. Fault-tolerant computer system design , 1996 .
[72] Joel H. Spencer,et al. Ulam's Searching Game with a Fixed Number of Lies , 1992, Theor. Comput. Sci..
[73] C. R. Kime,et al. System diagnosis , 1986 .
[74] J. Pieter M. Schalkwijk. A class of simple and optimal strategies for block coding on the binary symmetric channel with noiseless feedback , 1971, IEEE Trans. Inf. Theory.
[75] Claire Mathieu,et al. Selection in the presence of noise: the design of playoff systems , 1994, SODA '94.
[76] E. Szemerédi,et al. Sorting inc logn parallel steps , 1983 .
[77] Martin Aigner. Ulams Millionenspiel , 1995 .
[78] Yannis C. Stamatiou,et al. Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval , 2001, Comput. J..
[79] Didier Dubois,et al. Fuzzy Sets, Logics, and Reasoning About Knowledge , 1999 .
[80] Andrzej Pelc,et al. Solution of Ulam's problem on binary search with two lies , 1988, J. Comb. Theory, Ser. A.
[81] Yannis C. Stamatiou,et al. Locating Information with Uncertainty in Fully Interconnected Networks , 2000, DISC.
[82] Ugo Vaccaro,et al. coping with Delays and Time-Outs in Binary Search Procedures , 2000, ISAAC.
[83] Abraham Mehrez,et al. Information availability vs. solution space size in a knowledge acquisition problem , 1999, Comput. Oper. Res..
[84] Seif Haridi,et al. Distributed Algorithms , 1992, Lecture Notes in Computer Science.
[85] Eugene L. Lawler,et al. An Algorithm for "Ulam's Game" and its Application to Error Correcting Codes , 1995, Inf. Process. Lett..
[86] Richard W. Hamming,et al. Error detecting and error correcting codes , 1950 .
[87] Jehangir P. Karim,et al. The solution of a problem of Ulam on searching with lies , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[88] Daniele Mundici,et al. Logic of infinite quantum systems , 1993 .
[89] Peter Winkler,et al. Three Thresholds for a Liar , 1992, Combinatorics, Probability and Computing.
[90] Ferdinando Cicalese,et al. Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness , 1999, ESA.
[91] I. Niven. Coding Theory Applied to a Problem of Ulam , 1988 .
[92] S. Rao Kosaraju,et al. Comparison-based search in the presence of errors , 1993, STOC.
[93] Andrew Chi-Chih Yao,et al. On Fault-Tolerant Networks for Sorting , 1985, SIAM J. Comput..
[94] Ferdinando Cicalese,et al. Perfect Two-Fault Tolerant Search with Minimum Adaptiveness , 2000, Adv. Appl. Math..
[95] A. Bagchi. On Sorting in the Presence of Erroneous Information , 1992, Inf. Process. Lett..
[96] Evangelos Kranakis,et al. Searching with Mobile Agents in Networks with Liars , 2000, Euro-Par.
[97] Ray Hill,et al. Searching with lies: the Ulam problem , 1992, Discret. Math..
[98] Andrzej Pelc,et al. Solution of Ulam's problem on searching with a lie , 1987, J. Comb. Theory, Ser. A.
[99] G. Parlati,et al. Some results on searching with liesV , 1992 .
[100] Andrzej PELC,et al. Searching with Known Error Probability , 1989, Theor. Comput. Sci..
[101] Ewaryst Rafajłowicz. Minimum Cost Experimental Design with a Prescribed Information Matrix , 1989 .
[102] Claude E. Shannon,et al. The zero error capacity of a noisy channel , 1956, IRE Trans. Inf. Theory.
[103] Kang G. Shin,et al. Probabilistic diagnosis of multiprocessor systems , 1994, CSUR.
[104] Bala Ravikumar,et al. On Selecting the Largest Element in Spite of Erroneous Information , 1987, STACS.
[105] H. Crapo,et al. Algebraic Combinatorics and Computer Science: A Tribute to Gian-Carlo Rota , 2001 .
[106] Frank Stephan,et al. Effective Search Problems , 1994, Math. Log. Q..
[107] Ugo Vaccaro,et al. Optimal Strategies Against a Liar , 1999, Theor. Comput. Sci..