Gerth Stølting Brodal, Rolf Fagerberg  Home/Search
Context Related
| brics.dk/~gerth/Papers/stoc03.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/pub3 (more) Homepages: G.Brodal |
Rate this article:      (best)Comment on this article |
Abstract: In this paper, we present lower bounds for permuting and sorting in the cache-oblivious model. We prove that (1) I/O optimal cache-oblivious comparison based sorting is not possible without a tall cache assumption, and (2) there does not exist an I/O optimal cache-oblivious algorithm for permuting, not even in the presence of a tall cache assumption. Our results for sorting show... (Update)
Cited by: More
Unknown - Brodal Et Al (Correct)
Active bibliography (related documents): More All
1.7: The Cost of Cache-Oblivious Searching - Bender, Brodal, Fagerberg, Ge.. (2003) (Correct)
1.2: Funnel Heap - A Cache Oblivious Priority Queue Gerth Stlting.. - Fagerberg (Correct)
0.7: Cache-Oblivious Data Structures for Orthogonal Range.. - Agarwal, Arge.. (Correct)
Similar documents based on text: More All
0.6: Funnel Heap - A Cache Oblivious Priority Queue - Brodal, Fagerberg (2002) (Correct)
0.4: Improved Bounds for Dictionary Look-up with One Error - Brodal, Venkatesh (1999) (Correct)
0.4: Optimal Static Range Reporting in One Dimension - Alstrup, Brodal, Rauhe (2000) (Correct)
BibTeX entry: (Update)
G. S. Brodal and R. Fagerberg. On the limits of cache-obliviousness. In Proc. 35th Annual ACM Symposium on Theory of Computing, pages 307--315. ACM Press, 2003. http://citeseer.ist.psu.edu/brodal03limits.html More
@inproceedings{ brodal03limits,
author = "Gerth St\olting Brodal and Rolf Fagerberg",
title = "On the Limits of Cache-Obliviousness",
booktitle = "STOC'03",
year = "2003",
url = "citeseer.ist.psu.edu/brodal03limits.html" }
Citations (may not include all citations):198 Organization and maintenance of large ordered indexes (context) - Bayer, McCreight - 1972
109 inputoutput complexity sorting and related problem (context) - Vitter, output et al. - 1988
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982
65 ciency of List Update and Paging Rules (context) - Sleator, Tarjan - 1985
64 Cache-oblivious algorithms (context) - Frigo, Leiserson et al. - 1999
59 External memory algorithms and data structures: Dealing with.. - Vitter - 2001
35 Cache-oblivious B-trees - Bender, Demaine et al. - 2000
33 External memory data structures - Arge - 2001
28 A locality-preserving cache-oblivious dynamic dictionary - Bender, Duan et al. - 2002
25 Massachusetts Institute of Technology (context) - Prokop, Master's - 1999
24 A fast merging algorithm (context) - Brown, Tarjan - 1979
20 Cache oblivious search trees via binary trees of small heigh.. - Brodal, Fagerberg et al. - 2002
17 A simple algorithm for merging two disjoint linearly ordered.. (context) - Hwang, Lin - 1972
14 A general lower bound on the I/O-complexity of comparison-ba.. - Arge, Knudsen et al. - 1993
12 Cache-oblivious priority queue and graph algorithm applicati.. - Arge, Bender et al. - 2002
9 Scanning and traversing: Maintaining data for traversals in .. - Bender, Cole et al. - 2002
8 Cache oblivious distribution sweeping - Brodal, Fagerberg - 2002
6 Introduction to Design and Analysis (context) - Baase, Gelder - 1999
5 Exponential structures for cache-oblivious algorithms (context) - Bender, Cole et al. - 2002
4 Optimised predecessor data structures for internal memory (context) - Rahman, Cole et al. - 2001
3 Funnel heap - a cache oblivious priority queue - Brodal, Fagerberg - 2002
3 A characterization of temporal locality and its portability .. (context) - Bilardi, Peserico - 2076
2 cient tree layout in a multilevel memory hierarchy (context) - Bender, Demaine et al. - 2002
2 On cache-oblivious multidimensional range searching (context) - Agarwal, Arge et al. - 2003
Documents on the same site (http://www.brics.dk/~gerth/pub3.html): More
Finding Maximal Pairs with Bounded Gap - Brodal, Lyngsų, Pedersen, Stoye (1999) (Correct)
Finding Maximal Pairs with Bounded Gap - Brodal, Lyngsø, al. (1999) (Correct)
The Complexity of Constructing Evolutionary Trees.. - Brodal, Fagerberg.. (2001) (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