SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 14, Issue 4, 1995, Pages 355-366

Finding all periods and initial palindromes of a string in parallel

(2) Breslauer, D a Galil, Z b,c

a CWI (Netherlands)

b Columbia University ^* (United States)

c TEL AVIV UNIVERSITY (Israel)

Author keywords

Comparison model; Lower bounds; Palindromes; Parallel algorithms; Periods; Strings

Indexed keywords

EID: 0010106660 PISSN: 01784617 EISSN: 14320541 Source Type: Journal
DOI: 10.1007/BF01294132 Document Type: Article

Times cited : (28)

References (22)

1
- 84936669250
- A. Apostolico and D. Breslauer. An optimal O(log log n) time parallel algorithm for detecting all squares in a string. SIAM J. Comput., to appear.

2
- 84947946278
- Optimal parallel algorithms for periods, palindromes and squares
- Lecture Notes in Computer Science, Vol. 623, Springer-Verlag, Berlin
- (1992) Proc. 19th Internat. Colloq. on Automata, Languages, and Programming , pp. 296-307
- Apostolico, A.¹ Breslauer, D.² Galil, Z.³

3
- 84882876757
- Dover, New York
- (1973) Palindromes and Anagrams
- Bergerson, H.W.¹

4
- 0016046965
- Evaluation of general arithmetic expressions
- (1974) J. Assoc. Comput. Mach. , vol.21 , pp. 201-206
- Brent, R.P.¹

5
- 4243794932
- Efficient String Algorithmics
- Department of Computer Science, Columbia University, New York
- (1992) Ph.D. thesis
- Breslauer, D.¹

6
- 0029192317
- Fast parallel string prefix-matching
- (1995) Theoret. Comput. Sci. , vol.137 , Issue.2 , pp. 269-278
- Breslauer, D.¹

7
- 0028397167
- Testing string superprimitivity in parallel
- (1994) Inform. Process. Lett. , vol.49 , Issue.5 , pp. 235-241
- Breslauer, D.¹

8
- 0025631378
- An optimal O(log log n) time parallel string matching algorithm
- (1990) SIAM J. Comput. , vol.19 , Issue.6 , pp. 1051-1058
- Breslauer, D.¹ Galil, Z.²

9
- 0026931011
- A lower bound for parallel string matching
- (1992) SIAM J. Comput. , vol.21 , Issue.5 , pp. 856-862
- Breslauer, D.¹ Galil, Z.²

10
- 0026221074
- Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
- (1991) Theoret. Comput. Sci. , vol.88 , pp. 59-82
- Crochemore, M.¹ Rytter, W.²

11
- 84936669251
- F. E. Fich, R. L. Radge, and A. Wigderson. Relations between concurrent-write models of parallel computation. Proc. 3rd ACM Symp. on Principles of Distributed Computing, 1984, pages 179–189.

12
- 0002743213
- Sring matching and other produces
- R. M., Karp, American Mathematical Society, Providence, RI
- (1974) Complexity of Computation , pp. 113-125
- Fischer, M.J.¹ Paterson, M.S.²

13
- 0022138863
- Optimal parallel algorithms for string matching
- (1985) Inform. and Control , vol.67 , pp. 144-157
- Galil, G.¹

14
- 0003620778
- Addison-Wesley, Reading, MA
- (1979) Introduction to Automata Theory, Languages and Computation
- Hopcroft, J.E.¹ Ullman, J.D.²

15
- 84936669258
- R. M. Karp, R. E. Miller, and A. L. Rosenberg. Rapid identification of repeated patterns in strings, trees and arrays. Proc. 4th ACM Symp. on Theory of Computing, 1972, pages 125–136.

16
- 84936669240
- Z. Kedem, G. M. Landau, and K. Palem. Optimal parallel suffix-prefix matching algorithm and applications. Proc. 1st ACM Symp. on Parallel Algorithms and Architectures, 1989, pages 388–398.

17
- 0000904908
- Fast pattern matching in strings
- (1977) SIAM J. Comput. , vol.6 , pp. 322-350
- Knuth, D.E.¹ Morris, J.H.² Pratt, V.R.³

18
- 0004157169
- Addison-Wesley, Reading, MA
- (1983) Combinatorics on Words
- Lothaire, M.¹

19
- 0001531261
- The equation a^m=bⁿc^p in a free group
- (1962) The Michigan Mathematical Journal , vol.9 , pp. 289-298
- Lyndon, R.C.¹ Schutzenberger, M.P.²

20
- 0016532337
- A new linear-time “On-line” algorithm for finding the smallest initial palindrome of a string
- (1975) J. Assoc. Comput. Mach. , vol.22 , pp. 346-351
- Manacher, G.¹

21
- 0001261631
- Parallelism in comparison models
- (1975) SIAM Journal on Computing , vol.4 , pp. 348-355
- Valiant, L.G.¹

22
- 0022142469
- Optimal parallel pattern matching in strings
- (1985) Inform. and Control , vol.67 , pp. 91-113
- Vishkin, U.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.