Three-dimensional pattern matching

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Three-dimensional pattern matching

Full text

Pdf (1.06 MB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures table of contents

Newport, Rhode Island, United States

Pages: 53 - 62

Year of Publication: 1997

ISBN:0-89791-890-8

Authors

Zvi Galil	Department of Computer Science, Columbia University and Tel Aviv University
Jong Geun Park	Department of Computer Engineering, Seoul National University, Seoul 151-742, Korea
Kunsoo Park

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 24, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/258492.258498 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AB	Amihood Amir , Gary Benson, Two-dimensional periodicity and its applications, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.440-452, September 1992, Orlando, Florida, United States
	ABF	Amihood Amir , Gary Benson , Martin Farach, An Alphabet Independent Approach to Two-Dimensional Pattern Matching, SIAM Journal on Computing, v.23 n.2, p.313-323, April 1994 [doi>10.1137/S0097539792226321]
	ABF2	Amihood Amir , Gary Benson , Martin Farach, Optimal parallel two dimensional pattern matching, Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures, p.79-85, June 30-July 02, 1993, Velen, Germany [doi>10.1145/165231.165242]
	AIL	A. Apostolico, C.S. Iliopoulos, G.M. Landau, B. Schieber and U. Vishkin, Parallel construction of a suffix tree with applications, A1gorithmica 3 (1988), 34 7-365.
	Ba	T.J. Baker, A technique for extending rapid exact-match string matching to arrays of more than one dimension, SIAM J. Comput. 7 (1978), 533-541.
	Bi	R.S. Bird. Two dimensional pattern matching, Inform. Process. Lett. 6 (1977), 168-170.
	Br	Dany Breslauer, Dictionary-Matching on Unbounded Alphabets: Uniform Length Dictionaries, Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, p.184-197, June 05-08, 1994
	CCG	R. Cole, M. Crochemore, Z. Galil, L. G#sieniec, R. Hariharan, S. Muthukrishnan, K. Park and W. Rytter, Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions, Proc. 34th IEEE Syrup. Found. Computer Science, 1993, 248-258.
	CGH	R. Cole, Z. Galil, R. Hariharan, S. Muthukrishnan and K. Park, Parallel two dimensional witness computation, Manuscript.
	CMR	M. Crochemore, L. G#sieniec, R. Hariharan, S. Muthukrishnan and W. Rytter, A constant time optima parallel algorithm for two dimensional pattern matching, Manuscript.
	CPP	Artur Czumaj , Zvi Galil , Leszek Gąsieniec , Kunsoo Park , Wojciech Plandowski, Work-time-optimal parallel algorithms for string problems, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.713-722, May 29-June 01, 1995, Las Vegas, Nevada, United States [doi>10.1145/225058.225289]
	GP	Zvi Galil , Kunsoo Park, Alphabet-Independent Two-Dimensional Witness Computation, SIAM Journal on Computing, v.25 n.5, p.907-935, Oct. 1996 [doi>10.1137/S0097539792241941]
	Ha	Ramesh Hariharan, Optimal parallel suffix tree construction, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.290-299, May 23-25, 1994, Montreal, Quebec, Canada [doi>10.1145/195058.195162]
	KR	Marek Karpinski , Wojciech Rytter, An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern, Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, p.125-135, June 05-08, 1994
	KMP	D.E. Knuth, J.H. Morris and V.B. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6 (1977), 323--350.
	SV	Sühleyman Cenk Sahinalp , Uzi Vishkin, Symmetry breaking for suffix tree construction, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.300-309, May 23-25, 1994, Montreal, Quebec, Canada [doi>10.1145/195058.195164]
	Vi	Uzi Vishkin, Optimal parallel pattern matching in strings, Information and Control, v.67 n.1-3, p.91-113, Oct./Nov./Dec. 1986 [doi>10.1016/S0019-9958(85)80028-0]
	Vi2	Uzi Vishkin, Deterministic sampling: a new technique for fast pattern matching, SIAM Journal on Computing, v.20 n.1, p.22-40, Feb. 1991 [doi>10.1137/0220002]