Gerth Stølting Brodal, Rolf Fagerberg  Home/Search
Context Related
| brics.dk/~gerth/Pa...mfttr0252.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brics.dk/~gerth/pub16 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We adapt the distribution sweeping method to the cache oblivious model. Distribution sweeping is the name used for a general approach for divide-and-conquer algorithms where the combination of solved subproblems can be viewed as a merging process of streams. We demonstrate by a series... (Update)
Cited by: More
Unknown - Brodal Et Al (Correct)
I/O-Efficient Construction of Voronoi Diagrams - Kumar, Ramos (2002) (Correct)
The Cost of Cache-Oblivious Searching - Bender, Brodal, Fagerberg, Ge.. (2003) (Correct)
Similar documents (at the sentence level):
6.7%: Cache Oblivious Distribution Sweeping - Brodal, Fagerberg (2002) (Correct)
5.8%: Cache Oblivious Search Trees via Binary Trees of Small Height - Brodal, Fagerberg, Jacob (2002) (Correct)
Active bibliography (related documents): More All
0.4: Algorithm Engineering - Demetrescu, Finocchi, Italiano (2003) (Correct)
0.3: Ultra-Fast Expected Time Parallel Algorithms - MacKenzie, Stout (1991) (Correct)
0.2: Cache-Oblivious Data Structures for Orthogonal Range.. - Agarwal, Arge.. (Correct)
Similar documents based on text: More All
0.8: Funnel Heap - A Cache Oblivious Priority Queue - Brodal, Fagerberg (2002) (Correct)
0.5: Funnel Heap - A Cache Oblivious Priority Queue Gerth Stlting.. - Fagerberg (Correct)
0.4: The Complexity of Constructing Evolutionary Trees.. - Brodal, Fagerberg.. (2001) (Correct)
Related documents from co-citation: More All
8: The input-output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
8: Cache-oblivious algorithms (context) - Frigo, Leiserson et al. - 1999
7: Cache-oblivious priority-queue and graph algorithms - Arge, Bender et al. - 2002
BibTeX entry: (Update)
G. S. Brodal and R. Fagerberg. Cache oblivious distribution sweeping. In Proc. Annual International Colloquium on Automata, Languages, and Programming, pages 426--438, 2002. http://citeseer.ist.psu.edu/article/brodal02cache.html More
@inproceedings{ brodal02cache,
author = "G. Brodal and R. Fagerberg",
title = "Cache oblivious distribution sweeping",
booktitle = "Proc. Annual International Colloquium on Automata, Languages, and Programming",
pages = "426--438",
year = "2002",
url = "citeseer.ist.psu.edu/article/brodal02cache.html" }
Citations (may not include all citations):1575 Computer Architecture: A Quantitative Approach (context) - Hennessy, Patterson - 1996
1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
229 Computational Geometry: Algorithms and Applications (context) - de Berg, van Kreveld et al. - 1997
198 Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
121 Externalmemory computational geometry - Goodrich, Tsay et al. - 1993
109 inputoutput complexity sorting and related problem (context) - Vitter, output et al. - 1988
64 Cacheoblivious algorithms (context) - Frigo, Leiserson et al. - 1999
59 External memory algorithms and data structures: Dealing with.. - Vitter - 2001
37 Algorithms for Klee's rectangle problems (context) - Bentley - 1977
35 Cache-oblivious Btrees - Bender, Demaine et al. - 2000
28 A locality-preserving cache-oblivious dynamic dictionary - Bender, Duan et al. - 2002
25 Massachusetts Institute of Technology (context) - Prokop, Master's - 1999
25 An optimal worst case algorithm for reporting intersections .. (context) - Bentley, Wood - 1980
20 Cache oblivious search trees via binary trees of small heigh.. - Brodal, Fagerberg et al. - 2002
17 the parallel-decomposability of geometric problems (context) - Atallah, Tsay - 1992
14 cient algorithm for determining the convex hull of a finite .. (context) - Graham - 1972
13 er tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
12 Cache-oblivious priority queue and graph algorithm applicati.. - Arge, Bender et al. - 2002
3 Quasi-valid range querying and its implications for nearest .. (context) - Willard, Wee - 1988
3 cient cache-oblivious algorithms (context) - Bender, Cole et al. - 2002
2 On finding the maxima of a set of vectores (context) - Kung, Luccio et al. - 1975
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.brics.dk/~gerth/pub16.html):
Partially Persistent Data Structures Of Bounded Degree With.. - Brodal (1996) (Correct)
Worst-Case Efficient External-Memory Priority Queues - Brodal, Katajainen (1998) (Correct)
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