P. Kumar and E. Ramos. I/O ecient construction of Voronoi diagrams. Unpublished manuscript, July 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Cache-Oblivious B-Trees - Bender, Demaine, Farach-Colton (2000) (25 citations) (Correct)
.... Static search trees Basic layout [Pro99] Experiments [LFN02] Optimal constant factor [BBF 03] Linked lists supporting scans [BCDFC02] Priority queues [ABD 02b, BF02b] Trie layout [ABD 02a, BDFC02] Computational geometry Distribution sweeping [BF02a] Voronoi diagrams [KR03] Orthogonal range searching [AADHM03] Lower bounds [BF03] Table 1: Related work in cache oblivious data structures. These results, except the static search tree of [Pro99] appeared after the conference version of this paper. 1.4 Notation We introduce a notational convention of possible ....
Piyush Kumar and Edgar Ramos. I/O-ecient construction of Voronoi diagrams. Manuscript, 2003.
The Cost of Cache-Oblivious Searching - Bender, Brodal, Fagerberg, Ge.. (2003) (Correct)
No context found.
P. Kumar and E. Ramos. I/O ecient construction of Voronoi diagrams. Unpublished manuscript, July 2002.
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