Jakob Pagter, Theis Rauhe  Home/Search
Context
Related
| brics.dk/RS/98/Ref...ICSRS9810.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/RS/98/Ref/BRICSRS98... (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. (Update)
Similar documents (at the sentence level):
48.0%: Optimal Time-Space Trade-Offs for Sorting - Pagter, Rauhe (Correct)
Active bibliography (related documents): More All
1.0: Time-Space Tradeoffs for Set Operations - Boaz Patt David (1993) (Correct)
0.3: Machine Models and Linear Time Complexity - Regan (1993) (Correct)
0.3: On the Complexity of SAT - Lipton, Viglas (1999) (Correct)
Similar documents based on text: More All
1.1: Finding Maximal Pairs with Bounded Gap - Brodal, Lyngsų, Pedersen, Stoye (1999) (Correct)
1.1: Normalization by Evaluation with Typed Abstract Syntax - Danvy, Rhiger, Rose (2001) (Correct)
1.1: A Simple Take on Typed Abstract Syntax in Haskell-like Languages - Danvy, Rhiger (2000) (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/article/pagter98optimal.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth, Searching et al. - 1973
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
19 A Time-Space Tradeoff for Sorting on Non-Oblivious Machines - Borodin, Fischer et al. - 1981
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
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 KolmogorovComplexity (context) - Reisch, Schnitger - 1982
2 Upper Bounds for Time-Space Trade-offs in Sorting and Select.. (context) - Frederickson - 1987
1 Time Space Tradeoffs (Getting Closer to the Barrier (context) - Borodin - 1993
1 Time-Space Tradeoffs for Set Operations (context) - Patt-Shamir, Peleg - 1993
Documents on the same site (http://www.brics.dk/RS/98/Ref/BRICS-RS-98-Ref/): More
The Hardness of Speeding-up Knapsack - Sen (1998) (Correct)
On the (Im)possibility of Basing Oblivious Transfer.. - Damgård.. (1998) (Correct)
Lower Bounds for Dynamic Algebraic Problems - Frandsen, al. (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