Sorting and selection with imprecise comparisons

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 37-48

  Ajtai, Miklós ^a   Feldman, Vitaly ^a   Hassidim, Avinatan ^b   Nelson, Jelani ^b  

^a IBM ALMADEN RESEARCH CENTER   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENCE THRESHOLD; HUMAN SUBJECTS; JUST-NOTICEABLE DIFFERENCE; METHOD OF PAIRED COMPARISONS; OPTIMAL SOLUTIONS; OPTIMALITY; SIMPLE MODEL; STANDARD METHOD;

LINGUISTICS;

TRANSLATION (LANGUAGES);

EID: 70449086292     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_5     Document Type: Conference Paper

References (24)

1. Aggarwal, G., Ailon, N., Constantin, F., Even-Dar, E., Feldman, J., Frahling, G., Henzinger, M.R., Muthukrishnan, S., Nisan, N., Pál, M., Sandler, M., Sidiropoulos, A.: Theory research at Google. SIGACT News 39(2), 10-28 (2008)
2. Assaf, S., Upfal, E.: Fault tolerant sorting networks. SIAM J. Discrete Math 4(4), 472-480 (1991)
3. Ben-Or, M., Hassidim, A.: The bayesian learner is optimal for noisy binary search (and pretty good for quantum as well). In: FOCS, pp. 221-230 (2008)
4. Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci. 7(4), 448-461 (1973)
5. Bollobás, B., Thomason, A.: Parallel sorting. Discrete Appl. Math. 6, 1-11 (1983)
6. Borgstrom, R.S., Kosaraju, S.R.: Comparison-based search in the presence of errors. In: STOC, pp. 130-136 (1993)
7. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
8. David, H.A.: The Method of Paired Comparisons, 2nd edn. Charles Griffin & Company Limited (1988)
9. Feige, U., Raghavan, P., Peleg, D., Upfal, E.: Computing with noisy information. SIAM J. Comput. 23(5) (1994)
10. Finocchi, I., Grandoni, F., Italiano, G.F.: Optimal resilient sorting and searching in the presence of memory faults. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 286-298. Springer, Heidelberg (2006)
11. Finocchi, I., Italiano, G.F.: Sorting and searching in the presence of memory faults (without redundancy). In: STOC, pp. 101-110 (2004)
12. Gasarch, W.I., Golub, E., Kruskal, C.P.: Constant time parallel sorting: an empirical view. J. Comput. Syst. Sci. 67(1), 63-91 (2003)
13. Häggkvist, R., Hell, P.: Parallel sorting with constant time for comparisons. SIAM J. Comput. 10(3), 465-472 (1981)
14. Häggkvist, R., Hell, P.: Sorting and merging in rounds. SIAM Journal on Algebraic and Discrete Methods 3(4), 465-473 (1982)
15. Karp, R.M., Kleinberg, R.: Noisy binary search and its applications. In: SODA, pp. 881-890 (2007)
16. Pelc, A.: Searching games with errors - fifty years of coping with liars. Theor. Comput. Sci. 270(1-2), 71-109 (2002)
17. Ravikumar, B., Ganesan, K., Lakshmanan, K.B.: On selecting the largest element in spite of erroneous information. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol. 247, pp. 88-99. Springer, Heidelberg (1987)
18. Rényi, A.: On a problem in information theory. Magyar Tud. Akad. Mat. Kutató Int. Közl 6, 505-516 (1962)
19. Rivest, R.L., Meyer, A.R., Kleitman, D.J., Winklmann, K., Spencer, J.: Coping with errors in binary search procedures. J. Comput. Sys. Sci. 20(3), 396-405 (1980)
20. Smith, S.M., Albaum, G.S.: Fundamentals of Marketing Research, 1st edn. Sage Publications, Thousand Oaks (2005)
21. Thurstone, L.L.: A law of comparative judgment. Psychological Review 34, 273-286 (1927)
22. Ulam, S.M.: Adventures of a Mathematician. Scribner's, New York (1976)
23. Valiant, L.G.: Parallelism in comparison problems. SIAM J. Comput. 4(3), 348-355 (1975)
24. Yao, A.C., Yao, F.F.: On fault-tolerant networks for sorting. SIAM J. Comput. 14(1), 120-128 (1985)