G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in x + y and matrices with sorted columns. Journal of Computer and System Sciences, 24:197--208, 1982. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Algorithms for Geometric Optimization - Agarwal, Sharir (1998) (9 citations) (Correct)
....searching has certain drawbacks, which we discuss next. Consequently, there have been several recent attempts to replace parametric searching by alternative techniques, including randomization [15, 54, 73, 199] expander graphs [30, 176, 179, 178] geometric cuttings [18, 49] and matrix searching [124, 125, 126, 127, 131]. We present these alternative techniques in Section 3. Almost concurrently with the development of the parametric searching technique, Megiddo devised another ingenious technique for solving linear programming and several related optimization problems [211, 213] This technique, now known as ....
G. N. Frederickson and D. B. Johnson, The complexity of selection and ranking in X+Y and matrices with sorted rows and columns, J. Comput. Syst. Sci., 24 (1982), 197--208.
Iterated Nearest Neighbors and Finding Minimal Polytopes - Eppstein, Erickson (1994) (34 citations) (Correct)
....are potential L1 diameters. We will not actually build M , since that would require time Omega ) but we can access anyentry in constant time. We binary search through M for the optimal diameter. Since the rows and columns of M are sorted, we can select any elementin time O(n log n)[22]. Thus, each step of the search is dominated byOvermars and Yap s algorithm, and the entire search requires time O(n n) Theorem 5.6. We can find the minimum L1 diameter k point subset of a set of , in time O(kn log n k k) and space O(kn k ) orin time and space O(n log n kn) ....
G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in X +Y and matrices with sorted rows and columns. J. Comput. Syst. Sci., 24:197--208, 1982.
Monitoring the Dynamic Web - To Respond To (Correct)
No context found.
G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in x + y and matrices with sorted columns. Journal of Computer and System Sciences, 24:197--208, 1982.
Monitoring the Dynamic Web to Respond to Continuous Queries - Pandey, Ramamritham, al. (2003) (Correct)
No context found.
G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in x + y and matrices with sorted columns. Journal of Computer and System Sciences, 24:197--208, 1982.
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