Optimal parallel pattern matching in strings

Information and Control

Volumn 67, Issue 1-3, 1985, Pages 91-113

  Vishkin, Uzi ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING;

OPTIMAL PARALLEL PATTERN MATCHING; STRING PATTERN MATCHING;

COMPUTER PROGRAMMING;

EID: 0022142469     PISSN: 00199958     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0019-9958(85)80028-0     Document Type: Article

References (39)

1. Parallel computational geometry
2. Finding Euler circuits in logarithmic parallel time
3. An optimal algorithm for parallel selection
4. An O(n log n) sorting network
5. New connectivity and MSF algorithms for Ultracomputer and PRAM
6. Finding Euler tours in parallel
7. A technique for extending rapid exact-match string matching to arrays of more than one dimension
8. Routing, merging and sorting on parallel model of computation
9. A fast string searching algorithm
10. Optimal parallel generation of a computation tree form
11. Optimal parallel algorithms for the connected component problems
12. Optimal parallel algorithms for string matching
13. Computing connected components on parallel computers
14. A survey of parallel algorithms in numerical linear algebra
15. Fast pattern matching in strings
16. P in a free group
17. Efficient string matching in the presence of errors
18. Parallel algorithms for the convex hull problem in two dimensions
19. Parallel dictionaries on 2–3 trees
20. A fast probabilistic parallel sorting algorithm
21. A logarithmic time sort for linear size networks
22. Fast efficient parallel algorithms for some graph problems
23. Finding the maximum merging, and sorting in a parallel computation model
24. An O(logn) parallel connectivity algorithm
25. 2 log n) parallel max-flow algorithm
26. Efficient parallel algorithms for a class of graph theoretic problems
27. An Efficient Parallel Biconnectivity Algorithm
28. An optimal parallel connectivity algorithm
29. Randomized speed-ups in parallel computation
30. On efficient parallel strong orientation