7.23 I. Matching and Stereo

Chapter Contents (Back)

7.23.1 I.1. Matching: Strings, etc.

Chapter Contents (Back)

Crochemore, M.,
Special Issue On Selected Papers Of The Combinatorial Pattern Matching School,
TCS 92(1), 1-222. BibRef

Bertossi, A.A., Luccio, F., Pagli, L., Lodi, E.,
A Parallel Solution To The Approximate String Matching Problem,
COMPUTER J.(35), 1992, pp. 524-526. BibRef

Colussi, L.,
Correctness And Efficiency Of Patttern Matching Algorithms,
INFORMATION CONTROL(95), 1991, pp. 225-251. BibRef

Grossi, R.,
Further Comments On The Subtree Isomorphism For Ordered Trees,
IPL(40), 1991, pp. 255-256. BibRef

Verma, R.M.,
Strings, Trees, And Patterns,
IPL(41), 1992, pp. 157-161. BibRef

Zhang, K.,
On The Editing Distance Between Unordered Labeled Trees,
IPL(42), 1992, pp. 133-139. BibRef

Aoe, J.I.,
A Practical Method For Implementing String Pattern Matching Machines,
IS(64), 1992, pp. 95-114. BibRef

Ramesh, R., Ramakrishnan, I.V.,
Nonlinear Pattern Matching In Trees,
J. ACM(39), 1992, pp. 295-316. BibRef


Amir, A., Landau, G.M., Vishkin, U.,
Efficient Pattern Matching With Scaling,
J. ALGORITHMS(13), 1992, pp. 2-32. BibRef

Flasinski, M.,
Some Notes On A Problem Of Constructing The Best Matched Graph,
PR(24), 1991, pp. 1223-1224. BibRef

Chung, K.L.,
A Randomized Parallel Algorithm For String Matching On Hypercube,
PR(25), 1992, pp. 1265-1268. BibRef

Bonnin, A., Pallo, J.M.,
A Shortest Path Metric On Unlabeled Binary Trees,
PRL(13), 1992, pp. 411-415. BibRef

Galil, Z., Giancarlo, R.,
On The Exact Complexity Of String Matching: Upper Bounds,
SIAM JC(21), 1992, pp. 407-437. BibRef

Breslauer, D., Galil, Z.,
A Lower Bound For Parallel String Matching,
SIAM JC(21), 1992, pp. 856-862. BibRef

Kedem, Z.M., Palem, K.V.,
Optimal Parallel Algorithms For Forest And Term Matching,
TCS(93), 1992, pp. 245-264. BibRef

Cai, J., Paige, R., Tarjan, R.,
More Efficient Bottom-Up Multi-Pattern Matching In Trees,
TCS(106), 1992, pp. 21-60. BibRef

Esposito, F.,
Classification In Noisy Environments Using A Distance Measure Between Structural Symbolic Descriptions,
T-PAMI(14), 1992, pp. 390-402. BibRef

Takefuji, Y., Tanaka, T., Lee, K.C.,
A Parallel String Search Algorithm,
T-SMC(22), 1992, pp. 332-336. BibRef

Gaudron, I.,
2d Objects Recognition By Graph Matching,
ICPR(B), pp. 508-511. BibRef

Bunke, H., Csirik, J.,
Inference Of Edit Costs Using Parametric String Matching,
ICPR(B), pp. 549-552. BibRef

Chapter on Rosenfeld Bibliography for 1992 continues in
I.2. Matching: Images, etc. .

Last update:Jun 7, 2018 at 10:14:50