Jakob Pagter, Theis Rauhe  Home/Search
Context
Related
| itu.dk/people/theis/Publica...focs98.ps 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: itu.dk/people/thei...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem. Beame has shown a lower bound of n 2 ) for this product leaving a gap of a logarithmic factor up to the previously best known upper bound of O(n 2 log n) due to Frederickson. Since then, no progress has been made towards tightening this gap. The main contribution of this paper is a comparison based sorting... (Update)
Similar documents (at the sentence level):
47.1%: Optimal Time-Space Trade-Offs for Sorting - Pagter, Rauhe (1998) (Correct)
Active bibliography (related documents): More All
1.0: Time-Space Tradeoffs for Set Operations - Boaz Patt David (1993) (Correct)
0.6: Some Topics in Parallel Computation and Branching Programs - Sinha (1995) (Correct)
0.3: On the Complexity of SAT - Lipton, Viglas (1999) (Correct)
Similar documents based on text: More All
0.1: Realizations Of Causal Manifolds By Quantum Fields - Saller (1997) (Correct)
0.1: OwnTime: A System for Timespace Management - Rodenstein, Abowd, Catrambone (1999) (Correct)
0.1: On the Complexities of Linear LL(1) and LR(1) Grammars - Holzer, Lange (Correct)
BibTeX entry: (Update)
@inproceedings{ pagter98optimal,
author = "Jakob Pagter and Theis Rauhe",
title = "Optimal Time-Space Trade-Offs for Sorting",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "264-268",
year = "1998",
url = "citeseer.ist.psu.edu/359348.html" }
Citations (may not include all citations):250 volume 3 of The Art of Computer Programming (context) - Knuth, Searching - 1998
31 Selection and Sorting with Limited Storage (context) - Munro, Paterson - 1980
29 A Time-Space Tradeoff for Sorting on a General Sequential Mo.. (context) - Borodin, Cook - 1982
21 The Recognition Problem for the Set of Perfect Squares (context) - Cobham - 1966
19 A Time-Space Tradeoff for Sorting on NonOblivious Machines - Borodin, Fischer et al. - 1981
17 Getting Closer to the Barrier (context) - Borodin, Tradeoffs - 1993
14 A Time-Space Tradeoff for Element Distinctness (context) - Borodin, Fich et al. - 1987
12 Near-optimal Time-Space Tradeoff for Element Distinctness (context) - Yao - 1994
10 Models of Computation (context) - Savage - 1998
9 Two Time-Space Tradeoffs for Element Distinctness (context) - Karchmer - 1986
8 A General Sequential Time-Space Tradeoff for Finding Unique .. (context) - Beame - 1991
8 Sorting and Searching Revisited (context) - Andersson - 1996
5 The Time-Space Tradeoff For Sorting With Linear Queries (context) - Yao - 1982
3 Three Applications of Kolmogorov-Complexity (context) - Reisch, Schnitger - 1982
2 Time-Space Tradeoffs for Set Operations - Patt-Shamir, Peleg - 1993
2 Upper Bounds for Time-Space Tradeoffs in Sorting and Selecti.. (context) - Frederickson - 1987
Documents on the same site (http://www.itu.dk/people/theis/Publications/publications.html): More
Pattern Matching in Dynamic Texts - Alstrup, Brodal, Rauhe (2000) (Correct)
Hardness Results for Dynamic Problems by Extensions of Fredman and .. - Rauhe (1998) (Correct)
Worst-case and Amortised Optimality in Union-Find.. - Alstrup, Ben-Amram.. (1999) (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