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 条
  • [41] An improved time-space lower bound for tautologies
    Diehl, Scott
    van Melkebeek, Dieter
    Williams, Ryan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2011, 22 (03) : 325 - 338
  • [42] An Improved Time-Space Lower Bound for Tautologies
    Diehl, Scott
    van Melkebeek, Dieter
    Williams, Ryan
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2009, 5609 : 429 - +
  • [43] Extractor-Based Time-Space Lower Bounds for Learning
    Garg, Sumegha
    Raz, Ran
    Tal, Avishay
    STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 990 - 1002
  • [44] Inductive Time-Space Lower Bounds for Sat and Related Problems
    Ryan Williams
    computational complexity, 2006, 15 : 433 - 470
  • [45] Better time-space lower bounds for SAT and related problems
    Williams, R
    TWENTIETH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2005, : 40 - 49
  • [46] Time-Space Lower Bounds for Two-Pass Learning
    Garg, Sumegha
    Raz, Ran
    Tal, Avishay
    34TH COMPUTATIONAL COMPLEXITY CONFERENCE (CCC 2019), 2019, 137
  • [47] Inductive time-space lower bounds for SAT and related problems
    Williams, Ryan
    COMPUTATIONAL COMPLEXITY, 2006, 15 (04) : 433 - 470
  • [48] LIMITS ON ALTERNATION TRADING PROOFS FOR TIME-SPACE LOWER BOUNDS
    Buss, Samuel R.
    Williams, Ryan
    COMPUTATIONAL COMPLEXITY, 2015, 24 (03) : 533 - 600
  • [49] Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs
    Banerjee, Niranka
    Chakraborty, Sankardeep
    Raman, Venkatesh
    Roy, Sasanka
    Saurabh, Saket
    COMPUTING AND COMBINATORICS, 2015, 9198 : 349 - 360
  • [50] Quantum and classical strong direct product theorems and optimal time-space tradeoffs
    Klauck, H
    Spalek, R
    de Wolf, R
    45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 12 - 21
12345