G.J.E. Rawlins, Compared to What? An Introduction to the Analysis of Algorithms , W.H. Freeman, New York, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....time after the arrival of the corresponding input (or set of inputs) Thus, for example, it may be crucial for an application that each input be operated on as soon as it is received. Similarly, each partial solution (as well as the final one) may need to be returned as soon as it is available [32, 40, 56]. It is helpful to note here that, when no deadlines are imposed, computations for which inputs arrive while the algorithm is in progress are referred to as on line [27, 33, 35, 36] incremental [21, 22, 49, 59] dynamic [11, 12, 67] and updating [20, 23, 28, 38, 53, 54, 62, 66] It is also ....

G.J.E. Rawlins, Compared to What? An Introduction to the Analysis of Algorithms , W.H. Freeman, New York, 1992.

....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 wish to sort a bag of n nuts and n bolts by size in the dark. We can compare the sizes of a nut and a bolt by attempting to screw one into the other. This operation tells us that either the nut is bigger than the bolt; the bolt is ....

G.J.E. Rawlins. Compared to what ? An introduction to the analysis of algorithms. Computer Science Press, 1992.

....time after the arrival of the corresponding input (or set of inputs) Thus, for example, it may be crucial for an application that each input be operated on as soon as it is received. Similarly, each partial solution (as well as the final one) may need to be returned as soon as it is available [31, 39, 55]. It is helpful to note here that, when no deadlines are imposed, computations for which inputs arrive while the algorithm is in progress are referred to as on line [26, 32, 34, 35] incremental [20, 21, 48, 58] dynamic [10, 11, 66] and updating [19, 22, 27, 37, 52, 53, 61, 65] It is also ....

G.J.E. Rawlins, Compared to What? An Introduction to the Analysis of Algorithms, W.H. Freeman, New York, 1992.

....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 of the form compare b i and s j . The answer to each such query is either b i s j or b i = s j or b i s j . The nuts and bolts matching problem is first mentioned as an exercise in [14], page 293. There is a simple randomized algorithm along the lines of Quicksort for this problem and this solution is described later in this section. Since there are n possibilities for oe, the obvious information theoretic lower bound shows 2 Alon, Blum, Fiat, Kannan, Naor and Ostrovsky that ....

G. J. E. Rawlins, Compared to what? an introduction to the analysis of algorithms, Computer Science Press, 1991.

....of outputs) must be returned within a certain time after its computation. Thus, for example, it may be crucial for an application that each input be operated on as soon as it is received. Similarly, each partial solution (as well as the final one) may need to be returned as soon as it is available [21, 28, 37]. It is helpful to note here that, when no deadlines are imposed, computations for which inputs arrive while the algorithm is in progress are referred to as on line [18, 22, 23, 24] incremental [14, 15, 32, 39] dynamic [7, 8, 44] and updating [13, 16, 19, 26, 34, 35, 41, 43] 2.2 Real time ....

G.J.E. Rawlins, Compared to What? An Introduction to the Analysis of Algorithms , W.H. Freeman, New York, 1992.

....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 of the form compare b i and s j . The answer to each such query is either b i s j or b i = s j or b i s j . The nuts and bolts matching problem is first mentioned as an exercise in [14], page 293. There is a simple randomized algorithm along the lines of Quicksort for this problem and this solution is described later in this section. Since there are n possibilities for oe, the obvious information theoretic lower bound shows that any bounded degree decision tree that solves the ....

G. J. E. Rawlins, Compared to what? an introduction to the analysis of algorithms, Computer Science Press, 1991.

....of computing a solution. The newly arrived data must be incorporated in the solution at hand. The final solution is to be returned by a certain deadline. Real time computations form a subclass of a larger class of problems known variably as on line, incremental , dynamic, and updating computations [7, 12, 13, 14, 17, 18, 19, 20, 21, 22, 24, 25, 30, 31, 32, 36, 38, 40, 41]. What distinguishes a real time problem from problems in the larger class is the presence of deadlines by which the input is to be processed, by which the output is to be produced, and so on. 3 Modern Cryptography The purpose of contemporary cryptography is the protection of digital ....

G.J.E. Rawlins, Compared to What? An Introduction to the Analysis of Algorithms , W.H. Freeman, New York, 1992.

....is computed. Subsequently, more data arrive at regular intervals. Each new datum received must be incorporated into the solution. Real time computation is sometimes known as on line computation, by contrast with off line computation in which all the required data are available at the outset [14, 16, 17, 21, 28]. The adjectives updating , incremental , and dynamic are also often used to refer to algorithms that receive and process new data [4, 9, 10, 11] Examples of real time computations include sorting a sequence of numbers, computing the convex hull of a set of points in the plane, and finding the ....

G.J.E. Rawlins, Compared to What? An Introduction to the Analysis of Algorithms , W.H. Freeman, New York, 1992.

....is solved on line, not all of its input data are available initially. Data arrive one at a time or in bundles, according to a given data arrival law, while the solution to the problem is being computed. Whenever a new datum is received, it must be taken into account in updating the solution [15, 16, 18, 24]. The on line computational paradigm has been used to exhibit superlinear speedup in a variety of contexts [7, 8, 9, 20, 21] Recently, it was used to demonstrate that parallelism can do more than just speed up computation. It is shown in [3] that for real time optimization problems, a solution ....

G.J.E. Rawlins, Compared to What? An Introduction to the Analysis of Algorithms , W.H. Freeman, New York, 1992.

No context found.

G.J.E. Rawlins, Compared to What? An Introduction to the Analysis of Algorithms , W.H. Freeman, New York, 1992.

No context found.

compared to what? an introduction to the analysis of algorithms, gregory j.e. rawlins, Computer Science Press, W.H. Freeman and Company.

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