Tree pattern matching and subset matching in deterministic O(n log3 n)-time

Cole, Richard ; Hariharan, Ramesh ; Indyk, Piotr (1999) Tree pattern matching and subset matching in deterministic O(n log3 n)-time In: SODA '99 Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, January 17-19, 1999, Baltimore, Maryland, USA.

Full text not available from this repository.

Official URL: http://dl.acm.org/citation.cfm?id=314565&CFID=7096...

Abstract

This article does not have an abstract.

Item Type:Conference or Workshop Item (Paper)
Source:Copyright of this article belongs to ACM, Inc.
ID Code:102275
Deposited On:09 Mar 2018 11:23
Last Modified:09 Mar 2018 11:23

Repository Staff Only: item control page