OPTIMAL PARALLEL PATTERN-MATCHING IN STRINGS

被引：62

作者：

VISHKIN, U ^{[1
]}

机构：

[1] TEL AVIV UNIV, DEPT COMP SCI, IL-69978 TEL AVIV, ISRAEL

来源：

INFORMATION AND CONTROL | 1985年 / 67卷 / 1-3期

关键词：

D O I：

10.1016/S0019-9958(85)80028-0

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：91 / 113

页数：23

共 39 条

[1] AGGARWAL A, 1985, 26TH P ANN IEEE S F
[2] Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st
[3] SORTING IN C LOG N PARALLEL STEPS
AJTAI, M
KOMLOS, J
SZEMEREDI, E
[J]. COMBINATORICA, 1983, 3 (01) : 1 - 19
[4] AN OPTIMAL ALGORITHM FOR PARALLEL SELECTION
AKL, SG
[J]. INFORMATION PROCESSING LETTERS, 1984, 19 (01) : 47 - 50
[5] FINDING EULER TOURS IN PARALLEL
ATALLAH, M
VISHKIN, U
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 29 (03) : 330 - 337
[6] AWERBUCH B, 1984, 16TH P ANN ACM S THE, P249
[7] AWERBUCH B, 1983, 1983 P INT C PAR PRO
[8] TECHNIQUE FOR EXTENDING RAPID EXACT-MATCH STRING MATCHING TO ARRAYS OF MORE THAN ONE DIMENSION
BAKER, TP
[J]. SIAM JOURNAL ON COMPUTING, 1978, 7 (04) : 533 - 541
[9] OPTIMAL PARALLEL GENERATION OF A COMPUTATION TREE FORM
BARON, I
VISHKIN, U
[J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1985, 7 (02): : 348 - 357
[10] BORODIN A, 1982, 14TH P ACM S THEOR C, P338