Efficient Preprocessing of Simple Binary Pattern Forests

Journal of Algorithms

Volumn 20, Issue 3, 1996, Pages 602-612

  Thorup, Mikkel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES;

BINARY TREE; COMBINATORIAL PROBLEM; PATTERN MATCHING;

ALGORITHMS;

EID: 0030371225     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1996.0029     Document Type: Article

References (9)

1. J. Cai, R. Paige, and R. Tarjan, More efficient bottom-up multi-pattern matching in trees, Theoret. Comput. Sci. 106 (1992), 21-60.
2. D. Chase, An improvement to bottom-up tree pattern matching, in "Proceedings 14th POPL," pp. 168-177, Assoc. Comput. Mach. New York, 1987.
3. P. F. Dietz, Maintaining order in a linked list, in "Proceedings 14th STOC," pp. 122-127, Assoc. Comput. Mach. New York, 1982.
4. P. F. Dietz and D. D. Sleator, Two algorithms for maintaining order in a list, in "Proceedings 19th STOC," pp. 365-372, Assoc. Comput. Mach. New York, 1987.
5. C. Hoffmann and J. O'Donnell, An interpreter generator using tree pattern matching, in "Proceedings 6th POPL," pp. 169-179, Assoc. Comput. Mach. New York, 1979.
6. C. Hoffmann and J. O'Donnell, Pattern matching in trees, J. Assoc. Comput. Mach. 29(1) (1982), 68-95.
7. D. Knuth, J. Morris, and V. Pratt, Fast pattern matching in strings, SIAM J. Comput. 6(2) (1977), 323-350.
8. M. Thorup, Efficient preprocessing of simple binary pattern forests, in "Proceedings 4th SWAT," pp. 350-358, LNCS 824, Springer-Verlag, Berlin, 1994.
9. B. Wegbreit, Retrieval from context trees, Inform. Process Lett. 3(4) (1975), 119-120.