G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of LNCS, pages 426--438. Springer Verlag, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Cache-Oblivious Data Structures for Orthogonal Range.. - Agarwal, Arge.. (Correct)
....to recent surveys for further I O model and hierarchical memory model results [6, 26] Frigo et al. 22] developed cache oblivious algorithms for sorting, Fast Fourier Transform, and matrix multiplication. Subsequently, a number of other results have been obtained in the cache oblivious model [7, 10, 11, 12, 13, 16, 17, 24], among them several cache oblivious B tree structure with O(log B N) search and update bounds [11, 12, 13, 17, 24] Several of these structures can also support one dimensional range queries in O(log B N T B) memory transfers [12, 13, 17] but at an increased amortized update cost of O(log B N ....
G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. Annual International Colloquium on Automata, Languages, and Programming, pages 426--438, 2002.
Unknown - Brodal Et Al Self-citation (Brodal Fagerberg) (Correct)
No context found.
G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming, volume 2380 of LNCS, pages 426--438. Springer Verlag, 2002.
The Cost of Cache-Oblivious Searching - Bender, Brodal, Fagerberg, Ge.. (2003) Self-citation (Brodal Fagerberg) (Correct)
No context found.
G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), volume 2380 of LNCS, pages 426-438, 2002. 11
Cache Oblivious Distribution Sweeping - Brodal, Fagerberg (2002) (2 citations) Self-citation (Brodal Fagerberg) (Correct)
No context found.
G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. Technical Report RS-02-18, BRICS, Dept. of Computer Science, University of Aarhus, 2002.
Funnel Heap - A Cache Oblivious Priority Queue - Brodal, Fagerberg (2002) Self-citation (Brodal Fagerberg) (Correct)
No context found.
G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), 2002. To appear.
On the Limits of Cache-Obliviousness - Brodal, Fagerberg (2003) Self-citation (Brodal Fagerberg) (Correct)
No context found.
G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), volume 2380 of LNCS, pages 426--438. Springer, 2002.
Funnel Heap - A Cache Oblivious Priority Queue Gerth Stlting.. - Fagerberg Self-citation (Brodal Fagerberg) (Correct)
....optimal cache oblivious algorithms for matrix transposition, FFT, and sorting. Cache oblivious search trees which match the search cost of the standard (cache aware) B trees [4] were presented in [6,8,9,11] Cache oblivious algorithms have also been given for problems in computational geometry [6,10], for scanning dynamic sets [5] and for layout of static trees [7] Recently, the first Partially supported by the Future and Emerging Technologies programme of the EU under contract number IST 1999 14186 (ALCOM FT) Supported by the Carlsberg Foundation (contract number ANS 0257 20) ....
....cache oblivious priority queue, Funnel Heap, based only on binary merging. Essentially, our structure is a single heap ordered tree with binary mergers in the nodes and bu#ers on the edges. It was inspired by the cache oblivious merge sort algorithm Funnelsort presented in [13] and simplified in [10]. Like the priority queue of Arge et al. our data structure supports the operations Insert and DeleteMin using amortized N ) I Os per operation, under the so called tall cache assumption M . Here, N is the total number of elements inserted. For a slightly di#erent algorithm we give a ....
[Article contains additional citation context not shown here]
G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. 29th International Colloquium on Automata, Languages, and Programming (ICALP), volume 2380 of LNCS, pages 426--438. Springer, 2002.
I/O-Efficient Construction of Voronoi Diagrams - Kumar, Ramos (2002) (Correct)
No context found.
G. S. Brodal and R. Fagerberg. Cache-Oblivious Distribution Sweeping. To appear in ICALP 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