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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1999, Pages 245-254

  Cole, Richard ^a   Hariharan, Ramesh ^a   Indyk, Piotr ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; SET THEORY; TREES (MATHEMATICS);

SUBSET MATCHING; TREE PATTERN MATCHING;

DATA STRUCTURES;

EID: 0032794945     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)