Sorting and Selection with Imprecise Comparisons
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature
- No. 2,p. 37-48
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Theory research at GoogleACM SIGACT News, 2008
- On selecting the largest element in spite of erroneous information2006
- Searching games with errors—fifty years of coping with liarsTheoretical Computer Science, 2002
- Fault Tolerant Sorting NetworksSIAM Journal on Discrete Mathematics, 1991
- On Fault-Tolerant Networks for SortingSIAM Journal on Computing, 1985
- Parallel sortingDiscrete Applied Mathematics, 1983
- Parallel Sorting with Constant Time for ComparisonsSIAM Journal on Computing, 1981
- Coping with errors in binary search proceduresJournal of Computer and System Sciences, 1980
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- A law of comparative judgment.Psychological Review, 1927