| E. Koutsoupias and David S. Taylor. Indexing schemes for random points. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 17--19, 1999. |
....two dimensional case. Unfortunately, their published proof is seriously flawed. Hellerstein, Koutsoupias and Papadimitriou [HKP97] introduced the indexability model, and published the first lower bounds, for restricted cases of two dimensional search. Subsequently, Koutsoupias and Taylor [KT98, KT99] provided lower bounds for orthogonal range search, but within a simplified complexity framework, where the e#ect of the block size is not accounted for. Samoladas and Miranker [SM98] introduced a general framework for lower bounds, and proved tight bounds for restricted d dimensional range ....
E. Koutsoupias and David S. Taylor. Indexing schemes for random points. In Proc. ACM-SIAM Symp. on Discrete Algorithms, pages 17--19, 1999.
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