Y. Perl, A. Itai, and H. Avni. Interpolation search -- a log log n search. Comm. ACM, 21(7):550--553, July 1978. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Median Bounds and their Application - Siegel (1999) (1 citation) (Correct)
....of the difference as n ## with np fixed [6] Before presenting some additional probability applications, we give an easy algorithmic application. 2.1.2. Interpolation Search. Interpolation Search was introduced by Peterson [13] and its performance has been analyzed extensively [19] 3] [11]. Moreover, the underlying scheme has been extended to support search for data generated from unknown probability distributions [18] and more general data access systems [9] The basic probing strategy, however, has yet to be analyzed by elementary means. Indeed, it has been open whether a simple ....
....Trials needed to get r successes is just r p , where p is the probability of success. Analysis 2. More interesting is a log 2 log 2 n O(1) bound for the probe count. The proof has two parts. The first half originates in an elegant, short (but sophisticated) analysis by Perl, Itai, and Avni [11]. These authors presented a three part analysis of Interpolation Search that was technically incomplete. The first part uses notions no more advanced than Jensen s Inequality in the restricted form E[X ] 2 # E[X 2 ] conditional expectations for discrete random processes, plus a few standard ....
[Article contains additional citation context not shown here]
Perl, Y., A. Itai and H. Avni, Interpolation search--A log log N search, CACM, 21, 7 (1978), pp. 550--554.
Exponentially Small Bounds on the Expected Optimum of the.. - Lueker (1998) (2 citations) (Correct)
....on the distribution of the X i , we show that the expected value of the solution to these problems is also exponentially small, i.e. of the form O(e Gammacn ) though we make no claim that we have the best value for the constant c. The proof method is in some ways similar to the argument in [PIA78]: we model the problem by a sequence of random variables and then apply a nonlinear transformation to make the sequence amenable to analysis by martingale theory. We note that while the bounds developed in [KKLO86, Luek82] on the median are much more precise than those we show here on the ....
Yehoshua Perl, Alon Itai, and Haim Avni. Interpolation search---a log log n search. Communications of the ACM, 21(7):550--553, July 1978.
Storing And Retrieving Keys In A Table By Cross-Indexing - Teahan, Witten (Correct)
....n 1 and n 2 elements require at most n 1 n 2 comparisons. 3.4. RUN LENGTH CODING If the set often contains many runs of consecutive 1 bits, another promising method is to store a list of the lengths of each run. If a fixed number of bits is used to store these lengths then an interpolation search (Perl et al. 1978) can be employed providing a more rapid means for testing, union and intersection operations than the other list encoding methods described above. 3.5. PARTITIONS OF BIT VECTORS Another method of storing the sets is to partition each one into blocks of approximately equal length (Bookstein ....
Perl, Y., Itai, A. and Avni, H. (1978) Interpolation search---a log log N search. Comm. Association for Computing Machinery 21(7): 550--553; July.
Volumes from Overlaying 3-D Triangulations in Parallel - Franklin, Kankanhalli (1992) (Correct)
....this data structure, locating a point, v, goes as follows. 1. Project v onto the XY plane, and determine which cell, c, contains it. 2. If c contains blocking faces, then locate v between an adjacent pair of them. Recommended procedures for this include a binary search or an interpolation search[PIA78] The latter uses an expected (log log N ) queries if the statistical distribution of the elements is known. log log N ) is effectively a small constant. Only the faces in the cell between these two blocking faces, and the upper blocking face, are relevant to what follows. See Figure 3. 3. Run a ....
Y. Perl, A. Itai, and H. Avni. Interpolation search -- a log log n search. Comm. ACM, 21(7):550--553, July 1978.
Volumes from Overlaying 3-D Triangulations in Parallel - Franklin, Kankanhalli (Correct)
No context found.
Y. Perl, A. Itai, and H. Avni. Interpolation search -- a log log n search. Comm. ACM, 21(7):550--553, July 1978.
Improved Bounds for Finger Search on a RAM - Kaporis, Makris, Sioutas.. (2003) (Correct)
No context found.
Y. Pearl, A. Itai, and H. Avni. Interpolation Search -- A log log N Search. Communications of the ACM 21(7):550-554, 1978.
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