N. Alon, M. Blum, A. Fiat, S. Kannan, M. Naor, and R. Ostrovsky. Matching nuts and bolts. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 690--696, 1994. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Randomized Algorithms - A short course on and the probabilistic.. - Merkle (2001) (Correct)
....that solves the sorting nuts and bolts problem uses at least c(n log n) comparisons in worst case for some constant c 0. Bradford and Fleischer [7] give an deterministic algorithm that uses O(n log 2 n) comparisons in worst case, thus improving on a previous algorithm due to Alon et. al [2] that uses O(n log 4 n) comparisons. K oml os, Ma, and Szemer edi [21] describe an algorithm that uses just O(n log n) comparisons, however, they remark that their algorithm relies on the construction of certain graphs that are known to exist but cannot be constructed eciently by current ....
Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, and Rafail Ostrovsky. Matching nuts and bolts. In SODA 1994, pages 690-696, 1994.
Matching Nuts and Bolts Faster - Bradford, Fleischer (1995) (2 citations) (Correct)
....each nut its corresponding bolt. We can only compare nuts to bolts. That is we can neither compare nuts to nuts, nor bolts to bolts. This humble restriction on the comparisons appears to make this problem very hard to solve. In fact, the best deterministic solution to date is due to Alon et al. . [1] and takes Theta(n log 4 n) time. Their solution uses (efficient) graph expanders. In this paper, we give a simpler O(n log 2 n) time algorithm which uses only a simple (and not so efficient) expander. 1 Introduction In [7] page 293, Rawlins posed the following interesting problem : We ....
....(and so fit together) Because it is dark we are not allowed to compare nuts directly or bolts directly. How many fitting operations do we need to sort the nuts and bolts in the worst case As a mathematician (instead of a carpenter) you would probably prefer to see the problem stated as follows ([1]) Given two sets B = fb 1 ; b n g and S = fs 1 ; s n g, where B is a set of n distinct real numbers (representing the sizes of the bolts) and S is a permutation of B, we wish to find efficiently the unique permutation oe 2 S n so that b i = s oe(i) for all i, based on queries ....
[Article contains additional citation context not shown here]
N. Alon, M. Blum, A. Fiat, S. Kannan, M. Naor and R. Ostrovsky. Matching nuts and bolts. Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'94), 1994, pp. 690--696.
Selection with Monotone Comparison Costs - Kannan, Khanna Self-citation (Kannan) (Correct)
....with competitive algorithms that work for arbitrary, monotone comparison costs is therefore an interesting problem. We note here that an example of non monotone comparison costs is the nuts and bolts model where the comparison cost is 1 for a comparison between a nut and a bolt, and is 1 otherwise [1, 2, 6]. To our knowledge, this is the only example in the literature of comparison costs that can not be modeled by a monotone cost function. Selection is a challenging problem even in the monotone cost model. One reason is that the certificate cost is highly sensitive to the rank of the element being ....
N. ALON, M. BLUM, A. FIAT, S. KANNAN, M. NAOR, AND R. OSTROVSKY. Matching nuts and bolts. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, page 690--696, 1994.
Sorting and Selection with Structured Costs - Gupta, Kumar (2001) (1 citation) (Correct)
No context found.
N. Alon, M. Blum, A. Fiat, S. Kannan, M. Naor, and R. Ostrovsky. Matching nuts and bolts. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 690--696, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC