A TRADE-OFF BETWEEN SPACE AND EFFICIENCY FOR ROUTING TABLES

被引：220

作者：

PELEG, D

UPFAL, E

机构：

[1] IBM CORP,ALMADEN RES CTR,SAN JOSE,CA 95120

[2] WEIZMANN INST SCI,IL-76100 REHOVOT,ISRAEL

来源：

JOURNAL OF THE ACM | 1989年 / 36卷 / 03期

关键词：

D O I：

10.1145/65950.65953

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：510 / 530

页数：21

共 21 条

[1] COMPLEXITY OF NETWORK SYNCHRONIZATION [J].

AWERBUCH, B .

JOURNAL OF THE ACM, 1985, 32 (04) :804-823

[2]

AWERBUCH B, 1988, MITLCSTM369 TECH REP

[3]

AWERBUCH B, 1989, 21ST P ACM S THEOR C, P479

[4]

AWERBUCH B, 1988, MITLCSTM354 TECH REP

[5] ESTABLISHING VIRTUAL CIRCUITS IN LARGE COMPUTER-NETWORKS [J].

BARATZ, AE ;

JAFFE, JM .

COMPUTER NETWORKS AND ISDN SYSTEMS, 1986, 12 (01) :27-37

[6]

Bollobas B., 1985, RANDOM GRAPHS

[7] THE K-DOMINATION AND K-STABILITY PROBLEMS ON SUN-FREE CHORDAL GRAPHS [J].

CHANG, GJ ;

NEMHAUSER, GL .

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (03) :332-345

[8] A MEASURE OF ASYMPTOTIC EFFICIENCY FOR TESTS OF A HYPOTHESIS BASED ON THE SUM OF OBSERVATIONS [J].

CHERNOFF, H .

ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04) :493-507

[9] AN UPPER BOUND FOR THE K-DOMINATION NUMBER OF A GRAPH [J].

COCKAYNE, EJ ;

GAMBLE, B ;

SHEPHERD, B .

JOURNAL OF GRAPH THEORY, 1985, 9 (04) :533-534

[10]

Frederickson G. N., 1986, 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), P428, DOI 10.1109/SFCS.1986.49

← 1 2 3 →