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 条

[21] TIME-SPACE TRADEOFFS IN VECTOR ALGORITHMS FOR APL FUNCTIONS
BUDD, TA
SIGPLAN NOTICES, 1988, 23 (12): : 63 - 68
[22] IMPROVED BOUNDS ON THE PROBLEM OF TIME-SPACE TRADE-OFF IN THE PEBBLE GAME
REISCHUK, R
JOURNAL OF THE ACM, 1980, 27 (04) : 839 - 849
[23] Conditional Lower Bounds for Space/Time Tradeoffs
Goldstein, Isaac
Kopelowitz, Tsvi
Lewenstein, Moshe
Porat, Ely
ALGORITHMS AND DATA STRUCTURES: 15TH INTERNATIONAL SYMPOSIUM, WADS 2017, 2017, 10389 : 421 - 436
[24] Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability
Fortnow, L
TWELFTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1997, : 52 - 60
[25] More Time-Space Tradeoffs for Finding a Shortest Unique Substring
Bannai, Hideo
Gagie, Travis
Hoppenworth, Gary
Puglisi, Simon J.
Russo, Luis M. S.
ALGORITHMS, 2020, 13 (09)
[26] Time-space tradeoffs for counting NP solutions modulo integers
Williams, R. Ryan
COMPUTATIONAL COMPLEXITY, 2008, 17 (02) : 179 - 219
[27] Time-Space Tradeoffs for Counting NP Solutions Modulo Integers
R. Ryan Williams
computational complexity, 2008, 17 : 179 - 219
[28] TIME-SPACE TRADEOFFS ON BACK-TO-BACK FFT ALGORITHMS
CARLSON, DA
IEEE TRANSACTIONS ON COMPUTERS, 1983, 32 (06) : 585 - 589
[29] Time-space tradeoffs for undirected graph traversal by graph automata
Beame, P
Borodin, A
Raghavan, P
Ruzzo, WL
Tompa, M
INFORMATION AND COMPUTATION, 1996, 130 (02) : 101 - 129
[30] NOTE ON TIME-SPACE TRADEOFFS FOR COMPUTING CONTINUOUS-FUNCTIONS
ABELSON, H
INFORMATION PROCESSING LETTERS, 1979, 8 (04) : 215 - 217

← 1 2 3 4 5 →