VARIATIONS ON THE COMMON SUBEXPRESSION PROBLEM

被引：187

作者：

DOWNEY, PJ

SETHI, R

TARJAN, RE

机构：

[1] BELL TEL LABS INC,MURRAY HILL,NJ 07974

[2] STANFORD UNIV,STANFORD,CA 94305

来源：

JOURNAL OF THE ACM | 1980年 / 27卷 / 04期

关键词：

D O I：

10.1145/322217.322228

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：758 / 771

页数：14

共 21 条

[11]

LIU L, 1978, 78351 CORN U COMP SC

[12] FAST DECISION PROCEDURES BASED ON CONGRUENCE CLOSURE [J].

NELSON, G ;

OPPEN, DC .

JOURNAL OF THE ACM, 1980, 27 (02) :356-364

[13] REASONING ABOUT RECURSIVELY DEFINED DATA-STRUCTURES [J].

OPPEN, DC .

JOURNAL OF THE ACM, 1980, 27 (03) :403-427

[14] LINEAR UNIFICATION [J].

PATERSON, MS ;

WEGMAN, MN .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1978, 16 (02) :158-167

[15]

Rose D. J., 1976, SIAM Journal on Computing, V5, P266, DOI 10.1137/0205021

[16]

Sethi R., 1976, SIAM Journal on Computing, V5, P73, DOI 10.1137/0205005

[17] ALGORITHM FOR REASONING ABOUT EQUALITY [J].

SHOSTAK, RE .

COMMUNICATIONS OF THE ACM, 1978, 21 (07) :583-585

[18] STORING A SPARSE TABLE [J].

TARJAN, RE ;

YAO, ACC .

COMMUNICATIONS OF THE ACM, 1979, 22 (11) :606-611

[19] EFFICIENCY OF A GOOD BUT NOT LINEAR SET UNION ALGORITHM [J].

TARJAN, RE .

JOURNAL OF THE ACM, 1975, 22 (02) :215-225

[20]

TARSKI A., 1953, UNDECIDABLE THEORIES

← 1 2 3 →