Author of the publication

An Improved Algorithm for Approximate String Matching.

, and . ICALP, volume 372 of Lecture Notes in Computer Science, page 394-404. Springer, (1989)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Lower Bound for Parallel String Matching., and . SIAM J. Comput., 21 (5): 856-862 (1992)On the Exact Complexity of String Matching: Lower Bounds., and . SIAM J. Comput., 20 (6): 1008-1020 (1991)Faster Tree Pattern Matching., , and . J. ACM, 41 (2): 205-213 (1994)A Constant-Time Optimal Parallel String-Matching Algorithm.. J. ACM, 42 (4): 908-918 (1995)A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort., and . J. ACM, 26 (1): 58-64 (1979)Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version), and . STOC, page 177-188. ACM, (1981)Data Structures and Algorithms for Disjoint Set Union Problems., and . ACM Comput. Surv., 23 (3): 319-344 (1991)Cryptographic Computation: Secure Faut-Tolerant Protocols and the Public-Key Model., , and . CRYPTO, volume 293 of Lecture Notes in Computer Science, page 135-155. Springer, (1987)Real-Time Streaming String-Matching., and . CPM, volume 6661 of Lecture Notes in Computer Science, page 162-172. Springer, (2011)Old and New in Stringology.. CPM, volume 6129 of Lecture Notes in Computer Science, page 26. Springer, (2010)