Tree pattern matching and subset matching in randomized O(nlog 3 m) time
Richard Cole, Ramesh Hariharan · 1997
Article Free Access Share on Tree pattern matching and subset matching in randomized O(nlog3m) time Authors: Richard Cole Courant Institute, New York University Courant Institute, New York UniversityView Profile , Ramesh Hariharan Indian Institute of Science, Bangalore Indian Institute of Science, BangaloreView Profile Authors Info & Claims STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computingMay 1997 Pages 66–75https://doi.org/10.1145/258533.258553Published:04 May 1997Publication History 18citation510DownloadsMetricsTotal Citations18Total Downloads510Last 12 Months39Last 6 weeks8 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF