UPPER-BOUNDS FOR TIME-SPACE TRADE-OFFS IN SORTING AND SELECTION

被引：38

作者：

FREDERICKSON, GN

机构：

[1] Purdue Univ, West Lafayette, IN, USA, Purdue Univ, West Lafayette, IN, USA

来源：

关键词：

in part by the National;

D O I：

10.1016/0022-0000(87)90002-X

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：19 / 26

页数：8

共 7 条

[1]

Blum M., 1973, Journal of Computer and System Sciences, V7, P448, DOI 10.1016/S0022-0000(73)80033-9

[2] A TIME-SPACE TRADEOFF FOR SORTING ON NON-OBLIVIOUS MACHINES [J].

BORODIN, A ;

FISCHER, MJ ;

KIRKPATRICK, DG ;

LYNCH, NA ;

TOMPA, M .

BORODIN, A ;

COOK, S .

[4] SELECTION AND SORTING WITH LIMITED STORAGE [J].

MUNRO, JI ;

PATERSON, MS .

[5]

SAVAGE JE, 1978, CS32 BROWN U TECHN R

TOMPA, M .

[7]

TOMPA M, 1978, 12278 U TOR TECHN RE