A TIME-SPACE TRADEOFF FOR SORTING ON NON-OBLIVIOUS MACHINES

被引：37

作者：

BORODIN, A

FISCHER, MJ

KIRKPATRICK, DG

LYNCH, NA

TOMPA, M

机构：

[1] UNIV WASHINGTON,DEPT COMP SCI,SEATTLE,WA 98195

[2] UNIV BRITISH COLUMBIA,DEPT COMP SCI,VANCOUVER V6T 1W5,BC,CANADA

[3] GEORGIA INST TECHNOL,SCH INFORMAT & COMP SCI,ATLANTA,GA 30332

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1981年 / 22卷 / 03期

关键词：

D O I：

10.1016/0022-0000(81)90037-4

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：351 / 364

页数：14

共 19 条

[1] NOTE ON TIME-SPACE TRADEOFFS FOR COMPUTING CONTINUOUS-FUNCTIONS [J].

ABELSON, H .

INFORMATION PROCESSING LETTERS, 1979, 8 (04) :215-217

[2]

BORODIN A, 1980, 12TH P ANN ACM S THE, P294

[3]

COBHAM A, 1966, IBM RC1704 WATS RES

[4]

FREDERICKSON GN, 1980, CS803 PENNS STAT U T

[5]

Galil Z., 1977, 18th Annual Symposium on Foundations of Computer Science, P179, DOI 10.1109/SFCS.1977.27

[6]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[7]

LENGAUER T, 1979, 11TH P ANN ACM S THE, P262

[8]

MASEK W. J., 1976, THESIS MIT

[9]

Munro J. I., 1978, 19th Annual Symposium on Foundations of Computer Science, P253, DOI 10.1109/SFCS.1978.32

[10] TIME-SPACE TRADE-OFFS IN A PEBBLE GAME [J].

PAUL, WJ ;

TARJAN, RE .

ACTA INFORMATICA, 1978, 10 (02) :111-115

← 1 2 →