SOME MODIFIED ALGORITHMS FOR DIJKSTRA LONGEST UPSEQUENCE PROBLEM

被引：10

作者：

DEWAR, RBK

MERRITT, SM

SHARIR, M

机构：

来源：

关键词：

D O I：

10.1007/BF00625277

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：1 / 15

页数：15

共 12 条

[1]

DEWAR RBK, UNPUB DERIVATION SOR

[2]

DEWAR RBK, 1979, P ACM C DETROIT

[3]

DEWAR RBK, 1981, HIGHER LEVEL PROGRAM

[4] SOME BEAUTIFUL ARGUMENTS USING MATHEMATICAL INDUCTION [J].

DIJKSTRA, EW .

[5] PROGRAM SYNTHESIS KNOWLEDGE [J].

GREEN, C ;

BARSTOW, D .

[6]

Hwang FK., 1972, SIAM J COMPUT, V1, P31, DOI 10.1137/0201004

[7]

Knuth D. E., 1973, ART COMPUTER PROGRAM

[8] SIGNIFICANT IMPROVEMENTS TO THE HWANG-LIN MERGING ALGORITHM [J].

MANACHER, GK .

[9] FORD-JOHNSON SORTING ALGORITHM IS NOT OPTIMAL [J].

MANACHER, GK .

[10]

MERRITT SM, 1982, THESIS NEW YORK U