Improved upper bounds for time-space tradeoffs for selection with limited storage

被引：0
|
作者：
Raman, V [1 ]
Ramnath, S
机构：
[1] Inst Math Sci, Chennai 600113, India
[2] St Cloud State Univ, Dept Comp Sci, St Cloud, MN 56303 USA
来源：
ALGORITHM THEORY - SWAT'98 | 1998年 / 1432卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We consider the problem of finding an element of a given rank in a totally ordered set given in a read-only array, using Limited extra storage cells. We give new algorithms for various ranges of extra space. Our upper bounds improve the previously known bounds in the range of space s such that s is o(lg(2) n) and s greater than or equal to clg lg n/ lg lg lg n for some constant c. We also give faster algorithms to find small ranks.
引用
收藏
页码：131 / 142
页数：12
相关论文
共 50 条
  • [1] Time-Space Tradeoffs in Resolution: Superpolynomial Lower Bounds for Superlinear Space
    Beame, Paul
    Beck, Chris
    Impagliazzo, Russell
    STOC'12: PROCEEDINGS OF THE 2012 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2012, : 213 - 231
  • [2] UPPER-BOUNDS FOR TIME-SPACE TRADE-OFFS IN SORTING AND SELECTION
    FREDERICKSON, GN
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1987, 34 (01) : 19 - 26
  • [3] Time-space tradeoffs for satisfiability
    Fortnow, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2000, 60 (02) : 337 - 353
  • [4] TIME-SPACE TRADEOFFS FOR SET OPERATIONS
    PATTSHAMIR, B
    PELEG, D
    THEORETICAL COMPUTER SCIENCE, 1993, 110 (01) : 99 - 129
  • [5] Time-space tradeoffs for branching programs
    Beame, P
    Jayram, TS
    Saks, M
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (04) : 542 - 572
  • [6] Time-space tradeoffs for polynomial evaluation
    Aldaz, M
    Heintz, J
    Matera, G
    Montaña, JL
    Pardo, LM
    COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1998, 327 (10): : 907 - 912
  • [7] Time-space tradeoffs for nondeterministic computation
    Fortnow, L
    van Melkebeek, D
    15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 2 - 13
  • [8] Time-space tradeoffs for branching programs
    Beame, P
    Saks, M
    Thathachar, JS
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 254 - 263
  • [9] Time-space tradeoffs in the counting hierarchy
    Allender, E
    Koucky, M
    Ronneburger, D
    Roy, S
    Vinay, V
    16TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 295 - 302
  • [10] Comparison-Based Time-Space Lower Bounds for Selection
    Chan, Timothy M.
    ACM TRANSACTIONS ON ALGORITHMS, 2010, 6 (02)
12345